<?xml version="1.0" encoding="utf-8"?>
<XML>
<JOURNAL>
<YEAR>1397</YEAR>
<VOL>15</VOL>
<NO>3</NO>
<MOSALSAL>37</MOSALSAL>
<PAGE_NO>133</PAGE_NO>


<ARTICLES>

	<ARTICLE> 
		<TitleF>ارزیابی خودکار جویش‌گرهای ویدئویی حوزه وب فارسی بر اساس تجمیع آرا </TitleF>
		<TitleE>Automatic Evaluation of Video Search engines in Persian Web domain based on Majority Voting</TitleE>
		<TitleLang_ID>1</TitleLang_ID>
		<ABSTRACTS>
			<ABSTRACT>
			<Language_ID>1</Language_ID>
			<CONTENT>امروزه رشد بسیار سریع اینترنت و نفوذ روزافزون آن در زندگی افراد باعث شده تا کاربران بسیاری برای رفع نیازهای روزمره خود به جویش&#8204;گرها مراجعه کنند و این جویش&#8204;گرها به توسعه و بهبود مستمر نیاز دارند. از&#8204;این&#8204;رو ارزیابی جویش&#8204;گرها برای تعیین کارایی آنها اهمیت به&#8204;سزایی دارد. در ایران نیز همانند سایر کشورها پژوهش&#8204;های گسترده&#8204;ای در زمینه ایجاد جویش&#8204;گرهای خاص&#8204;منظوره بومی انجام شده است. یکی از مهم&#8204;ترین جویش&#8204;گرهای خاص&#8204;منظوره ایجاد&#8204;شده، جویش&#8204;گر ویدئویی است که وظیفه بازیابی ویدئوها از سطح وب را برعهده دارد. برای ارزیابی کیفیت این جویش&#8204;گرها و بهبود مستمر آنها باید سطح خدمات&#8204;دهی هر کدام از جویش&#8204;گرها در مقایسه با دیگر جویش&#8204;گرهای موجود مورد ارزیابی قرار گیرد. از آنجا که سرعت ارزیابی نقش مهمی در تعیین روند اصلاحات مورد نیاز دارد، بحث ارزیابی خودکار جویش&#8204;گر&#8204;ها بسیار پراهمیت خواهد شد. در این مقاله روشی مبتنی بر تجمیع آرا به&#8204;منظور ارزیابی خودکار جویش&#8204;گرهای ویدئویی ارائه شده است. تمرکز اصلی این روش بر روی حوزه وب فارسی بوده و با توسعه روشی نوین برای شباهت&#8204;سنجی مبتنی بر محتوا براساس بردار&#8204;های حرکت ویدئوها، سعی در ارزیابی جویش&#8204;گرهای ویدئویی دارد. برای محک&#8204;زدن روش معرفی&#8204;شده، سازوکاری طراحی شد تا نتایج به&#8204;دست&#8204;آمده با نتایج حاصل از ارزیابی انسانی مورد مقایسه قرار گیرد. نتایج به&#8204;دست&#8204;آمده نشان&#8204;دهنده میزان همبستگی بیش از 94% دو روش است که قابل اتکا&#8204;بودن روش خودکار ارزیابی پیشنهادی را بیان می&#8204;کند.
&#160;</CONTENT>
			</ABSTRACT>
			<ABSTRACT>
			<Language_ID>2</Language_ID>
			<CONTENT>Today, the growth of the internet and its high influence in individuals&#8217; life have caused many users to solve their daily needs by search engines and hence, the search engines need to be modified and continuously improved. Therefore, evaluating search engines to determine their performance is of paramount importance. In Iran, as well as other countries, extensive researches are being performed on search engines. To evaluate the quality of search engines and continually improve their performance, it is necessary to evaluate search engines and compare them to other existing ones. Since the speed plays an important role in the assessment of the performance, automatic search engine evaluation methods attracted grate attention. In this paper, a method based on the majority voting is proposed to assess the video search engines. We introduced a mechanism to assess the automatic evaluation method by comparing its results with the results obtained by human search engine evaluation. The results obtained, shows 94 % correlation of the two methods which indicate the reliability of automated approach.
In general, the proposed method can be described in three steps.
Step 1: Retrieve first k_retrieve results of n different video search engines and build the return result set for each written query.
Step 2: Determine the level of relevance of each retrieved result from the search engines
Step 3: Evaluating the search engines by computing different evaluation criteria based on decisions on relevance of the retrieved videos by each search engine 
&#160;Clearly, the main part of any evaluation system with the goal of evaluating the accuracy of search engines is the second step. In this paper, we have tried to present a new solution based on the aggregation of votes in order to determine whether a result is relevant or not, as well as its level of relevance. For this purpose, for each query the return results from different search engines are compared with each other, and the result returned by more than m of the search engines (m ; and the result of which their URLs (after the normalization) are similar to the normalized URL from the m-1 of the other search engines, are considered as the relevant results. At the second level, the retrieved results will be compared in terms of content. In this way, after calculating the address-like similarity, all the results are transmitted to the motion vector extraction component to extract and store the motion vector.
In the content based similarity algorithm, the set of motion vectors is initially considered as a sequence of motion vector. We, then, try to find the greatest similarity of the smaller sequence with the larger sequence. After this step, we will report the maximum similarity of the two videos. The process of finding the maximum similarity is that we consider a window with a smaller video sequence length. In this window we calculate and hold the similarity of two sequences. In the proposed method, after identifying the similarity between the return results of different search engines, their level is ranked at three different levels: &#34;unrelated&#34; (0), &#34;quantitatively related&#34; (1) and &#34;related&#34; (2). Since Google&#39;s search engine is currently the world&#8217;s largest and best-performing search engine, and most search engines have been compared to it, and are also trying to achieve the same function, the first five Google search engine results are get the minimum relevance, by default, &#34;slightly related&#34;. Then the similarity module is used to evaluate the similarity of the retrieved n results of the tested search engines.
&#160;</CONTENT>
			</ABSTRACT>
		</ABSTRACTS>

		<PAGES>
			<PAGE>
			<FPAGE>3</FPAGE>
			<TPAGE>12</TPAGE>
			</PAGE>
		</PAGES>

		<RECEIVE_DATE>
			2017/12/6
		</RECEIVE_DATE>

		<RECEIVE_DATE_FA>
			1396/9/15
		</RECEIVE_DATE_FA>

		<ACCEPT_DATE>
			2018/09/15
		</ACCEPT_DATE>

		<ACCEPT_DATE_FA>
			1397/6/24
		</ACCEPT_DATE_FA>

		<AUTHORS>
			<AUTHOR>
				<Name>محمد مهدی</Name>
				<MidName></MidName>
				<Family>یدالهی</Family>
				<NameE>Mohammadmahdi</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Yadolahi</FamilyE>
				<Organizations>
				<Organization>مرکز تحقیقات مخابرات ایران</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>mm.yadollahi@itrc.ac.ir</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>فرزاد</Name>
				<MidName></MidName>
				<Family>زرگری</Family>
				<NameE>Farzad</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Zargari</FamilyE>
				<Organizations>
				<Organization>مرکز تحقیقات مخابرات ایران</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>zargari@itrc.ac.ir</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>مژگان</Name>
				<MidName></MidName>
				<Family>فرهودی</Family>
				<NameE>Mojgan</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Farhoodi</FamilyE>
				<Organizations>
				<Organization>مرکز تحقیقات مخابرات ایران</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>farhood@itrc.ac.ir</Email>
				</EMAILS>
			</AUTHOR>
		</AUTHORS>


		<KEYWORDS>
			<KEYWORD>
				<KeyText>Automatic assessment</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Video search engine</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Persian Web</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>ارزیابی خودکار</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>جویش‌گرهای ویدئویی</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>وب فارسی</KeyText>
			</KEYWORD>
		</KEYWORDS>

		<REFRENCES>
			<REFRENCE>
				<REF>[1] Moosavi Sobhan, Azimzadeh Masoumeh, Mahmo-udi Maryam, Yari Alireza, A Comprehens-ive and Effective Framework for the Assessment of Persian Search Engines, The 18th Annual National Conference of the Computer Society, Tehran, Esfand 1391.##[2] Azimzadeh Masoumeh, Somoori Shahriar, Yari Alireza, Qualitative and qualitative comparison of search engines in the Persian Web domain, 18th National Computer Society Conference, Tehran, Esfand 1391.##[3] R. Badie, M. Azimzadeh, M.S. Zahedi, S. Samuri, &#34;Automatic evaluation of search engines: Using webpages' content, web graph link structure and websites' popularity&#34; Seventh International Symposium on Telecommunica-tions ( IST2014), September 09-11, 2014.##[4] Maryam Mahmoudy, Mohammad Sadegh zahedi, Masomeh Azimzadeh, &#34;Evalua-ting the retrieval effectiveness of search engines using Persian navigational queries&#34;, Seventh Interna-tional Symposium on Telecommunica-tions (IST2014), September 09-11, 2014.##[5] I. Soboroff, C. Nicholas, and P. Cahan, &#34;Ranking retrieval systems without relevance judgments,&#34; in Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval, 2001, pp. 66-73.##[6] S. P. Harter, &#34;Variations in relevance assessm-ents and the measurement of retrieval effective-ness,&#34; JASIS, vol. 47, pp. 37-49, 1996.##https://doi.org/10.1002/(SICI)1097-4571(199601)47:1&#60;37::AID-ASI4&#62;3.0.CO;2-3##[7] A. Spink and H. Greisdorf, &#34;Regions and levels: measuring and mapping users' relevance judgments,&#34; Journal of the American Society for Information science and Technology, vol. 52, pp. 161-173, 2001.##https://doi.org/10.1002/1097-4571(2000)9999:9999&#60;::AID-ASI1564&#62;3.0.CO;2-L##[8] S. Wu and F. Crestani, &#34;Methods for ranking information retrieval systems without relevance judgments,&#34; in Proceedings of the 2003 ACM symposium on Applied computing, 2003, pp. 811-816.##[9] J. Callan, M. Connell, and A. Du, &#34;Automatic discovery of language models for text databases,&#34; in ACM SIGMOD Record, 1999, pp. 479-490.##[10] A. Chowdhury and I. Soboroff, &#34;Automatic evaluation of world wide web search services,&#34; in Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval, 2002, pp. 421-422.##[11] S. M. Beitzel, E. C. Jensen, A. Chowdhury, and D. Grossman, &#34;Using titles and category names from editor-driven taxonomies for automatic evaluation,&#34; in Proceedings of the twelfth international conference on Information and knowledge management, 2003, pp. 17-23.##[12] F. Can, R. Nuray, and A. B. Sevdik, &#34;Automatic performance evaluation of Web search engines,&#34; Information processing &#38; management, vol. 40, pp. 495-514, 2004.##[13] T. Joachims, L. Granka, B. Pan, H. Hembrooke, and G. Gay, &#34;Accurately interpreting clickth-rough data as implicit feedback,&#34; in Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval, 2005, pp. 154-161.##[14] Y. Liu, Y. Fu, M. Zhang, S. Ma, and L. Ru, &#34;Automatic search engine performance evaluation with click-through data analysis,&#34; in Proceedings of the 16th international conference on World Wide Web, 2007, pp. 1133-1134.##[15] Y. Liu, M. Zhang, L. Ru, and S. Ma, &#34;Automatic query type identification based on click through information,&#34; in Information Retrieval Techno-logy, ed: Springer, 2006, pp. 593-600.##[16] T. Joachims, &#34;Evaluating Retrieval Performance Using Clickthrough Data,&#34; ed: Citeseer, 2003.##[17] G. Mood, &#34;Boes, Introduction to the theory of statistics,&#34; McCraw-Hill Statistics Series, 1974.##[18] H. Sharma and B. J. Jansen, &#34;Automated evaluation of search engine performance via implicit user feedback,&#34; in Proceedings of the 28th annual international ACM SIGIR con-ference on Research and development in information retrieval, 2005, pp. 649-650.##[19] R. Ali and M. S. Beg, &#34;Automatic performance evaluation of web search systems using rough set based rank aggregation,&#34; in Proceedings of the First International Conference on Intelligent Human Computer Interaction, 2009, pp. 344-358.##[20] R. Nuray and F. Can, &#34;Automatic ranking of information retrieval systems using data fusion,&#34; Information processing &#38; management, vol. 42, pp. 595-614, 2006.##[21] H. Sadeghi. &#34;Automatic Performance Evaluation of Web search Engines using judgements of Meta search Engines&#34;, Online Information Review, ISSN:1468-4527,Emerald Publishing Limited, pp.957-971. (2011).##[22] Tawileh W, Griesbaum J, Mandl T. Evaluation of five web search engines in Arabic language. Proceedings of LWA. (2010).##[23] Lewandowski, Dirk. Evaluating the retrieval effectiveness of Web search engines using a representative query sample. Journal of the Association for Information Science and Technology (2015).##[24] Bar-Ilan J, Levene M. A method to assess search engine results. Online Information Review 35(6), 854-868. (2011).##[25] Keyvanpour M, alamdar F. Effective browsing of image search results via diversified visual summarization by Clustering. JSDP. 2012; 8 (2) :57-74##[1] موسوی سبحان، عظیم‌زاده معصومه، محمودی مریم، یاری علیرضا، ارائه چارچوبی جامع و کارا برای ارزیابی موتورهای جستجوی فارسی، هجدهمین کنفرانس ملی سالیانه انجمن کامپیوتر، تهران، اسفند 1391.##[2] عظیم‌زاده معصومه، سموری شهریار، یاری علیرضا، بررسی و مقایسه کیفی موتورهای جستجو در حوزه وب فارسی،‌ هجدهمین کنفرانس ملی سالیانه انجمن کامپیوتر، تهران، اسفند 1391.##[1] Moosavi Sobhan, Azimzadeh Masoumeh, Mahmo-udi Maryam, Yari Alireza, A Comprehens-ive and Effective Framework for the Assessment of Persian Search Engines, The 18th Annual National Conference of the Computer Society, Tehran, Esfand 1391.##[2] Azimzadeh Masoumeh, Somoori Shahriar, Yari Alireza, Qualitative and qualitative comparison of search engines in the Persian Web domain, 18th National Computer Society Conference, Tehran, Esfand 1391.##[3] R. Badie, M. Azimzadeh, M.S. Zahedi, S. Samuri, &#34;Automatic evaluation of search engines: Using webpages' content, web graph link structure and websites' popularity&#34; Seventh International Symposium on Telecommunica-tions ( IST2014), September 09-11, 2014.##[4] Maryam Mahmoudy, Mohammad Sadegh zahedi, Masomeh Azimzadeh, &#34;Evalua-ting the retrieval effectiveness of search engines using Persian navigational queries&#34;, Seventh Interna-tional Symposium on Telecommunica-tions (IST2014), September 09-11, 2014.##[5] I. Soboroff, C. Nicholas, and P. Cahan, &#34;Ranking retrieval systems without relevance judgments,&#34; in Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval, 2001, pp. 66-73.##[6] S. P. Harter, &#34;Variations in relevance assessm-ents and the measurement of retrieval effective-ness,&#34; JASIS, vol. 47, pp. 37-49, 1996.##https://doi.org/10.1002/(SICI)1097-4571(199601)47:1&#60;37::AID-ASI4&#62;3.0.CO;2-3##[7] A. Spink and H. Greisdorf, &#34;Regions and levels: measuring and mapping users' relevance judgments,&#34; Journal of the American Society for Information science and Technology, vol. 52, pp. 161-173, 2001.##https://doi.org/10.1002/1097-4571(2000)9999:9999&#60;::AID-ASI1564&#62;3.0.CO;2-L##[8] S. Wu and F. Crestani, &#34;Methods for ranking information retrieval systems without relevance judgments,&#34; in Proceedings of the 2003 ACM symposium on Applied computing, 2003, pp. 811-816.##[9] J. Callan, M. Connell, and A. Du, &#34;Automatic discovery of language models for text databases,&#34; in ACM SIGMOD Record, 1999, pp. 479-490.##[10] A. Chowdhury and I. Soboroff, &#34;Automatic evaluation of world wide web search services,&#34; in Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval, 2002, pp. 421-422.##[11] S. M. Beitzel, E. C. Jensen, A. Chowdhury, and D. Grossman, &#34;Using titles and category names from editor-driven taxonomies for automatic evaluation,&#34; in Proceedings of the twelfth international conference on Information and knowledge management, 2003, pp. 17-23.##[12] F. Can, R. Nuray, and A. B. Sevdik, &#34;Automatic performance evaluation of Web search engines,&#34; Information processing &#38; management, vol. 40, pp. 495-514, 2004.##[13] T. Joachims, L. Granka, B. Pan, H. Hembrooke, and G. Gay, &#34;Accurately interpreting clickth-rough data as implicit feedback,&#34; in Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval, 2005, pp. 154-161.##[14] Y. Liu, Y. Fu, M. Zhang, S. Ma, and L. Ru, &#34;Automatic search engine performance evaluation with click-through data analysis,&#34; in Proceedings of the 16th international conference on World Wide Web, 2007, pp. 1133-1134.##[15] Y. Liu, M. Zhang, L. Ru, and S. Ma, &#34;Automatic query type identification based on click through information,&#34; in Information Retrieval Techno-logy, ed: Springer, 2006, pp. 593-600.##[16] T. Joachims, &#34;Evaluating Retrieval Performance Using Clickthrough Data,&#34; ed: Citeseer, 2003.##[17] G. Mood, &#34;Boes, Introduction to the theory of statistics,&#34; McCraw-Hill Statistics Series, 1974.##[18] H. Sharma and B. J. Jansen, &#34;Automated evaluation of search engine performance via implicit user feedback,&#34; in Proceedings of the 28th annual international ACM SIGIR con-ference on Research and development in information retrieval, 2005, pp. 649-650.##[19] R. Ali and M. S. Beg, &#34;Automatic performance evaluation of web search systems using rough set based rank aggregation,&#34; in Proceedings of the First International Conference on Intelligent Human Computer Interaction, 2009, pp. 344-358.##[20] R. Nuray and F. Can, &#34;Automatic ranking of information retrieval systems using data fusion,&#34; Information processing &#38; management, vol. 42, pp. 595-614, 2006.##[21] H. Sadeghi. &#34;Automatic Performance Evaluation of Web search Engines using judgements of Meta search Engines&#34;, Online Information Review, ISSN:1468-4527,Emerald Publishing Limited, pp.957-971. (2011).##[22] Tawileh W, Griesbaum J, Mandl T. Evaluation of five web search engines in Arabic language. Proceedings of LWA. (2010).##[23] Lewandowski, Dirk. Evaluating the retrieval effectiveness of Web search engines using a representative query sample. Journal of the Association for Information Science and Technology (2015).##[24] Bar-Ilan J, Levene M. A method to assess search engine results. Online Information Review 35(6), 854-868. (2011).##[25] Keyvanpour M, alamdar F. Effective browsing of image search results via diversified visual summarization by Clustering. JSDP. 2012; 8 (2) :57-74## ##</REF>
			</REFRENCE>
		</REFRENCES>

	</ARTICLE>


	<ARTICLE> 
		<TitleF>شبکه عصبی پیچشی با پنجره‌های قابل تطبیق برای بازشناسی گفتار</TitleF>
		<TitleE>Adaptive Windows Convolutional Neural Network for Speech Recognition</TitleE>
		<TitleLang_ID>1</TitleLang_ID>
		<ABSTRACTS>
			<ABSTRACT>
			<Language_ID>1</Language_ID>
			<CONTENT>در حالی&#8204;که سامانه&#8204;های بازشناسی گفتار به&#8204;طور پیوسته در حال ارتقا می&#8204;باشند و شاهد استفاده گسترده از آن&#8204;ها می&#8204;باشیم، اما دقت این سامانه&#8204;ها فاصله زیادی نسبت به توان بازشناسی انسان دارد و در شرایط ناسازگار این فاصله افزایش می&#8204;یابد. یکی از علل اصلی این مسئله تغییرات زیاد سیگنال گفتار است. در سال&#8204;های اخیر، استفاده از شبکه&#8204;های عصبی عمیق در ترکیب با مدل مخفی مارکف، موفقیت&#8204;های قابل توجهی در حوزه پردازش گفتار داشته &#8204;است. این مقاله به&#8204;دنبال مدل&#8204;کردن بهتر گفتار با استفاده از تغییر ساختار در شبکه عصبی پیچشی عمیق است؛ به&#8204;نحوی که با تنوعاتِ بیان گویندگان در سیگنال گفتار &#160;منطبق&#8204;تر شود. در این راه، مدل&#8204;های موجود و انجام استنتاج بر روی آن&#8204;ها را بهبود و گسترش خواهیم داد. در این مقاله با ارائه شبکه پیچشی عمیق با پنجره&#173;های قابل تطبیق سامانه بازشناسی گفتار را نسبت به تفاوت بیان در بین گویندگان و تفاوت در بیان&#8204;های یک گوینده مقاوم خواهیم کرد. تحلیل&#173;ها و نتایج آزمایش&#8204;های صورت&#8204;گرفته بر روی دادگان گفتار فارس&#173;دات و TIMIT نشان داد که روش پیشنهادی خطای مطلق بازشناسی واج را نسبت به شبکه پیچشی عمیق به&#173;ترتیب به میزان 2/1 و 1/1 درصد کاهش می&#8204;دهد که این مقدار در مسئله بازشناسی گفتار مقدار قابل توجهی است.&#160;</CONTENT>
			</ABSTRACT>
			<ABSTRACT>
			<Language_ID>2</Language_ID>
			<CONTENT>Although, speech recognition systems are widely used and their accuracies are continuously increased, there is a considerable performance gap between their accuracies and human recognition ability. This is partially due to high speaker variations in speech signal. Deep neural networks are among the best tools for acoustic modeling. Recently, using hybrid deep neural network and hidden Markov model (HMM) leads to considerable performance achievement in speech recognition problem because deep networks model complex correlations between features. The main aim of this paper is to achieve a better acoustic modeling by changing the structure of deep Convolutional Neural Network (CNN) in order to adapt speaking variations. In this way, existing models and corresponding inference task have been improved and extended. 
Here, we propose adaptive windows convolutional neural network (AWCNN) to analyze joint temporal-spectral features variation. AWCNN changes the structure of CNN and estimates the probabilities of HMM states. We propose adaptive windows convolutional neural network in order to make the model more robust against the speech signal variations for both single speaker and among various speakers. This model can better model speech signals. The AWCNN method applies to the speech spectrogram and models time-frequency varieties. 
This network handles speaker feature variations, speech signal varieties, and variations in phone duration. The obtained results and analysis on FARSDAT and TIMIT datasets show that, for phone recognition task, the proposed structure achieves 1.2%, 1.1% absolute error reduction with respect to CNN models respectively, which is a considerable improvement in this problem. Based on the results obtained by the conducted experiments, we conclude that the use of speaker information is very beneficial for recognition accuracy.</CONTENT>
			</ABSTRACT>
		</ABSTRACTS>

		<PAGES>
			<PAGE>
			<FPAGE>13</FPAGE>
			<TPAGE>30</TPAGE>
			</PAGE>
		</PAGES>

		<RECEIVE_DATE>
			2017/12/62018/04/4
		</RECEIVE_DATE>

		<RECEIVE_DATE_FA>
			1397/1/15
		</RECEIVE_DATE_FA>

		<ACCEPT_DATE>
			2018/09/152018/12/17
		</ACCEPT_DATE>

		<ACCEPT_DATE_FA>
			1397/9/26
		</ACCEPT_DATE_FA>

		<AUTHORS>
			<AUTHOR>
				<Name>تکتم</Name>
				<MidName></MidName>
				<Family>ذوقی</Family>
				<NameE>Toktam</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Zoughi</FamilyE>
				<Organizations>
				<Organization>دانشگاه صنعتی امیرکبیر</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>TOKTAM.ZOUGHI@GMAIL.COM</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>محمد مهدی</Name>
				<MidName></MidName>
				<Family>همایون پور</Family>
				<NameE>Mohammad Mehdi</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Homayounpour</FamilyE>
				<Organizations>
				<Organization>دانشگاه صنعتی امیرکبیر</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>homayoun@aut.ac.ir</Email>
				</EMAILS>
			</AUTHOR>
		</AUTHORS>


		<KEYWORDS>
			<KEYWORD>
				<KeyText>Speech recognition</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>deep neural network</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Convolutional neural network</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Adaptive windows convolutional neural network</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>بازشناسی گفتار</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>شبکه عصبی عمیق</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>شبکه عصبی پیچشی</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>پنجره‌های قابل تطبیق</KeyText>
			</KEYWORD>
		</KEYWORDS>

		<REFRENCES>
			<REFRENCE>
				<REF>[1] Bi Jen Khan, J. Sheykhzadegan, &#34;Persian speech dataset&#34;, in Machine Translation in Persian, 2006, pp. 261-247.##[2] B. BabaAli, &#34;A state-of-the-art and efficient framework for Persian speech recognition&#34;, Signal and Data Processing, Vol. 13, No. 3, pp. 1-13, 2015.##[3] S. Z. Seyyedsalehi, and A. Seyyedsalehi, &#34;Improving the nonlinear manifold separator model to the face recognition by a single image of per person.&#34; Signal and Data Processing, Vol. 12, No.1, pp. 3-16, 2015.##[4] Z. Ansari, and A. Seyyedsalehi, &#34;Deep Modular Neural Networks with Double Spatio-temporal Association Structure for Persian Continuous Speech Recognition.&#34; Signal and Data Processing, Vol. 13, No.1, pp. 39-56, 2016.##[5] S. Z. Seyyedsalehi, and A. Seyyedsalehi, &#34;A new fast pre training method for training of deep neural network.&#34; Signal and Data Processing, Vol. 10, No.1, pp. 13-26, 2013.##[6] Y. Hifny and S. Renals, &#34;Speech recognition using augmented conditional random fields,&#34; IEEE Transactions on Audio, Speech and Language Processing, vol. 17, no. 2, pp. 354–365, 2009.##[7] K. H. Davis, R. Biddulph, and S. Balashek, &#34;Automatic Recognition of Spoken Digits,&#34; The Journal of the Acoustical Society of America, vol. 24, no. 6, p. 637–‎642‎, 1952.##[8] L. Rabiner and B. Juang, Fundamentals of Speech Recognition: Prentice Hall, vol. 22. 1993.##[9] R. P. Lippmann, &#34;Speech recognition by machines and humans,&#34; Speech Communication, vol. 22, no. 7, pp. 1–15, 1997.##[10] O. Scharenborg, &#34;Reaching over the gap: A review of efforts to link human and automatic speech recognition research,&#34; Speech Communication, vol. 49, no. 5, pp. 336–347, 2007.##[11] M. Ostendorf, &#34;Moving Beyond the 'Beads-on-a-String' Model of Speech,&#34; in IEEE Automatic Speech Recognition and Understanding Workshop‎, 1999, pp. 79–83.##[12] H. Bourlard, H. Hermansky, and N. Morgan, &#34;Towards increasing speech recognition error rates,&#34; Speech Communication, vol. 18, no. 3, pp. 205–231, 1996.##[13] N. Morgan, Q. Zhu, and A. Stolcke, &#34;Pushing the envelope-aside,&#34; Signal Processing Magazine‎, vol. 22, no. 5, pp. 81–88, 2005.##[14] C. J. Leggetter and P. C. Woodland, &#34;Maximum likelihood linear regression for speaker adaptation of continuous density hidden Markov models,&#34; Computer Speech &#38; Language, vol. 9, no. 2, pp. 171–185, 1995.##[15] L. Lee and R. C. Rose, &#34;Speaker normalization using efficient frequency warping procedures,&#34; in IEEE International Conference on Acoustics, Speech, and Signal Processing, 1996, vol. 1, pp. 356–1996.##[16] L. Welling, S. Kanthak and H. Ney, &#34;Improved methods for vocal tract normalization,&#34; in IEEE International Conference on Acoustics, Speech, and Signal Processing, 1999, vol. 2, pp. 761–764.##[17] D. Povey. Discriminative Training for Large Vocabulary Speech Recognition. PhD thesis, Cambridge University, 2003.##[18] S. F. Chen and J. Goodman, &#34;An empirical study of smoothing techniques for language modeling,&#34; in Proceedings of the 34th annual meeting on Association for Computational Linguistics, 1996, pp. 310–318.##[19] G. E. Dahl, D. Yu, L. Deng and A. Acero, &#34;Context-dependent pre-trained deep neural networks for large-vocabulary speech recognition,&#34; IEEE Transactions on Audio, Speech and Language Processing, vol. 20, no. 1, pp. 30–42, 2012.##[20] G. Hinton, L. Deng, D. Yu, G. E. Dahl, A. Mohamed, N. Jaitly, A. Senior, V. Vanhoucke, P. Nguyen, T. N. Sainath, and B. Kingsbury, &#34;Deep Neural Networks for Acoustic Modeling in Speech Recognition: The Shared Views of Four Research Groups,&#34; IEEE Signal Processing Magazine, vol. 29, no. 6, pp. 82–97, 2012.##[21] A. R. Mohamed, G. Hinton and G. Penn, &#34;Understanding how deep belief networks perform acoustic modelling,&#34; in IEEE Interna-tional Conference on Acoustics, Speech and Signal Processing, 2012, pp. 4273–4276.##[22] R. Salakhutdinov and G. Hinton, &#34;An Efficient Learning Procedure for Deep Boltzmann Machines,&#34; Neural Computation, vol. 24, no. 8, pp. 1967–2006, 2012.##[23] R. Salakhutdinov, &#34;Learning deep generative models‎,&#34; PHD thesis, Toronto, Ont., Canada‎, 2009.##[24] G. E. Hinton, &#34;Training products of experts by minimizing contrastive divergence,&#34; Neural Computation, vol. 14, no. 8, pp. 1771–1800, 2002.##[25] G. E. Hinton, S. Osindero, and Y. W. Teh, &#34;A fast learning algorithm for deep belief nets,&#34; Neural computation, vol. 18, no. 7, pp. 1527–1554, 2006.##[26] P. Ramesh and J. G. Wilpon, &#34;Modeling state durations in hidden Markov models for automatic speech recognition,&#34; in IEEE International Conference on Acoustics, Speech, and Signal Processing, 1992, vol. 1, pp. 381–384.##[27] P. N. Justine T. Kao, Geoffrey Zweig, &#34;Discriminative duration modeling for speech recognition with segmental conditional random fields,&#34; in ICASSP, 2011. PP. 4476-4479.##[28] S. Z. Yu, &#34;Hidden semi-Markov models,&#34; Artificial Intelligence, vol. 174, no. 2. pp. 215–243, 2010.##[29] S. J. Rennie, P. Fousek, and P. L. Dognin, &#34;factorial hidden restricted boltzmann machines for noise robust speech recognition,&#34; in IEEE International Conference on Acoustics, Speech and Signal Processing, 2012, pp. 4297–4300.##[30] J. Huang and B. Kingsbury, &#34;Audio-visual deep learning for noise robust speech recognition,&#34; in IEEE International Conference on Acoustics, Speech and Signal Processing, 2013, pp. 7596–7599.##[31] A. Maas and Q. Le, &#34;Recurrent Neural Networks for Noise Reduction in Robust ASR.,&#34; in Interspeech, 2012, pp. 3–6.##[32] H. Bourlard and N. Morgan, &#34;Continuous speech recognition by connectionist statistical methods,&#34; IEEE Transactions on Neural Net-works, vol. 4, no. 6, pp. 893–909, 1993.##[33] A. J. Robinson, G. D. Cook, D. P. W. Ellis, E. Fosler-Lussier, S. J. Renals, and D. A. G. Williams, &#34;Connectionist speech recognition of Broadcast News,&#34; Speech Communication, vol. 37, no. 1–2, pp. 27–45, 2002.##[34] Y. H. Sung and D. Jurafsky, &#34;Hidden conditional random fields for phone recognition,&#34; in IEEE Workshop on Automatic Speech Recognition and Understanding, 2009, pp. 107–112.##[35] T. N. Sainath, A. R. Mohamed, B. Kingsbury and B. Ramabhadran, &#34;Deep convolutional neural networks for LVCSR,&#34; in IEEE International Conference on Acoustics, Speech and Signal Processing, 2013, pp. 8614–8618.##[36] T. N. Sainath, B. Kingsbury, G. Saon, H. Soltau, A.-R. Mohamed, G. Dahl, and B. Ramabhadran, &#34;Deep Convolutional Neural Networks for Large-scale Speech Tasks.,&#34; Neural networks, vol. 64, pp. 39–48, Sep. 2014.##[37] T. N. Sainath, B. Kingsbury, H. Soltau and B. Ramabhadran, &#34;Optimization techniques to improve training speed of deep neural networks for large speech tasks,&#34; IEEE Transactions on Audio, Speech and Language Processing, vol. 21, no. 11, pp. 2267–2276, 2013.##[38] H. Lee, R. Grosse, R. Ranganath, and A. Y. Ng, &#34;Convolutional deep belief networks for scalable unsupervised learning of hierarchical represent-tations,&#34; in Proceedings of the 26th Annual International Conference on Machine Learning, 2009, vol. 2008, pp. 1–8.##[39] O. Abdel-Hamid, A. Mohamed, H. Jiang, L. Deng, G. Penn, and D. Yu, &#34;Convolutional neural networks for speech recognition,&#34; IEEE Transactions on Speech and Audio Processing, vol. 22, no. 10, pp. 1533–1545, 2014.##[40] G. Heigold, &#34;A log-linear discriminative mode-ling framework for speech recognition,&#34; PhD dissertation, Aachen, Germany, 2010.##[41] M. Russell and A. Cook, &#34;Experimental evaluation of duration modelling techniques for automatic speech recognition,&#34; in IEEE Inter-national Conference on Acoustics, Speech, and Signal Processing, 1987, vol. 12, pp. 2376–2379.##[42] H. Lee and H. Kwon, &#34;Going Deeper with Contextual CNN for Hyperspectral Image Classification,&#34; IEEE Transactions on Image Processing, vol. 26, no. 10, pp. 4843–4855, 2017.##[43] C. Dong, C. C. Loy, K. He, and X. Tang, &#34;Image Super-Resolution Using Deep Convolutional Networks,&#34; IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 38, no. 2, pp. 295–307, 2016.##[44] K. He, X. Zhang, S. Ren, and J. Sun, &#34;Deep Residual Learning for Image Recognition,&#34; in IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2016, pp. 770–778.##[45] A. Graves, A. Mohamed, and G. Hinton, &#34;Speech Recognition with Deep Recurrent Neural Networks,&#34; in Acoustics, Speech and Signal Processing (ICASSP), 2013, no. 3, pp. 6645–6649.##[46] Y. Miao, M. Gowayyed, and F. Metze, &#34;EESEN: End-to-end speech recognition using deep RNN models and WFST-based decoding,&#34; in IEEE Workshop on Automatic Speech Recognition and Understanding, ASRU 2015 - Proceedings, 2016, pp. 167–174.##[47] W. Song and J. Cai, &#34;End-to-End Deep Neural Network for Automatic Speech Recognition,&#34; CS224d: Deep Learning for Natural Language Processing, pp. 1–8, 2015.##[48] S. Kapadia, V. Valtchev and S. J. Young, &#34;MMI training for continuous phoneme recognition on the TIMIT database,&#34; in IEEE International Conference on Acoustics, Speech, and Signal Processing, 1993, vol. 2, pp. ‎491–494‎.##[49] M. Bijankhan, J. Sheikhzadegan, and M. R. Roohani, Y. Samareh, &#34;FARSDAT- the speech database of farsi spoken language,&#34; in proceedings Australian conference on speech science and technology, 1994, vol. 2, pp. 826–830.##[50] B. H. Juang, W. Chou, and C. H. Lee, &#34;Minimum classification error rate methods for speech recognition,&#34; IEEE Transactions on Speech and Audio Processing, vol. 5, no. 3, pp. 257–265, 1997.##[51] E. McDermott, T. J. Hazen, J. Roux, A. Nakamura and S. Katagiri, &#34;Discriminative Training for Large-Vocabulary Speech Recog-nition Using Minimum Classification Error,&#34; IEEE Transactions on Audio, Speech and Language Processing, vol. 15, no. 1, pp. 203–223, 2007.##[52] F. Sha and L. Saul, &#34;Large Margin Gaussian Mixture Modeling for Phonetic Classification and Recognition,&#34; in IEEE International Conference on Acoustics Speech and Signal Processing Proceedings, 2006, vol. 1, pp. ‎265–268‎.##[53] G. Zweig, P. Nguyen, D. Van Compernolle, K. Demuynck, L. Atlas, P. Clark, G. Sell, M. Wang, F. Sha, H. Hermansky, D. Karakos, A. Jansen, S. Thomas, S. Bowman and J. Kao, &#34;Speech recognition with segmental conditional random fields,&#34; in IEEE International Conference on Acoustics, Speech and Signal Processing, 2011, pp. 5044–5047.##[1] ج. شیخ زادگان ،م. بیژن خان، &#34;دادگان گفتاری زبان فارسی&#34;، دومین کارگاه پژوهشی زبان فارسی و رایانه، 1385، ص 261-247.##[2] ب. باباعلی، &#34;پایه گذاری بستری نو و کارآمد در حوزه بازشناسی گفتار فارسی&#34;، پردازش علائم و داده‌ها، دوره 13، ش. 3، ص. 1-13، 1394.##[3] س. ز. سیدصالحی و س.ع. سیدصالحی، &#34;بهبود مدل تفکیککننده منیفلدهای غیرخطی بهمنظور بازشناسی چهره با یک تصویر از هر فرد&#34;، پردازش علائم و داده‌ها، دوره 12، ش. 1، ص. 3-16، 1394.##[4] ز. انصاری و ع. سید صالحی، &#34;معرفی شبکه های عصبی پیمانه ای عمیق با ساختار فضایی-زمانی دوگانه جهت بهبود بازشناسی گفتار پیوسته فارسی&#34;، پردازش علائم و داده‌ها، دوره 13، ش. 1، ص. 39-56، 1395.##[5] س. ز. سیدصالحی و س. ع. سیدصالحی، &#34;روش پیشتعلیم سریع بر مبنای کمینهسازی خطا برای همگرائی یادگیری شبکههای عصبی با ساختار عمیق&#34;، پردازش علائم و داده‌ها، دوره 10، ش. 1، ص. 13-26، 1392.##[1] Bi Jen Khan, J. Sheykhzadegan, &#34;Persian speech dataset&#34;, in Machine Translation in Persian, 2006, pp. 261-247.##[2] B. BabaAli, &#34;A state-of-the-art and efficient framework for Persian speech recognition&#34;, Signal and Data Processing, Vol. 13, No. 3, pp. 1-13, 2015.##[3] S. Z. Seyyedsalehi, and A. Seyyedsalehi, &#34;Improving the nonlinear manifold separator model to the face recognition by a single image of per person.&#34; Signal and Data Processing, Vol. 12, No.1, pp. 3-16, 2015.##[4] Z. Ansari, and A. Seyyedsalehi, &#34;Deep Modular Neural Networks with Double Spatio-temporal Association Structure for Persian Continuous Speech Recognition.&#34; Signal and Data Processing, Vol. 13, No.1, pp. 39-56, 2016.##[5] S. Z. Seyyedsalehi, and A. Seyyedsalehi, &#34;A new fast pre training method for training of deep neural network.&#34; Signal and Data Processing, Vol. 10, No.1, pp. 13-26, 2013.##[6] Y. Hifny and S. Renals, &#34;Speech recognition using augmented conditional random fields,&#34; IEEE Transactions on Audio, Speech and Language Processing, vol. 17, no. 2, pp. 354–365, 2009.##[7] K. H. Davis, R. Biddulph, and S. Balashek, &#34;Automatic Recognition of Spoken Digits,&#34; The Journal of the Acoustical Society of America, vol. 24, no. 6, p. 637–‎642‎, 1952.##[8] L. Rabiner and B. Juang, Fundamentals of Speech Recognition: Prentice Hall, vol. 22. 1993.##[9] R. P. Lippmann, &#34;Speech recognition by machines and humans,&#34; Speech Communication, vol. 22, no. 7, pp. 1–15, 1997.##[10] O. Scharenborg, &#34;Reaching over the gap: A review of efforts to link human and automatic speech recognition research,&#34; Speech Communication, vol. 49, no. 5, pp. 336–347, 2007.##[11] M. Ostendorf, &#34;Moving Beyond the 'Beads-on-a-String' Model of Speech,&#34; in IEEE Automatic Speech Recognition and Understanding Workshop‎, 1999, pp. 79–83.##[12] H. Bourlard, H. Hermansky, and N. Morgan, &#34;Towards increasing speech recognition error rates,&#34; Speech Communication, vol. 18, no. 3, pp. 205–231, 1996.##[13] N. Morgan, Q. Zhu, and A. Stolcke, &#34;Pushing the envelope-aside,&#34; Signal Processing Magazine‎, vol. 22, no. 5, pp. 81–88, 2005.##[14] C. J. Leggetter and P. C. Woodland, &#34;Maximum likelihood linear regression for speaker adaptation of continuous density hidden Markov models,&#34; Computer Speech &#38; Language, vol. 9, no. 2, pp. 171–185, 1995.##[15] L. Lee and R. C. Rose, &#34;Speaker normalization using efficient frequency warping procedures,&#34; in IEEE International Conference on Acoustics, Speech, and Signal Processing, 1996, vol. 1, pp. 356–1996.##[16] L. Welling, S. Kanthak and H. Ney, &#34;Improved methods for vocal tract normalization,&#34; in IEEE International Conference on Acoustics, Speech, and Signal Processing, 1999, vol. 2, pp. 761–764.##[17] D. Povey. Discriminative Training for Large Vocabulary Speech Recognition. PhD thesis, Cambridge University, 2003.##[18] S. F. Chen and J. Goodman, &#34;An empirical study of smoothing techniques for language modeling,&#34; in Proceedings of the 34th annual meeting on Association for Computational Linguistics, 1996, pp. 310–318.##[19] G. E. Dahl, D. Yu, L. Deng and A. Acero, &#34;Context-dependent pre-trained deep neural networks for large-vocabulary speech recognition,&#34; IEEE Transactions on Audio, Speech and Language Processing, vol. 20, no. 1, pp. 30–42, 2012.##[20] G. Hinton, L. Deng, D. Yu, G. E. Dahl, A. Mohamed, N. Jaitly, A. Senior, V. Vanhoucke, P. Nguyen, T. N. Sainath, and B. Kingsbury, &#34;Deep Neural Networks for Acoustic Modeling in Speech Recognition: The Shared Views of Four Research Groups,&#34; IEEE Signal Processing Magazine, vol. 29, no. 6, pp. 82–97, 2012.##[21] A. R. Mohamed, G. Hinton and G. Penn, &#34;Understanding how deep belief networks perform acoustic modelling,&#34; in IEEE Interna-tional Conference on Acoustics, Speech and Signal Processing, 2012, pp. 4273–4276.##[22] R. Salakhutdinov and G. Hinton, &#34;An Efficient Learning Procedure for Deep Boltzmann Machines,&#34; Neural Computation, vol. 24, no. 8, pp. 1967–2006, 2012.##[23] R. Salakhutdinov, &#34;Learning deep generative models‎,&#34; PHD thesis, Toronto, Ont., Canada‎, 2009.##[24] G. E. Hinton, &#34;Training products of experts by minimizing contrastive divergence,&#34; Neural Computation, vol. 14, no. 8, pp. 1771–1800, 2002.##[25] G. E. Hinton, S. Osindero, and Y. W. Teh, &#34;A fast learning algorithm for deep belief nets,&#34; Neural computation, vol. 18, no. 7, pp. 1527–1554, 2006.##[26] P. Ramesh and J. G. Wilpon, &#34;Modeling state durations in hidden Markov models for automatic speech recognition,&#34; in IEEE International Conference on Acoustics, Speech, and Signal Processing, 1992, vol. 1, pp. 381–384.##[27] P. N. Justine T. Kao, Geoffrey Zweig, &#34;Discriminative duration modeling for speech recognition with segmental conditional random fields,&#34; in ICASSP, 2011. PP. 4476-4479.##[28] S. Z. Yu, &#34;Hidden semi-Markov models,&#34; Artificial Intelligence, vol. 174, no. 2. pp. 215–243, 2010.##[29] S. J. Rennie, P. Fousek, and P. L. Dognin, &#34;factorial hidden restricted boltzmann machines for noise robust speech recognition,&#34; in IEEE International Conference on Acoustics, Speech and Signal Processing, 2012, pp. 4297–4300.##[30] J. Huang and B. Kingsbury, &#34;Audio-visual deep learning for noise robust speech recognition,&#34; in IEEE International Conference on Acoustics, Speech and Signal Processing, 2013, pp. 7596–7599.##[31] A. Maas and Q. Le, &#34;Recurrent Neural Networks for Noise Reduction in Robust ASR.,&#34; in Interspeech, 2012, pp. 3–6.##[32] H. Bourlard and N. Morgan, &#34;Continuous speech recognition by connectionist statistical methods,&#34; IEEE Transactions on Neural Net-works, vol. 4, no. 6, pp. 893–909, 1993.##[33] A. J. Robinson, G. D. Cook, D. P. W. Ellis, E. Fosler-Lussier, S. J. Renals, and D. A. G. Williams, &#34;Connectionist speech recognition of Broadcast News,&#34; Speech Communication, vol. 37, no. 1–2, pp. 27–45, 2002.##[34] Y. H. Sung and D. Jurafsky, &#34;Hidden conditional random fields for phone recognition,&#34; in IEEE Workshop on Automatic Speech Recognition and Understanding, 2009, pp. 107–112.##[35] T. N. Sainath, A. R. Mohamed, B. Kingsbury and B. Ramabhadran, &#34;Deep convolutional neural networks for LVCSR,&#34; in IEEE International Conference on Acoustics, Speech and Signal Processing, 2013, pp. 8614–8618.##[36] T. N. Sainath, B. Kingsbury, G. Saon, H. Soltau, A.-R. Mohamed, G. Dahl, and B. Ramabhadran, &#34;Deep Convolutional Neural Networks for Large-scale Speech Tasks.,&#34; Neural networks, vol. 64, pp. 39–48, Sep. 2014.##[37] T. N. Sainath, B. Kingsbury, H. Soltau and B. Ramabhadran, &#34;Optimization techniques to improve training speed of deep neural networks for large speech tasks,&#34; IEEE Transactions on Audio, Speech and Language Processing, vol. 21, no. 11, pp. 2267–2276, 2013.##[38] H. Lee, R. Grosse, R. Ranganath, and A. Y. Ng, &#34;Convolutional deep belief networks for scalable unsupervised learning of hierarchical represent-tations,&#34; in Proceedings of the 26th Annual International Conference on Machine Learning, 2009, vol. 2008, pp. 1–8.##[39] O. Abdel-Hamid, A. Mohamed, H. Jiang, L. Deng, G. Penn, and D. Yu, &#34;Convolutional neural networks for speech recognition,&#34; IEEE Transactions on Speech and Audio Processing, vol. 22, no. 10, pp. 1533–1545, 2014.##[40] G. Heigold, &#34;A log-linear discriminative mode-ling framework for speech recognition,&#34; PhD dissertation, Aachen, Germany, 2010.##[41] M. Russell and A. Cook, &#34;Experimental evaluation of duration modelling techniques for automatic speech recognition,&#34; in IEEE Inter-national Conference on Acoustics, Speech, and Signal Processing, 1987, vol. 12, pp. 2376–2379.##[42] H. Lee and H. Kwon, &#34;Going Deeper with Contextual CNN for Hyperspectral Image Classification,&#34; IEEE Transactions on Image Processing, vol. 26, no. 10, pp. 4843–4855, 2017.##[43] C. Dong, C. C. Loy, K. He, and X. Tang, &#34;Image Super-Resolution Using Deep Convolutional Networks,&#34; IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 38, no. 2, pp. 295–307, 2016.##[44] K. He, X. Zhang, S. Ren, and J. Sun, &#34;Deep Residual Learning for Image Recognition,&#34; in IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2016, pp. 770–778.##[45] A. Graves, A. Mohamed, and G. Hinton, &#34;Speech Recognition with Deep Recurrent Neural Networks,&#34; in Acoustics, Speech and Signal Processing (ICASSP), 2013, no. 3, pp. 6645–6649.##[46] Y. Miao, M. Gowayyed, and F. Metze, &#34;EESEN: End-to-end speech recognition using deep RNN models and WFST-based decoding,&#34; in IEEE Workshop on Automatic Speech Recognition and Understanding, ASRU 2015 - Proceedings, 2016, pp. 167–174.##[47] W. Song and J. Cai, &#34;End-to-End Deep Neural Network for Automatic Speech Recognition,&#34; CS224d: Deep Learning for Natural Language Processing, pp. 1–8, 2015.##[48] S. Kapadia, V. Valtchev and S. J. Young, &#34;MMI training for continuous phoneme recognition on the TIMIT database,&#34; in IEEE International Conference on Acoustics, Speech, and Signal Processing, 1993, vol. 2, pp. ‎491–494‎.##[49] M. Bijankhan, J. Sheikhzadegan, and M. R. Roohani, Y. Samareh, &#34;FARSDAT- the speech database of farsi spoken language,&#34; in proceedings Australian conference on speech science and technology, 1994, vol. 2, pp. 826–830.##[50] B. H. Juang, W. Chou, and C. H. Lee, &#34;Minimum classification error rate methods for speech recognition,&#34; IEEE Transactions on Speech and Audio Processing, vol. 5, no. 3, pp. 257–265, 1997.##[51] E. McDermott, T. J. Hazen, J. Roux, A. Nakamura and S. Katagiri, &#34;Discriminative Training for Large-Vocabulary Speech Recog-nition Using Minimum Classification Error,&#34; IEEE Transactions on Audio, Speech and Language Processing, vol. 15, no. 1, pp. 203–223, 2007.##[52] F. Sha and L. Saul, &#34;Large Margin Gaussian Mixture Modeling for Phonetic Classification and Recognition,&#34; in IEEE International Conference on Acoustics Speech and Signal Processing Proceedings, 2006, vol. 1, pp. ‎265–268‎.##[53] G. Zweig, P. Nguyen, D. Van Compernolle, K. Demuynck, L. Atlas, P. Clark, G. Sell, M. Wang, F. Sha, H. Hermansky, D. Karakos, A. Jansen, S. Thomas, S. Bowman and J. Kao, &#34;Speech recognition with segmental conditional random fields,&#34; in IEEE International Conference on Acoustics, Speech and Signal Processing, 2011, pp. 5044–5047.## ##</REF>
			</REFRENCE>
		</REFRENCES>

	</ARTICLE>


	<ARTICLE> 
		<TitleF>ارایه یک روش جدید انتشار داده‌ها با حفظ محرمانگی با هدف بهبود دقّت طبقه‌‌بندی روی داده‌های گمنام</TitleF>
		<TitleE>A New Privacy Preserving Data Publishing Technique Conserving Accuracy of Classification on Anonymized Data</TitleE>
		<TitleLang_ID>1</TitleLang_ID>
		<ABSTRACTS>
			<ABSTRACT>
			<Language_ID>1</Language_ID>
			<CONTENT>با توسعه روزافزون خدمات دولت الکترونیکی، اطلاعات شخصی افراد در قالب پایگاه&#8204;های داده در دستگاه&#8204;ها و ارگان&#8204;های دولتی و خصوصی ذخیره شده است. در بسیاری از موارد برای پردازش و استخراج دانش از این منابع داده بزرگ و با&#8204;ارزش، نیاز به انتشار منابع داده و در&#8204;اختیار&#8204;گذاشتن اطلاعات به سایر نهادها و شرکت&#8204;ها پدید می&#8204;آید که این امر موجب ایجاد چالش&#8204;&#8204;های امنیتی در نقض حریم خصوصی افراد می&#8204;شود. در این مقاله ضمن بررسی کامل پیشینه پژوهش، حفظ محرمانگی در انتشار داده&#8204;ها، یک روش کارآمد برای گمنام&#8204;سازی ارائه می&#8204;شود که هدف آن حفظ دقت طبقه&#8204;بندی روی داده&#8204;های گمنام است. این روش با بهره&#8204;گیری از درخت تصمیم از انتشار اطلاعاتی که تأثیر کمی بر سودمندی داده&#8204;های خروجی دارد و حذف آن&#8204;ها موجب تأمین محرمانگی می&#8204;شود، جلوگیری می&#8204;کند. یکی از چالش&#8204;های طرح&#8204;&#8204;هایی که از عمل&#8204;گر گمنام&#8204;سازی عمومی&#8204;سازی استفاده می&#8204;کنند، نیازمندی به ساخت درخت طبقه&#8204;&#8204;بندی برای هر شبه&#8204;شناسه است که بیش&#8204;تر به&#8204;صورت خودکار صورت می&#8204;گرفت. در طرح پیشنهادی نیازی به ساخت درخت طبقه&#8204;&#8204;بندی نیست. نتایج شبیه&#8204;&#8204;سازی و ارزیابی&#8204;های انجام&#8204;&#8204;شده نشان می&#8204;دهد، میان دقت الگوریتم&#8204;های طبقه&#8204;&#8204;بندی که روی مجموعه&#8204;داده استاندارد گمنام&#8204;شده توسط این روش و مجموعه&#8204;داده اولیه آموزش دیده&#8204;اند، تفاوت اندکی وجود دارد.
&#160;</CONTENT>
			</ABSTRACT>
			<ABSTRACT>
			<Language_ID>2</Language_ID>
			<CONTENT>Data collection and storage has been facilitated by the growth in electronic services, and has led to recording vast amounts of personal information in public and private organizations databases. These records often include sensitive personal information (such as income and diseases) and must be covered from others access. But in some cases, mining the data and extraction of knowledge from these valuable sources, creates the need for sharing them with other organizations. This would bring security challenges in user&#8217;s privacy. The concept of privacy is described as sharing of information in a controlled way. In other words, it decides what type of personal information should be shared and which group or person can access and use it. &#8220;Privacy preserving data publishing&#8221; is a solution to ensure secrecy of sensitive information in a data set, after publishing it in a hostile environment. This process aimed to hide sensitive information and keep published data suitable for knowledge discovery techniques. Grouping data set records is a broad approach to data anonymization. This technique prevents access to sensitive attributes of a specific record by eliminating the distinction between a number of data set records. So far a large number of data publishing models and techniques have been proposed but their utility is of concern when a high privacy requirement is needed. The main goal of this paper to present a technique to improve the privacy and performance data publishing techniques. In this work first we review previous techniques of privacy preserving data publishing and then we present an efficient anonymization method which its goal is to conserve accuracy of classification on anonymized data. The attack model of this work is based on an adversary inferring a sensitive value in a published data set to as high as that of an inference based on public knowledge. Our privacy model and technique uses a decision tree to prevent publishing of information that removing them provides privacy and has little effect on utility of output data. The presented idea of this paper is an extension of the work presented in [20]. Experimental results show that classifiers trained on the transformed data set achieving similar accuracy as the ones trained on the original data set.</CONTENT>
			</ABSTRACT>
		</ABSTRACTS>

		<PAGES>
			<PAGE>
			<FPAGE>31</FPAGE>
			<TPAGE>46</TPAGE>
			</PAGE>
		</PAGES>

		<RECEIVE_DATE>
			2017/12/62018/04/42017/12/12
		</RECEIVE_DATE>

		<RECEIVE_DATE_FA>
			1396/9/21
		</RECEIVE_DATE_FA>

		<ACCEPT_DATE>
			2018/09/152018/12/172018/07/25
		</ACCEPT_DATE>

		<ACCEPT_DATE_FA>
			1397/5/3
		</ACCEPT_DATE_FA>

		<AUTHORS>
			<AUTHOR>
				<Name>رضا</Name>
				<MidName></MidName>
				<Family>ابراهیمی آتانی</Family>
				<NameE>Reza</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Ebrahimi Atani</FamilyE>
				<Organizations>
				<Organization>دانشگاه گیلان</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>rebrahimi@guilan.ac.ir</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>مهدی</Name>
				<MidName></MidName>
				<Family>صادق پور</Family>
				<NameE>Mehdi</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Sadeghpour</FamilyE>
				<Organizations>
				<Organization>دانشگاه گیلان</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>mehdi.sadeghpour@live.com</Email>
				</EMAILS>
			</AUTHOR>
		</AUTHORS>


		<KEYWORDS>
			<KEYWORD>
				<KeyText>Privacy preservation</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Data sharing</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Anonymization</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Classification</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Decision tree</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Suppression</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>حفظ محرمانگی</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>طبقه‌‌بندی</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>گمنام‌سازی</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>درخت تصمیم</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>عمل‌گر فرونشانی</KeyText>
			</KEYWORD>
		</KEYWORDS>

		<REFRENCES>
			<REFRENCE>
				<REF>[1] B. C. M. Fung, K. Wang, A. Wai-Chee Fu and P. S. Yu, (2010), Introduction to Privacy-Preserving Data Publishing: Concepts and Techniques, Chapman and Hall/CRC.##[2] J. Bennett and S. Lanning, (2007), &#34;The Netflix Prize&#34;, Proceedings of the KDD Cup Workshop, pp. 3-6.##[3] D. Nettleton, (2014), &#34;Data Privacy and Privacy-Preserving Data Publishing,&#34; in Commercial Data Mining: Processing, Analysis and Modeling for Predictive Analytics Projects, Morgan Kaufmann, pp. 266-277.##[4] B. Fung, K. Wang and P. Yu, (2010), &#34;Privacy-Preserving Data Publishing: A Survey of Recent Developments&#34;, ACM Computing Surveys, vol. 42, no. 4,##[5] L. Sweeney, (2002), &#34;k-Anonymity: A Model for Protecting Privacy&#34;, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 10, no. 5, pp. 557-570.##https://doi.org/10.1142/S0218488502001648##[6] K. S. Babu, (2013), Utility-Based Privacy Preserving Data Publishing, PhD thesis, National Institute of Technology Rourkela.##[7] N. Mohammed, B. C. M. Fung, P. C. K. Hung and C. K. Lee, (2009), &#34;Healthcare Data: A Case Study on the Blood Transfusion Service&#34;, Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 1285-1294.##[8] D. Dou and S. Coulondre, (2012), &#34;Detecting Privacy Violations in Multiple Views Publishing,&#34; in Database and Expert Systems Applications, Springer-Verlag Berlin Heidelberg, 506–513.##[9] A. Anjum and G. Raschia, (2013), &#34;Anonymizing Sequential Releases under Arbitrary Updates&#34;, Proceedings of the Joint EDBT/ICDT 2013 Workshops, pp. 145-154.##[10] B. Fung, K. Wang and P. Yu, (2007), &#34;Anonymizing Classification Data for Privacy Preservation&#34;, IEEE Transactions on Knowledge and Data Engineering, vol. 19, no. 5, pp. 711-725.##[11] V. S. Susan and T. Christopher, (2014), &#34;A Survey on Privacy Preservation in Data Publishing&#34;, International Journal of Computer Science and Mobile Computing, vol. 3, no. 3, pp. 188-193.##[12] T. Dalenius, (1977), &#34;Towards a Methodology for Statistical Disclosure Control&#34;, Statistik Tidskrift, vol. 15, 429–222.##[13] C. Dwork, (2006), &#34;Differential Privacy,&#34; in Automata, Languages and Programming, Springer Berlin Heidelberg, pp. 1-12.##[14] K. Wang and B. C. M. Fung, (2006), &#34;Anonymizing sequential releases&#34;, Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 414-423.##[15] A. Machanavajjhala, D. Kifer, J. Gehrke and M. Venkitasubramaniam, (2007), &#34;l-diversity: Privacy beyond k-anonymity&#34;, ACM Transactions on Knowledge Discovery from Data, vol. 1, no. 1, article 3.##[16] N. Li, T. Li and S. Venkatasubramanian, (2007), &#34;t-Closeness: Privacy Beyond k-Anonymity and l-Diversity&#34;, IEEE 23rd International Conference on Data Engineering, pp. 106 - 115.##[17] Y. Rubner, C. Tomasi and L. J. Guibas, (2000), &#34;The Earth Mover's Distance as a Metric for Image Retrieval&#34;, International Journal of Computer Vision, vol. 40, no. 2, pp. 99 - 121.##[18] N. Li, T. Li and S. Venkatasubramanian, (2010), &#34;Closeness A New Privacy Measure for Data Publishing&#34;, IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 7, pp. 943-956.##[19] M. E. Nergiz, M. Atzori and C. Clifton, (2007), &#34;Hiding the Presence of Individuals from Shared Databases&#34;, InProc. of ACM International Conference on Management of Data, pp. 665-676.##[20] A. S. Sattar, J. Li, X. Ding, J. Liu and M. Vincent, (2013), &#34;A general framework for privacy preserving data publishing&#34;, Knowledge-Based Systems, vol. 54, 276–287.##[21] K. Wang, P. Yu and S. Chakraborty, (2004), &#34;Bottom-Up Generalization: A Data Mining Solution to Privacy Protection&#34;, Fourth IEEE International Conference on Data Mining, pp. 249 - 256.##[22] B. Fung, K. Wang and Y. P.S, (2005), &#34;Top-Down Specialization for Information and Privacy Preservation&#34;, Proc. 21st International Conference on Data Engineering, pp. 205-216.##[23] S. Kisilevich, L. Rokach, Y. Elovici and B. Shapira, (2010), &#34;Efficient Multidimensional Suppression for K-Anonymity&#34;, IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 3, pp. 334 - 347.##[24] A. Hussien, N. Hamza and A. Hefny, (2013), &#34;Attacks on Anonymization-Based Privacy-Preserving: A Survey for Data Mining and Data Publishing&#34;, Journal of Information Security, vol. 4, no. 2, pp. 101-112.##[25] M. Hall, E. Frank, G. Holmes, B. Pfahringer, P. Reutemann and I. H. Witten, (2009), &#34;The WEKA Data Mining Software: An Update&#34;, ACM SIGKDD Explorations Newsletter, vol. 11, no. 1, pp. 10-18.##[26] &#34;Taxonomy trees of the Adult data set&#34;, [Online]. Available: http://ddm.cs.sfu.ca/dmsoft/Privacy/products/adultHierarchy.txt. [Accessed 8 May 2016].##[27] &#34;UCI Machine Learning Repository: Adult Data Set&#34;, [Online]. Available: http://archive.ics.uci.edu/ml/datasets/Adult. [Accessed 8 May 2016].##[28] M. Nergiz, C. Clifton and A. Nergiz, (2009), &#34;Multirelational k-Anonymity&#34;, IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 8, pp. 1104-1117.##[29] Mehdi Sadeghpour, &#34;Privacy Preserving Data Publishing using Group Based Anonymization&#34;, MSc thesis in Software engineering, University of Guilan, 2015.##[1] B. C. M. Fung, K. Wang, A. Wai-Chee Fu and P. S. Yu, (2010), Introduction to Privacy-Preserving Data Publishing: Concepts and Techniques, Chapman and Hall/CRC.##[2] J. Bennett and S. Lanning, (2007), &#34;The Netflix Prize&#34;, Proceedings of the KDD Cup Workshop, pp. 3-6.##[3] D. Nettleton, (2014), &#34;Data Privacy and Privacy-Preserving Data Publishing,&#34; in Commercial Data Mining: Processing, Analysis and Modeling for Predictive Analytics Projects, Morgan Kaufmann, pp. 266-277.##[4] B. Fung, K. Wang and P. Yu, (2010), &#34;Privacy-Preserving Data Publishing: A Survey of Recent Developments&#34;, ACM Computing Surveys, vol. 42, no. 4,##[5] L. Sweeney, (2002), &#34;k-Anonymity: A Model for Protecting Privacy&#34;, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 10, no. 5, pp. 557-570.##https://doi.org/10.1142/S0218488502001648##[6] K. S. Babu, (2013), Utility-Based Privacy Preserving Data Publishing, PhD thesis, National Institute of Technology Rourkela.##[7] N. Mohammed, B. C. M. Fung, P. C. K. Hung and C. K. Lee, (2009), &#34;Healthcare Data: A Case Study on the Blood Transfusion Service&#34;, Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 1285-1294.##[8] D. Dou and S. Coulondre, (2012), &#34;Detecting Privacy Violations in Multiple Views Publishing,&#34; in Database and Expert Systems Applications, Springer-Verlag Berlin Heidelberg, 506–513.##[9] A. Anjum and G. Raschia, (2013), &#34;Anonymizing Sequential Releases under Arbitrary Updates&#34;, Proceedings of the Joint EDBT/ICDT 2013 Workshops, pp. 145-154.##[10] B. Fung, K. Wang and P. Yu, (2007), &#34;Anonymizing Classification Data for Privacy Preservation&#34;, IEEE Transactions on Knowledge and Data Engineering, vol. 19, no. 5, pp. 711-725.##[11] V. S. Susan and T. Christopher, (2014), &#34;A Survey on Privacy Preservation in Data Publishing&#34;, International Journal of Computer Science and Mobile Computing, vol. 3, no. 3, pp. 188-193.##[12] T. Dalenius, (1977), &#34;Towards a Methodology for Statistical Disclosure Control&#34;, Statistik Tidskrift, vol. 15, 429–222.##[13] C. Dwork, (2006), &#34;Differential Privacy,&#34; in Automata, Languages and Programming, Springer Berlin Heidelberg, pp. 1-12.##[14] K. Wang and B. C. M. Fung, (2006), &#34;Anonymizing sequential releases&#34;, Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 414-423.##[15] A. Machanavajjhala, D. Kifer, J. Gehrke and M. Venkitasubramaniam, (2007), &#34;l-diversity: Privacy beyond k-anonymity&#34;, ACM Transactions on Knowledge Discovery from Data, vol. 1, no. 1, article 3.##[16] N. Li, T. Li and S. Venkatasubramanian, (2007), &#34;t-Closeness: Privacy Beyond k-Anonymity and l-Diversity&#34;, IEEE 23rd International Conference on Data Engineering, pp. 106 - 115.##[17] Y. Rubner, C. Tomasi and L. J. Guibas, (2000), &#34;The Earth Mover's Distance as a Metric for Image Retrieval&#34;, International Journal of Computer Vision, vol. 40, no. 2, pp. 99 - 121.##[18] N. Li, T. Li and S. Venkatasubramanian, (2010), &#34;Closeness A New Privacy Measure for Data Publishing&#34;, IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 7, pp. 943-956.##[19] M. E. Nergiz, M. Atzori and C. Clifton, (2007), &#34;Hiding the Presence of Individuals from Shared Databases&#34;, InProc. of ACM International Conference on Management of Data, pp. 665-676.##[20] A. S. Sattar, J. Li, X. Ding, J. Liu and M. Vincent, (2013), &#34;A general framework for privacy preserving data publishing&#34;, Knowledge-Based Systems, vol. 54, 276–287.##[21] K. Wang, P. Yu and S. Chakraborty, (2004), &#34;Bottom-Up Generalization: A Data Mining Solution to Privacy Protection&#34;, Fourth IEEE International Conference on Data Mining, pp. 249 - 256.##[22] B. Fung, K. Wang and Y. P.S, (2005), &#34;Top-Down Specialization for Information and Privacy Preservation&#34;, Proc. 21st International Conference on Data Engineering, pp. 205-216.##[23] S. Kisilevich, L. Rokach, Y. Elovici and B. Shapira, (2010), &#34;Efficient Multidimensional Suppression for K-Anonymity&#34;, IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 3, pp. 334 - 347.##[24] A. Hussien, N. Hamza and A. Hefny, (2013), &#34;Attacks on Anonymization-Based Privacy-Preserving: A Survey for Data Mining and Data Publishing&#34;, Journal of Information Security, vol. 4, no. 2, pp. 101-112.##[25] M. Hall, E. Frank, G. Holmes, B. Pfahringer, P. Reutemann and I. H. Witten, (2009), &#34;The WEKA Data Mining Software: An Update&#34;, ACM SIGKDD Explorations Newsletter, vol. 11, no. 1, pp. 10-18.##[26] &#34;Taxonomy trees of the Adult data set&#34;, [Online]. Available: http://ddm.cs.sfu.ca/dmsoft/Privacy/products/adultHierarchy.txt. [Accessed 8 May 2016].##[27] &#34;UCI Machine Learning Repository: Adult Data Set&#34;, [Online]. Available: http://archive.ics.uci.edu/ml/datasets/Adult. [Accessed 8 May 2016].##[28] M. Nergiz, C. Clifton and A. Nergiz, (2009), &#34;Multirelational k-Anonymity&#34;, IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 8, pp. 1104-1117.##[29] مهدی صادق پور، &#34; حفظ محرمانگی در انتشار داده ها به وسیله گم نام سازی دسته‌ای&#34;، پایان نامه کارشناسی ارشد مهندسی کامپیوتر – نرم افزار، دانشگاه گیلان، 1394.##[29] Mehdi Sadeghpour, &#34;Privacy Preserving Data Publishing using Group Based Anonymization&#34;, MSc thesis in Software engineering, University of Guilan, 2015.## ##</REF>
			</REFRENCE>
		</REFRENCES>

	</ARTICLE>


	<ARTICLE> 
		<TitleF>امید ریاضی نرخ پوشش برای ماتریس‌های هلمن</TitleF>
		<TitleE>Expected coverage rate for the Hellman matrices</TitleE>
		<TitleLang_ID>1</TitleLang_ID>
		<ABSTRACTS>
			<ABSTRACT>
			<Language_ID>1</Language_ID>
			<CONTENT>مصالحه حافظه&#8204;زمان یک الگوریتم احتمالاتی برای وارون&#8204;کردن توابع یک&#8204;طرفه، با استفاده از داده&#8204;های از پیش محاسبه&#8204;شده است. هلمن در سال ۱۹۸۰ این روش را معرفی کرد و یک کران پایین برای احتمال موفقیت آن به&#8204;دست آورد. پس از آن نیز تحلیل&#8204;های پژوهش&#8204;گران برای بررسی احتمال موفقیت، بر اساس همین کران پایین بوده است. در این مقاله، ابتدا به بررسی امید ریاضی نرخ پوشش یک ماتریس هلمن می&#8204;پردازیم؛ سپس، این نرخ را برای ماتریس&#8204;های هلمنی که فقط از یک زنجیره تشکیل شده&#8204;اند، محاسبه کرده&#8204;ایم. نشان داده&#8204;ایم که امید ریاضی نرخ پوشش برای چنین ماتریس&#8204;هایی بیشینه و برابر با ۸۵/۰ است. در ادامه، روش&#8204;هایی برای تخمین دقیق&#8204;تر این نرخ ارائه، و با روش هلمن مقایسه و در&#8204;نهایت، ماتریس&#8204;های هلمنی را معرفی کرده&#8204;ایم که فقط از یک زنجیره تشکیل شده&#8204;اند؛ ولی طول این زنجیره مقداری ثابت نیست و تا رسیدن به نخستین تکرار ادامه می&#8204;یابد. به&#8204;صورت نظری و عملی نشان داده&#8204;ایم که احتمال موفقیت برای چنین ماتریس&#8204;هایی بیشتر از روش هلمن است.
&#160;</CONTENT>
			</ABSTRACT>
			<ABSTRACT>
			<Language_ID>2</Language_ID>
			<CONTENT>Hellman&#8217;s time-memory trade-off is a probabilistic method for inverting one-way functions, using pre-computed data. Hellman introduced this method in 1980 and obtained a lower bound for the success probability of his algorithm.&#160; After that, all further analyses of researchers are based on this lower bound. 
In this paper, we first studied the expected coverage rate (ECR) of the Hellman matrices, which are constructed by a single chain. We showed that the ECR of such matrices is maximum and equal to 0.85. In this process, we find out that there exists a gap between the Hellman&#8217;s lower bound and experimental coverage rate of a Hellman matrix. Specifically, this gap is larger, when considering the Hellman matrices constructed with one single chain. So, we are investigated to obtain an accurate formula for the ECR of a Hellman matrix. Subsequently, we presented a new formula that estimate the ECR of a Hellman matrix more accurately than the Hellman&#8217;s lower bound. We showed that the given formula is closely match experimental data. 
In the last, we introduced a new method to construct matrices which have much more ECR than Hellman matrices. In fact, each matrix in this new method is constructed with one single chain, which is non-repeating trajectory from a random point. So, this approach result in a number of matrices that each one contains a chain with variable length. The main advantage of this method is that we have more probability of success than Hellman method, however online time and memory requirements are increased. We have also verified theory of this new method with experimental results.
&#160;</CONTENT>
			</ABSTRACT>
		</ABSTRACTS>

		<PAGES>
			<PAGE>
			<FPAGE>47</FPAGE>
			<TPAGE>58</TPAGE>
			</PAGE>
		</PAGES>

		<RECEIVE_DATE>
			2017/12/62018/04/42017/12/122017/12/7
		</RECEIVE_DATE>

		<RECEIVE_DATE_FA>
			1396/9/16
		</RECEIVE_DATE_FA>

		<ACCEPT_DATE>
			2018/09/152018/12/172018/07/252018/07/25
		</ACCEPT_DATE>

		<ACCEPT_DATE_FA>
			1397/5/3
		</ACCEPT_DATE_FA>

		<AUTHORS>
			<AUTHOR>
				<Name>ناصرحسین</Name>
				<MidName></MidName>
				<Family>غروی</Family>
				<NameE>Naser Hosein</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Gharavi</FamilyE>
				<Organizations>
				<Organization>دانشگاه جامع امام حسین (ع)</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>hgharavi@ihu.ac.ir</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>عبدالرسول</Name>
				<MidName></MidName>
				<Family>میرقدری</Family>
				<NameE>Abdorasool</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Mirqadri</FamilyE>
				<Organizations>
				<Organization>دانشگاه جامع امام حسین (ع)</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>amrghdri@ihu.ac.ir</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>محمد</Name>
				<MidName></MidName>
				<Family>عبدالهی ازگمی</Family>
				<NameE>Mohammad</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Abdollahi azgomi</FamilyE>
				<Organizations>
				<Organization>دانشگاه علم و صنعت ایران</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>azgomi@iust.ac.ir</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>سید احمد</Name>
				<MidName></MidName>
				<Family>موسوی</Family>
				<NameE>Sayyed Ahmad</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Mousavi</FamilyE>
				<Organizations>
				<Organization>دانشگاه شهید باهنر کرمان</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>s.a.mousavi@math.uk.ac.ir</Email>
				</EMAILS>
			</AUTHOR>
		</AUTHORS>


		<KEYWORDS>
			<KEYWORD>
				<KeyText>Time-Memory Trade-off</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>one way function</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Hellman matrix</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Expected coverage rate</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>مصالحه حافظه‌زمان</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>تابع یک‌طرفه</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>ماتریس هلمن</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>امید ریاضی نرخ پوشش</KeyText>
			</KEYWORD>
		</KEYWORDS>

		<REFRENCES>
			<REFRENCE>
				<REF>[1] E. Barkan, E. Biham and A. Shamir, &#34;Rigorous bounds on cryptanalytic time/memory tradeoffs&#34;, in Advances in Cryptology: Proceedings of Crypto, LNCS, 2006, 4117, pp. 1–21.##[2] J. Borst, &#34;Block Ciphers: Design, Analysis and Side-Channel Analysis&#34;, PhD thesis, Katholieke Universiteit Leuven, 2001.##[3] D.E. Denning, Cryptography and data security, Addison-Wesley, 1982.##[4] P. Flajolet, and A. Odlyzko, &#34;Random mapping statistics&#34;, Advances in Cryptology, Proceedings of Eurocrypt'89, LNCS, 1990, 434, pp. 329–354.##[5] P. Flajolet, and R. Sedgewick, An introduction to analysis of algorithms, Addison-Wesley, 2013.##[6] B. Harris, &#34;Probability distributions related to random mappings&#34;, The Annals of Mathematical Statistics, pp. 1045–1062, 1960.##[7] M. Hellman, &#34;A cryptanalytic time-memory trade-off&#34;, IEEE Transactions on Information Theory IT, vol. 26, pp. 401–406, 1980.##[8] J. Hong, and S. Moon, &#34;A comparison of cryptanalytic tradeoff algorithms&#34;, Journal of cryptology, vol. 26 (4), pp. 559-637, 2013.##[9] J. Hong and B.I. Kim, &#34;Performance comparison of cryptanalytic time memory data tradeoff methods&#34;, Bull. Korean Math. Soc., vol. 53(5), pp. 1439-1446, 2016.##[10] V. Kolchin, &#34;Random mapp-ings&#34;, Translations series in mathematics and engineering, Optimization Software, Inc., Publications Division, 1986.##[11] K. Kusuda, and T. Matsumoto, &#34;Optimization of time-memory trade-off cryptanalysis and is application to DES&#34;, FEAL-32, and Skipjack, E-79A, pp. 35–48, 1996.##[12] G. W. Lee, and J. Hong, &#34;Comparison of perfect table cryptanalytic tradeoff algorithms&#34;, Designs, Codes and Cryptography, pp. 473-523, 2016.##[13] R.C. Phan, &#34;Mini advanced encryption standard (mini-AES): a testbed for cryptanalysis students&#34;, Cryptologia, vol. 26(4), pp. 283-306, 2002.##[14] Ph. Oechslin, &#34;Making a faster cryptanaly-tic time-memory trade-off&#34;, Annual International Cryptology Conference, Springer Berlin Heidelberg, 2003.##[1] E. Barkan, E. Biham and A. Shamir, &#34;Rigorous bounds on cryptanalytic time/memory tradeoffs&#34;, in Advances in Cryptology: Proceedings of Crypto, LNCS, 2006, 4117, pp. 1–21.##[2] J. Borst, &#34;Block Ciphers: Design, Analysis and Side-Channel Analysis&#34;, PhD thesis, Katholieke Universiteit Leuven, 2001.##[3] D.E. Denning, Cryptography and data security, Addison-Wesley, 1982.##[4] P. Flajolet, and A. Odlyzko, &#34;Random mapping statistics&#34;, Advances in Cryptology, Proceedings of Eurocrypt'89, LNCS, 1990, 434, pp. 329–354.##[5] P. Flajolet, and R. Sedgewick, An introduction to analysis of algorithms, Addison-Wesley, 2013.##[6] B. Harris, &#34;Probability distributions related to random mappings&#34;, The Annals of Mathematical Statistics, pp. 1045–1062, 1960.##[7] M. Hellman, &#34;A cryptanalytic time-memory trade-off&#34;, IEEE Transactions on Information Theory IT, vol. 26, pp. 401–406, 1980.##[8] J. Hong, and S. Moon, &#34;A comparison of cryptanalytic tradeoff algorithms&#34;, Journal of cryptology, vol. 26 (4), pp. 559-637, 2013.##[9] J. Hong and B.I. Kim, &#34;Performance comparison of cryptanalytic time memory data tradeoff methods&#34;, Bull. Korean Math. Soc., vol. 53(5), pp. 1439-1446, 2016.##[10] V. Kolchin, &#34;Random mapp-ings&#34;, Translations series in mathematics and engineering, Optimization Software, Inc., Publications Division, 1986.##[11] K. Kusuda, and T. Matsumoto, &#34;Optimization of time-memory trade-off cryptanalysis and is application to DES&#34;, FEAL-32, and Skipjack, E-79A, pp. 35–48, 1996.##[12] G. W. Lee, and J. Hong, &#34;Comparison of perfect table cryptanalytic tradeoff algorithms&#34;, Designs, Codes and Cryptography, pp. 473-523, 2016.##[13] R.C. Phan, &#34;Mini advanced encryption standard (mini-AES): a testbed for cryptanalysis students&#34;, Cryptologia, vol. 26(4), pp. 283-306, 2002.##[14] Ph. Oechslin, &#34;Making a faster cryptanaly-tic time-memory trade-off&#34;, Annual International Cryptology Conference, Springer Berlin Heidelberg, 2003.## ##</REF>
			</REFRENCE>
		</REFRENCES>

	</ARTICLE>


	<ARTICLE> 
		<TitleF>توسعه سامانه مکاترونیکی بلادرنگ سنجش استرس، مبتنی بر سیگنال‌های حیاتی</TitleF>
		<TitleE>Development of a Mechatronics System to Real-Time Stress Detection Based on Physiological Signals</TitleE>
		<TitleLang_ID>1</TitleLang_ID>
		<ABSTRACTS>
			<ABSTRACT>
			<Language_ID>1</Language_ID>
			<CONTENT>کمتر کسی در دنیای پرتلاطم و پرتنش امروز، با واژه استرس بیگانه است؛ به&#8206;طوری&#8206;که در برخی مواقع، استرس تبدیل به بخشی از زندگی انسان شده&#8204;است. استرسِ بیش از حد، باعث بروز مشکلاتی می&#8204;شود که علاوه&#173;بر اثرات روانی، پیامدهای جسمی بی&#8204;شماری از جمله سکته&#8204;های مغزی، قلبی، فشارخون و غیره را دارد و هیچ عضو یا ارگانی از بدن انسان از تأثیرات آن در امان نیست. هدف این پژوهش، طرّاحی و ساخت دستگاهی است که با استفاده از سیگنال&#8206;های هدایت الکتریکی پوست (GSR) و فتوپلتیسموگرافی (PPG) بتواند میزان استرس فرد را به&#8204;صورت شاخص پیوسته بیان کند. سخت&#8206;افزار این دستگاه مبتنی بر پردازنده ARM و رابط کاربری آن با زبان C++ برنامه&#8204;نویسی شده&#8204;است. به&#8204;منظور سنجش میزان استرس، الگو&#8206;سازی با استفاده از شبکه عصبی مصنوعی MLP و شبکه فازی-عصبی تطبیقی (ANFIS) انجام، که در بهترین حالت در الگو&#8206;سازی با ANFIS، دقت %91/92، و میانگین خطای 007/0 حاصل شده&#8204;است. 
&#160;</CONTENT>
			</ABSTRACT>
			<ABSTRACT>
			<Language_ID>2</Language_ID>
			<CONTENT>Stress has affected human&#8217;s lives in many areas, today. Stress can adversely affect human&#8217;s health to such a degree as to either cause death or indicate a major contributor to death. Therefore, in recent years, some researchers have focused to developing systems to detect stress and then presenting viable solutions to manage this issue.
Generally, stress can be identified through three different methods including (1) Psychological Evaluation, (2) Behavioral Responses and finally (3) Physiological Signals. Physiological signals are internal signs of functioning the body, and therefore nowadays are commonly used in various medical and non-medical applications. Since these signals are correlated with the stress, they have been commonly used in detection of the stress in humans. Photoplethysmography (PPG) and Galvanic Skin Response (GSR) are two of the most common signals which have been widely used in many stress related studies. PPG is a noninvasive method to measure the blood volume changes in blood vessels and GSR refers to changes in sweat gland activity that are reflective of the intensity of human emotional state.
Design and fabrication of a real-time handheld system in order to detect and display the stress level is the main aim of this paper. The fabricated stress monitoring device is completely compatible with both wired and wireless sensor devices. The GSR and PPG signals are used in the developed system. The mentioned signals are acquired using appropriate sensors and are displayed to the user after initial signal processing operation. The main processor of the developed system is ARM-cortex A8 and its graphical user interface (GUI) is based on C++ programming language. Artificial Neural Networks such as MLP and Adaptive Neuro-Fuzzy Inference System (ANFIS) are utilized to modeling and estimation of the stress index. The results show that ANFIS model have a good accuracy with a coefficient of determination values of 0.9291 and average relative error of 0.007.
&#160;</CONTENT>
			</ABSTRACT>
		</ABSTRACTS>

		<PAGES>
			<PAGE>
			<FPAGE>59</FPAGE>
			<TPAGE>74</TPAGE>
			</PAGE>
		</PAGES>

		<RECEIVE_DATE>
			2017/12/62018/04/42017/12/122017/12/72017/12/20
		</RECEIVE_DATE>

		<RECEIVE_DATE_FA>
			1396/9/29
		</RECEIVE_DATE_FA>

		<ACCEPT_DATE>
			2018/09/152018/12/172018/07/252018/07/252018/07/25
		</ACCEPT_DATE>

		<ACCEPT_DATE_FA>
			1397/5/3
		</ACCEPT_DATE_FA>

		<AUTHORS>
			<AUTHOR>
				<Name>علیرضا</Name>
				<MidName></MidName>
				<Family>گل‌گونه</Family>
				<NameE>Alireza</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Golgouneh</FamilyE>
				<Organizations>
				<Organization>آزمایشگاه ربات‌های خدمت‌رسان پیشرفته، دانشکده علوم و فنون نوین، دانشگاه تهران</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>golgouneh@ut.ac.ir</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>بهرام</Name>
				<MidName></MidName>
				<Family>تارویردی‌زاده</Family>
				<NameE>Bahram</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Tarvirdizadeh</FamilyE>
				<Organizations>
				<Organization>آزمایشگاه ربات‌های خدمت‌رسان پیشرفته، دانشکده علوم و فنون نوین، دانشگاه تهران</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>bahram@ut.ac.ir</Email>
				</EMAILS>
			</AUTHOR>
		</AUTHORS>


		<KEYWORDS>
			<KEYWORD>
				<KeyText>Stress</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Physiological signals</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>GSR</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>PPG</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Artificial Neural Networks</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>ANFIS</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>سیگنال‌های حیاتی</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>فتوپلتیسموگرافی</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>هدایت الکتریکی پوست</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>شبکه‌ عصبی مصنوعی</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>شبکه فازی-عصبی تطبیقی</KeyText>
			</KEYWORD>
		</KEYWORDS>

		<REFRENCES>
			<REFRENCE>
				<REF>[1] J. Cacioppo, L. G. Tassinary, and G. G. Berntson, The Handbook of Psychophysiology, vol. 44., Cambridge University Press, 2007.##[2] H. Kurniawan, A. V Maslov, and M. Pechenizkiy, &#34;Stress detection from speech and Galvanic Skin Response signals,&#34; Proceedings of the 26th IEEE International Symposium on Computer-Based Medical Systems. pp. 209–214, 2013.##[3] A. Kaklauskas et al., &#34;Web-based biometric computer mouse advisory system to analyze a user's emotions and work productivity,&#34; Eng. Appl. Artif. Intell., vol. 24, no. 6, pp. 928–945, Sep. 2011.##[4] &#34;Physiology,&#34; 2015. [Online]. Available: http://www.oxforddictionaries.com/definition/english/physiology.##[5] E. Risk and O. Report, OSH in figures: stress at work — facts and figures. Luxembourg,: Euro-pean Agency for Safety and Health at Work, 2009.z##[6] M. Bickford, &#34;Stress in the workplace: A general overview of the causes, the effects, and the solutions,&#34; Canadian Mental Health Association Newfoundland and Labrador Division, pp. 1–3, 2005.##[7] W. Liao, W. Zhang, Z. Zhu, and Q. Ji, &#34;A real-time human stress monitoring system using dynamic bayesian network,&#34; IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops. p. 70, 2005.##[8] D. Carneiro, J. C. Castillo, P. Novais, A. Fernández-Caballero, and J. Neves, &#34;Multimodal behavioral analysis for non-invasive stress detection,&#34; Expert Systems with Applications, vol. 39, no. 18, pp. 13376–13389, 2012.##[9] T. Hayashi, Y. Mizuno-Matsumoto, E. Okamoto, M. Kato, and T. Murata, &#34;An fMRI study of brain processing related to stress states,&#34; World Automation Congress (WAC), pp. 1–6, 2012##[10] H. Lu et al., &#34;Stresssense: Detecting stress in unconstrained acoustic environments using smartphones,&#34; Proceedings of the 2012 ACM Conference on Ubiquitous Computing, pp. 351-360. ACM, 2012.##[11] A. Muaremi, B. Arnrich, and G. Tröster, &#34;Towards Measuring Stress with Smartphones and Wearable Devices During Workday and Sleep,&#34; Bionanoscience, vol. 3, no. 2, pp. 172–183, 2013.##[12] C. Epp, M. Lippold, and R. L. Mandryk, &#34;Identifying emotional states using keystroke dynamics,&#34; in Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. 715–724, 2011.##[13] D. F. Dinges et al., &#34;Optical computer recognition of facial expressions associated with stress induced by performance demands.,&#34; Aviat. Space. Environ. Med., vol. 76, no. 6 Suppl, pp. B172-82, 2005.##[14] A. Alberdi, A. Aztiria, and A. Basarab, &#34;Towards an automatic early stress recognition system for office environments based on multimodal measurements: A review,&#34; J. Biomed. Inform., vol. 59, pp. 49–75, 2016.##[15] P. Zimmermann, S. Guttormsen, B. Danuser, and P. Gomez, &#34;Affective computing—A rationale for measuring mood with mouse and keyboard,&#34; Int. J. Occup. Saf. Ergon., vol. 9, no. 4, pp. 539–551, 2003.##[16] M. Garbarino, M. Lai, D. Bender, R. W. Picard, and S. Tognetti, &#34;Empatica E3—A wearable wireless multi-sensor device for real-time computerized biofeedback and data acquisition,&#34; in Wireless Mobile Communication and Healthcare (Mobihealth), 2014 EAI 4th International Conference on, pp. 39–42, 2014,.##[17] A. Golgouneh, A. Bamshad, B. Tarvirdizadeh, and F. Tajdari, &#34;Design of a new, light and portable mechanism for knee CPM machine with a user-friendly interface,&#34; In Artificial Intelligence and Robotics (IRANOPEN), pp. 103-108. IEEE, 2016##[18] B. Cinaz, B. Arnrich, R. La Marca, and G. Tröster, &#34;Monitoring of mental workload levels during an everyday life office-work scenario,&#34; Pers. ubiquitous Comput., vol. 17, no. 2, pp. 229–239, 2013.##[19] R.A. Shirvan, M.A. Khalilzadeh, S.E. Tahami, and V. Saadatian, &#34;Comparision of linear and nonlinear feaaturs of heart rate variability signal to quantification of stress level using genetic algorithem and neural network,&#34; Signal and Data Processing, vol. 5, no. 2, p.p. 29-40, 2009.##[20] C. Maaoui, A. Pruski, and F. Abdat, &#34;Emotion recognition for human-machine communi-cation,&#34; in Intelligent Robots and Systems, 2008. IROS 2008. IEEE/RSJ Inter-national Conference on, pp. 1210–1215, 2008.##[21] M. T. Quazi, S. C. Mukhopadhyay, N. K. Suryadevara, and Y. M. Huang, &#34;Towards the smart sensors based human emotion recog-nition,&#34; in Instrumentation and Measurement Technology Conference (I2MTC), 2012 IEEE International, pp. 2365–2370, 2012.##[22] K. Palanisamy, M. Murugappan, and S. Yaacob, &#34;Multiple physiological signal-based human stress identification using non-linear classifiers,&#34; Elektron. ir Elektrotechnika, vol. 19, no. 7, pp. 80–85, 2013.##[23] J. Wijsman, B. Grundlehner, J. Penders, and H. Hermens, &#34;Trapezius muscle EMG as predictor of mental stress,&#34; in Wireless Health 2010, pp. 155–163, 2010.##[24] S.-H. Seo, J.-T. Lee, and M. Crisan, &#34;Stress and EEG. Convergence and hybrid information technologies,&#34; InTech. Available from http// www. intechopen. com/ books/ Converg. Stress., 2010.##[25] Y. Shi, M. Nguyen, P. Blitz, and B. French, &#34;Personalized stress detection from physiological measurements,&#34; Int. Symp. Qual. Life Technol., no. September 2015, pp. 28–29, 2010.##[26] C. Z. Wei, &#34;Stress emotion recognition based on RSP and EMG signals,&#34; in Advanced Materials Research, 2013, vol. 709, pp. 827–831.##[27] J. Zhai and A. Barreto, &#34;Stress detection in computer users based on digital signal processing of noninvasive physiological variables,&#34; in Engineering in Medicine and Biology Society, 2006. EMBS'06. 28th Annual International Conference of the IEEE, pp. 1355–1358, 2006.##[28] V. Jeyhani, S. Mahdiani, M. Peltokangas, and A. Vehkaoja, &#34;Comparison of HRV parameters derived from photoplethysmography and electrocardiography signals,&#34; in 2015 37th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC), 2015, pp. 5952–5955.##[29] J. Peuscher, &#34;Galvanic skin response (GSR),&#34; 2In: TMSi. 2012.##[30] K. Peternel, M. Pogačnik, R. Tavčar, and A. Kos, &#34;A presence-based context-aware chronic stress recognition system,&#34; Sensors, vol. 12, no. 11, pp. 15888–15906, 2012.##[31] K. Asai, &#34;The Role of Head-Up Display in Computer-Assisted Instruction,&#34; arXiv Prepr. arXiv1001.0420, 2010.##[32] J. A. Healey and R. W. Picard, &#34;Detecting stress during real-world driving tasks using physiological sensors,&#34; Intell. Transp. Syst. IEEE Trans., vol. 6, no. 2, pp. 156–166, 2005.##[33] J. Hernandez, P. Paredes, A. Roseway, and M. Czerwinski, &#34;Under pressure: sensing stress of computer users,&#34; in Proceedings of the SIGCHI conference on Human factors in computing systems, pp. 51–60, 2014.##[34] F.-T. Sun, C. Kuo, H.-T. Cheng, S. Buthpitiya, P. Collins, and M. Griss, &#34;Activity-aware mental stress detection using physiological sensors,&#34; in International Conference on Mobile Computing, Applications, and Services, 2010, pp. 211–230.##[35] C. Setz, B. Arnrich, J. Schumm, R. La Marca, G. Tröster, and U. Ehlert, &#34;Discriminating stress from cognitive load using a wearable EDA device,&#34; IEEE Trans. Inf. Technol. Biomed., vol. 14, no. 2, pp. 410–417, 2010.##[36] A. de Santos Sierra, C. S. Ávila, J. G. Casanova, and G. B. Del Pozo, &#34;A stress-detection system based on physiological signals and fuzzy logic,&#34; Ind. Electron. IEEE Trans., vol. 58, no. 10, pp. 4857–4865, 2011.##[37]. R.A. Shirvan, M.A. Khalilzadeh, &#34;Process and analysis of the photoplethysmography and heart rate variability signals to determine stress level,&#34; 16th Iranian Conference on Electrical Engineering, 2008.##[38]. A. Derakhshan, M.A. Khalilzadeh, M. Azarnoosh, A. Mohammadian, &#34;Evaluate the changes in stress level using facial thermal imaging,&#34; 16th Iranian conference on Biomedical Engineering, 2008.##[39] K. Frank, P. Robertson, M. Gross, and K. Wiesner, &#34;Sensor-based identification of human stress levels,&#34; in Pervasive Computing and Communications Workshops (PERCOM Wor-kshops), 2013 IEEE International Conference on, pp. 127–132, 2013.##[40] M. Morris and F. Guilak, &#34;Mobile heart health: project highlight,&#34; IEEE Pervasive Comput., vol. 8, no. 2, pp. 57–61, 2009.##[41] V. Alexandratos, M. Bulut, and R. Jasinschi, &#34;Mobile real-time arousal detection,&#34; in 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 4394–4398, 2014.##[42] &#34;Research Center for Development of Advanced Technologies.&#34; [Online]. Available: http://en.-rcdat.ir.##[43] J. A. Healey, &#34;Wearable and automotive systems for affect recognition from physiology.&#34; Massa-chusetts Institute of Technology, 2000.##[44] M. E. Dawson, A. M. Schell, and D. L. Filion, &#34;7 the electrodermal system,&#34; Handb. Psycho-physiol., vol. 159, 2007.##[45] M. Bolanos, H. Nazeran, and E. Haltiwanger, &#34;Comparison of heart rate variability signal features derived from electrocardiography and photoplethysmography in healthy individuals,&#34; in Engineering in Medicine and Biology Society, 2006. EMBS'06. 28th Annual International Conference of the IEEE, pp. 4289–4294, 2006.##[46] W.-H. Lin, D. Wu, C. Li, H. Zhang, and Y.-T. Zhang, &#34;Comparison of heart rate variability from PPG with that from ECG,&#34; in The International Conference on Health Informatics, pp. 213–215, 2014.##[47] J. Rand, A. Hoover, S. Fishel, J. Moss, J. Pappas, and E. Muth, &#34;Real-time correction of heart interbeat intervals,&#34; IEEE Trans. Biomed. Eng., vol. 54, no. 5, pp. 946–950, 2007.##[48] G. G. Berntson and J. R. Stowell, &#34;ECG artifacts and heart period variability: don't miss a beat!,&#34; Psychophysiology, vol. 35, no. 1, pp. 127–132, 1998.##[49] P. D. Welch, &#34;The use of fast Fourier transform for the estimation of power spectra: A method based on time averaging over short, modiﬁed periodograms,&#34; IEEE Trans. audio Elec-troacoust., vol. 15, no. 2, pp. 70–73, 1967.##[50] A. Golgouneh, &#34;Design and development of a portable system to continuous stress monitoring system using ARM processor,&#34; M.S. Thesis, University of Tehran, 2016.##[51] M. A. Hall, &#34;Correlation-based feature selection of discrete and numeric class machine learning,&#34; 2000.##[52] T. M. Geronimo, C. E. D. Cruz, E. C. Bianchi, F. de Souza Campos, and P. R. Aguiar, &#34;MLP and ANFIS Applied to the Prediction of Hole Diameters in the Drilling Process,&#34;. INTECH Open Access Publisher, 2013.##[53] P. Davis, &#34;Levenberg-marquart methods and nonlinear estimation,&#34; Siam News, vol. 26, no. 6, pp. 1–12, 1993.##[54] L. A. Zadeh, &#34;Fuzzy sets,&#34; Inf. Control, vol. 8, no. 3, pp. 338–353, 1965.##[55] J.-S. Jang, &#34;ANFIS: adaptive-network-based fuzzy inference system,&#34; IEEE Trans. Syst. Man. Cybern., vol. 23, no. 3, pp. 665–685, 1993.##[56] L.-X. Wang, &#34;A Course in Fuzzy Systems and Control, Prentice-Hall PTR,&#34; Englewood Cliffs, NJ, 1997.##[57] M. Saidi, H. Hassanpoor, and A. Azizi Lari, &#34;Proposed new sign al for real-time stress monitoring: Combination of physiological measures,&#34; AUT J. Electr. Eng., vol. 49, no. 1, pp. 11–18, 2017.##[1] J. Cacioppo, L. G. Tassinary, and G. G. Berntson, The Handbook of Psychophysiology, vol. 44., Cambridge University Press, 2007.##[2] H. Kurniawan, A. V Maslov, and M. Pechenizkiy, &#34;Stress detection from speech and Galvanic Skin Response signals,&#34; Proceedings of the 26th IEEE International Symposium on Computer-Based Medical Systems. pp. 209–214, 2013.##[3] A. Kaklauskas et al., &#34;Web-based biometric computer mouse advisory system to analyze a user's emotions and work productivity,&#34; Eng. Appl. Artif. Intell., vol. 24, no. 6, pp. 928–945, Sep. 2011.##[4] &#34;Physiology,&#34; 2015. [Online]. Available: http://www.oxforddictionaries.com/definition/english/physiology.##[5] E. Risk and O. Report, OSH in figures: stress at work — facts and figures. Luxembourg,: Euro-pean Agency for Safety and Health at Work, 2009.z##[6] M. Bickford, &#34;Stress in the workplace: A general overview of the causes, the effects, and the solutions,&#34; Canadian Mental Health Association Newfoundland and Labrador Division, pp. 1–3, 2005.##[7] W. Liao, W. Zhang, Z. Zhu, and Q. Ji, &#34;A real-time human stress monitoring system using dynamic bayesian network,&#34; IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops. p. 70, 2005.##[8] D. Carneiro, J. C. Castillo, P. Novais, A. Fernández-Caballero, and J. Neves, &#34;Multimodal behavioral analysis for non-invasive stress detection,&#34; Expert Systems with Applications, vol. 39, no. 18, pp. 13376–13389, 2012.##[9] T. Hayashi, Y. Mizuno-Matsumoto, E. Okamoto, M. Kato, and T. Murata, &#34;An fMRI study of brain processing related to stress states,&#34; World Automation Congress (WAC), pp. 1–6, 2012##[10] H. Lu et al., &#34;Stresssense: Detecting stress in unconstrained acoustic environments using smartphones,&#34; Proceedings of the 2012 ACM Conference on Ubiquitous Computing, pp. 351-360. ACM, 2012.##[11] A. Muaremi, B. Arnrich, and G. Tröster, &#34;Towards Measuring Stress with Smartphones and Wearable Devices During Workday and Sleep,&#34; Bionanoscience, vol. 3, no. 2, pp. 172–183, 2013.##[12] C. Epp, M. Lippold, and R. L. Mandryk, &#34;Identifying emotional states using keystroke dynamics,&#34; in Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. 715–724, 2011.##[13] D. F. Dinges et al., &#34;Optical computer recognition of facial expressions associated with stress induced by performance demands.,&#34; Aviat. Space. Environ. Med., vol. 76, no. 6 Suppl, pp. B172-82, 2005.##[14] A. Alberdi, A. Aztiria, and A. Basarab, &#34;Towards an automatic early stress recognition system for office environments based on multimodal measurements: A review,&#34; J. Biomed. Inform., vol. 59, pp. 49–75, 2016.##[15] P. Zimmermann, S. Guttormsen, B. Danuser, and P. Gomez, &#34;Affective computing—A rationale for measuring mood with mouse and keyboard,&#34; Int. J. Occup. Saf. Ergon., vol. 9, no. 4, pp. 539–551, 2003.##[16] M. Garbarino, M. Lai, D. Bender, R. W. Picard, and S. Tognetti, &#34;Empatica E3—A wearable wireless multi-sensor device for real-time computerized biofeedback and data acquisition,&#34; in Wireless Mobile Communication and Healthcare (Mobihealth), 2014 EAI 4th International Conference on, pp. 39–42, 2014,.##[17] A. Golgouneh, A. Bamshad, B. Tarvirdizadeh, and F. Tajdari, &#34;Design of a new, light and portable mechanism for knee CPM machine with a user-friendly interface,&#34; In Artificial Intelligence and Robotics (IRANOPEN), pp. 103-108. IEEE, 2016##[18] B. Cinaz, B. Arnrich, R. La Marca, and G. Tröster, &#34;Monitoring of mental workload levels during an everyday life office-work scenario,&#34; Pers. ubiquitous Comput., vol. 17, no. 2, pp. 229–239, 2013.##[19] ر. عارفی شیروانی، م. خلیل‌زاده و و. سعادتیان، &#34;مقایسه تحلیل خطی و غیر‌خطی سیگنال تغییرات نرخ ضربان قلب به‌منظور کمی‌سازی سطح استرس با استفاده از الگوریتم تکاملی و شبکه عصبی،&#34; پردازش علائم و داده، جلد 5، شماره 2، شماره صفحات 29-40، سال 87.##[19] R.A. Shirvan, M.A. Khalilzadeh, S.E. Tahami, and V. Saadatian, &#34;Comparision of linear and nonlinear feaaturs of heart rate variability signal to quantification of stress level using genetic algorithem and neural network,&#34; Signal and Data Processing, vol. 5, no. 2, p.p. 29-40, 2009.##[20] C. Maaoui, A. Pruski, and F. Abdat, &#34;Emotion recognition for human-machine communi-cation,&#34; in Intelligent Robots and Systems, 2008. IROS 2008. IEEE/RSJ Inter-national Conference on, pp. 1210–1215, 2008.##[21] M. T. Quazi, S. C. Mukhopadhyay, N. K. Suryadevara, and Y. M. Huang, &#34;Towards the smart sensors based human emotion recog-nition,&#34; in Instrumentation and Measurement Technology Conference (I2MTC), 2012 IEEE International, pp. 2365–2370, 2012.##[22] K. Palanisamy, M. Murugappan, and S. Yaacob, &#34;Multiple physiological signal-based human stress identification using non-linear classifiers,&#34; Elektron. ir Elektrotechnika, vol. 19, no. 7, pp. 80–85, 2013.##[23] J. Wijsman, B. Grundlehner, J. Penders, and H. Hermens, &#34;Trapezius muscle EMG as predictor of mental stress,&#34; in Wireless Health 2010, pp. 155–163, 2010.##[24] S.-H. Seo, J.-T. Lee, and M. Crisan, &#34;Stress and EEG. Convergence and hybrid information technologies,&#34; InTech. Available from http// www. intechopen. com/ books/ Converg. Stress., 2010.##[25] Y. Shi, M. Nguyen, P. Blitz, and B. French, &#34;Personalized stress detection from physiological measurements,&#34; Int. Symp. Qual. Life Technol., no. September 2015, pp. 28–29, 2010.##[26] C. Z. Wei, &#34;Stress emotion recognition based on RSP and EMG signals,&#34; in Advanced Materials Research, 2013, vol. 709, pp. 827–831.##[27] J. Zhai and A. Barreto, &#34;Stress detection in computer users based on digital signal processing of noninvasive physiological variables,&#34; in Engineering in Medicine and Biology Society, 2006. EMBS'06. 28th Annual International Conference of the IEEE, pp. 1355–1358, 2006.##[28] V. Jeyhani, S. Mahdiani, M. Peltokangas, and A. Vehkaoja, &#34;Comparison of HRV parameters derived from photoplethysmography and electrocardiography signals,&#34; in 2015 37th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC), 2015, pp. 5952–5955.##[29] J. Peuscher, &#34;Galvanic skin response (GSR),&#34; 2In: TMSi. 2012.##[30] K. Peternel, M. Pogačnik, R. Tavčar, and A. Kos, &#34;A presence-based context-aware chronic stress recognition system,&#34; Sensors, vol. 12, no. 11, pp. 15888–15906, 2012.##[31] K. Asai, &#34;The Role of Head-Up Display in Computer-Assisted Instruction,&#34; arXiv Prepr. arXiv1001.0420, 2010.##[32] J. A. Healey and R. W. Picard, &#34;Detecting stress during real-world driving tasks using physiological sensors,&#34; Intell. Transp. Syst. IEEE Trans., vol. 6, no. 2, pp. 156–166, 2005.##[33] J. Hernandez, P. Paredes, A. Roseway, and M. Czerwinski, &#34;Under pressure: sensing stress of computer users,&#34; in Proceedings of the SIGCHI conference on Human factors in computing systems, pp. 51–60, 2014.##[34] F.-T. Sun, C. Kuo, H.-T. Cheng, S. Buthpitiya, P. Collins, and M. Griss, &#34;Activity-aware mental stress detection using physiological sensors,&#34; in International Conference on Mobile Computing, Applications, and Services, 2010, pp. 211–230.##[35] C. Setz, B. Arnrich, J. Schumm, R. La Marca, G. Tröster, and U. Ehlert, &#34;Discriminating stress from cognitive load using a wearable EDA device,&#34; IEEE Trans. Inf. Technol. Biomed., vol. 14, no. 2, pp. 410–417, 2010.##[36] A. de Santos Sierra, C. S. Ávila, J. G. Casanova, and G. B. Del Pozo, &#34;A stress-detection system based on physiological signals and fuzzy logic,&#34; Ind. Electron. IEEE Trans., vol. 58, no. 10, pp. 4857–4865, 2011.##[37] ر. عارفی شیروانی، م. خلیل‌زاده، &#34;پردازش و تحلیل سیگنال فتوپلتیسموگراف و تغییرات نرخ ضربان قلب به‌منظور تعیین سطح استرس،&#34; شانزدهمین کنفرانس مهندسی برق، 1387.##[37]. R.A. Shirvan, M.A. Khalilzadeh, &#34;Process and analysis of the photoplethysmography and heart rate variability signals to determine stress level,&#34; 16th Iranian Conference on Electrical Engineering, 2008.##[38] ا. درخشان، م. خلیل‌زاده، م. آذرنوش، ا. محمدیان، &#34;ارزیابی تغییرات سطح استرس با استفاده از تصویربرداری حرارتی چهره،&#34; شانزدهمین کنفرانس مهندسی پزشکی ایران، 1387.##[38]. A. Derakhshan, M.A. Khalilzadeh, M. Azarnoosh, A. Mohammadian, &#34;Evaluate the changes in stress level using facial thermal imaging,&#34; 16th Iranian conference on Biomedical Engineering, 2008.##[39] K. Frank, P. Robertson, M. Gross, and K. Wiesner, &#34;Sensor-based identification of human stress levels,&#34; in Pervasive Computing and Communications Workshops (PERCOM Wor-kshops), 2013 IEEE International Conference on, pp. 127–132, 2013.##[40] M. Morris and F. Guilak, &#34;Mobile heart health: project highlight,&#34; IEEE Pervasive Comput., vol. 8, no. 2, pp. 57–61, 2009.##[41] V. Alexandratos, M. Bulut, and R. Jasinschi, &#34;Mobile real-time arousal detection,&#34; in 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 4394–4398, 2014.##[42] &#34;Research Center for Development of Advanced Technologies.&#34; [Online]. Available: http://en.-rcdat.ir.##[43] J. A. Healey, &#34;Wearable and automotive systems for affect recognition from physiology.&#34; Massa-chusetts Institute of Technology, 2000.##[44] M. E. Dawson, A. M. Schell, and D. L. Filion, &#34;7 the electrodermal system,&#34; Handb. Psycho-physiol., vol. 159, 2007.##[45] M. Bolanos, H. Nazeran, and E. Haltiwanger, &#34;Comparison of heart rate variability signal features derived from electrocardiography and photoplethysmography in healthy individuals,&#34; in Engineering in Medicine and Biology Society, 2006. EMBS'06. 28th Annual International Conference of the IEEE, pp. 4289–4294, 2006.##[46] W.-H. Lin, D. Wu, C. Li, H. Zhang, and Y.-T. Zhang, &#34;Comparison of heart rate variability from PPG with that from ECG,&#34; in The International Conference on Health Informatics, pp. 213–215, 2014.##[47] J. Rand, A. Hoover, S. Fishel, J. Moss, J. Pappas, and E. Muth, &#34;Real-time correction of heart interbeat intervals,&#34; IEEE Trans. Biomed. Eng., vol. 54, no. 5, pp. 946–950, 2007.##[48] G. G. Berntson and J. R. Stowell, &#34;ECG artifacts and heart period variability: don't miss a beat!,&#34; Psychophysiology, vol. 35, no. 1, pp. 127–132, 1998.##[49] P. D. Welch, &#34;The use of fast Fourier transform for the estimation of power spectra: A method based on time averaging over short, modiﬁed periodograms,&#34; IEEE Trans. audio Elec-troacoust., vol. 15, no. 2, pp. 70–73, 1967.##[50] ع. گل گونه، &#34;طراحی و ساخت سیستم قابل حمل پایش پیوسته استرس، مبتنی بر پردازنده ARM ،&#34; پایان‌نامه کارشناسی ارشد، دانشگاه تهران، 1395.##[50] A. Golgouneh, &#34;Design and development of a portable system to continuous stress monitoring system using ARM processor,&#34; M.S. Thesis, University of Tehran, 2016.##[51] M. A. Hall, &#34;Correlation-based feature selection of discrete and numeric class machine learning,&#34; 2000.##[52] T. M. Geronimo, C. E. D. Cruz, E. C. Bianchi, F. de Souza Campos, and P. R. Aguiar, &#34;MLP and ANFIS Applied to the Prediction of Hole Diameters in the Drilling Process,&#34;. INTECH Open Access Publisher, 2013.##[53] P. Davis, &#34;Levenberg-marquart methods and nonlinear estimation,&#34; Siam News, vol. 26, no. 6, pp. 1–12, 1993.##[54] L. A. Zadeh, &#34;Fuzzy sets,&#34; Inf. Control, vol. 8, no. 3, pp. 338–353, 1965.##[55] J.-S. Jang, &#34;ANFIS: adaptive-network-based fuzzy inference system,&#34; IEEE Trans. Syst. Man. Cybern., vol. 23, no. 3, pp. 665–685, 1993.##[56] L.-X. Wang, &#34;A Course in Fuzzy Systems and Control, Prentice-Hall PTR,&#34; Englewood Cliffs, NJ, 1997.##[57] M. Saidi, H. Hassanpoor, and A. Azizi Lari, &#34;Proposed new sign al for real-time stress monitoring: Combination of physiological measures,&#34; AUT J. Electr. Eng., vol. 49, no. 1, pp. 11–18, 2017.## ##</REF>
			</REFRENCE>
		</REFRENCES>

	</ARTICLE>


	<ARTICLE> 
		<TitleF>استفاده از نمایش پراکنده و همکاری دوربین‌ها برای کاربردهای نظارت بینایی</TitleF>
		<TitleE>Application of Sparse Representation and Camera Collaboration in Visual Surveillance Systems</TitleE>
		<TitleLang_ID>1</TitleLang_ID>
		<ABSTRACTS>
			<ABSTRACT>
			<Language_ID>1</Language_ID>
			<CONTENT>مسأله آشکارسازی رفتارهای غیرمعمول براساس ویدئو، در&#8204;&#8204;حقیقت شناسایی الگوها در داده&#8204;هایی است که با رفتارهای مورد انتظار مطابقت ندارند. درهمین&#8204;اواخر برای خوشه&#173;بندی رفتارها و آشکارسازی رفتارهای غیرمعمول، از روش&#8204;های بازسازی پراکنده استفاده می&#8204;شود. در این مقاله از نمایش پراکنده ویژگی&#8204;ها و همکاری دوربین&#8204;ها، برای شناسایی رفتارها و آشکارسازی رفتارهای غیرمعمول استفاده می&#8204;شود. ابتدا برای هر محل در فریم تصویر، یک ویژگی که دارای استقلال هندسی است، استخراج می&#8204;شود؛ سپس برای یک دوربین، ماتریس دیکشنری A محاسبه و به&#8204;عنوان یک مجموعه از مدل رفتاری در نظر گرفته می&#8204;شود. حال، تحت عنوان مسأله همکاری دوربین&#8204;ها، ماتریس دیکشنری یادگرفته&#8204;شده به دوربین دیگر منتقل می&#8204;شود و در دوربین جدید برای آشکارسازی غیرمعمول&#8204;ها مورد استفاده قرار می&#8204;گیرد. برای یادگیری ماتریس دیکشنری، یک روش سلسله&#8204;مراتبی با استفاده از خوشه&#173;بندی طیفی پیشنهاد و یک معیار اندازه&#8204;گیری با استفاده از نمایش پراکنده برای آشکارسازی رفتارهای غیرمعمول ارائه می&#8204;شود. نتایج آزمایشی، مؤثر&#8204;بودن ره&#8204;یافت پیشنهادی در استفاده از همکاری دوربین&#173;ها برای آشکارسازی رفتارهای غیرمعمول را نشان&#160; می&#173;دهد.</CONTENT>
			</ABSTRACT>
			<ABSTRACT>
			<Language_ID>2</Language_ID>
			<CONTENT>With the growth of demand for security and safety, video-based surveillance systems have been employed in a large number of rural and urban areas. The problem of such systems lies in the detection of patterns of behaviors in a dataset that do not conform to normal behaviors. Recently, for behavior classification and abnormal behavior detection, the sparse representation approach is used. In this paper, feature sparse representation in a multi-view network is used for the purpose of behavior classification and abnormal behavior detection. To serve this purpose, a geometrically independent feature is first extracted for each location in the image. Then, for each camera view, the matrix for the dictionary A is calculated, which is considered as a set of behavior models. In order to share information and make use of the trained models, the learned dictionary matrix from the experienced camera is transferred to inexperienced cameras. The transferred matrix in the new camera is subsequently used to detect abnormal behaviors. A hierarchical method on the basis of spectral clustering is proposed for learning the dictionary matrix. After sparse feature representation, a measurement criterion, which makes use of the representation, is presented for abnormal behavior detection. The merit of the method proposed in this paper is that the method does not require correspondence across cameras. The direct use of the dictionary matrix and transfer of the learned dictionary matrix from the experienced camera to inexperienced ones, are tested on several real-world video datasets. In both cases, desirable improvements in abnormal behavior detection are obtained. The experimental results point to the efficacy of the proposed method for camera cooperation in order to detect abnormal behaviors.
&#160;</CONTENT>
			</ABSTRACT>
		</ABSTRACTS>

		<PAGES>
			<PAGE>
			<FPAGE>75</FPAGE>
			<TPAGE>88</TPAGE>
			</PAGE>
		</PAGES>

		<RECEIVE_DATE>
			2017/12/62018/04/42017/12/122017/12/72017/12/202017/09/28
		</RECEIVE_DATE>

		<RECEIVE_DATE_FA>
			1396/7/6
		</RECEIVE_DATE_FA>

		<ACCEPT_DATE>
			2018/09/152018/12/172018/07/252018/07/252018/07/252018/08/6
		</ACCEPT_DATE>

		<ACCEPT_DATE_FA>
			1397/5/15
		</ACCEPT_DATE_FA>

		<AUTHORS>
			<AUTHOR>
				<Name>اصغر</Name>
				<MidName></MidName>
				<Family>فیضی</Family>
				<NameE>Asghar</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Feizi</FamilyE>
				<Organizations>
				<Organization>دانشگاه دامغان</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>a.feizi@du.ac.ir</Email>
				</EMAILS>
			</AUTHOR>
		</AUTHORS>


		<KEYWORDS>
			<KEYWORD>
				<KeyText>Visual Surveillance</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Sparse Representation</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Behavior Recognition</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Abnormal Behavior</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Camera Collaboration</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>نظارت بینایی</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>نمایش پراکنده</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>شناسایی رفتارها</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>رفتارهای غیرمعمول</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>اشتراک اطلاعات چند دوربین</KeyText>
			</KEYWORD>
		</KEYWORDS>

		<REFRENCES>
			<REFRENCE>
				<REF>[1] C. Chi-Hung, H. Jun-Wei, T. Luo-Wei, C. Sin-Yu, and F. Kuo-Chin, &#34;Carried object detection using ratio histogram and its application to suspicious event analysis,&#34; IEEE Trans. Circuits Syst. Video Technol., vol. 19, no. 6, pp. 911–916, 2009.##[2] T. Xiang and S. Gong, &#34;Video behaviour profiling for anomaly detection,&#34; IEEE Trans. Pattern Anal. Mach. Intell., vol. 30, no. 5, pp. 893–908, 2008.##[3] D. Xu, R. Song, X. Wu, N. Li, W. Feng, and H. Qian, &#34;Video anomaly detection based on a hierarchical activity discovery within spatio-temporal contexts,&#34; Neurocomputing, vol. 143, pp. 144–152, 2014.##[4] M. Sabokrou, M. Fayyaz, M. Fathy, Z. Moayed, and R. Klette, &#34;Deep-anomaly: Fully convolutional neural network for fast anomaly detection in crowded scenes,&#34; Computer Vision and Image Understanding, no. February, Elsevier, pp. 0–1, 2018.##[5] Y. Yuan, D. Wang, and Q. Wang, &#34;Anomaly Dete-ction in Traffic Scenes via Spatial-Aware Motion Reconstruction,&#34; IEEE Trans. Intell. Transp. Syst., vol. 18, no. 5, pp. 1198–1209, 2017.##[6] X. Gu, J. Cui, and Q. Zhu, &#34;Abnormal crowd behavior detection by using the particle entropy,&#34; Optik (Stuttg)., vol. 125, no. 14, pp. 3428–3433, 2014.##[7] Y. Zhang, H. Lu, L. Zhang, and X. Ruan, &#34;Combin-ing motion and appearance cues for anomaly detection,&#34; Pattern Recognit., vol. 51, pp. 443–452, 2016.##[8] B. Antić and B. Ommer, &#34;Video parsing for ab-normality detection,&#34; Proc. IEEE Int. Conf. Com-put. Vis., pp. 2415–2422, 2011.##[9] S. Zhu, J. Hu, and Z. Shi, &#34;Local abnormal behav-ior detection based on optical flow and spatio-temporal gradient,&#34; Multimed. Tools Appl., vol. 75, no. 15, pp. 9445–9459, 2016.##[10] J. Kim and K. Grauman, &#34;Observe locally, infer globally: a space–time mrf for detecting ab-normal activities with incremental updates,&#34; in Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, 2009, no. June.##[11] A. L. Hou, J. L. Guo, C. J. Wang, L. Wu, and F. Li, &#34;Abnormal behavior recognition based on trajectory feature and regional optical flow,&#34; in Proceedings - 2013 7th International Conference on Image and Graphics, ICIG 2013, 2013, pp. 643–649.##[12] V. Saligrama, J. Konrad, and P. M. Jodoin, &#34;Vi-deo anomaly identification,&#34; IEEE Signal Pro-cess. Mag., vol. 27, no. 5, pp. 18–33, 2010.##[13] J. A. Rodríguez-Serrano and S. Singh, &#34;Trajec-tory clustering in CCTV traffic videos using probability product kernels with hidden Markov models,&#34; Pattern Anal. Appl., vol. 15, no. 4, pp. 415–426, 2012.##[14] S. Amraee, A. Vafaei, K. Jamshidi, and P. Adibi, &#34;Anomaly detection and localization in crowded scenes using connected component analysis,&#34; 2017.##[15] X. Wang, X. Ma, and E. Grimson, &#34;Unsupervised Activity Perception in Crowded and Complicated Scenes Using Hierarchical Bayesian Mod-els.pdf,&#34; vol. 31, no. 3, pp. 1–35, 2007.##[16] S. Li, C. Liu, and Y. Yang, &#34;Anomaly Detection Based on Maximum a Posteriori,&#34; Pattern Reco-gnit. Lett., vol. 0, pp. 1–7, 2017.##[17] C. Simon, J. Meessen, and C. De Vleeschouwer, &#34;Visual event recognition using decision trees,&#34; Multimed. Tools Appl., vol. 50, no. 1, pp. 95–121, 2010.##[18] S. Amraee, A. Vafaei, K. Jamshidi, and P. Adibi, &#34;Abnormal event detection in crowded scenes us-ing one-class SVM,&#34; Signal, Image Video Pro-cess., 2018.##[19] B. D. Devarajan, Z. Cheng, and R. J. Radke, &#34;Camera Networks,&#34; vol. 96, no. 10, pp. 1625–1639, 2008.##[20] M. Piccardi, &#34;Background subtraction techn-i-ques: a review,&#34; Vision Res., pp. 3099–3104, 2004.##[21] H. Cheng, Sparse Representation , Modeling and Learning in Visual Recognition. .##[22] X. Mo, V. Monga, R. Bala, and Z. Fan, &#34;A joint sparsity model for video anomaly detection,&#34; Conf. Rec. - Asilomar Conf. Signals, Syst. Com-put., pp. 1969–1973, 2012.##[23] J. Wright, A. Y. Yang, A. Ganesh, S. S. Sastry, and Y. Ma, &#34;Robust face recognition via sparse representation,&#34; IEEE Trans. Pattern Anal. Mach. Intell., vol. 31, no. 2, pp. 210–227, 2009.##[24] A. Wagner, J. Wright, A. Ganesh, Z. Zhou, H. Mobahi, and Y. Ma, &#34;Toward a practical face re-cognition system: Robust alignment and illu-mination by sparse representation,&#34; IEEE Trans. Pa-ttern Anal. Mach. Intell., vol. 34, no. 2, pp. 372–386, 2012.##[25] M. Planck and U. Von Luxburg, &#34;A Tutorial on Spectral Clustering A Tutorial on Spectral Clus-tering,&#34; Stat. Comput., vol. 17, no. March, pp. 395–416, 2006.##[26] L. Zelnik and P. Perona, &#34;Self-Yuning Spectral Clustering,&#34; vol. 17, no. 4.##[27] R. Mehran, a. Oyama, and M. Shah, &#34;Abnormal crowd behavior detection using social force model,&#34; 2009 IEEE Conf. Comput. Vis. Pattern Recognit., no. 2, pp. 935–942, 2009.##[28] &#34;PETS2006 dataset. Available: http://www.cv-g.rdg.ac.uk/PETS2006/data.html.&#34;##[1] C. Chi-Hung, H. Jun-Wei, T. Luo-Wei, C. Sin-Yu, and F. Kuo-Chin, &#34;Carried object detection using ratio histogram and its application to suspicious event analysis,&#34; IEEE Trans. Circuits Syst. Video Technol., vol. 19, no. 6, pp. 911–916, 2009.##[2] T. Xiang and S. Gong, &#34;Video behaviour profiling for anomaly detection,&#34; IEEE Trans. Pattern Anal. Mach. Intell., vol. 30, no. 5, pp. 893–908, 2008.##[3] D. Xu, R. Song, X. Wu, N. Li, W. Feng, and H. Qian, &#34;Video anomaly detection based on a hierarchical activity discovery within spatio-temporal contexts,&#34; Neurocomputing, vol. 143, pp. 144–152, 2014.##[4] M. Sabokrou, M. Fayyaz, M. Fathy, Z. Moayed, and R. Klette, &#34;Deep-anomaly: Fully convolutional neural network for fast anomaly detection in crowded scenes,&#34; Computer Vision and Image Understanding, no. February, Elsevier, pp. 0–1, 2018.##[5] Y. Yuan, D. Wang, and Q. Wang, &#34;Anomaly Dete-ction in Traffic Scenes via Spatial-Aware Motion Reconstruction,&#34; IEEE Trans. Intell. Transp. Syst., vol. 18, no. 5, pp. 1198–1209, 2017.##[6] X. Gu, J. Cui, and Q. Zhu, &#34;Abnormal crowd behavior detection by using the particle entropy,&#34; Optik (Stuttg)., vol. 125, no. 14, pp. 3428–3433, 2014.##[7] Y. Zhang, H. Lu, L. Zhang, and X. Ruan, &#34;Combin-ing motion and appearance cues for anomaly detection,&#34; Pattern Recognit., vol. 51, pp. 443–452, 2016.##[8] B. Antić and B. Ommer, &#34;Video parsing for ab-normality detection,&#34; Proc. IEEE Int. Conf. Com-put. Vis., pp. 2415–2422, 2011.##[9] S. Zhu, J. Hu, and Z. Shi, &#34;Local abnormal behav-ior detection based on optical flow and spatio-temporal gradient,&#34; Multimed. Tools Appl., vol. 75, no. 15, pp. 9445–9459, 2016.##[10] J. Kim and K. Grauman, &#34;Observe locally, infer globally: a space–time mrf for detecting ab-normal activities with incremental updates,&#34; in Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, 2009, no. June.##[11] A. L. Hou, J. L. Guo, C. J. Wang, L. Wu, and F. Li, &#34;Abnormal behavior recognition based on trajectory feature and regional optical flow,&#34; in Proceedings - 2013 7th International Conference on Image and Graphics, ICIG 2013, 2013, pp. 643–649.##[12] V. Saligrama, J. Konrad, and P. M. Jodoin, &#34;Vi-deo anomaly identification,&#34; IEEE Signal Pro-cess. Mag., vol. 27, no. 5, pp. 18–33, 2010.##[13] J. A. Rodríguez-Serrano and S. Singh, &#34;Trajec-tory clustering in CCTV traffic videos using probability product kernels with hidden Markov models,&#34; Pattern Anal. Appl., vol. 15, no. 4, pp. 415–426, 2012.##[14] S. Amraee, A. Vafaei, K. Jamshidi, and P. Adibi, &#34;Anomaly detection and localization in crowded scenes using connected component analysis,&#34; 2017.##[15] X. Wang, X. Ma, and E. Grimson, &#34;Unsupervised Activity Perception in Crowded and Complicated Scenes Using Hierarchical Bayesian Mod-els.pdf,&#34; vol. 31, no. 3, pp. 1–35, 2007.##[16] S. Li, C. Liu, and Y. Yang, &#34;Anomaly Detection Based on Maximum a Posteriori,&#34; Pattern Reco-gnit. Lett., vol. 0, pp. 1–7, 2017.##[17] C. Simon, J. Meessen, and C. De Vleeschouwer, &#34;Visual event recognition using decision trees,&#34; Multimed. Tools Appl., vol. 50, no. 1, pp. 95–121, 2010.##[18] S. Amraee, A. Vafaei, K. Jamshidi, and P. Adibi, &#34;Abnormal event detection in crowded scenes us-ing one-class SVM,&#34; Signal, Image Video Pro-cess., 2018.##[19] B. D. Devarajan, Z. Cheng, and R. J. Radke, &#34;Camera Networks,&#34; vol. 96, no. 10, pp. 1625–1639, 2008.##[20] M. Piccardi, &#34;Background subtraction techn-i-ques: a review,&#34; Vision Res., pp. 3099–3104, 2004.##[21] H. Cheng, Sparse Representation , Modeling and Learning in Visual Recognition. .##[22] X. Mo, V. Monga, R. Bala, and Z. Fan, &#34;A joint sparsity model for video anomaly detection,&#34; Conf. Rec. - Asilomar Conf. Signals, Syst. Com-put., pp. 1969–1973, 2012.##[23] J. Wright, A. Y. Yang, A. Ganesh, S. S. Sastry, and Y. Ma, &#34;Robust face recognition via sparse representation,&#34; IEEE Trans. Pattern Anal. Mach. Intell., vol. 31, no. 2, pp. 210–227, 2009.##[24] A. Wagner, J. Wright, A. Ganesh, Z. Zhou, H. Mobahi, and Y. Ma, &#34;Toward a practical face re-cognition system: Robust alignment and illu-mination by sparse representation,&#34; IEEE Trans. Pa-ttern Anal. Mach. Intell., vol. 34, no. 2, pp. 372–386, 2012.##[25] M. Planck and U. Von Luxburg, &#34;A Tutorial on Spectral Clustering A Tutorial on Spectral Clus-tering,&#34; Stat. Comput., vol. 17, no. March, pp. 395–416, 2006.##[26] L. Zelnik and P. Perona, &#34;Self-Yuning Spectral Clustering,&#34; vol. 17, no. 4.##[27] R. Mehran, a. Oyama, and M. Shah, &#34;Abnormal crowd behavior detection using social force model,&#34; 2009 IEEE Conf. Comput. Vis. Pattern Recognit., no. 2, pp. 935–942, 2009.##[28] &#34;PETS2006 dataset. Available: http://www.cv-g.rdg.ac.uk/PETS2006/data.html.&#34;## ##</REF>
			</REFRENCE>
		</REFRENCES>

	</ARTICLE>


	<ARTICLE> 
		<TitleF>یافتن الگوهای مکرّر در قرآن کریم به‌‌کمک روش‌‌های متن‌‌کاوی
</TitleF>
		<TitleE>Finding Frequent Patterns in Holy Quran UsingText Mining</TitleE>
		<TitleLang_ID>1</TitleLang_ID>
		<ABSTRACTS>
			<ABSTRACT>
			<Language_ID>1</Language_ID>
			<CONTENT>متن قرآن خصوصیات منحصر به فردی از نظر معنا، مفهوم و موضوع نسبت با سایر متون دارد. کشف الگوهای پنهان و ارزشمند از درون حجم وسیعی از داده&#8204;های خام، به&#8204;تازگی توجه بسیاری از پژوهش&#8204;گران را به خود جلب کرده است. متن&#8204;کاوی زمینه&#8204;ای برای کشف اطلاعات از متون است که ما را در نیل به این هدف می&#8204;تواند کمک کند. در سال&#8204;های اخیر متن&#8204;کاوی روی قرآن و کشف دانش نهفته از واژه&#8204;های آن، چندی است که مورد توجه بسیاری از متخصصان قرار گرفته است. در این مقاله با در&#8204;نظر&#8204;گرفتن 6348 آیه قرآن، هر آیه به&#8204;صورت یک سبد خرید در نظر گرفته شده و کلمات&#160; هر آیه به&#8204;عنوان اقلام هستند؛ سپس با استفاده از قوانین انجمنی، کلمات و آیات قرآن بررسی شده و&#160; از میان 54226 قانون انجمنی استخراج&#8204;شده از واژه&#8204;های قرآن که با استفاده از معیارهایی مانند ضریب اطمینان، ضریب پشتیبان، معیارLift &#160;و معیار Co-efficient ارزیابی شده&#8204;اند، ده قانون برتر هر معیار تحلیل و بررسی شده و بدین ترتیب الگوهای استخراج&#8204;شده از قوانین انجمنی، الگوهای پرتکرار یک&#8204;تایی، دوتایی و سه&#8204;تایی در قرآن به دست می&#8204;آید.</CONTENT>
			</ABSTRACT>
			<ABSTRACT>
			<Language_ID>2</Language_ID>
			<CONTENT>Quran&#8217;s Text differs from any other texts in terms of its exceptional concepts, ideas and subjects. To recognize the valuable implicit patterns through a vast amount of data has lately captured the attention of so many researchers. Text Mining provides the grounds to extract information from texts and it can help us reach our objective in this regard. In recent years, Text Mining on Quran and extracting implicit knowledge from Quranic words have been the object of researchers&#8217; focus. It is common that in Quranic experts&#8217; arguments, different sides of the discussion present different intellectual, logical and some non-integrated minor evidence in order to prove their own theories. More often than not, every side of these arguments disapproves of the other&#8217;s hypothesis and in the end it is impossible for them to reach a state of consensus on the matter, the reason is that, they do not have a common basis for their arguments and they do not make use of scientific, logical methods to strongly support their theories. Therefore, using modern technological trends regarding Quranic arguments could lead to resolving so many of current discrepancies, caused by human errors, which exist among Quranic researchers. It can help providing a common ground for their arguments in order to reach a comprehensive understanding.
The method used in this research implements frequent pattern mining algorithms, singular frequent patterns as well as dual and tripe frequent patterns in order to analyze Quranic text, in addition to this, Association rules have also been evaluated in the research.
Out of 54226 extracted association rules for Quranic words which have been evaluated by the use of criteria such as confidence coefficient, support coefficient, lift criteria as well as Co-efficient criteria. Top 10 rules for each criterion have been analyzed and reviewed throughout the project.</CONTENT>
			</ABSTRACT>
		</ABSTRACTS>

		<PAGES>
			<PAGE>
			<FPAGE>89</FPAGE>
			<TPAGE>100</TPAGE>
			</PAGE>
		</PAGES>

		<RECEIVE_DATE>
			2017/12/62018/04/42017/12/122017/12/72017/12/202017/09/282017/12/14
		</RECEIVE_DATE>

		<RECEIVE_DATE_FA>
			1396/9/23
		</RECEIVE_DATE_FA>

		<ACCEPT_DATE>
			2018/09/152018/12/172018/07/252018/07/252018/07/252018/08/62018/07/25
		</ACCEPT_DATE>

		<ACCEPT_DATE_FA>
			1397/5/3
		</ACCEPT_DATE_FA>

		<AUTHORS>
			<AUTHOR>
				<Name>اکرم</Name>
				<MidName></MidName>
				<Family>اصلانی</Family>
				<NameE>Akram</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Aslani</FamilyE>
				<Organizations>
				<Organization>دانشگاه پیام نور</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>pnuakaslani@yahoo.com</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>مهدی</Name>
				<MidName></MidName>
				<Family>اسماعیلی</Family>
				<NameE>Mahdi</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Esmaeili</FamilyE>
				<Organizations>
				<Organization>دانشگاه آزاد کاشان</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>msxp@yahoo.com</Email>
				</EMAILS>
			</AUTHOR>
		</AUTHORS>


		<KEYWORDS>
			<KEYWORD>
				<KeyText>Data Mining</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Text Mining</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Association rules</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Holy Quran</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Frequent patterns</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>داده‌کاوی</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>متن‌کاوی</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>قوانین انجمنی</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>قرآن کریم</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>الگوهای مکرّر</KeyText>
			</KEYWORD>
		</KEYWORDS>

		<REFRENCES>
			<REFRENCE>
				<REF>[1] M. Esmaieli, Concepts and techniques of data min-ing, Kashan;Azad University of Kashan,2013.##[2] R. N. Y. Radfar.R, Nezafti.N, Yoosefi Asli.S. Classification of Bank Internet Customers Using Data Mining Algorithms. IT management, pp71-90, 2014.##[3] A. M. Aghakardan, Keihani Nejad. Provides a mo-del for extracting information from textual texts ba-sed on e-learning, IT management,pp 47-54,2012.##[4] M.Karami, Journal of Health Management,2008.##[5] E. K. G. Estiri, Kahani, Ghaemi, Creating and publishing semantic web infrastructure for the Holy Quran, iranian association of information and communication technology, 2013.##[6] chue, s., puteri nor, e. (2014). frequent pattern ex-traction in the tafseer of al-quran. factually of com-puter sience and information technology.##[7] S. M. A. Salehi Shahroodi, Minaie, Ashrafi,The text explores the computerized subject of the Holy Quran to discover the semantic connections bet-ween the verses based on the interpretation of al-Mizan. The Quran recognizes, pp 117-152,2013.##[8] K.Kharazi, Discover the root relationships of Quranic words with the data mining approach. Tehran: Khaje Naseerdin Tousi University, 2011.##[9] chua, s., nor ellyza biniti nohuddin, p. (2014). Fre-quent pattern extraction in the tafseer of al-quran. department of computer science.##[10] alhawarat, m., hegazi, m., hilal, a. (2015). processing the text of the holy quran: a text mining study. international journal of advanced science and applications, 262-26##[11] ali, i. (2012). application of a mining algorithm to finding frequent patterns in a text corous: a case study of the arabic. international journal of soft-ware engineering and its applications, 127-134.##[12] Nasreen, S., Awais Azam, M., Shehzad, K., Naeem, U., Ali Ghazanfar, M. (2014). Frequent pattern mining algorithms for finding associated frequent patterns for data streams: a survey. emerging ubiquitous systems and pervasive net-works, 109-116##[13] H. Hojati, Research in the history of the Holy Qur'an, Teh-ran: Publishing House of Islamic Culture, 2006.##[14] F. Z. Fakhr Ahmad, Zolghadri Jahrom, An Effective Method for Exploring Over-the-Counter Items in Cart Basket Analysis. The International Scientific Engineering Department of Iran University of Science and Technology, pp 65-75, 2009.##[1] اسماعیلی، مهدی، مفاهیم و تکنیک‌های داده‌کاوی، کاشان، دانشگاه آزاد اسلامی واحد کاشان،1392.##[1] M. Esmaieli, Concepts and techniques of data min-ing, Kashan;Azad University of Kashan,2013.##[2] R. N. Y. Radfar.R, Nezafti.N, Yoosefi Asli.S. Classification of Bank Internet Customers Using Data Mining Algorithms. IT management, pp71-90, 2014.##[2] رادفر،رضا، نظافتی، نوید، یوسفی اصلی، سعید، "طبقه بندی مشتریان اینترنت بانک با کمک الگوریتم‌های داده کاوی"، نشریه علمی= پژوهشی مدیریت و فناوری اطلاعات، شماره 1، صفحات 90-71، 1393.##[3] آقاکاردان، احمد، کیهانی نژاد، مینا،" ارائه مدلی برای استخراج اطلاعات ازمستندات متنی مبتنی بر متن‌کاوی در حوزه یادگیری الکترونیکی"، نشریه علمی=پژوهشی مدیریت و فناوری اطلاعات و ارتباطات ایران، شماره‌های 11و12،صفحات 47-54، 1391.##[3] A. M. Aghakardan, Keihani Nejad. Provides a mo-del for extracting information from textual texts ba-sed on e-learning, IT management,pp 47-54,2012.##[4] کرمی، مهتاب،" کاربرد ابزارهای تحلیلگر داده کاوی و متن کاوی درچابکی سازمان های مراقبت بهداشتی و درمانی"، فصل‌نامه علمی پژوهشی مدیریت سلامت، شماره 10، 1386.##[4] M.Karami, Journal of Health Management,2008.##[5] استیری، احمد، کاهانی، محسن، قائمی، هادی، "ایجاد و انتشار زیر ساخت وب معنایی برای قرآن کریم"، iranian association of information and communication technology، 2013.##[5] E. K. G. Estiri, Kahani, Ghaemi, Creating and publishing semantic web infrastructure for the Holy Quran, iranian association of information and communication technology, 2013.##[6] chue, s., puteri nor, e. (2014). frequent pattern ex-traction in the tafseer of al-quran. factually of com-puter sience and information technology.##[7] صالحی شهرودی، محمدحسین، مینایی، بهروز، اشرفی، امیررضا، "متن‌کاوی موضوعی رایانه‌ای قرآن کریم برای کشف ارتباطات معنایی میان آیات برمبنای تفسیر المیزان " قرآن شناخت، شماره 2، 1392.##[7] S. M. A. Salehi Shahroodi, Minaie, Ashrafi,The text explores the computerized subject of the Holy Quran to discover the semantic connections bet-ween the verses based on the interpretation of al-Mizan. The Quran recognizes, pp 117-152,2013.##[8] خرازی، مریم، "کشف روابط ریشه واژه‌های قرآنی با رویکرد داده‌کاوی"، دانشگاه خواجه نصیر‌الدین طوسی، تهران،1393.##[8] K.Kharazi, Discover the root relationships of Quranic words with the data mining approach. Tehran: Khaje Naseerdin Tousi University, 2011.##[9] chua, s., nor ellyza biniti nohuddin, p. (2014). Fre-quent pattern extraction in the tafseer of al-quran. department of computer science.##[10] alhawarat, m., hegazi, m., hilal, a. (2015). processing the text of the holy quran: a text mining study. international journal of advanced science and applications, 262-26##[11] ali, i. (2012). application of a mining algorithm to finding frequent patterns in a text corous: a case study of the arabic. international journal of soft-ware engineering and its applications, 127-134.##[12] Nasreen, S., Awais Azam, M., Shehzad, K., Naeem, U., Ali Ghazanfar, M. (2014). Frequent pattern mining algorithms for finding associated frequent patterns for data streams: a survey. emerging ubiquitous systems and pervasive net-works, 109-116##[13] حجتی، سیدمحمدباقر، پژوهشی در تاریخ قرآن کریم، تهران،دفتر نشر فرهنگ اسلامی،1386.##[13] H. Hojati, Research in the history of the Holy Qur'an, Teh-ran: Publishing House of Islamic Culture, 2006.##[14] فخراحمد، سیدمحمد،صدرالدینی، محمدهادی، ذوالقدری جهرمی، منصور، "روشی کارا برای کاوش مجموعه اقلام پرتکرار در تحلیل داده‌های سبد خرید"، نشریه بین‌المللی علوم مهندسی دانشگاه علم وصنعت ایران، شماره 7،صفحه 74-65، 1387.##[14] F. Z. Fakhr Ahmad, Zolghadri Jahrom, An Effective Method for Exploring Over-the-Counter Items in Cart Basket Analysis. The International Scientific Engineering Department of Iran University of Science and Technology, pp 65-75, 2009.## ##</REF>
			</REFRENCE>
		</REFRENCES>

	</ARTICLE>


	<ARTICLE> 
		<TitleF>روشی جدید برای عضویت‌دهی به داده‌ها و شناسایی نوفه و داده‌های پرت با استفاده از ماشین بردار پشتیبان فازی</TitleF>
		<TitleE>A New Method to Determine Data Membership and Find Noise and Outlier Data Using Fuzzy Support
 Vector Machine</TitleE>
		<TitleLang_ID>1</TitleLang_ID>
		<ABSTRACTS>
			<ABSTRACT>
			<Language_ID>1</Language_ID>
			<CONTENT>در این مقاله روشی جدید را با استفاده از ماشین بردار پشتیبان فازی به منظور عضویت&#8206;دهی داده&#8204;های آموزشی، براساس فاصله از ابر صفحه جداکننده معرفی می&#8204;شود. در این روش، با استفاده از طبقه&#8204;بندی ماشین بردار پشتیبان و نیز عضویت نخستین داده&#8204;های آموزشی، یک تابع عضویت فازی به&#8204;کمک اعداد فازی مثلثی متقارن برای تمام فضا معرفی می&#8204;شود. مبتنی بر این روش، مقدار تابع عضویت فازی هر داده جدیدی که می&#8204;خواهد طبقه&#8204;بندی شود، به&#173;گونه&#8204;ای انتخاب می&#8204;شود که کمترین میزان اختلاف را با عضویت اولیه داده&#8204;های آموزشی و بیشترین میزان فازی&#173;سازی داشته باشد. نخست این مسأله به&#8204;صورت یک مسأله بهینه&#8204;سازی غیرخطی تعریف، سپس به&#8204;کمک روش نقاط بحرانی، الگوریتمی کارا معرفی می&#8204;شود و تابع عضویت نهایی داده&#8204;های آموزشی به&#8204;دست می&#173;آید؛ همچنین، در ادامه با مقایسه مقدار عضویت&#8204;های اولیه داده&#8204;های آموزشی با توزیع عضویت نهایی به&#8204;دست&#8204;آمده از روش پیشنهادی، میزان نوفه&#8204;ای&#8204;بودن داده آموزشی بررسی می&#8204;شود. در انتهای این مقاله نیز جهت فهم بهتر و نشان&#8204;دادن کارایی الگوریتم، آزمایش&#8204;هایی انجام و چگونگی رفتار الگوریتم پیشنهادی بر روی نمودار پیاده&#8204;سازی و با یک روش پایه مقایسه می&#8204;شود.
&#160;</CONTENT>
			</ABSTRACT>
			<ABSTRACT>
			<Language_ID>2</Language_ID>
			<CONTENT>Support Vector Machine (SVM) is one of the important classification techniques, has been recently attracted by many of the researchers. However, there are some limitations for this approach. Determining the hyperplane that distinguishes classes with the maximum margin and calculating the position of each point (train data) in SVM linear classifier can be interpreted as computing a data membership with certainty. A question may be raised here: how much the level of the certainty of this classification, based on hyperplane, can be trusted. In the standard SVM classification, the significance of error for different train data is considered equal and every datum is assumed to belong to just one class. However, in many cases some of train data, including outlier and vague data with no defined model, cannot be strictly considered as a member of a certain class. That means, a train datum may does not exactly belong to one class and its features may show 90 percent membership of one class and 10 percent of another. In such cases, by using fuzzy SVM based on fuzzy logic, we can determine the significance of data in the train phase and finally determine relative class membership of data. 
The method proposed by Lin and Wang is a basic method that introduces a membership function for fuzzy support vector machine. Their membership function is based on the distance between a point and the center of its corresponding class. 
In this paper, we introduce a new method for giving membership to train data based on their distance from distinctive hyperplane. In this method, SVM classification together with primary train data membership are used to introduce a fuzzy membership function for the whole space using symmetrical triangular fuzzy numbers. Based on this method, fuzzy membership function value of new data is selected with minimum difference from primary membership of train data and with the maximum level of fuzzification. In the first step, we define the problem as a nonlinear optimization problem. Then we introduce an efficient algorithm using critical points and obtain final membership function of train data. According to the proposed algorithm, the more distant data from the hyperplane will have a higher membership degree. If a datum exists on the hyperplane, it belongs to both classes with the same membership degree. Moreover, by comparing the primary membership degree of train data and calculated final distribution, we compute the level of noise for train data. Finally, we give a numerical example for illustration the efficiency of the proposed method and comparing its results with the results of the Lin and Wang approach.
&#160;</CONTENT>
			</ABSTRACT>
		</ABSTRACTS>

		<PAGES>
			<PAGE>
			<FPAGE>101</FPAGE>
			<TPAGE>112</TPAGE>
			</PAGE>
		</PAGES>

		<RECEIVE_DATE>
			2017/12/62018/04/42017/12/122017/12/72017/12/202017/09/282017/12/142017/11/19
		</RECEIVE_DATE>

		<RECEIVE_DATE_FA>
			1396/8/28
		</RECEIVE_DATE_FA>

		<ACCEPT_DATE>
			2018/09/152018/12/172018/07/252018/07/252018/07/252018/08/62018/07/252018/08/18
		</ACCEPT_DATE>

		<ACCEPT_DATE_FA>
			1397/5/27
		</ACCEPT_DATE_FA>

		<AUTHORS>
			<AUTHOR>
				<Name>منا</Name>
				<MidName></MidName>
				<Family>خداقلی</Family>
				<NameE>Mona</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Khodagholi</FamilyE>
				<Organizations>
				<Organization>گروه ریاضی، دانشکده علوم پایه، دانشگاه شاهد</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>ma_khodagholy@yahoo.com</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>اردشیر</Name>
				<MidName></MidName>
				<Family>دولتی</Family>
				<NameE>Ardeshir</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Dolati</FamilyE>
				<Organizations>
				<Organization>گروه ریاضی، دانشکده علوم پایه، دانشگاه شاهد</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>dolati@shahed.ac.ir</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>علی</Name>
				<MidName></MidName>
				<Family>حسین زاده</Family>
				<NameE>Ali</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Hosseinzadeh</FamilyE>
				<Organizations>
				<Organization>گروه ریاضی، دانشکده علوم پایه، دانشگاه شاهد</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>hoseinzadeh1393@gmail.com</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>خشایار</Name>
				<MidName></MidName>
				<Family>شمس الکتابی</Family>
				<NameE>khashayar</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Shamsolketabi</FamilyE>
				<Organizations>
				<Organization>دانشگاه تربیت مدرس</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>ali_newmath@yahoo.com</Email>
				</EMAILS>
			</AUTHOR>
		</AUTHORS>


		<KEYWORDS>
			<KEYWORD>
				<KeyText>Fuzzy Logic</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Machine learning</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Data mining</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Fuzzy support vector machine</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>fuzzy membership function</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>منطق فازی</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>یادگیری ماشین</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>داده‌کاوی</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>بردار پشتیبان فازی</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>تابع عضویت فازی</KeyText>
			</KEYWORD>
		</KEYWORDS>

		<REFRENCES>
			<REFRENCE>
				<REF>[1] Mehralian M A, kazem fouladi K. the recognition of online handwritten persian characters based on their main bodies using svm. JSDP. 2012; 9 (1) :59-68##[2] Montazer G A, shayestehfar M. iranian license plate identification with fuzzy support vector ma-chine . JSDP. 2015; 12 (1) :47-56##[3] Abe S. Pattern Classification: Neuro-Fuzzy M-ethods And Their Comparison. springer-verlag, London, UK, 2001.##[4] Alpayden E. Introduction To Machine Learning. The MIT Press, 2010.##[5] Bezdek J. C. Fuzzy Mathematics In Pattern Classi-fication. Phd Dissertation, Cornell University, Ith-aca, NY, 1973.##[6] Bishop CM. Pattern Recognition And Machine Learning. springer; 2006.##[7] Burges J. C. a tutorial on support vector machine-es for pattern recognition. Data Mining and Know-ledge Discovery 1998; 2(2): 121-167.##[[8] Cortes C., Vapnik V. support-vector networks. Machine Learning 1995; 20(3): 273-297.##https://doi.org/10.1007/BF00994018##[9] Fisher RA. the use of multiple measurements in taxonomic problems. Annals of eugenics. 1936 Sep;7(2):179-88.##[10] Huang H. P., Liu Y. H. fuzzy support vector machine for pattern recognition and data mining. Int J Fuzzy Syst 2002; 4(3): 826–835.##[11] Inoue T., Abe S. fuzzy support vector machines for pattern classification. In Proceeding of IJCNN 2001; 2: 1449–1454.##[12] Jiang X. F., Yi, Z., Lv J. C. fuzzy svm with a new fuzzy membership function. Neural Compute 2006; 15(3-4): 268–276.##[13] Lee, G.H., Taur, J. S., Tao, C.W. a robust fuzzy support vector machine for two-class pattern classification. International Journal of Fuzzy Systems 2006; 8(2): 76-87.##[14] Li M. Q., Chen F. Z., Kou J. S. candidate vectors selection for training support vector machines. IEEE Computer Society, Third International Conference on Natural Computation (ICNC) 2007; 1: 538-542.##[15] Lin C. F., Wang S.D. fuzzy support vector ma-chines. IEEE Trans. on Neural Networks 2002; 13(2): 464-471.##[16] Mitchell T. Machine Learning. McGraw Hill, ISBN 0-07-042807-7, 1997.##[17] Nilsson N. J. Introduction To Machine Learning. Robotics Laboratory Department of Computer Science Stanford University Stanford, CA 94305, 2005.##[18] Pontil M., Verri A. properties of support vector machines. Neural Computation 1998; 10(4): 955-974.##[19] Schölkopf B., Burges J. C., Smola A. Advances In Kernel Methods: Support Vector Learning. Cambridge. MA: MIT Press, 1999.##[20] Shiry S., Sadatpoor S. S. Using Machine Learning Techniques In Homeopathy. Amir Kabir Uni-versity Press, 2010.##[21] Tang M. E. fuzzy svm with a new fuzzy membership function to solve the two-class pro-blems. Neural Processing Letters 2011; 34(3): 209-219.##[22] Trung L. e., Tran D., Wanli M. A., Sharma D. a new fuzzy membership computation method for fuzzy support vector machines, Communications and Electronics (ICCE), Third International Conference on 2010; 153 – 157.##[23] Vapnik V. N. Statistical Learning Theory. New York: Wiley, 1998.##[24] Vapnik V. N. The Nature Of Statistical Learning Theory. New York: Springer-Verlag, 1995.##[25] Zadeh L. A. Fuzzy Set A Basis For A Thory Of Possibility. In Fuzzy Set and System 1987; 1: 3-28.##[26] Zadeh L. A. fuzzy sets. information and control, 1965; 8(3): 338-353.##[27] Zhang X.G. using class-center vectors to build support vector machines. In: Proceeding of the IEEE signal processing society workshop 1999; 3–11.##[1] محمدامین، فولادی کاظم. بازشناسی برخط حروف مجزای دست‌نویس فارسی بر اساس تشخیص گروه بدنه اصلی با استفاده از ماشین بردار پشتیبان. پردازش علائم و داده‌ها. 1391; 9 (1) :59-68##[1] Mehralian M A, kazem fouladi K. the recognition of online handwritten persian characters based on their main bodies using svm. JSDP. 2012; 9 (1) :59-68##[2] منتظر غلامعلی، شایسته‌فر محمد. شناسایی پلاک خودروهای ایرانی با الگوریتم ماشین بردار پشتیبانی فازی. پردازش علائم و داده‌ها. ۱۳۹۴; ۱۲ (۱) :۴۷-۵۶.##[2] Montazer G A, shayestehfar M. iranian license plate identification with fuzzy support vector ma-chine . JSDP. 2015; 12 (1) :47-56##[3] Abe S. Pattern Classification: Neuro-Fuzzy M-ethods And Their Comparison. springer-verlag, London, UK, 2001.##[4] Alpayden E. Introduction To Machine Learning. The MIT Press, 2010.##[5] Bezdek J. C. Fuzzy Mathematics In Pattern Classi-fication. Phd Dissertation, Cornell University, Ith-aca, NY, 1973.##[6] Bishop CM. Pattern Recognition And Machine Learning. springer; 2006.##[7] Burges J. C. a tutorial on support vector machine-es for pattern recognition. Data Mining and Know-ledge Discovery 1998; 2(2): 121-167.##[[8] Cortes C., Vapnik V. support-vector networks. Machine Learning 1995; 20(3): 273-297.##https://doi.org/10.1007/BF00994018##[9] Fisher RA. the use of multiple measurements in taxonomic problems. Annals of eugenics. 1936 Sep;7(2):179-88.##[10] Huang H. P., Liu Y. H. fuzzy support vector machine for pattern recognition and data mining. Int J Fuzzy Syst 2002; 4(3): 826–835.##[11] Inoue T., Abe S. fuzzy support vector machines for pattern classification. In Proceeding of IJCNN 2001; 2: 1449–1454.##[12] Jiang X. F., Yi, Z., Lv J. C. fuzzy svm with a new fuzzy membership function. Neural Compute 2006; 15(3-4): 268–276.##[13] Lee, G.H., Taur, J. S., Tao, C.W. a robust fuzzy support vector machine for two-class pattern classification. International Journal of Fuzzy Systems 2006; 8(2): 76-87.##[14] Li M. Q., Chen F. Z., Kou J. S. candidate vectors selection for training support vector machines. IEEE Computer Society, Third International Conference on Natural Computation (ICNC) 2007; 1: 538-542.##[15] Lin C. F., Wang S.D. fuzzy support vector ma-chines. IEEE Trans. on Neural Networks 2002; 13(2): 464-471.##[16] Mitchell T. Machine Learning. McGraw Hill, ISBN 0-07-042807-7, 1997.##[17] Nilsson N. J. Introduction To Machine Learning. Robotics Laboratory Department of Computer Science Stanford University Stanford, CA 94305, 2005.##[18] Pontil M., Verri A. properties of support vector machines. Neural Computation 1998; 10(4): 955-974.##[19] Schölkopf B., Burges J. C., Smola A. Advances In Kernel Methods: Support Vector Learning. Cambridge. MA: MIT Press, 1999.##[20] Shiry S., Sadatpoor S. S. Using Machine Learning Techniques In Homeopathy. Amir Kabir Uni-versity Press, 2010.##[21] Tang M. E. fuzzy svm with a new fuzzy membership function to solve the two-class pro-blems. Neural Processing Letters 2011; 34(3): 209-219.##[22] Trung L. e., Tran D., Wanli M. A., Sharma D. a new fuzzy membership computation method for fuzzy support vector machines, Communications and Electronics (ICCE), Third International Conference on 2010; 153 – 157.##[23] Vapnik V. N. Statistical Learning Theory. New York: Wiley, 1998.##[24] Vapnik V. N. The Nature Of Statistical Learning Theory. New York: Springer-Verlag, 1995.##[25] Zadeh L. A. Fuzzy Set A Basis For A Thory Of Possibility. In Fuzzy Set and System 1987; 1: 3-28.##[26] Zadeh L. A. fuzzy sets. information and control, 1965; 8(3): 338-353.##[27] Zhang X.G. using class-center vectors to build support vector machines. In: Proceeding of the IEEE signal processing society workshop 1999; 3–11.## ##</REF>
			</REFRENCE>
		</REFRENCES>

	</ARTICLE>


	<ARTICLE> 
		<TitleF>نهان‌کاوی صوت مبتنی بر همبستگی بین فریم و کاهش بازگشتی ویژگی</TitleF>
		<TitleE>Audio Steganalysis based on Inter-frame correlation and recursive feature elimination</TitleE>
		<TitleLang_ID>1</TitleLang_ID>
		<ABSTRACTS>
			<ABSTRACT>
			<Language_ID>1</Language_ID>
			<CONTENT>سیگنال&#173;&#8204;های صوتی دیجیتال، به&#8204;دلیل این&#173;که حاوی نرخ اطلاعات زیادی هستند، پوشش مناسبی برای روش&#8204;&#173;های نهان&#8204;&#173;نگاری محسوب می&#173;&#8204;شوند. روش&#8204;&#173;های متنوعی برای نهان&#8204;&#173;نگاری داده&#8204;&#173;های مختلف و به تبع آن نهان&#173;&#8204;کاوی داده&#173;&#8204;ها در سیگنال صوتی وجود دارد. در این میان روش&#8204;&#173;های نهان&#173;&#8204;کاوی فراگیر به&#8204;دلیل عدم وابستگی به الگوریتم نهان&#173;&#8204;نگاری، کاربرد وسیع&#8204;&#173;تری دارند. در این مقاله روش جدیدی برای نهان&#173;&#8204;کاوی فراگیر ارائه شده که در آن با به&#8204;کارگیری ضرایب مربوط به همبستگی بین فریم، دقت نهان&#173;&#8204;کاوی به مقدار قابل توجهی افزایش پیدا کرده است. همچنین عملکرد ماشین بردار پشتیبان با به&#8204;کارگیری الگوریتم کاهش بازگشتی ویژگی&#173;&#8204;ها به&#8204;همراه کاهش بایاس ناشی از همبستگی بین آن&#173;ها بهبود یافته که منجر به افزایش پایداری نهان&#173;&#8204;کاوی و دقت بیشتر شده است. 
&#160;</CONTENT>
			</ABSTRACT>
			<ABSTRACT>
			<Language_ID>2</Language_ID>
			<CONTENT>Dramatic changes in digital communication and exchange of image, audio, video and text files result in a suitable field for interpersonal transfers of hidden information. Therefore, nowadays, preserving channel security and intellectual property and access to hidden information make new fields of researches naming steganography, watermarking and steganalysis. Steganalysis as a binary classification distinguish clean signals from stego signals. Features extracted from time and transform domain are proper for this classifier.
Some of steganalysis methods are depended on a specific steganography algorithm and others are independent. The second group of methods are called Universal steganalysis. Universal steganalysis methods are widely used in applications because of their independency to steganography algorithms. These algorithms are based on characteristics such as distortion measurements, higher order statistics and other similar features. 
In this research we try to achieve more reliable and accurate results using analytical review of features, choose more effective of them and optimize SVM performance. 
In new researches Mel Frequency Cepstral Coefficient and Markov transition probability matrix coefficients are used to steganalysis design. In this paper we consider two facts. First, MFCC extract signal&#160;&#160; features in transform domain similar to human hearing model, which is more sensitive to low frequency signals. As a result, in this method there is more hidden information mostly in higher frequency audio signals. Therefore, it is suggested to use reversed MFCC. Second, there is an interframe correlation in audio signals which is useful as an information hiding effect. 
For the first time, in this research, this features is used in steganalysis field. To have more accurate and stable results, we use recursive feature elimination with correlation bias reduction for SVM. 
To implement suggested algorithm, we use two different data sets from TIMIT and GRID. For each data sets,Steghide and LSB-Matching steganography methods implement with 20 and 50 percent capacity. In addition, one of the LIBSVM 3.2 toolboxes is sued for implementation. 
Finally, the results show accuracy of steganalysis, four to six percent increase in comparison with previous methods. The ROC of methods clearly shows this improvement.
&#160;</CONTENT>
			</ABSTRACT>
		</ABSTRACTS>

		<PAGES>
			<PAGE>
			<FPAGE>113</FPAGE>
			<TPAGE>122</TPAGE>
			</PAGE>
		</PAGES>

		<RECEIVE_DATE>
			2017/12/62018/04/42017/12/122017/12/72017/12/202017/09/282017/12/142017/11/192017/12/24
		</RECEIVE_DATE>

		<RECEIVE_DATE_FA>
			1396/10/3
		</RECEIVE_DATE_FA>

		<ACCEPT_DATE>
			2018/09/152018/12/172018/07/252018/07/252018/07/252018/08/62018/07/252018/08/182018/07/25
		</ACCEPT_DATE>

		<ACCEPT_DATE_FA>
			1397/5/3
		</ACCEPT_DATE_FA>

		<AUTHORS>
			<AUTHOR>
				<Name>فاطمه</Name>
				<MidName></MidName>
				<Family>اشعری</Family>
				<NameE>Fatemeh</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Ashari</FamilyE>
				<Organizations>
				<Organization>دانشکده فنی و مهندسی دانشگاه الزهرا(س)</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>ftashari@gmail.com</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>نوشین</Name>
				<MidName></MidName>
				<Family>ریاحی</Family>
				<NameE>Nooshin</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Riahi</FamilyE>
				<Organizations>
				<Organization>دانشکده فنی و مهندسی دانشگاه الزهرا(س)</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>nriahi@alzahra.ac.ir</Email>
				</EMAILS>
			</AUTHOR>
		</AUTHORS>


		<KEYWORDS>
			<KEYWORD>
				<KeyText>steganalysis</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>steganography</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Mel</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>SVM-RFE+CBR</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>نهان نگاری</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>نهان‌کاوی</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>همبستگی بین فریم</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>کپستروم مل معکوس</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>کاهش ویژگی بازگشتی</KeyText>
			</KEYWORD>
		</KEYWORDS>

		<REFRENCES>
			<REFRENCE>
				<REF>[1] Ghasemzadeh, H. Tajikkhas, M. Khalilarjmandi, H. "Audio Steganalysis based on psychoacoustic model of human hearing". (2016) ELSEVIER, Signal Processing Letters,Vol. 51, Pages 664-672.##[2] Ren, Y. Xiong, Q. Wang, L. "Steganalysis of AAC using calibrated Markov model of adjacent codebook". (2016) IEEE International Conference on Acoustica, Speech and Signal Processing.##[3] Yan, Ke. Zhang, David. "Feature selection and analysis on correlated gas sensor data with-recursive feature elimination". (2015) Elsevier, Sensors and Actuators B 212. Pages 353-363.##[4] Ghasemzadeh, H. Khalil Arjmandi, M. "Reversed-Mel Cepstrum Based Audio Steganalysis". (2014) IEEE 4th International eConference on Computer and Knowledge Engineering.##[5] Yang, Y. et al. "An inter-frame correlation based error concealment of immittance spectral coeffi-cients for mobile speech and audio codecs". (2014) IEEE International Conference on High Per-formance Computing and Communications.##[6] Liu, Q. Sung, A. Qiao, M. "Derivative-Based Audio Steganalysis". (2011) ACM Transactions on Multimedia Computing, Communications and Applications, Vol. 7, No. 3, Article 18.##[7] Tolosi, L. Lengauer, Th. "Classification with correlated features: unreliability of feature ranking and solu-tions". (2011) Data and text mining. Publ-ished by Oxford University Press. Vol. 27, Pages 1986–1994.##[8] Liu, Q. Sung, A. Qiao, M."Temporal Derivative-Based Spectrum and Mel-Cepstrum Audio Ste-ganalysis". (2009) IEEE Transaction on in-formation forensics and security, Vol. 4, No. 3.##[9] Liu, Q. et al. "Novel Stram Mining for Audio Steganalysis". (2009) ACM International Con-ference on Multimedia, Pages 95-104.##[10] Zeng, W. et al. "An Algorithm of Echo Steg-analysis based on Power Cepstrum and Pattern Classification". (2008) International Conference on Information and Automation, Pages 1667-1670.##[11] Liu, Y. el al. "A Novel Audio Steganalysis based on Higher-Order Statistics of Distortion Measure with Hausdroff Distence". (2008) Lecture Notes in Computer Science, Vol. 5222, Pages 487-501.##[12] Ismail Avcibas,"Audio Steganalysis With Content-Independent Dis-tortion Measures". (2006) IEEE Signal Processing Letters,Vol.13, No.2.##[13] Johnson, M.K. et al. "Steganalysis of Recorded Speech". (2005) Conference on Security, Stega-nography and Watermarking of Multi-media, Vol. 5681, Pages 664-672.##[14] Ozer, H. Activbas, I. et al. "Steganalysis of Audio based on Audio Quality Metrics". (2003) Conference on Security, Steganography and Watermarking of Multimedia, Vol. 5020, Pages 55-66.##[15] Harmsen, J.J. Pearlman, W.A. "Steganalysis of additive noise modelable information Hiding". (2006)##[16] Paliwal, K.K. "Use of temporal correlation between successive frames in a hidden markov-model based speech recognizer". (1993) IEEE international conference on Acoustics, speech, and signal processing##[17] I. Guyon, J. Weston, S. B, and V. V. (2002) "Gene selection for cancer classification using support vector machines". Mach. Learn., Vol. 46, No. 1–3, pp. 389–422.##[1] Ghasemzadeh, H. Tajikkhas, M. Khalilarjmandi, H. "Audio Steganalysis based on psychoacoustic model of human hearing". (2016) ELSEVIER, Signal Processing Letters,Vol. 51, Pages 664-672.##[2] Ren, Y. Xiong, Q. Wang, L. "Steganalysis of AAC using calibrated Markov model of adjacent codebook". (2016) IEEE International Conference on Acoustica, Speech and Signal Processing.##[3] Yan, Ke. Zhang, David. "Feature selection and analysis on correlated gas sensor data with-recursive feature elimination". (2015) Elsevier, Sensors and Actuators B 212. Pages 353-363.##[4] Ghasemzadeh, H. Khalil Arjmandi, M. "Reversed-Mel Cepstrum Based Audio Steganalysis". (2014) IEEE 4th International eConference on Computer and Knowledge Engineering.##[5] Yang, Y. et al. "An inter-frame correlation based error concealment of immittance spectral coeffi-cients for mobile speech and audio codecs". (2014) IEEE International Conference on High Per-formance Computing and Communications.##[6] Liu, Q. Sung, A. Qiao, M. "Derivative-Based Audio Steganalysis". (2011) ACM Transactions on Multimedia Computing, Communications and Applications, Vol. 7, No. 3, Article 18.##[7] Tolosi, L. Lengauer, Th. "Classification with correlated features: unreliability of feature ranking and solu-tions". (2011) Data and text mining. Publ-ished by Oxford University Press. Vol. 27, Pages 1986–1994.##[8] Liu, Q. Sung, A. Qiao, M."Temporal Derivative-Based Spectrum and Mel-Cepstrum Audio Ste-ganalysis". (2009) IEEE Transaction on in-formation forensics and security, Vol. 4, No. 3.##[9] Liu, Q. et al. "Novel Stram Mining for Audio Steganalysis". (2009) ACM International Con-ference on Multimedia, Pages 95-104.##[10] Zeng, W. et al. "An Algorithm of Echo Steg-analysis based on Power Cepstrum and Pattern Classification". (2008) International Conference on Information and Automation, Pages 1667-1670.##[11] Liu, Y. el al. "A Novel Audio Steganalysis based on Higher-Order Statistics of Distortion Measure with Hausdroff Distence". (2008) Lecture Notes in Computer Science, Vol. 5222, Pages 487-501.##[12] Ismail Avcibas,"Audio Steganalysis With Content-Independent Dis-tortion Measures". (2006) IEEE Signal Processing Letters,Vol.13, No.2.##[13] Johnson, M.K. et al. "Steganalysis of Recorded Speech". (2005) Conference on Security, Stega-nography and Watermarking of Multi-media, Vol. 5681, Pages 664-672.##[14] Ozer, H. Activbas, I. et al. "Steganalysis of Audio based on Audio Quality Metrics". (2003) Conference on Security, Steganography and Watermarking of Multimedia, Vol. 5020, Pages 55-66.##[15] Harmsen, J.J. Pearlman, W.A. "Steganalysis of additive noise modelable information Hiding". (2006)##[16] Paliwal, K.K. "Use of temporal correlation between successive frames in a hidden markov-model based speech recognizer". (1993) IEEE international conference on Acoustics, speech, and signal processing##[17] I. Guyon, J. Weston, S. B, and V. V. (2002) "Gene selection for cancer classification using support vector machines". Mach. Learn., Vol. 46, No. 1–3, pp. 389–422.## ##</REF>
			</REFRENCE>
		</REFRENCES>

	</ARTICLE>


	<ARTICLE> 
		<TitleF>بهینه‌سازی اجرا و پاسخ صفحات وب در فضای ابری با روش‌های پیش‌پردازش، مطالعه موردی سامانه‌های وارنیش و انجینکس </TitleF>
		<TitleE>Optimizing Web programs Response in Cloud Using Pre-processing, Case study Nginx, Varnish</TitleE>
		<TitleLang_ID>1</TitleLang_ID>
		<ABSTRACTS>
			<ABSTRACT>
			<Language_ID>1</Language_ID>
			<CONTENT>سرعت پاسخ صفحات وب یکی از ضرورت&#8204;های دنیای فناوری اطلاعات است. در سال&#8204;های اخیر شرکت&#8204;های مشهور از قبیل گوگل و دانشمندان علوم رایانه تمرکز خود را روی سرعت&#8204;بخشیدن به وب قرار دادند و تلاش کردند تا راهی برای سریع&#8204;تر&#8204;کردن وب بیابند. دستاوردهایی از قبیل گوگل پیج اسپید، انجینکس و وارنیش نتیجه این پژوهش&#8204;ها بوده است. درهمین&#8204;اواخر روش&#8204;ها و ابزارهای مؤثر و موفقی برای افزایش سرعت بارگذاری صفحات وب ارائه شده که بیش&#8204;تر به دو رهیافت افزایش سرعت در سمت کاربر و افزایش سرعت در سمت سرور تقسیم می&#8204;شود. پراکسی معکوس به&#8204;عنوان مؤثرترین روش افزایش سرعت در سمت سرور است. در این مقاله ضمن معرفی پراکسی معکوس، کارایی سامانه&#8204;های وب سرور چهارگانه آپاچی + وارنیش، انجینکس، انجینکس + وارنیش و آپاچی را، با دو نوع محتوای پویا و ایستا، از منظر سرعت پاسخ صفحات وب به&#8204;عنوان معیار سنجش بررسی کرده&#8204;ایم. نخست&#8204; این&#8204;که نتایج به&#8204;دست&#8204;آمده نشان می&#8204;دهند، استفاده از پراکسی معکوس موجب افزایش سرعت پاسخ می&#8204;شود؛ دوم این&#8204;که این افزایش سرعت نه&#8204;تنها به وب سرور بلکه به نوع محتوای صفحات وب و تعداد تقاضاهای تکراری در صفحات وب مرتبط است. در پایان یک رتبه&#173;بندی برای انتخاب وب&#173;سرور و پراکسی معکوس مناسب برای محتوای وب ایستا یا چندرسانه&#173;ای و محتوای وب پویا یا پردازشی ارائه شده است.
&#160;</CONTENT>
			</ABSTRACT>
			<ABSTRACT>
			<Language_ID>2</Language_ID>
			<CONTENT>The response&#160;speed&#160;of Web pages&#160;is one of the necessities of information technology. In recent years, renowned companies such as Google and computer scientists focused on speeding up the web. Achievements such as Google Pagespeed, Nginx and varnish are the result of these researches. In Customer to Customer(C2C) business systems, such as chat systems, and in Business to Customer(B2C) systems, such as online stores and banks, the power and speed of the system&#8217;s response to the high volume of visitors are very effective in customer satisfaction and the efficiency of the business system. Increasing the speed of web pages from the origin of the advent of this technology, used from known and proven methods such as preprocessing, cookie, Ajax, cache and so on, to speed up the implementation of Internet applications, but it still needs to increase the speed of running and operating systems under the web.
Recently,&#160;successful&#160;and effective&#160;methods and&#160;tools&#160;devised to increase the loading speed&#160;of Web pages, which consist mainly two&#160;approaches, increasing the speed&#160;on the&#160;client-side user and&#160;increasing the speed of&#160;the server-side.
Research and technology on the performance and speed of Web technology on server side are divided into two categories of content enhancements, such as the Google Page Speed tool and Web server performance improvements such as Reverse Proxies. Reverse proxy is the most effective way to increase the speed on the server-side. Web server performance is measured by various metrics such as process load, memory usage and response speed to requests. Reverse proxy technology has been implemented in the Varna and Engineer systems. Implementing the reverse proxy in Varna has focused on caching processing content and on the engineering to cache static content.
Our goal is to evaluate the performance of these two systems as reverse proxies to improve the response speed and loading of web pages in two types of dynamic (processing) and static (multimedia) content and provide a framework for the appropriate selection of a reverse proxy on web servers.
In this paper, we introduce reverse proxy and analyze the performance of the four web servers, namely apache + varnish, nginx, nginx + varnish and apache, with both static and dynamic content, in terms of response speed of web pages as a measure of performance. First, our results show that, using a reverse proxy response speed is increased. Second, the resulted speed up is related not only to web server type but also to the content type of web pages requested repeatedly. Finally, a ranking is provided which helps to select the appropriate web server and reverse proxy when the web content type is static (multimedia) or dynamic (processed).</CONTENT>
			</ABSTRACT>
		</ABSTRACTS>

		<PAGES>
			<PAGE>
			<FPAGE>123</FPAGE>
			<TPAGE>133</TPAGE>
			</PAGE>
		</PAGES>

		<RECEIVE_DATE>
			2017/12/62018/04/42017/12/122017/12/72017/12/202017/09/282017/12/142017/11/192017/12/242017/10/22
		</RECEIVE_DATE>

		<RECEIVE_DATE_FA>
			1396/7/30
		</RECEIVE_DATE_FA>

		<ACCEPT_DATE>
			2018/09/152018/12/172018/07/252018/07/252018/07/252018/08/62018/07/252018/08/182018/07/252018/07/25
		</ACCEPT_DATE>

		<ACCEPT_DATE_FA>
			1397/5/3
		</ACCEPT_DATE_FA>

		<AUTHORS>
			<AUTHOR>
				<Name>سنیه</Name>
				<MidName></MidName>
				<Family>دیلمی</Family>
				<NameE>Saniyeh</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Deylami</FamilyE>
				<Organizations>
				<Organization>دانشگاه قم</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>s.deylami1990@gmail.com</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>یعقوب</Name>
				<MidName></MidName>
				<Family>فرجامی</Family>
				<NameE>Yaghoub</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Farjami</FamilyE>
				<Organizations>
				<Organization>دانشگاه قم</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>farjami@gmail.com</Email>
				</EMAILS>
			</AUTHOR>
		</AUTHORS>


		<KEYWORDS>
			<KEYWORD>
				<KeyText>reverse proxy</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>varnish</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>nginx</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>accelerated web</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>response time</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>سرعت پاسخ</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>پراکسی معکوس</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>انجینکس</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>آپاچی</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>وارنیش</KeyText>
			</KEYWORD>
		</KEYWORDS>

		<REFRENCES>
			<REFRENCE>
				<REF>[1] M. Firtman, High Performance Mobile Web: Best Practices for Optimizing Mobile Web Apps. O'Reilly Media, 2016.##[2] J. Wagner, Web Performance in Action: Building Faster Web Pages. Manning Publications, 2017.##[3] D. Aivaliotis, Mastering Nginx. Packt Publishing Ltd, 2016.##[4] T. Feryn, Getting Started with Varnish Cache: Acc-elerate Your Web Applications, O'Reilly Media, 2017.##[5] Apache Foundation, Apache HTTP Server 2.2 Official Documentation. Vol. I-III, Apache Sof-tware Foundation, 2010.##[6] S. Corona, Nginx: A Practical Guide to High Per-formance, O'Reilly Media, 2017.##[7] R. Moutinho, Instant Varnish Cache How-to. Packt Publishing Ltd.‌, New York, 2013.##[8] P. H. Kamp, You're doing it wrong. Communi-cations of the ACM vol. 53 no.7, pp. 55-59, 2010.##[9] Web Page Test, Test a website's performance, Available: http://www.webpagetest.org/, [Access-ed: Sept. 1, 2015].##[10] GTmetrix, Website Speed and Performance Optimization, Available: http://gtmetrix.com/, [Accessed: Sept. 1, 2015].##[11] Pingdom, Website &#38; Performance Monitoring, Available: http://tools.pingdom.com/fpt/, [Acc-essed: Sept. 1, 2015].##[12] S. Bakhtiyari, Performance Evaluation of the Apache Traffic Server and Varnish Reverse Proxies, Master Thesis, Dept. of Informatics, Univ. of Oslo, Oslo, Norway, May 23, 2012.##[13] L. D. Tobias, Caching HTTP A comparative study of caching reverse proxies Varnish and Nginx, Master Thesis, School of Informatics, Univ. of Skövde, Skövde, Sweden, June 8, 2014.##[14] N. Mathieu, Magento Site Performance Optimi-zation, Packt Publishing, 2014.##[15] B. T. Teklehaimanot, Virtualization of Video Streaming Functions. Ph.D. diss., Dept. of Computer Sciences, Univ. of Saarlandes, Saarb-rücken, Germany, 2016.##[16] D. Kumar, V. Tyagi, and M. Vijay, With High Level Fragmentation of Dataset, Load Balancing in Cloud Computing. Int. Journal of Innovations &#38; Advancement in Computer Science, Vol 3, Issue 5, 2014.##[17] R. DiCosmo, S. Zacchiroli and G. Zavattaro, Aeolus: A component model for the cloud. J. In-formation and Computation, Vol. 239, pp. 100-121, 2014.##[18] A. Grocevs, N. Prokofyeva, Modern approaches to reduce webpage load times, J. Env. Tech. Resources, 2015, Vol. 3, pp. 87-91, 2015.##[19] J. Andjarwirawan, I. Gunawan and E. Kusumo, Varnish Web Cache Application Evaluation. Proc. Intelligence in the Era of Big Data, 4th Int. Conf. on Soft Computing, Intelligent Systems, and Information Technology, pp. 404-410, Sprin-ger,‌ 2015.##[20]‌ A. Loechel and S. Schmid, Comparison of Different Caching Techniques for High-Per-formance Web Map Services. Int. Journal of Spatial Data Infrastructures Research, Vol. 8, pp. 43-73, 2013.##[21] J. Nogueira, D. Gonzalez, L. Guardalben and S. Sargento. Over-The-Top Catch-up TV content-aware caching. 2016 IEEE Symposium on Com-puters and Communication (ISCC), pp. 1012-1017. IEEE, 2016.##[22] P. A. Baeza, Integración de un proxy inverso Varnish Cache con un panel de control Virtualmin para crear una plataforma de servicios de hospedaje Web. Thesis, Dept. Tècnica Sup-erior d'Enginyeria Informàtica, Univ. Politècnica de València, Valencia, Spain, 2015.##[23] L. P. Petroski, J. Matos, and J. E. Bertotti. Analysis of an event oriented web server as a reverse proxy with flexible load distribution. Ibe-roamerican Journal of Applied Computing, Vol. 4, no. 2, 2016.‌##[24] A. Martínez-Álvarez, S. Cuenca-Asensi, A. Ortiz, J. Calvo-Zaragoza, and L. A. V. Tejuelo, Tuning compilations by multi-objective optimization: Application to apache web server, Journal of Applied Soft Computing, Vol. 29, pp. 461-470.‌ 2016.##[25] D. S. Berger, K. R. Sitaraman and M. Harchol-Balter. AdaptSize: Orchestrating the Hot Object Memory Cache in a Content Delivery Network. 14th USENIX Symposium on Networked Sys-tems Design and Implementation, pp. 483-498. 2017.##[26] R. Viscomi, A. Davies and M. Duran: Using WebPageTest, Web Performance Testing for Novices and Power Users. O'Reilly Media, Octo-ber 2015.##[27] L. Čegan, Intelligent preloading of websites resources based on clustering web user sessions. 5th International Conference on IT Convergence and Security, pp. 1-4. IEEE, 2015.##[28] L. Čegan, Performance Evaluation of Preloading Resources for Web Pages, Advanced Computer and Communication Engineering Technology. Lecture Notes in Electrical Engineering, Vol. 362. Springer, 2016.##[1] M. Firtman, High Performance Mobile Web: Best Practices for Optimizing Mobile Web Apps. O'Reilly Media, 2016.##[2] J. Wagner, Web Performance in Action: Building Faster Web Pages. Manning Publications, 2017.##[3] D. Aivaliotis, Mastering Nginx. Packt Publishing Ltd, 2016.##[4] T. Feryn, Getting Started with Varnish Cache: Acc-elerate Your Web Applications, O'Reilly Media, 2017.##[5] Apache Foundation, Apache HTTP Server 2.2 Official Documentation. Vol. I-III, Apache Sof-tware Foundation, 2010.##[6] S. Corona, Nginx: A Practical Guide to High Per-formance, O'Reilly Media, 2017.##[7] R. Moutinho, Instant Varnish Cache How-to. Packt Publishing Ltd.‌, New York, 2013.##[8] P. H. Kamp, You're doing it wrong. Communi-cations of the ACM vol. 53 no.7, pp. 55-59, 2010.##[9] Web Page Test, Test a website's performance, Available: http://www.webpagetest.org/, [Access-ed: Sept. 1, 2015].##[10] GTmetrix, Website Speed and Performance Optimization, Available: http://gtmetrix.com/, [Accessed: Sept. 1, 2015].##[11] Pingdom, Website &#38; Performance Monitoring, Available: http://tools.pingdom.com/fpt/, [Acc-essed: Sept. 1, 2015].##[12] S. Bakhtiyari, Performance Evaluation of the Apache Traffic Server and Varnish Reverse Proxies, Master Thesis, Dept. of Informatics, Univ. of Oslo, Oslo, Norway, May 23, 2012.##[13] L. D. Tobias, Caching HTTP A comparative study of caching reverse proxies Varnish and Nginx, Master Thesis, School of Informatics, Univ. of Skövde, Skövde, Sweden, June 8, 2014.##[14] N. Mathieu, Magento Site Performance Optimi-zation, Packt Publishing, 2014.##[15] B. T. Teklehaimanot, Virtualization of Video Streaming Functions. Ph.D. diss., Dept. of Computer Sciences, Univ. of Saarlandes, Saarb-rücken, Germany, 2016.##[16] D. Kumar, V. Tyagi, and M. Vijay, With High Level Fragmentation of Dataset, Load Balancing in Cloud Computing. Int. Journal of Innovations &#38; Advancement in Computer Science, Vol 3, Issue 5, 2014.##[17] R. DiCosmo, S. Zacchiroli and G. Zavattaro, Aeolus: A component model for the cloud. J. In-formation and Computation, Vol. 239, pp. 100-121, 2014.##[18] A. Grocevs, N. Prokofyeva, Modern approaches to reduce webpage load times, J. Env. Tech. Resources, 2015, Vol. 3, pp. 87-91, 2015.##[19] J. Andjarwirawan, I. Gunawan and E. Kusumo, Varnish Web Cache Application Evaluation. Proc. Intelligence in the Era of Big Data, 4th Int. Conf. on Soft Computing, Intelligent Systems, and Information Technology, pp. 404-410, Sprin-ger,‌ 2015.##[20]‌ A. Loechel and S. Schmid, Comparison of Different Caching Techniques for High-Per-formance Web Map Services. Int. Journal of Spatial Data Infrastructures Research, Vol. 8, pp. 43-73, 2013.##[21] J. Nogueira, D. Gonzalez, L. Guardalben and S. Sargento. Over-The-Top Catch-up TV content-aware caching. 2016 IEEE Symposium on Com-puters and Communication (ISCC), pp. 1012-1017. IEEE, 2016.##[22] P. A. Baeza, Integración de un proxy inverso Varnish Cache con un panel de control Virtualmin para crear una plataforma de servicios de hospedaje Web. Thesis, Dept. Tècnica Sup-erior d'Enginyeria Informàtica, Univ. Politècnica de València, Valencia, Spain, 2015.##[23] L. P. Petroski, J. Matos, and J. E. Bertotti. Analysis of an event oriented web server as a reverse proxy with flexible load distribution. Ibe-roamerican Journal of Applied Computing, Vol. 4, no. 2, 2016.‌##[24] A. Martínez-Álvarez, S. Cuenca-Asensi, A. Ortiz, J. Calvo-Zaragoza, and L. A. V. Tejuelo, Tuning compilations by multi-objective optimization: Application to apache web server, Journal of Applied Soft Computing, Vol. 29, pp. 461-470.‌ 2016.##[25] D. S. Berger, K. R. Sitaraman and M. Harchol-Balter. AdaptSize: Orchestrating the Hot Object Memory Cache in a Content Delivery Network. 14th USENIX Symposium on Networked Sys-tems Design and Implementation, pp. 483-498. 2017.##[26] R. Viscomi, A. Davies and M. Duran: Using WebPageTest, Web Performance Testing for Novices and Power Users. O'Reilly Media, Octo-ber 2015.##[27] L. Čegan, Intelligent preloading of websites resources based on clustering web user sessions. 5th International Conference on IT Convergence and Security, pp. 1-4. IEEE, 2015.##[28] L. Čegan, Performance Evaluation of Preloading Resources for Web Pages, Advanced Computer and Communication Engineering Technology. Lecture Notes in Electrical Engineering, Vol. 362. Springer, 2016.## ##</REF>
			</REFRENCE>
		</REFRENCES>

	</ARTICLE>

</ARTICLES>

</JOURNAL>
</XML>
