<?xml version="1.0" encoding="utf-8"?>
<XML>
<JOURNAL>
<YEAR>1399</YEAR>
<VOL>17</VOL>
<NO>2</NO>
<MOSALSAL>44</MOSALSAL>
<PAGE_NO>121</PAGE_NO>


<ARTICLES>

	<ARTICLE> 
		<TitleF>مدل‌سازی چرخه عملیاتی سامانه اسکادا با استفاده از شبکه‌ پتری</TitleF>
		<TitleE>A Petri-net Model for Operational Cycle in SCADA Systems</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;سازی رفتارهای پست، شبکه و اپراتور برخوردار است.</CONTENT>
			</ABSTRACT>
			<ABSTRACT>
			<Language_ID>2</Language_ID>
			<CONTENT>Supervisory control and data acquisition (SCADA) system monitors and controls industrial processes in critical infrastructures (CIs) and plays the vital role in maintaining the reliability of CIs such as power, oil, and gas system. In fact, SCADA system refers to the set of control process, which measures and monitors sensors in remote substations from a control center. These sensors usually have a type of automated response capability when a certain criteria is met. When an abnormal system status occurs, an alarm signal is raised in control center and as a result the operator will be notified. In this way, all normal and abnormal system statuses are monitored in control center. In CI&#8217;s application, since several substation resources and their related sensors are too high (because the CI&#8217;s grid is often large, complex and wide), the number of alarms is very high. It gets worse when the operator mistakes and as a result, cascading alarms are flooded. In this condition, the rate of raising alarms may be more than clearing them.
In SCADA system, alarm clearing is one of the main duties of operators. When an alarm is raised in control center, the operator should clear it as soon as possible. However, the recent reports confirm the poor alarm clearing causes accidents in the SCADA system. As any operator mistake can increase the number of alarms and jeopardize the system reliability, alarms processing and decision-making for clearing them are a stressful and time-consuming for the SCADA operators. In a large and complex CI such as power system, when operators are overwhelmed by the system alarms, they may take wrong decisions and even ignore alarms. Alarm flooding, lots of operator&#8217;s workload and his/her fatigue as a result, are the main causes of operator&#8217;s mistake.
If generating of an alarm in a remote substation is denoted as an operational cycle in an SCADA system until clearing it by the operator in control center, the aim of this paper is modeling the operational cycle by using colored petri nets. The proposed model is based on a general approach which alarm messages are integrated with the operator&#8217;s commands. Of course, the model focuses on generating of alarms by substation resources. To verify the proposed model, a real data set of power system of Iran is used and to demonstrate the potential of the proposed model some scenarios about operator&#8217; workload and alarm flooding are simulated.</CONTENT>
			</ABSTRACT>
		</ABSTRACTS>

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

		<RECEIVE_DATE>
			2018/09/15
		</RECEIVE_DATE>

		<RECEIVE_DATE_FA>
			1397/6/24
		</RECEIVE_DATE_FA>

		<ACCEPT_DATE>
			2019/09/2
		</ACCEPT_DATE>

		<ACCEPT_DATE_FA>
			1398/6/11
		</ACCEPT_DATE_FA>

		<AUTHORS>
			<AUTHOR>
				<Name>پیام</Name>
				<MidName></MidName>
				<Family>محمودی نصر</Family>
				<NameE>Payam</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Mahmoudi Nasr</FamilyE>
				<Organizations>
				<Organization>دانشگاه مازندران</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>p.mahmoudi@umz.ac.ir</Email>
				</EMAILS>
			</AUTHOR>
		</AUTHORS>


		<KEYWORDS>
			<KEYWORD>
				<KeyText>Alarm</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Modeling</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Operational cycle</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Petri nets</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>SCADA</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. Wang, F. Yang, T. Chen, and S. L. Shah, "An overview of industrial alarm systems: main causes for alarm overloading, research status, and open problems," IEEE Transactions on Automation Science and Engineering, vol. 13, pp. 1045-1061, 2016.##[2] D. Li, J. Hu, H. Wang, and W. Huang, "A distributed parallel alarm management strategy for alarm reduction in chemical plants," Journal of Process Control, vol. 34, pp. 117-125, 2015.##[3] Y. Wu, M. Kezunovic, and T. Kostic, "An advanced alarm processor using two-level processing structure," in Power Tech, 2007 IEEE Lausanne, 2007, pp. 125-130.##[4] P. Mahmoudi-Nasr and A. Yazdian-Varjani, "An Access Management System to Mitigate Operational Threats in SCADA System", JSDP, vol. 14 (4), pp. 3-18, 2018.##[5] P. Mahmoudi-Nasr and A. Yazdian-Varjani, "Toward Operator Access Management in SCADA System: Deontological Threat Mitigation," IEEE Transactions on Industrial Informatics, vol. 14, pp. 3314-3324, 2018.##[6] P. T. Bullemer, M. Tolsma, D. Reising, and J. Laberge, "Towards improving operator alarm flood responses: alternative alarm presentation techniques," Abnormal Situation Management Consortium, 2011.##[7] S. Charbonnier, N. Bouchair, and P. Gayet, "Fault template extraction to assist operators during industrial alarm floods," Engineering Applications of Artificial Intelligence, vol. 50, pp. 32-44, 2016.##[8] R. R. R. Barbosa, R. Sadre, and A. Pras, "Exploiting traffic periodicity in industrial control networks," International journal of critical infrastructure protection, vol. 13, pp. 52-62, 2016.##[9] M. Kezunovic and Y. Guan, "Intelligent alarm processing: From data intensive to information rich," in System Sciences, 2009. HICSS'09. 42nd Hawaii International Conference on, 2009, pp. 1-8.##[10] S. Khanmohammadi, K. Rezaie, J. Jassbi, and S. Tadayon, "A model of the failure detection based on fuzzy inference system for the control center of a power system," Appl. Math. Sci, vol. 6, pp. 1747-1758, 2012.##[11] V. Calderaro, C. N. Hadjicostis, A. Piccolo, and P. Siano, "Failure identification in smart grids based on petri net modeling," IEEE Transactions on Industrial Electronics, vol. 58, pp. 4613-4623, 2011.##[12] Y. Guan and M. Kezunovic, "Contingency-based nodal market operation using intelligent economic alarm processor," IEEE Transactions on Smart Grid, vol. 4, pp. 540-548, 2013.##[13] D. Hadžiosmanović, D. Bolzoni, and P. H. Hartel, "A log mining approach for process monitoring in SCADA," International Journal of Information Security, pp. 1-21, 2012.##[14] Niroo Research Institue, "Substation automation systems standard (transmission and subtransmission substations), Ministry of Energy of Iran, 2008.##[15] T. M. Chen, J. C. Sanchez-Aarnoutse, and J. Buford, "Petri net modeling of cyber-physical attacks on smart grid," IEEE Transactions on Smart Grid, vol. 2, pp. 741-749, 2011.##[16] C. Fecarotti, J. Andrews, and R. Remenyte-Prescott, "Analysis of the Design, Operation and Maintenance Options to Provide a Fault Tolerant Railway System," in Transport Research Arena (TRA) 5th Conference: Transport Solutions from Research to Deployment, 2014.##[17] D. C. Montgomery, Introduction to statistical quality control: John Wiley &#38; Sons (New York), 2009.##[18] X. Dong, K. Hopkinson, X. Tong, X. Wang, and J. Thorp, "IP-based communication systems for wide-area frequency stability predictive control," in Critical Infrastructure (CRIS), 2010 5th International Conference on, 2010, pp. 1-7.##[19] J. Zhao, Y. Xu, F. Luo, Z. Dong, and Y. Peng, "Power system fault diagnosis based on history driven differential evolution and stochastic time domain simulation," Information Sciences, vol. 275, pp. 13-29, 2014.##[20] V. Rodrigo, M. Chioua, T. Hagglund, and M. Hollender, "Causal analysis for alarm flood reduction," IFAC-PapersOnLine, vol. 49, pp. 723-728, 2016.##[21] (2017). http://CPNTools.org##[1] J. Wang, F. Yang, T. Chen, and S. L. Shah, "An overview of industrial alarm systems: main causes for alarm overloading, research status, and open problems," IEEE Transactions on Automation Science and Engineering, vol. 13, pp. 1045-1061, 2016.##[2] D. Li, J. Hu, H. Wang, and W. Huang, "A distributed parallel alarm management strategy for alarm reduction in chemical plants," Journal of Process Control, vol. 34, pp. 117-125, 2015.##[3] Y. Wu, M. Kezunovic, and T. Kostic, "An advanced alarm processor using two-level processing structure," in Power Tech, 2007 IEEE Lausanne, 2007, pp. 125-130.##[4] محمودی نصر. پیام، یزدیان ورجانی. علی, "یک سامانه مدیریت دسترسی برای کاهش تهدیدهای عملیاتی در سامانه اسکادا", پردازش علائم و داده‌ها، دوره 14، شماره 4 - (12-1396).##[4] P. Mahmoudi-Nasr and A. Yazdian-Varjani, "An Access Management System to Mitigate Operational Threats in SCADA System", JSDP, vol. 14 (4), pp. 3-18, 2018.##[5] P. Mahmoudi-Nasr and A. Yazdian-Varjani, "Toward Operator Access Management in SCADA System: Deontological Threat Mitigation," IEEE Transactions on Industrial Informatics, vol. 14, pp. 3314-3324, 2018.##[6] P. T. Bullemer, M. Tolsma, D. Reising, and J. Laberge, "Towards improving operator alarm flood responses: alternative alarm presentation techniques," Abnormal Situation Management Consortium, 2011.##[7] S. Charbonnier, N. Bouchair, and P. Gayet, "Fault template extraction to assist operators during industrial alarm floods," Engineering Applications of Artificial Intelligence, vol. 50, pp. 32-44, 2016.##[8] R. R. R. Barbosa, R. Sadre, and A. Pras, "Exploiting traffic periodicity in industrial control networks," International journal of critical infrastructure protection, vol. 13, pp. 52-62, 2016.##[9] M. Kezunovic and Y. Guan, "Intelligent alarm processing: From data intensive to information rich," in System Sciences, 2009. HICSS'09. 42nd Hawaii International Conference on, 2009, pp. 1-8.##[10] S. Khanmohammadi, K. Rezaie, J. Jassbi, and S. Tadayon, "A model of the failure detection based on fuzzy inference system for the control center of a power system," Appl. Math. Sci, vol. 6, pp. 1747-1758, 2012.##[11] V. Calderaro, C. N. Hadjicostis, A. Piccolo, and P. Siano, "Failure identification in smart grids based on petri net modeling," IEEE Transactions on Industrial Electronics, vol. 58, pp. 4613-4623, 2011.##[12] Y. Guan and M. Kezunovic, "Contingency-based nodal market operation using intelligent economic alarm processor," IEEE Transactions on Smart Grid, vol. 4, pp. 540-548, 2013.##[13] D. Hadžiosmanović, D. Bolzoni, and P. H. Hartel, "A log mining approach for process monitoring in SCADA," International Journal of Information Security, pp. 1-21, 2012.##[14] پژوهشگاه نیرو, "استاندارد سیستم های اتوماسیون پست‌های انتقال و فوق توزیع," شرکت توانیر, 1386.##[14] Niroo Research Institue, "Substation automation systems standard (transmission and subtransmission substations), Ministry of Energy of Iran, 2008.##[15] T. M. Chen, J. C. Sanchez-Aarnoutse, and J. Buford, "Petri net modeling of cyber-physical attacks on smart grid," IEEE Transactions on Smart Grid, vol. 2, pp. 741-749, 2011.##[16] C. Fecarotti, J. Andrews, and R. Remenyte-Prescott, "Analysis of the Design, Operation and Maintenance Options to Provide a Fault Tolerant Railway System," in Transport Research Arena (TRA) 5th Conference: Transport Solutions from Research to Deployment, 2014.##[17] D. C. Montgomery, Introduction to statistical quality control: John Wiley &#38; Sons (New York), 2009.##[18] X. Dong, K. Hopkinson, X. Tong, X. Wang, and J. Thorp, "IP-based communication systems for wide-area frequency stability predictive control," in Critical Infrastructure (CRIS), 2010 5th International Conference on, 2010, pp. 1-7.##[19] J. Zhao, Y. Xu, F. Luo, Z. Dong, and Y. Peng, "Power system fault diagnosis based on history driven differential evolution and stochastic time domain simulation," Information Sciences, vol. 275, pp. 13-29, 2014.##[20] V. Rodrigo, M. Chioua, T. Hagglund, and M. Hollender, "Causal analysis for alarm flood reduction," IFAC-PapersOnLine, vol. 49, pp. 723-728, 2016.##[21] (2017). http://CPNTools.org## ##</REF>
			</REFRENCE>
		</REFRENCES>

	</ARTICLE>


	<ARTICLE> 
		<TitleF>ارائه روش‌های جدید الگوی چینش پایلوت به‌منظور بهبود عملکرد سامانه DVB-T</TitleF>
		<TitleE>Proposed Pilot Pattern Methods for Improvement DVB-T System Performance</TitleE>
		<TitleLang_ID>1</TitleLang_ID>
		<ABSTRACTS>
			<ABSTRACT>
			<Language_ID>1</Language_ID>
			<CONTENT>یکی از بلوک&#173;&#8204;های مهم در سامانه DVB-T، بلوک OFDM است. در بلوک OFDM، پایلوت&#173;ها، تخمین کانال و روش&#8204;&#173;های درون&#8204;یابی نقش کلیدی دارند. تعداد پایلوت&#8204;ها در هر سبل OFDM در الگوهای مختلف پایلوت&#8204;ها متفاوت است. در این مقاله روش&#8204;&#173;های الگوی چینش پایلوتی جدیدی ارائه شده تا با استفاده از سه پارامتر احتمال خطا، زمان محاسباتی و تعداد پایلوت&#8204;ها عملکرد سامانه DVB-T بهبود یابد. در این پژوهش بهبود عملکرد با استفاده از روش&#8204;&#173;های مختلف درون&#8204;یابی دوبعدی بررسی شده است. بدیهی است تمام اهداف موردنظر در یک الگو برآورده نمی&#8204;&#173;شود؛ یعنی به&#8204;طور مثال ممکن است، خطا کمتر، اما تعداد پایلوت بیشتر شده باشد؛ بنابراین الگویی را باید پذیرفت که مطابق با هدف مورد نظر باشد. در این پژوهش شش روش درون&#8204;یابی دوبعدیlinear, Nearest-neighbor, spline, Cubic Hermite, cosine &#160;و &#160;low pass&#160; استفاده شده و سه الگوی جدید برای پایلوت&#8204;ها پیشنهاد شده که این سه الگو با الگوهای متداول DVB-T برای چهار کانال مختلف بررسی و برای هر کانال سی روش درون&#8204;یابی آزمایش شده است. چهار کانال استفاده شده عبارتند از کانال سامانه OFDM با نوفه AWGN و سامانه OFDM با نوفه AWGN و محوشدگی، سامانه DVB-T با نوفه AWGN و سامانه DVB-T با نوفه AWGN و محوشدگی. نتایج حاصل از این پژوهش نشان می&#8204;دهد که در بیشتر حالات، روش&#8204;&#173;های درون&#8204;یابی خطی و کسینوسی در بعد دوم بهترین عملکرد را دارند و درون&#8204;یابی نزدیک&#8204;ترین همسایگی در بعد دوم بدترین عملکرد را دارد. درنهایت الگوهای پایلوت پیشنهادی با الگوی پایلوت مرسوم سامانه DVB-T مقایسه و ملاحظه شد الگوهای پایلوت پیشنهادی عملکرد بهتری نسبت به الگوی پایلوت مرسوم سیستم DVB-T دارند. از آن جا که در DVB-T جا&#8204;به&#8204;جایی و سرعت مطرح است، در مرحله دوم این پژوهش روش&#8204;&#173;های درون&#8204;یابی دوبعدی در چند فرکانس داپلر مختلف در سامانه DVB-T با استفاده از الگوی پایلوت آن بررسی شده است. شبیه&#8204;سازی&#8204;ها نشان می&#8204;دهد که در سه فرکانس داپلر صفر، سی و 150 هرتز الگوهای پیشنهادی پایلوت در&#8204;حالی&#8204;که یکی از درون&#8204;یابی&#8204;ها خطی باشد، عملکرد بهتری نسبت به روش متداول در DVB-T دارند.</CONTENT>
			</ABSTRACT>
			<ABSTRACT>
			<Language_ID>2</Language_ID>
			<CONTENT>Recently, orthogonal frequency division multiplexing (OFDM) has been extensively used in communications systems to resist channel impairments in frequency selective channels. OFDM is a multicarrier transmission technology in wireless environment that use a large number of orthogonal subcarriers to transmit information. OFDM is one of the most important blocks in digital video broadcast-terrestrial (DVB-T) system. The goal of this paper is comparing the methods of interpolation in OFDM system that not used channel statistics information. Therefore, we used pilots for obtaining the information of channel, and by the method of estimation without use of channel statistics information, the channel primary frequency response estimated in pilot&#8217;s frequencies. Pilots, channel estimation and interpolation methods are key roles in the OFDM block. The number of pilots are different in the OFDM symbol for different pilot patterns.&#160; In this article, we proposed three pilot patterns to improve DVB-T system performance. Our criteria for this purpose are error probability, calculation time, and the number of pilots. We have tested the performance improvement by using two-dimensional (2D) interpolation methods. Obviously, we do not obtain all of our requests and requirements via one pilot pattern. For example, the error may be decreases, but the number of pilots is increased. Therefore, we must select the pilot pattern that achieve the most important goal for us. We have applied six interpolation methods, for 2D interpolation, such as linear, nearest-neighbor, spline, cubic Hermite, cosine and low pass interpolations. We have compared three proposed pilot patterns with the conventional DVB-T pilot pattern in four different channels. In each channel, we have tested 30 interpolation methods. The applied channels are OFDM system with AWGN noise, OFDM system with AWGN noise and Rayleigh fading, DVB-T system with AWGN noise and DVB-T system with AWGN noise and Rayleigh fading. We observed that the best performance happens when we use linear interpolation in the first dimension and cosine interpolation in the second dimension of 2D interpolation. In addition, the worst performance will be happened when Nearest-neighbor interpolation is used in the second dimension of 2D interpolation. In the last step, we compared the proposed pilot patterns with the conventional DVB-T pilot pattern in 2D interpolation method that it leads to better performance in DVB-T system. We observed that the proposed pilot patterns have better performance than the conventional DVB-T pilot pattern. In the DVB-T, movement and velocity are very important and considered in this research. In the second step using DVB-T pilot pattern, we compared 2D interpolation methods in some different Doppler frequencies. Simulation results show that at 3 Doppler frequencies, i.e. 0, 30, 150Hz, the proposed schemes with a linear interpolation has better performance than the conventional method in the DVB-T systems.</CONTENT>
			</ABSTRACT>
		</ABSTRACTS>

		<PAGES>
			<PAGE>
			<FPAGE>32</FPAGE>
			<TPAGE>15</TPAGE>
			</PAGE>
		</PAGES>

		<RECEIVE_DATE>
			2018/09/152017/07/30
		</RECEIVE_DATE>

		<RECEIVE_DATE_FA>
			1396/5/8
		</RECEIVE_DATE_FA>

		<ACCEPT_DATE>
			2019/09/22020/06/2
		</ACCEPT_DATE>

		<ACCEPT_DATE_FA>
			1399/3/13
		</ACCEPT_DATE_FA>

		<AUTHORS>
			<AUTHOR>
				<Name>بهاره</Name>
				<MidName></MidName>
				<Family>خسروانی</Family>
				<NameE>bahareh</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Khosravani</FamilyE>
				<Organizations>
				<Organization>دانشگاه آزاد اسلامی واحد یادگار امام خمینی (ره) شهرری</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>Bahareh.khosravani@yahoo.com</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>سعید</Name>
				<MidName></MidName>
				<Family>قاضی مغربی</Family>
				<NameE>saeed</NameE>
				<MidNameE></MidNameE>
				<FamilyE>ghazi-maghrebi</FamilyE>
				<Organizations>
				<Organization>دانشگاه آزاد اسلامی واحد یادگار امام خمینی (ره) شهرری</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>s_ghazi2002@yahoo.com</Email>
				</EMAILS>
			</AUTHOR>
		</AUTHORS>


		<KEYWORDS>
			<KEYWORD>
				<KeyText>DVB-T</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Interpolation</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>OFDM</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Pilot</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>DVB-T</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>OFDM</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>پایلوت و درون‌یابی</KeyText>
			</KEYWORD>
		</KEYWORDS>

		<REFRENCES>
			<REFRENCE>
				<REF>[1] F. Sanzi and J. Speidel, "An adaptive two-dimensional channel estimator for wireless OFDM with application to mobile DVB-T", IEEE Transactions Broadcasting, Vol. 46, No. 2, pp. 128-133, Jun. 2000.##[2] K. Fazel and J. Kaiser, Multi-Carrier and Spread Spectrum Systems. John Wiley &#38; Sons: England, 2013.##[3] H. Onderj and T. Kratochvil, "DVBT channel coding implementation in MATLAB", Department of Radio Electronics, Brno University of Technology, 2012.##[4] M. Elsharief, M. Abouelatta, Zekry, "Implementing a Standard DVB-T System using MATLAB Simulink", International Journal of Computer Applications (0975 - 8887), Vol. 98, No.5, pp.27-32, July 2014.##[5] F. Kh. Deylamani and S. Gh. Maghrebi," Using WPT as a New Method Instead of FFT for ¬Improving the Performance of OFDM Modu-lation", Journal of Signal and Data Processing, Vol. 16, No. 2, pp. 121-136, 1398.##[6] ETSI EN 300 744, "Digital Video Broadcasting (DVB); Framing structure, channel coding and modulation for digital terrestrial television", 2009.##[7] F. Wang, "Pilot-based channel estimation in OFDM system," University of Toledo, pp. 1-95, May 2011.##[8] J. G. Prokis and M. salehi, "Digital communication," 5th edition 2007, Mc Graw-Hill.##[9] A. Asadi and B. Mozaffari. T, "Channel estimation in OFDM-based systems using wavelet transform", Journal of nonlinear systems in electrical engineering, Vol. 1, No. 1, pp. 22-41, 2013.##[10] https: //en.wikipedia.org / Interpolation.##[11] R. Pulikkoonattu, "Channel estimation in DVB-T and OFDM systems", Mar. 2007.##[12] Zh. IIuaqing and L. Jianbo, "Two-dimension interpolation for channel of DVBT system", International Conference on Computer, Control Engineering, pp.253-256, 2012.##[13] Y. Lee, H. Kim, M. Sung, I. Park, S. Lee, " Noise reduction for channel estimation based on pilot-block averaging in DVB-T receivers ", IEEE, pp. 51-58, Jan. 2006.##[14] P. Dhok, A. Dhanvijay, "A review on digital video broadcasting terrestrial (DVB-T) based OFDM system", International Journal of Engineering and Techniques, Vol. 1, No. 2, Mar - Apr 2015.##[15] A. W. Abobaker, "Study and simulation of DVB-T2 IRD performance for different types of channels", M.S. thesis, Faculty of Electrical and Electronic Engineering University Tun Hussein Onn Malaysia, Jun. 2015.##[16] S. Pathak and H. M. Markandeshwar, "Channel estimation in OFDM systems," International Journal of Advanced Research in Computer Science and Software Engineering Research Paper, Vol. 3, No. 3, Mar. 2013.##[17] P. P. Sure, Ch. M. Bhuma, "A survey on OFDM channel estimation techniques based on denoising Filter," International Journal of Elec-tronics &#38; Communication, Vol. 5, No. 5, May 2017.##[18] A. N. Uwaechia and N. M. Mahyuddin, "A Review on Sparse Channel Estimation in OFDM System Using Compressed Sensing," IETE Technical Review, Vol. 34, No. 5, pp. 514-531, 2017.##[19] V. Mathai, K. M. Sagayam, "Comparison and Analysis of channel estimation algorithms in OFDM systems," International Journal of Scientific &#38; technology research, Vol. 2, No. 3, Mar. 2013.##[20] B. Kamislioglu, A. AKBAL, "LSE Channel Estimation and Performance Analysis of OFDM Systems," Turkish Journal of Science &#38; Technology. Vol. 12, No. 2, pp. 53-57, 2017.##[21] A. N. Uwaechia, N. M. Mahyuddin, "A Review on Sparse channel estimation in OFDM system using compressed sensing," IETE Technical Review . Aug. 2016.##[22] P. Sure, Ch. M. Bhuma, "A survey on OFDM channel estimation techniques based on denoising strategies," Engineering Science and Technology, Elsevier, Feb. 2017##[23] S.Z. Seyedsalehi, A.M.Nasrabadi, V.Aboutalebi, "Quadratic b-spline wavelet and committee machine for the p300 detection in Brain computer interface", signal and data processing, Vol.5, No. 2, pp.70-75, 2009.##[24] Y. Asai, J,u. Mashino1, T. Sugiyama1, and M. Katayama, "simple channel tracking scheme using deductive combining for MIMO-OFDM WLANs," IEICE Communications Express, Vol. 6, No.7, pp. 429-434, Jul. 2017.##[25] Y.Kao, H. Chiu, "The Analysis of Scattered Pilot OFDM System and the Discussion of Channel Estimation Based on Two Dimensional Interpolation strategies," Engineering Science and Technology, an International Journal, Vol. 20, No. 2, pp. 629-636, Apr. 2017.##[26]https://en.wikipedia.org/wiki/Nearest-neighbor_Interpolation.##[27] J. Kim, D. Kim, M. Niamat, "Pilot-based channel estimation in OFDM system", University of Toledo, 2011.##[28]http://rozup.ir/up/stcomputer/studownload/dif-antegral.pdf.##[29]https://en.wikipedia.org/wiki/Spline_ (mathematics).##[30] https://en.wikipedia.org/wiki/ Cubic _ Hermite _spline.##[31] A.Z.M. Touhidul Islam, I. Misra, "Performance of wireless OFDM system with LS-interpolation-based channel estimation in multi-path fading channel", International Journal on Computational Sciences &#38; Applications (IJCSA), Vol. 2, No.5, Oct. 2012 .##[32] https://www.petesqbsite.com/sections /zines/qb-_on_acid /zip/index.html##[33] SA. Hosseini, H. Ghassemian, "Hyperspectral data feature extraction using rational function curve fitting," International Journal of Pattern Recognition and Artificial Intelligence, Vol. 30, No. 01, 1650001, 2016.##[34] M. Beitollahi, SA. Hosseini, "Using Savitsky-Golay filter and interval curve fitting in order to hyperspectral data compression," Iranian Con-ference on Electrical Engineering (ICEE), pp.1967-1972, 2017.##[1] F. Sanzi and J. Speidel, "An adaptive two-dimensional channel estimator for wireless OFDM with application to mobile DVB-T", IEEE Transactions Broadcasting, Vol. 46, No. 2, pp. 128-133, Jun. 2000.##[2] K. Fazel and J. Kaiser, Multi-Carrier and Spread Spectrum Systems. John Wiley &#38; Sons: England, 2013.##[3] H. Onderj and T. Kratochvil, "DVBT channel coding implementation in MATLAB", Department of Radio Electronics, Brno University of Technology, 2012.##[4] M. Elsharief, M. Abouelatta, Zekry, "Implementing a Standard DVB-T System using MATLAB Simulink", International Journal of Computer Applications (0975 - 8887), Vol. 98, No.5, pp.27-32, July 2014.##[5] سعید قاضی مغربی* و فربیان خردادپور دیلمانی، "استفاده از تبدیل بسته موجک در بهبود عملکرد OFDM به جای روش مرسوم مبتنی بر "FFT، نشریه پردازش علائم و داده‌ها، دوره 16، شماره 2، صفحه 121-136، سال 1398.##[5] F. Kh. Deylamani and S. Gh. Maghrebi," Using WPT as a New Method Instead of FFT for ¬Improving the Performance of OFDM Modu-lation", Journal of Signal and Data Processing, Vol. 16, No. 2, pp. 121-136, 1398.##[6] ETSI EN 300 744, "Digital Video Broadcasting (DVB); Framing structure, channel coding and modulation for digital terrestrial television", 2009.##[7] F. Wang, "Pilot-based channel estimation in OFDM system," University of Toledo, pp. 1-95, May 2011.##[8] J. G. Prokis and M. salehi, "Digital communication," 5th edition 2007, Mc Graw-Hill.##[9] علی اسدی و بهزاد مظفری تازه کند، "تخمین کانال در سیستم¬های مبتنی بر OFDM با استفاده از تبدیل ویولت"، نشریه سامانه¬های غیر خطی در مهندسی برق، دوره 1، شماره 1، صفحه 22-41، تابستان 1392.##[9] A. Asadi and B. Mozaffari. T, "Channel estimation in OFDM-based systems using wavelet transform", Journal of nonlinear systems in electrical engineering, Vol. 1, No. 1, pp. 22-41, 2013.##[10] https: //en.wikipedia.org / Interpolation.##[11] R. Pulikkoonattu, "Channel estimation in DVB-T and OFDM systems", Mar. 2007.##[12] Zh. IIuaqing and L. Jianbo, "Two-dimension interpolation for channel of DVBT system", International Conference on Computer, Control Engineering, pp.253-256, 2012.##[13] Y. Lee, H. Kim, M. Sung, I. Park, S. Lee, " Noise reduction for channel estimation based on pilot-block averaging in DVB-T receivers ", IEEE, pp. 51-58, Jan. 2006.##[14] P. Dhok, A. Dhanvijay, "A review on digital video broadcasting terrestrial (DVB-T) based OFDM system", International Journal of Engineering and Techniques, Vol. 1, No. 2, Mar - Apr 2015.##[15] A. W. Abobaker, "Study and simulation of DVB-T2 IRD performance for different types of channels", M.S. thesis, Faculty of Electrical and Electronic Engineering University Tun Hussein Onn Malaysia, Jun. 2015.##[16] S. Pathak and H. M. Markandeshwar, "Channel estimation in OFDM systems," International Journal of Advanced Research in Computer Science and Software Engineering Research Paper, Vol. 3, No. 3, Mar. 2013.##[17] P. P. Sure, Ch. M. Bhuma, "A survey on OFDM channel estimation techniques based on denoising Filter," International Journal of Elec-tronics &#38; Communication, Vol. 5, No. 5, May 2017.##[18] A. N. Uwaechia and N. M. Mahyuddin, "A Review on Sparse Channel Estimation in OFDM System Using Compressed Sensing," IETE Technical Review, Vol. 34, No. 5, pp. 514-531, 2017.##[19] V. Mathai, K. M. Sagayam, "Comparison and Analysis of channel estimation algorithms in OFDM systems," International Journal of Scientific &#38; technology research, Vol. 2, No. 3, Mar. 2013.##[20] B. Kamislioglu, A. AKBAL, "LSE Channel Estimation and Performance Analysis of OFDM Systems," Turkish Journal of Science &#38; Technology. Vol. 12, No. 2, pp. 53-57, 2017.##[21] A. N. Uwaechia, N. M. Mahyuddin, "A Review on Sparse channel estimation in OFDM system using compressed sensing," IETE Technical Review . Aug. 2016.##[22] P. Sure, Ch. M. Bhuma, "A survey on OFDM channel estimation techniques based on denoising strategies," Engineering Science and Technology, Elsevier, Feb. 2017##[23] سیده زهره سیدصالحی، علی مطیع نصرآبادی، وحید ابوطالبی، "به‌کارگیری تحلیل زمان‌- فرکانس و ماشین‌ همیار درتشخیص خودکار مؤلّفه‌ی P۳۰۰ جهت ارتباط مغز با رایانه"، نشریه پردازش علائم و داده‌ها، دوره 5، شماره 2، صفحه 57-70، سال 1387.##[23] S.Z. Seyedsalehi, A.M.Nasrabadi, V.Aboutalebi, "Quadratic b-spline wavelet and committee machine for the p300 detection in Brain computer interface", signal and data processing, Vol.5, No. 2, pp.70-75, 2009.##[24] Y. Asai, J,u. Mashino1, T. Sugiyama1, and M. Katayama, "simple channel tracking scheme using deductive combining for MIMO-OFDM WLANs," IEICE Communications Express, Vol. 6, No.7, pp. 429-434, Jul. 2017.##[25] Y.Kao, H. Chiu, "The Analysis of Scattered Pilot OFDM System and the Discussion of Channel Estimation Based on Two Dimensional Interpolation strategies," Engineering Science and Technology, an International Journal, Vol. 20, No. 2, pp. 629-636, Apr. 2017.##[26]https://en.wikipedia.org/wiki/Nearest-neighbor_Interpolation.##[27] J. Kim, D. Kim, M. Niamat, "Pilot-based channel estimation in OFDM system", University of Toledo, 2011.##[28]http://rozup.ir/up/stcomputer/studownload/dif-antegral.pdf.##[29]https://en.wikipedia.org/wiki/Spline_ (mathematics).##[30] https://en.wikipedia.org/wiki/ Cubic _ Hermite _spline.##[31] A.Z.M. Touhidul Islam, I. Misra, "Performance of wireless OFDM system with LS-interpolation-based channel estimation in multi-path fading channel", International Journal on Computational Sciences &#38; Applications (IJCSA), Vol. 2, No.5, Oct. 2012 .##[32] https://www.petesqbsite.com/sections /zines/qb-_on_acid /zip/index.html##[33] SA. Hosseini, H. Ghassemian, "Hyperspectral data feature extraction using rational function curve fitting," International Journal of Pattern Recognition and Artificial Intelligence, Vol. 30, No. 01, 1650001, 2016.##[34] M. Beitollahi, SA. Hosseini, "Using Savitsky-Golay filter and interval curve fitting in order to hyperspectral data compression," Iranian Con-ference on Electrical Engineering (ICEE), pp.1967-1972, 2017.## ##</REF>
			</REFRENCE>
		</REFRENCES>

	</ARTICLE>


	<ARTICLE> 
		<TitleF>نگاشت چرخه McGraw به متدولوژی  RUPبرای توسعه نرم‌افزار امن</TitleF>
		<TitleE>Mapping of McGraw Cycle to RUP Methodology for Secure Software Developing</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;افزار امن در کاهش چالش&#173;های امنیتی نرم&#8204;افزار مؤثر است. چرخه McGraw &#160;به&#8204;عنوان یکی از ره&#8204;یافت&#173;&#8204;های&#173; توسعه نرم&#8204;افزار امن&#8204; تعدادی نقطه تماس امنیت نرم&#8204;افزار را معرفی می&#173;&#8204;کند که شامل مجموعه&#8204;ای از دستورالعمل&#8204;های صریح و مشخص در راستای اِعمال مهندسی امنیت در نیازمندی&#8204;ها، معماری، طراحی، کد&#8204;نویسی، اندازه&#8204;گیری و نگهداری نرم&#8204;افزار است. نقاط تماس امنیت نرم&#8204;افزار برای استفاده در ساخت نرم&#8204;افزار، مستقل از پروسه نرم&#8204;افزاری است و به هر فرآیند تولید نرم&#8204;افزار قابل&#8204;اعمال است. بنابراین، می&#8204;توان با تغییر چرخه توسعه نرم&#8204;افزار مورد نظر و اعمال نقاط تماس، چرخه توسعه نرم&#8204;افزار امن را ایجاد کرد. در این پژوهش، راه&#8204;کاری برای نگاشت چرخه McGraw به متدولوژی RUP؛ به&#8204;عنوان متدولوژی سنگین وزن توسعه نرم&#8204;افزار؛ و تلفیق این دو متدولوژی در راستای ایجاد یک متدولوژی ساده و کارآمد برای توسعه نرم&#8204;افزار امن (که RUPST نام دارد) ارائه و همچنین، فراورده&#8204;های جدید RUP برای توسعه نرم&#8204;افزار امن به تفکیک هر نظم ارائه و چهار نقش جدید نیز برای انجام فعالیت&#8204;های مرتبط با امنیت نرم&#8204;افزار تعریف می&#8204;شود. راه&#8204;کار پیشنهادی در یک پروژه واقعی در شرکت کارخانجات مخابراتی ایران مورد استفاده و ارزیابی قرار گرفت. دست&#8204;آوردها نشان می&#8204;دهد که بهره&#8204;گیری و اجرای صحیح این ره&#8204;یافت توسط توسعه&#8204;دهندگان، به پیاده&#8204;سازی و توسعه امن&#8204;تر و مستحکم&#173;تر نرم&#8204;افزار منجر می&#8204;شود.</CONTENT>
			</ABSTRACT>
			<ABSTRACT>
			<Language_ID>2</Language_ID>
			<CONTENT>Designing a secure software is one of the major phases in developing a robust software. The McGraw life cycle, as one of the well-known software security development approaches, implements different touch points as a collection of software security practices. Each touch point includes explicit instructions for applying security in terms of design, coding, measurement, and maintenance of software. Developers are able to provide secure and robust software by applying such touch points. In this paper, we introduce a secure and robust approach to map McGraw cycle to RUP methodology, named RUPST. The traditional form of RUP methodology is revised based on the proposed activities for software security. RUPST adds activities like security requirements analysis,&#160;abuse case diagrams, risk-based security testes, code review, penetration testing, and security operations to the RUP disciplines. In this regard,&#160;based on RUP disciplines, new touch points of software security are presented as a table. Also, RUPST adds new roles&#160;such as security architect and requirement analyzer, security requirement designer, code reviewer and penetration tester which are presented in the form of a table along with responsibilities of each role.
This approach introduces new RUP artifacts for disciplines and defines new roles in the process of secure software design. The offered artifacts by RUPST include security requirement management plan, security risk analysis model, secure software architecture document, UMLSec model, secure software deployment model, code review report, security test plan, security testes procedures, security test model, security test data, penetration&#160;report, security risks management document, secure installation and configuration document and security audit&#160;report.
We evaluate the performance of the RUPST in real software design process in comparison to other secure software development approaches for different security aspects. The results demonstrate the efficiency of&#160;&#160; the proposed methodology in developing of a secure and robust software.</CONTENT>
			</ABSTRACT>
		</ABSTRACTS>

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

		<RECEIVE_DATE>
			2018/09/152017/07/302018/10/22
		</RECEIVE_DATE>

		<RECEIVE_DATE_FA>
			1397/7/30
		</RECEIVE_DATE_FA>

		<ACCEPT_DATE>
			2019/09/22020/06/22019/09/2
		</ACCEPT_DATE>

		<ACCEPT_DATE_FA>
			1398/6/11
		</ACCEPT_DATE_FA>

		<AUTHORS>
			<AUTHOR>
				<Name>کیوان</Name>
				<MidName></MidName>
				<Family>رحیمی زاده</Family>
				<NameE>Keyvan</NameE>
				<MidNameE></MidNameE>
				<FamilyE>RahimiZadeh</FamilyE>
				<Organizations>
				<Organization>دانشکده فنی و مهندسی، گروه مهندسی کامپیوتر، دانشگاه یاسوج</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>RahimiZadeh@yu.ac.ir</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>محمدعلی</Name>
				<MidName></MidName>
				<Family>ترکمانی</Family>
				<NameE>MohammadAli</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Torkamani</FamilyE>
				<Organizations>
				<Organization>کارخانجات مخابراتی ایران</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>Torkamani@itmc.ir</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>عباس</Name>
				<MidName></MidName>
				<Family>دهقانی</Family>
				<NameE>Abbas</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Dehghani</FamilyE>
				<Organizations>
				<Organization>دانشکده فنی و مهندسی، گروه مهندسی کامپیوتر، دانشگاه یاسوج</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>Dehghani@yu.ac.ir</Email>
				</EMAILS>
			</AUTHOR>
		</AUTHORS>


		<KEYWORDS>
			<KEYWORD>
				<KeyText>Secure software engineering</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>software development lifecycle</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>software design</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>RUP</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>artifact</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. H. Allen, Software security engineering: a guide for project managers. Addison-Wesley, 2008.##[2] M. Eftekhari, M.M. Momenabadi, M. Khamar, "Proposing an evolutionary-fuzzy method for software defects detection", JSDP. Vol. 15, NO. 4, pp.3-16, 2009.##[3] G. McGraw, "Software Security: Building Security in," in 2006 17th International Symposium on Software Reliability Engineer-ing, 2006, pp. 6-16.##[4] M. Howard and S. Lipner, "The security development lifecycle : SDL, a process for developing demonstrably more secure soft-ware", Microsoft Press, 2006.##[5] "Microsoft SDL Process Guidance updates, version 5.2 - Microsoft Security." [Online]. Available: https://www.microsoft.com/security/blog/2012/05/23/now-available-microsoft-sdl-process-guidance-updates-version-5-2/. [Accessed: 14-May-2019].##[6] J. Jürjens, "UMLsec: Extending UML for Secure Systems Development," Springer, Berlin, Heidelberg, 2002, pp. 412-425. DOI:##[7] J. Jürjens, Secure Systems Development with UML. Springer-Verlag Berlin, Heidelberg, 2010.##[8] N. R. Mead, T. Stehney, N. R. Mead, and T. Stehney, "Security quality requirements engineering (SQUARE) methodology," in Proceedings of the 2005 workshop on Software engineering for secure systems building trustworthy applications - SESS '05, 2005, vol. 30, no. 4, pp. 1-7. ##DOI:##[9] N. R Mead, V. Viswanathan, and J. Zhan, "Incorporating security requirements engineering into standard lifecycle processes," International Journal of Security and Its Applications, vol. 2, no. 4, pp. 67-79, 2008. DOI: 10.1109/COMPSAC.2008.85##[10] H. Assal and S. Chiasson, "Security in the Software Development Lifecycle," in Four-teenth Symposium on Usable Privacy and Security, 2018, pp. 281-296.##[11] P. Jaferian, G. Elahi, M. R. A. Shirazi, and B. Sadeghian, "RUPSec: extending business modeling and requirements disciplines of RUP for developing secure systems," in 31st EUROMICRO Conference on Software Engineering and Advanced Applications, 2005, pp.232-239. DOI: 10.1109/EUROMICRO.2005.51##[12] H. Mohd and et al., "A secured e-tendering model based on rational unified process (RUP) approach: inception and elaboration phases," International Journal of Supply Chain Management. Vol. 5, no 4, pp. 114-120, 2016.##[13] H. Belani, Z. Car, and A. Caric, "RUP-based process model for security requirements engineering in value-added service develop-ment," in 2009 ICSE Workshop on Software Engineering for Secure Systems, 2009, pp.54-60.##DOI: 10.1109/IWSESS.2009.5068459##[14] "Microsoft Attack Surface Analyzer. "[Online]. Available: https://www.microsoft.com/en-us/-download/details.aspx?id=24487. [Accessed: 15-May-2019].##[15] "FxCop | Microsoft Docs." [Online]. Available: https://docs.microsoft.com/en-us/previous-versions/dotnet/netframework-3.0/bb429476(v=vs.80). [Accessed: 15-May-2019].##[16] "Microsoft Code Analysis." [Online]. Available: http://microsoft.github.io/CodeAna-lysis/. [Accessed: 15-May-2019].##[17] "Microsoft Anti-Cross Site Scripting Library V4.3 from Official Microsoft Download Center." [Online]. Available: https://www.mic-rosoft.com/en-us/download/details.aspx-?id=43126. [Accessed: 15-May-2019].##[18] "Kali Linux | Penetration Testing and Ethical Hacking Linux Distribution." [Online]. Available: https://www.kali.org/. [Accessed: 15-May-2019].##[19] C. E. de Barros Paes and C. M. Hirata, "RUP Extension for the Development of Secure Systems," in Fourth International Conference on Information Technology (ITNG'07), 2007, pp. 643-652. DOI: 10.1109/ITNG.2007.171##[20] R. Kneuper, "Software Processes in the Software Product Life Cycle," in Software Processes and Life Cycle Models, Cham: Springer International Publishing, 2018, pp. 69-157.##DOI:##[21] Y. Mufti, M. Niazi, M. Alshayeb, and S. Mahmood, "A Readiness Model for Security Requirements Engineering," IEEE Access, vol. 6,pp.28611-28631,2018.##DOI: 10.1109/ACCESS.2018.2840322##[22] C. Gonzalez and E. Liñan, "A Software Engineering Methodology for Developing Secure Obfuscated Software," Springer, Cham, 2020, pp. 1069-1078. DOI: https://doi.or-g/10.1007/978-3-030-12385-7_72##[23] S. K. Jha and R. K. Mishra, "Predicting and Accessing Security Features into Component-Based Software Development: A Critical Survey," Springer, Singapore, 2019, pp. 287-294. DOI:##[24] P. Morrison, D. Moye, R. Pandita, and L. Williams, "Mapping the field of software life cycle security metrics," Information and Software Technology, vol. 102, pp. 146-159, Oct. 2018. DOI: ##https://doi.org/10.1016/j.infsof.2018.05.011##[25] H. Maleki, A. Jamshidi, and M. Mohammadi, "A Framework for Effective Exception Handling in Software Requirements Phase," Springer, Singapore, 2019, pp. 397-411. DOI: ##https://doi.org/10.1007/978-981-10-8672-4_30##[1] J. H. Allen, Software security engineering: a guide for project managers. Addison-Wesley, 2008.##[2] مهدی افتخاری، مریم مجیدی مومن آبادی، مجتبی خمر، "ارائه یک روش فازی-تکاملی برای تشخیص خطاهای نرم‌افزار"، پردازش علائم و داده‌ها. 1397، دوره 15،شماره 4، صفحات 16-3.##[2] M. Eftekhari, M.M. Momenabadi, M. Khamar, "Proposing an evolutionary-fuzzy method for software defects detection", JSDP. Vol. 15, NO. 4, pp.3-16, 2009.##[3] G. McGraw, "Software Security: Building Security in," in 2006 17th International Symposium on Software Reliability Engineer-ing, 2006, pp. 6-16.##[4] M. Howard and S. Lipner, "The security development lifecycle : SDL, a process for developing demonstrably more secure soft-ware", Microsoft Press, 2006.##[5] "Microsoft SDL Process Guidance updates, version 5.2 - Microsoft Security." [Online]. Available: https://www.microsoft.com/security/blog/2012/05/23/now-available-microsoft-sdl-process-guidance-updates-version-5-2/. [Accessed: 14-May-2019].##[6] J. Jürjens, "UMLsec: Extending UML for Secure Systems Development," Springer, Berlin, Heidelberg, 2002, pp. 412-425. DOI:##[7] J. Jürjens, Secure Systems Development with UML. Springer-Verlag Berlin, Heidelberg, 2010.##[8] N. R. Mead, T. Stehney, N. R. Mead, and T. Stehney, "Security quality requirements engineering (SQUARE) methodology," in Proceedings of the 2005 workshop on Software engineering for secure systems building trustworthy applications - SESS '05, 2005, vol. 30, no. 4, pp. 1-7. ##DOI:##[9] N. R Mead, V. Viswanathan, and J. Zhan, "Incorporating security requirements engineering into standard lifecycle processes," International Journal of Security and Its Applications, vol. 2, no. 4, pp. 67-79, 2008. DOI: 10.1109/COMPSAC.2008.85##[10] H. Assal and S. Chiasson, "Security in the Software Development Lifecycle," in Four-teenth Symposium on Usable Privacy and Security, 2018, pp. 281-296.##[11] P. Jaferian, G. Elahi, M. R. A. Shirazi, and B. Sadeghian, "RUPSec: extending business modeling and requirements disciplines of RUP for developing secure systems," in 31st EUROMICRO Conference on Software Engineering and Advanced Applications, 2005, pp.232-239. DOI: 10.1109/EUROMICRO.2005.51##[12] H. Mohd and et al., "A secured e-tendering model based on rational unified process (RUP) approach: inception and elaboration phases," International Journal of Supply Chain Management. Vol. 5, no 4, pp. 114-120, 2016.##[13] H. Belani, Z. Car, and A. Caric, "RUP-based process model for security requirements engineering in value-added service develop-ment," in 2009 ICSE Workshop on Software Engineering for Secure Systems, 2009, pp.54-60.##DOI: 10.1109/IWSESS.2009.5068459##[14] "Microsoft Attack Surface Analyzer. "[Online]. Available: https://www.microsoft.com/en-us/-download/details.aspx?id=24487. [Accessed: 15-May-2019].##[15] "FxCop | Microsoft Docs." [Online]. Available: https://docs.microsoft.com/en-us/previous-versions/dotnet/netframework-3.0/bb429476(v=vs.80). [Accessed: 15-May-2019].##[16] "Microsoft Code Analysis." [Online]. Available: http://microsoft.github.io/CodeAna-lysis/. [Accessed: 15-May-2019].##[17] "Microsoft Anti-Cross Site Scripting Library V4.3 from Official Microsoft Download Center." [Online]. Available: https://www.mic-rosoft.com/en-us/download/details.aspx-?id=43126. [Accessed: 15-May-2019].##[18] "Kali Linux | Penetration Testing and Ethical Hacking Linux Distribution." [Online]. Available: https://www.kali.org/. [Accessed: 15-May-2019].##[19] C. E. de Barros Paes and C. M. Hirata, "RUP Extension for the Development of Secure Systems," in Fourth International Conference on Information Technology (ITNG'07), 2007, pp. 643-652. DOI: 10.1109/ITNG.2007.171##[20] R. Kneuper, "Software Processes in the Software Product Life Cycle," in Software Processes and Life Cycle Models, Cham: Springer International Publishing, 2018, pp. 69-157.##DOI:##[21] Y. Mufti, M. Niazi, M. Alshayeb, and S. Mahmood, "A Readiness Model for Security Requirements Engineering," IEEE Access, vol. 6,pp.28611-28631,2018.##DOI: 10.1109/ACCESS.2018.2840322##[22] C. Gonzalez and E. Liñan, "A Software Engineering Methodology for Developing Secure Obfuscated Software," Springer, Cham, 2020, pp. 1069-1078. DOI: https://doi.or-g/10.1007/978-3-030-12385-7_72##[23] S. K. Jha and R. K. Mishra, "Predicting and Accessing Security Features into Component-Based Software Development: A Critical Survey," Springer, Singapore, 2019, pp. 287-294. DOI:##[24] P. Morrison, D. Moye, R. Pandita, and L. Williams, "Mapping the field of software life cycle security metrics," Information and Software Technology, vol. 102, pp. 146-159, Oct. 2018. DOI: ##https://doi.org/10.1016/j.infsof.2018.05.011##[25] H. Maleki, A. Jamshidi, and M. Mohammadi, "A Framework for Effective Exception Handling in Software Requirements Phase," Springer, Singapore, 2019, pp. 397-411. DOI: ##https://doi.org/10.1007/978-981-10-8672-4_30## ##</REF>
			</REFRENCE>
		</REFRENCES>

	</ARTICLE>


	<ARTICLE> 
		<TitleF>طبقه‌بندی تصاویر با استفاده از نمایش تُنُک و تطبیق زیرفضا</TitleF>
		<TitleE>Image Classification via Sparse Representation and Subspace Alignment</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;های آموزشی و آزمایش هستند. در این مقاله یک روش تطبیق دامنه با عنوان نمایش تُنُک و تطبیق زیرفضا (SRSA) پیشنهاد شده است، که با وزن&#8204;دهی مجدد نمونه&#8204;های آزمایش و نگاشت داده&#8204;ها به یک زیرفضای جدید مشکل اختلاف توزیع داده&#8204;ها را به&#8204;خوبی مرتفع می&#8204;سازد. SRSA با استفاده از یک نمایش تُنُک، بخشی از مجموعه داده&#8204;های هدف را که ارتباط قوی&#8204;تری با داده&#8204;های منبع دارند، انتخاب می&#8204;کند؛ علاوه&#8204;بر آن، SRSA با نگاشت داده&#8204;های تُنُک هدف و داده&#8204;های منبع به زیرفضاهای مستقل، اختلاف توزیع آنها را درفضای به&#8204;دست&#8204;آمده کاهش می&#8204;دهد؛ درنهایت با برروی&#8204;هم&#8204;گذاری زیرفضاهای نگاشت&#8204;شده، SRSA اختلاف توزیع بین داده&#8204;های آموزشی و آزمایش را به کمینه می&#8204;رساند. ما روش پیشنهادی خود را با ترتیب&#8204;دادن چهارده آزمایش بر روی پایگاه داده&#8204;های&#8204; بصری مختلف مورد ارزیابی قرار&#8204;داده و با مقایسه نتایج به&#8204;دست&#8204;آمده، نشان داده&#8204;ایم که SRSA عملکرد بهتری در مقایسه با جدیدترین روش&#8204;های یادگیری ماشین و تطبیق دامنه دارد.</CONTENT>
			</ABSTRACT>
			<ABSTRACT>
			<Language_ID>2</Language_ID>
			<CONTENT>Image representation is a crucial problem in image processing where there exist many low-level representations of image, i.e., SIFT, HOG and so on. But there is a missing link across low-level and high-level semantic representations. In fact, traditional machine learning approaches, e.g., non-negative matrix factorization, sparse representation and principle component analysis are employed to describe the hidden semantic information in images, where they assume that the training and test sets are from same distribution. However, due to the considerable difference across the source and target domains result in environmental or device parameters, the traditional machine learning algorithms may fail. 
Transfer learning is a promising solution to deal with above problem, where the source and target data obey from different distributions. For enhancing the performance of model, transfer learning sends the knowledge from the source to target domain. Transfer learning benefits from sample reweighting of source data or feature projection of domains to reduce the divergence across domains. 
Sparse coding joint with transfer learning has received more attention in many research fields, such as signal processing and machine learning where it makes the representation more concise and easier to manipulate. Moreover, sparse coding facilitates an efficient content-based image indexing and retrieval. 
In this paper, we propose image classification via Sparse Representation and Subspace Alignment (SRSA) to deal with distribution mismatch across domains in low-level image representation. Our approach is a novel image optimization algorithm based on the combination of instance-based and feature-based techniques. Under this framework, we reweight the source samples that are relevant to target samples using sparse representation. Then, we map the source and target data into their respective and independent subspaces. Moreover, we align the mapped subspaces to reduce the distribution mismatch across domains. The proposed approach is evaluated on various visual benchmark datasets with 14 experiments. Comprehensive experiments demonstrate that SRSA outperforms other latest machine learning and domain adaptation methods with significant difference.</CONTENT>
			</ABSTRACT>
		</ABSTRACTS>

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

		<RECEIVE_DATE>
			2018/09/152017/07/302018/10/222018/08/18
		</RECEIVE_DATE>

		<RECEIVE_DATE_FA>
			1397/5/27
		</RECEIVE_DATE_FA>

		<ACCEPT_DATE>
			2019/09/22020/06/22019/09/22019/11/3
		</ACCEPT_DATE>

		<ACCEPT_DATE_FA>
			1398/8/12
		</ACCEPT_DATE_FA>

		<AUTHORS>
			<AUTHOR>
				<Name>فریماه</Name>
				<MidName></MidName>
				<Family>شرافتی</Family>
				<NameE>Farimah</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Sherafati</FamilyE>
				<Organizations>
				<Organization>دانشگاه صنعتی ارومیه</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>farimah.sherafati@it.uut.ac.ir</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>جعفر</Name>
				<MidName></MidName>
				<Family>طهمورث نژاد</Family>
				<NameE>Jafar</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Tahmoresnezhad</FamilyE>
				<Organizations>
				<Organization>دانشگاه صنعتی ارومیه</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>j.tahmores@it.uut.ac.ir</Email>
				</EMAILS>
			</AUTHOR>
		</AUTHORS>


		<KEYWORDS>
			<KEYWORD>
				<KeyText>Image classification</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Visual domains adaptation</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Sparse representation</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Subspace alignment</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>طبقه‌بندی تصویر</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>تطبیق دامنه‌های بصری</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>نمایش تُنُک</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>تطبیق زیرفضا</KeyText>
			</KEYWORD>
		</KEYWORDS>

		<REFRENCES>
			<REFRENCE>
				<REF>[1] Y. Zhang, T. Liu, M. Long, and M. I. Jordan, "Bridging Theory and Algorithm for Domain Adaptation", arXiv preprint arXiv:1904.05801, 2019.##[2] S. Rezaei and J. Tahmoresnezhad, "Discriminative and domain invariant subspace alignment for visual tasks", Iran Journal of Computer Science, pp. 1-12, 2019.##[3] W. Kumagai and T. Kanamori, "Risk bound of transfer learning using parametric feature mapping and its application to sparse coding", Machine Learning, pp. 1-34, 2019.##[4] I. Jolliffe "Principal component analysis", Wiley, vol. 2, pp. 433-459, 2002.##[5] M. Jing, J. Li, J. Zhao, and K. Lu, "Learning distribution-matched landmarks for unsupervised domain adaptation", In International conference on database systems for advanced applications, pp. 491-508, 2018.##[6] A. Li, D. Chen, Z. Wu, G. Sun, and K. Lin, "Self-supervised sparse coding scheme for image classification based on low rank represent-tation", PloS one, Vol. 13(6), e0199141, 2018.##[7] A. Mirjalili, V. Abootalebi, M. T. Sadeghi, "mproving the performance of sparse representation-based classifier for EEG classification," JSDP , pp. 43-55, 2015.##[8] X. Li, M. Fang, J. J. Zhang and J. Wu, "Sample selection for visual domain adaptation via sparse coding", Signal Processing: Image Communi-cation, vol. 44, pp. 92-100, 2016.##[9] B. Gong, Y. Shi, F. Sha and K. Grauman, "Geodesic flow kernel for unsupervised domain adaptation", Proceedings of the IEEE Con-ference on Computer Vision and Pattern Recog-nition, pp. 2066-2073, 2012.##[10] S. J. Pan, I. W. Tsang, J. T. Kwok and Q. Yang, "Domain adaptation via transfer component analysis", IEEE Trans. Neural Netw, vol. 22, no. 2, pp. 199-210, 2011.##[11] B. Fernando, A. Habrard, M. Sebban, and T. Tuytelaars, "Unsupervised visual domain adap-tation using subspace alignment", in Proc. IEEE International Conference on Computer vision, pp. 2960-2967, 2013.##[12] M. Ghifary, D. Balduzzi, W. B. Kleijn, and M. Zhang, "Scatter component analysis: A unified framework for domain adaptation and domain generalizayion", IEEE Transactions on Pattern Analysis and Machine Intelligence, pp. 1-1, 2016.##[13] B. Sun and K. Saenko, "Subspace distribution alignment for unsupervised domain adaptation", in Proc. British Machine Vision Conference, 2015.##[14] J. Tahmoresnezhad and S. Hashemi, "Visual domain adaptation via transfer feature learning", Knowledge and Information Systems, vol. 50, no. 2, pp. 585-605, 2017.##[15] X. Li, M. Fang, J. J. Zhang and J. Wu, "Sample selection for visual domain adaptation via sparse coding", Signal Processing: Image Communi-cation, vol. 44, pp. 92-100, 2016.##[16] K. Saenko, B. Kulis, M. Fritz and T. Darrell, "Adapting visual category models to new domains", Proceedings of the European Con-ference on Computer Vision, pp. 213-226, 2010.##[17] G.Griffin, A. Holub and P. Perona, "Caltech-256 object category dataset", Technical Report7694, 2007.##[18] J. J. Hull, "A¬", IEEE Trans. Pattern Anal. Mach. Intell, vol. 16, no. 5, pp. 550-554, 1994.##[19] Y. LeCun, L. Bottou, Y. Bengio, P. Haffner, "Gradient-based learning applied to document recognition", Proc. IEEE, vol. 86, no. 11, pp. 2278-2324, 1998.##[20] L. Duan, D. Xu, I.W. Tsang, "Domain adaptation from multiple sources: a domain-dependent regularization approach", IEEE Trans. Neural Netw. Learn. Syst, vol. 23, no. 3, pp. 504-518, 2012.##[1] Y. Zhang, T. Liu, M. Long, and M. I. Jordan, "Bridging Theory and Algorithm for Domain Adaptation", arXiv preprint arXiv:1904.05801, 2019.##[2] S. Rezaei and J. Tahmoresnezhad, "Discriminative and domain invariant subspace alignment for visual tasks", Iran Journal of Computer Science, pp. 1-12, 2019.##[3] W. Kumagai and T. Kanamori, "Risk bound of transfer learning using parametric feature mapping and its application to sparse coding", Machine Learning, pp. 1-34, 2019.##[4] I. Jolliffe "Principal component analysis", Wiley, vol. 2, pp. 433-459, 2002.##[5] M. Jing, J. Li, J. Zhao, and K. Lu, "Learning distribution-matched landmarks for unsupervised domain adaptation", In International conference on database systems for advanced applications, pp. 491-508, 2018.##[6] A. Li, D. Chen, Z. Wu, G. Sun, and K. Lin, "Self-supervised sparse coding scheme for image classification based on low rank represent-tation", PloS one, Vol. 13(6), e0199141, 2018.##[7] A. Mirjalili, V. Abootalebi, M. T. Sadeghi, "mproving the performance of sparse representation-based classifier for EEG classification," JSDP , pp. 43-55, 2015.##[8] X. Li, M. Fang, J. J. Zhang and J. Wu, "Sample selection for visual domain adaptation via sparse coding", Signal Processing: Image Communi-cation, vol. 44, pp. 92-100, 2016.##[9] B. Gong, Y. Shi, F. Sha and K. Grauman, "Geodesic flow kernel for unsupervised domain adaptation", Proceedings of the IEEE Con-ference on Computer Vision and Pattern Recog-nition, pp. 2066-2073, 2012.##[10] S. J. Pan, I. W. Tsang, J. T. Kwok and Q. Yang, "Domain adaptation via transfer component analysis", IEEE Trans. Neural Netw, vol. 22, no. 2, pp. 199-210, 2011.##[11] B. Fernando, A. Habrard, M. Sebban, and T. Tuytelaars, "Unsupervised visual domain adap-tation using subspace alignment", in Proc. IEEE International Conference on Computer vision, pp. 2960-2967, 2013.##[12] M. Ghifary, D. Balduzzi, W. B. Kleijn, and M. Zhang, "Scatter component analysis: A unified framework for domain adaptation and domain generalizayion", IEEE Transactions on Pattern Analysis and Machine Intelligence, pp. 1-1, 2016.##[13] B. Sun and K. Saenko, "Subspace distribution alignment for unsupervised domain adaptation", in Proc. British Machine Vision Conference, 2015.##[14] J. Tahmoresnezhad and S. Hashemi, "Visual domain adaptation via transfer feature learning", Knowledge and Information Systems, vol. 50, no. 2, pp. 585-605, 2017.##[15] X. Li, M. Fang, J. J. Zhang and J. Wu, "Sample selection for visual domain adaptation via sparse coding", Signal Processing: Image Communi-cation, vol. 44, pp. 92-100, 2016.##[16] K. Saenko, B. Kulis, M. Fritz and T. Darrell, "Adapting visual category models to new domains", Proceedings of the European Con-ference on Computer Vision, pp. 213-226, 2010.##[17] G.Griffin, A. Holub and P. Perona, "Caltech-256 object category dataset", Technical Report7694, 2007.##[18] J. J. Hull, "A¬", IEEE Trans. Pattern Anal. Mach. Intell, vol. 16, no. 5, pp. 550-554, 1994.##[19] Y. LeCun, L. Bottou, Y. Bengio, P. Haffner, "Gradient-based learning applied to document recognition", Proc. IEEE, vol. 86, no. 11, pp. 2278-2324, 1998.##[20] L. Duan, D. Xu, I.W. Tsang, "Domain adaptation from multiple sources: a domain-dependent regularization approach", IEEE Trans. Neural Netw. Learn. Syst, vol. 23, no. 3, pp. 504-518, 2012.## ##</REF>
			</REFRENCE>
		</REFRENCES>

	</ARTICLE>


	<ARTICLE> 
		<TitleF>تقارن اطلاعات فرکانسی صدای ریه راست و چپ و تشخیص عفونت در بیماران فیبروز کیستیک</TitleF>
		<TitleE>Symmetry of Frequency information in Right and Left Lung sound and Infection Detection in Cystic Fibrosis Patients</TitleE>
		<TitleLang_ID>1</TitleLang_ID>
		<ABSTRACTS>
			<ABSTRACT>
			<Language_ID>1</Language_ID>
			<CONTENT>بیماری فیبروز کیستیک(&#8207;CF&#8207; یا &#8207;Cystic fibrosis&#8207;) شایع&#8204;ترین &#8207;اختلال چند&#8204;سیستمی است که علت اصلی مرگ و میر ناشی از این بیماری مربوط به &#8207;عفونت مزمن ریوی و عوارض آن &#8207;است. حدود60-75% بیماران &#8207;CF&#8207; به&#8204;صورت مداوم دچار عفونت &#8207;سودوموناس می&#8204;شوند؛ لذا بیماران &#8207;CF&#8207; باید پیوسته تحت مراقبت پزشک &#8207;باشند تا در&#8204;صورت بروز عفونت به&#8204;سرعت نسبت به درمان آن &#8207;اقدام شود. اگر چه کشت خلط یا حلق روش استاندارد تشخیص &#8207;عفونت است، ولی به&#8204;دست&#8204;آوردن نتیجه آن، زمان&#8204;بر بوده و &#8207;روشی که وجود عفونت را سریع&#8204;تر تشخیص دهد، باعث &#8207;سهولت در امر تشخیص و شروع درمان با آنتی&#8204;بیوتیک &#8207;می&#8204;شود. این مطالعه با هدف استفاده از صدای تنفس بیماران &#8207;CF&#8207; برای تشخیص وجود عفونت&#160; و موفقیت درمان انجام شد. به این منظور، تقارن اطلاعات سیگنال صدای ریه &#8207;راست و چپ در بیماران &#8207;CF&#8207; در حالت بدون عفونت، دارای عفونت &#8207;سودوموناس و نیز پس &#8207;از &#8207;درمان عفونت سودوموناس بررسی &#8207;شد. ابتدا صدای تنفس 34 بیمار CF ثبت و پس از انجام پیش پردازش&#8204;های لازم، 15ویژگی از آنها استخراج و با روش الگوریتم ژنتیک بهترین دسته ویژگی از ویژگی&#8204;&#8204;های به&#8204;دست&#8204;آمده استخراج و با روش کنار&#8204;گذاشتن یک شرکت&#8204;کننده به سه طبقه&#8204;بند ماشین بردار پشتیبان، K نزدیک&#8204;ترین همسایگی و بیزین داده شد. همچنین روش ترکیب سه طبقه&#8204;بند نیز بررسی شد. بهترین نتایج توسط روش ترکیب طبقه&#8204;بندها به&#8204;دست آمد که وجود عفونت با صحت %3/91 و موفقیت درمان با صحت %9/90 تشخیص &#8207;داده شدند. &#8207;در این مطالعه برای نخستین&#8204;بار از صدای تنفس بیماران CF برای تشخیص عفونت استفاده شده است. روش پیشنهادی، آسان و در دسترس بوده و می&#8204;تواند در شروع به درمان سریع و پیگیری روند درمان به پزشکان کمک کند.</CONTENT>
			</ABSTRACT>
			<ABSTRACT>
			<Language_ID>2</Language_ID>
			<CONTENT>Cystic fibrosis (CF) is the most common autosomal recessive disorder in white skinned individuals. Chronic lung infection is the main cause of mortality in this disease. Approximately 60&#8211;75 % of adult CF patients frequently suffer from Pseudomonas aeruginosa (PA) infection that is strongly associated with inflammation, lung destruction, and increased mortality. Therefore, CF patients should be followed up by physicians to diagnose infection in the primary stage, start treatment, and reduce the risk of chronic infection. Although sputum culture is the gold standard for diagnosis of PA infections, a rapid and accurate diagnostic method can facilitate early initiation of appropriate therapy and easy monitoring of the condition. The aim of this study was to diagnose CF patients with infection using their lung sound. 
In this study, the symmetry of frequency information in right and left lung was investigated in CF patients with positive sputum culture results, negative sputum culture results&#8206;, and patients who underwent treatment with antibiotics. Respiretorysounds were acquired from 34 CF patients (16 female, 18 male) who were being &#8206;followed-up at the Pediatric Respiratory and Sleep Medicine Research Center of Children&#39;s &#8206;Medical Center. The patient selection was based on their sputum microbiology culture. The selection &#8206;category was as follows: 12 patients with normal flora culture results and 11 patients with PA &#8206;infection. Also, respiratory sounds of 11 patients were recorded one month after antibiotic treatment and they used to investigate the effectiveness of the proposed method.
In the preprocessing step, cardiac sound was removed, respiratory sound cycles were separated and the signals were divided into 64 milisecond frame and 15 features were extracted from each frame. Differences between these features were computed between right and left lungs for early, middle and late section of the respiratory cycle using the new proposed feature. Then, the best group of features was selected by applying Genetic Algorithm. The selected group of features was fed into Support Vector Machine, K Nearest Neighbor and Na&#239;ve Bayesian classifier. Also, an Ensemble classifier was examined. The best result was obtained by Ensemble classifier that diagnosed infection by the accuracy of 91.3% and differentiates a group of CF patients with infection from CF patients who underwent treatment with an accuracy of 90.9%. This study describes a novel method of infection detection in CF patients based only on respiratory sound analysis. The proposed method is a simple and available way for early diagnosis of infection and initiating therapeutic strategies.</CONTENT>
			</ABSTRACT>
		</ABSTRACTS>

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

		<RECEIVE_DATE>
			2018/09/152017/07/302018/10/222018/08/182018/09/2
		</RECEIVE_DATE>

		<RECEIVE_DATE_FA>
			1397/6/11
		</RECEIVE_DATE_FA>

		<ACCEPT_DATE>
			2019/09/22020/06/22019/09/22019/11/32019/05/7
		</ACCEPT_DATE>

		<ACCEPT_DATE_FA>
			1398/2/17
		</ACCEPT_DATE_FA>

		<AUTHORS>
			<AUTHOR>
				<Name>آرزو</Name>
				<MidName></MidName>
				<Family>کریمی زاده</Family>
				<NameE>Arezoo</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Karimizadeh</FamilyE>
				<Organizations>
				<Organization>دانشگاه صنعتی خواجه نصیرالدین طوسی</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>a.karimizadeh@ee.kntu.ac.ir</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>منصور</Name>
				<MidName></MidName>
				<Family>ولی</Family>
				<NameE>Mansour</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Vali</FamilyE>
				<Organizations>
				<Organization>دانشگاه صنعتی خواجه نصیرالدین طوسی</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>mansour.vali@eetd.kntu.ac.ir</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>محمدرضا</Name>
				<MidName></MidName>
				<Family>مدرسی</Family>
				<NameE>mohammadreza</NameE>
				<MidNameE></MidNameE>
				<FamilyE>modaresi</FamilyE>
				<Organizations>
				<Organization>دانشگاه علوم پزشکی تهران</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>mr-modaresi@sina.tums.ac.ir</Email>
				</EMAILS>
			</AUTHOR>
		</AUTHORS>


		<KEYWORDS>
			<KEYWORD>
				<KeyText>Cystic Fibrosis</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Respiratory Sound</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Information Symmetry</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Ensemble classifier</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>فیبروز کیستیک</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>صدای تنفس</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>تقارن اطلاعاتی</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>ترکیب طبقه‌بندها</KeyText>
			</KEYWORD>
		</KEYWORDS>

		<REFRENCES>
			<REFRENCE>
				<REF>[1] M. A. Koda-Kimble, Koda-Kimble and Young's applied therapeutics: the clinical use of drugs: Lippincott Williams &#38; Wilkins, 2012.##[2] M. modaresi, J. faghihinia, and F baharzadeh, "Cystic Fibrosis Prevalence among a Group of High-Risk Iranian Children ," Journal of Isfahan Medical School, vol. 30, 2012.##[3] N. Pillarisetti, E. Williamson, B. Linnane, B. Skoric, C. F. Robertson, P. Robinson, J. Massie, G. L. Hall, P. Sly, and S. Stick, "Infection, inflammation, and lung function decline in infants with cystic fibrosis," American journal of respiratory and critical care medicine, vol. 184, pp. 75-81, 2011.##[4] H. G. Ahlgren, A. Benedetti, J. S. Landry, J. Bernier, E. Matouk, D. Radzioch, L. C. Lands, S. Rousseau, and D. Nguyen, "Clinical outcomes associated with Staphylococcus aureus and Pseudomonas aeruginosa airway infections in adult cystic fibrosis patients," BMC pulmonary medicine, vol. 15, pp. 67, 2015.##[5] Z. Li, M. R. Kosorok, P. M. Farrell, A. Laxova, S. E. West, C. G. Green, J. Collins, M. J. Rock, and M. L. Splaingard, "Longitudinal development of mucoid Pseudomonas aeruginosa infection and lung disease progression in children with cystic fibrosis," Jama, vol. 293, pp. 581-588, 2005.##[6] K. M. Langan, T. Kotsimbos, and A. Y. Peleg, "Managing Pseudomonas aeruginosa respiratory infections in cystic fibrosis," Current opinion in infectious diseases, vol. 28, pp. 547-556, 2015.##[7] P. J. Mogayzel Jr, E. T. Naureckas, K. A. Robinson, C. Brady, M. Guill, T. Lahiri, L. Lubsch, J. Matsui, C. M. Oermann, and F. Ratjen, "Cystic Fibrosis Foundation pulmonary guideline. Pharmacologic approaches to prevention and eradication of initial Pseudomonas aeruginosa infection," Annals of the American Thoracic Society, vol. 11, pp. 1640-1650, 2014.##[8] A. R. Smyth, S. C. Bell, S. Bojcin, M. Bryon, A. Duff, P. Flume, N. Kashirskaya, A. Munck, F. Ratjen, and S. J. Schwarzenberg, "European cystic fibrosis society standards of care: best practice guidelines," Journal of cystic fibrosis, vol. 13, pp. S23-S42, 2014.##[9] S. Ferrari, M. Silva, M. Guarino, J. M. Aerts, and D. Berckmans, "Cough sound analysis to identify respiratory infection in pigs," Computers and Electronics in Agriculture, vol. 64, pp. 318-325, 2008.##[10] A. Oliveira, C. Pinho, J. Dinis, D. Oliveira, and A. Marques, "Automatic Wheeze Detection and Lung Function Evaluation-A Preliminary Study," in HEALTHINF, 2013, pp. 323-326.##[11] J. Niu, Y. Shi, M. Cai, Z. Cao, D. Wang, Z. Zhang, and X. D. Zhang, "Detection of sputum by interpreting the time-frequency distribution of respiratory sound signal using image processing techniques," Bioinformatics, vol. 34, pp. 820-827, 2017.##[12] J. Niu, Y. Shi, D. Shen, Y. Wang, W. Xu, M. Cai, and Y. Li, "The Identification of Sputum Situation Based on the Sound from the Respiratory Tract," in 2018 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM), 2018, pp. 1166-1171.##[13] Y. Shi, G. Wang, J. Niu, Q. Zhang, M. Cai, B. Sun, D. Wang, M. Xue, and X. D. Zhang, "Classification of sputum sounds using artificial neural network and wavelet transform," Int. J. Biol. Sci, 2018.##[14] W. L. Wilkins, "Auscultation skills: breath and heart sounds," Auscultation Skills: Breath and Heart Sounds, pp. 156-157, 2009.##[15] R. Dosani and S. Kraman, "Lung sound intensity variability in normal men: a contour phonopneumographic study," Chest, vol. 83, pp. 628-631, 1983.##[16] H. Pasterkamp, S. Patel, and G. Wodicka, "Asymmetry of respiratory sounds and thoracic transmission," Medical and Biological Engi-neering and Computing, vol. 35, pp. 103-106, 1997.##[17] Z. K. Moussavi, M. T. Leopando, H. Pasterkamp, and G. Rempel, "Computerised acoustical respiratory phase detection without airflow measurement," Medical and Biological Engineering and Computing, vol. 38, pp. 198-203, 2000.##[18] R. P. Dellinger, J. E. Parrillo, A. Kushnir, M. Rossi, and I. Kushnir, "Dynamic visualization of lung sounds with a vibration response device: a case series," Respiration, vol. 75, pp. 60-72, 2008.##[19] A. Torres-Jimenez, S. Charleston-Villalobos, R. Gonzalez-Camarena, G. Chi-Lem, and T. Aljama-Corrales, "Asymmetry in lung sound intensities detected by respiratory acoustic thoracic imaging (RATHI) and clinical pulmonary auscultation," in Engineering in Medicine and Biology Society, 2008. EMBS 2008. 30th Annual International Conference of the IEEE, 2008, pp. 4797-4800.##[20] J. Gnitecki and Z. M. Moussavi, "Separating heart sounds from lung sounds," IEEE Engineering in medicine and biology magazine, vol. 26, pp. 20, 2007.##[21] D. S. Morillo, S. A. Moreno, M. Á. F. Granero, and A. L. Jiménez, "Computerized analysis of respiratory sounds during COPD exacerbations," Computers in biology and medicine, vol. 43, pp. 914-921, 2013.##[22] M. Tenhunen, E. Rauhala, E. Huupponen, A. Saastamoinen, A. Kulkas, and S. Himanen, "High frequency components of tracheal sound are emphasized during prolonged flow limitation," Physiological measurement, vol. 30, pp. 467, 2009.##[23] S. Charleston-Villalobos, L. Albuerne-Sanchez, R. Gonzalez-Camarena, M. Mejia-Avila, G. Carrillo-Rodriguez, and T. Aljama-Corrales, "Linear and nonlinear analysis of base lung sound in extrinsic allergic alveolitis patients in comparison to healthy subjects," Methods of information in medicine, vol. 52, pp. 266-276, 2013.##[24] V. Rocha, C. Melo, and A. Marques, "Computerized respiratory sound analysis in people with dementia: a first-step towards diagnosis and monitoring of respiratory conditions," Physiological measurement, vol. 37, pp. 2079, 2016.##[25] R. Naves, B. H. Barbosa, and D. D. Ferreira, "Classification of lung sounds using higher-order statistics: A divide-and-conquer approach," Computer methods and programs in biomedicine, vol. 129, pp. 12-20, 2016.##[26] O. Kramer, Genetic algorithm essentials vol. 679: Springer, 2017.##[27] X. Wu, V. Kumar, J. R. Quinlan, J. Ghosh, Q. Yang, H. Motoda, G. J. McLachlan, A. Ng, B. Liu, and S. Y. Philip, "Top 10 algorithms in data mining," Knowledge and information systems, vol. 14, pp. 1-37, 2008.##[28] M. Rahbaripour and B. M. Asl, "Premature Ventricular Contraction Arrythmia Detection in ECG Signals via Combined Classifiers," Signal and Data Processing, vol. 1, 2018.##[29] L. I. Kuncheva, J. C. Bezdek, and R. P. Duin, "Decision templates for multiple classifier fusion: an experimental comparison," Pattern recognition, vol. 34, pp. 299-314, 2001.##[30] A. Bohadana, G. Izbicki, and S. S. Kraman, "Fundamentals of lung auscultation," New England Journal of Medicine, vol. 370, pp. 744-751, 2014.##[1] M. A. Koda-Kimble, Koda-Kimble and Young's applied therapeutics: the clinical use of drugs: Lippincott Williams &#38; Wilkins, 2012.##[2] M. modaresi, J. faghihinia, and F baharzadeh, "Cystic Fibrosis Prevalence among a Group of High-Risk Iranian Children ," Journal of Isfahan Medical School, vol. 30, 2012.##[3] N. Pillarisetti, E. Williamson, B. Linnane, B. Skoric, C. F. Robertson, P. Robinson, J. Massie, G. L. Hall, P. Sly, and S. Stick, "Infection, inflammation, and lung function decline in infants with cystic fibrosis," American journal of respiratory and critical care medicine, vol. 184, pp. 75-81, 2011.##[4] H. G. Ahlgren, A. Benedetti, J. S. Landry, J. Bernier, E. Matouk, D. Radzioch, L. C. Lands, S. Rousseau, and D. Nguyen, "Clinical outcomes associated with Staphylococcus aureus and Pseudomonas aeruginosa airway infections in adult cystic fibrosis patients," BMC pulmonary medicine, vol. 15, pp. 67, 2015.##[5] Z. Li, M. R. Kosorok, P. M. Farrell, A. Laxova, S. E. West, C. G. Green, J. Collins, M. J. Rock, and M. L. Splaingard, "Longitudinal development of mucoid Pseudomonas aeruginosa infection and lung disease progression in children with cystic fibrosis," Jama, vol. 293, pp. 581-588, 2005.##[6] K. M. Langan, T. Kotsimbos, and A. Y. Peleg, "Managing Pseudomonas aeruginosa respiratory infections in cystic fibrosis," Current opinion in infectious diseases, vol. 28, pp. 547-556, 2015.##[7] P. J. Mogayzel Jr, E. T. Naureckas, K. A. Robinson, C. Brady, M. Guill, T. Lahiri, L. Lubsch, J. Matsui, C. M. Oermann, and F. Ratjen, "Cystic Fibrosis Foundation pulmonary guideline. Pharmacologic approaches to prevention and eradication of initial Pseudomonas aeruginosa infection," Annals of the American Thoracic Society, vol. 11, pp. 1640-1650, 2014.##[8] A. R. Smyth, S. C. Bell, S. Bojcin, M. Bryon, A. Duff, P. Flume, N. Kashirskaya, A. Munck, F. Ratjen, and S. J. Schwarzenberg, "European cystic fibrosis society standards of care: best practice guidelines," Journal of cystic fibrosis, vol. 13, pp. S23-S42, 2014.##[9] S. Ferrari, M. Silva, M. Guarino, J. M. Aerts, and D. Berckmans, "Cough sound analysis to identify respiratory infection in pigs," Computers and Electronics in Agriculture, vol. 64, pp. 318-325, 2008.##[10] A. Oliveira, C. Pinho, J. Dinis, D. Oliveira, and A. Marques, "Automatic Wheeze Detection and Lung Function Evaluation-A Preliminary Study," in HEALTHINF, 2013, pp. 323-326.##[11] J. Niu, Y. Shi, M. Cai, Z. Cao, D. Wang, Z. Zhang, and X. D. Zhang, "Detection of sputum by interpreting the time-frequency distribution of respiratory sound signal using image processing techniques," Bioinformatics, vol. 34, pp. 820-827, 2017.##[12] J. Niu, Y. Shi, D. Shen, Y. Wang, W. Xu, M. Cai, and Y. Li, "The Identification of Sputum Situation Based on the Sound from the Respiratory Tract," in 2018 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM), 2018, pp. 1166-1171.##[13] Y. Shi, G. Wang, J. Niu, Q. Zhang, M. Cai, B. Sun, D. Wang, M. Xue, and X. D. Zhang, "Classification of sputum sounds using artificial neural network and wavelet transform," Int. J. Biol. Sci, 2018.##[14] W. L. Wilkins, "Auscultation skills: breath and heart sounds," Auscultation Skills: Breath and Heart Sounds, pp. 156-157, 2009.##[15] R. Dosani and S. Kraman, "Lung sound intensity variability in normal men: a contour phonopneumographic study," Chest, vol. 83, pp. 628-631, 1983.##[16] H. Pasterkamp, S. Patel, and G. Wodicka, "Asymmetry of respiratory sounds and thoracic transmission," Medical and Biological Engi-neering and Computing, vol. 35, pp. 103-106, 1997.##[17] Z. K. Moussavi, M. T. Leopando, H. Pasterkamp, and G. Rempel, "Computerised acoustical respiratory phase detection without airflow measurement," Medical and Biological Engineering and Computing, vol. 38, pp. 198-203, 2000.##[18] R. P. Dellinger, J. E. Parrillo, A. Kushnir, M. Rossi, and I. Kushnir, "Dynamic visualization of lung sounds with a vibration response device: a case series," Respiration, vol. 75, pp. 60-72, 2008.##[19] A. Torres-Jimenez, S. Charleston-Villalobos, R. Gonzalez-Camarena, G. Chi-Lem, and T. Aljama-Corrales, "Asymmetry in lung sound intensities detected by respiratory acoustic thoracic imaging (RATHI) and clinical pulmonary auscultation," in Engineering in Medicine and Biology Society, 2008. EMBS 2008. 30th Annual International Conference of the IEEE, 2008, pp. 4797-4800.##[20] J. Gnitecki and Z. M. Moussavi, "Separating heart sounds from lung sounds," IEEE Engineering in medicine and biology magazine, vol. 26, pp. 20, 2007.##[21] D. S. Morillo, S. A. Moreno, M. Á. F. Granero, and A. L. Jiménez, "Computerized analysis of respiratory sounds during COPD exacerbations," Computers in biology and medicine, vol. 43, pp. 914-921, 2013.##[22] M. Tenhunen, E. Rauhala, E. Huupponen, A. Saastamoinen, A. Kulkas, and S. Himanen, "High frequency components of tracheal sound are emphasized during prolonged flow limitation," Physiological measurement, vol. 30, pp. 467, 2009.##[23] S. Charleston-Villalobos, L. Albuerne-Sanchez, R. Gonzalez-Camarena, M. Mejia-Avila, G. Carrillo-Rodriguez, and T. Aljama-Corrales, "Linear and nonlinear analysis of base lung sound in extrinsic allergic alveolitis patients in comparison to healthy subjects," Methods of information in medicine, vol. 52, pp. 266-276, 2013.##[24] V. Rocha, C. Melo, and A. Marques, "Computerized respiratory sound analysis in people with dementia: a first-step towards diagnosis and monitoring of respiratory conditions," Physiological measurement, vol. 37, pp. 2079, 2016.##[25] R. Naves, B. H. Barbosa, and D. D. Ferreira, "Classification of lung sounds using higher-order statistics: A divide-and-conquer approach," Computer methods and programs in biomedicine, vol. 129, pp. 12-20, 2016.##[26] O. Kramer, Genetic algorithm essentials vol. 679: Springer, 2017.##[27] X. Wu, V. Kumar, J. R. Quinlan, J. Ghosh, Q. Yang, H. Motoda, G. J. McLachlan, A. Ng, B. Liu, and S. Y. Philip, "Top 10 algorithms in data mining," Knowledge and information systems, vol. 14, pp. 1-37, 2008.##[28] مسعود رهبری پور، بابک محمد زاده اصل، "تشخیص آریتمی انقباضات زودرس بطنی در سیگنال الکتریکی قلب با استفاده از ترکیب طبقه‌بندها"، پردازش علائم و داده‌ها، سال 1397، شماره 1 پیاپی 35##[28] M. Rahbaripour and B. M. Asl, "Premature Ventricular Contraction Arrythmia Detection in ECG Signals via Combined Classifiers," Signal and Data Processing, vol. 1, 2018.##[29] L. I. Kuncheva, J. C. Bezdek, and R. P. Duin, "Decision templates for multiple classifier fusion: an experimental comparison," Pattern recognition, vol. 34, pp. 299-314, 2001.##[30] A. Bohadana, G. Izbicki, and S. S. Kraman, "Fundamentals of lung auscultation," New England Journal of Medicine, vol. 370, pp. 744-751, 2014.## ##</REF>
			</REFRENCE>
		</REFRENCES>

	</ARTICLE>


	<ARTICLE> 
		<TitleF>تخمین کمترین تفاوت قابل درک با استفاده از برجستگی بصری در تصاویر</TitleF>
		<TitleE>Just Noticeable Difference Estimation Using Visual Saliency in Images</TitleE>
		<TitleLang_ID>1</TitleLang_ID>
		<ABSTRACTS>
			<ABSTRACT>
			<Language_ID>1</Language_ID>
			<CONTENT>به&#8204;علت وجود برخی محدودیت&#173;های فیزیولوژیکی و فیزیکی مختلف در مغز و چشم، دستگاه بینایی انسان (HVS) قادر به درک برخی تغییرات سیگنال بصری که دامنه آن&#173;ها از یک حد آستانه مشخص (موسوم به آستانه JND) پایین&#173;تر باشند، نیست. در بیش&#8204;تر پژوهش&#8204;های موجود جهت تخمین آستانه JND، حساسیت HVS در تمام صحنه یکسان در نظر گرفته شده و تأثیرات توجه بصری (VA) ناشی از برجستگی بصری (VS) در این پژوهش&#8204;ها لحاظ نشده است. مطالعات مختلف نشان داده&#173;اند که حساسیت بصری در نواحی برجسته که توجه بصری بیشتری را جلب می&#173;&#8204;کنند بیشتر بوده و لذا در آن نقاط آستانه JND پایین&#173;تر است و بالعکس. در این مقاله مدلی محاسباتی برای تخمین JND پیشنهاد می&#173;&#8204;شود که از رابطه بین JND و برجستگی بصری برای بهبود تخمین آستانه JND استفاده می&#8204;&#173;کند. این مدل با استفاده از یک مدل JND یکنواخت کارآمد و با به&#173;&#8204;کارگیری یک تابع مدولاسیون غیر خطی مناسب، آستانه&#173;&#8204;های JND پیکسل&#173;های مختلف در یک تصویر را با توجه به برجستگی بصری آن&#173;ها بهبود می&#8204;دهد. تعیین پارامترهای تابع غیرخطی مدولاسیون در قالب یک مسأله بهینه&#8204;&#173;سازی، مدل&#8204;&#173;سازی می&#173;&#8204;شود که حل آن منجر به یافتن مدل JND بهبودیافته می&#8204;شود. کلید کارآمدی روش پیشنهادی به&#8204;کارگیری سازوکاری است که منجر به استفاده کارآمدتر از برجستگی بصری می&#173;&#8204;شود.آزمایش&#173;&#8204;های انجام&#8204;گرفته نشان&#8204;&#173;دهنده برتری قابل ملاحظه روش پیشنهادی نسبت به روش&#8204;&#173;های مشابه موجود است.</CONTENT>
			</ABSTRACT>
			<ABSTRACT>
			<Language_ID>2</Language_ID>
			<CONTENT>Due to some physiological and physical limitations in the brain and the eye, the human visual system (HVS) is unable to perceive some changes in the visual signal whose range is lower than a certain threshold so-called just-noticeable distortion (JND) threshold. Visual attention (VA) provides a mechanism for selection of particular aspects of a visual scene so as to reduce the computational load on the brain. According to the current knowledge, it is believed that VA is driven by &#8220;visual saliency&#8221;. In a visual scene, a region is said to be visually salient if it possess certain characteristics, which make it stand out from its surrounding regions and draw our attention to it. In most existing researches for estimating the JND threshold, the sensitivity of the HVS has been consider the same throughout the scene and the effects of visual attention (caused by visual saliency) which have been ignored. Several studies have shown that in salient areas that attract more visual attention, visual sensitivity is higher, and therefore the JND thresholds are lower in those points and vice versa. In other words, visual saliency modulates JND thresholds. Therefore, considering the effects of visual saliency on the JND threshold seems not only logical but also necessary. In this paper, we present an improved non-uniform model for estimating the JND threshold of images by considering the mechanism of visual attention and taking advantage of visual saliency that leads to non-uniformity of importance of different parts of an image. The proposed model, which has the ability to use any existing uniform JND model, improves the JND threshold of different pixels in an image according to the visual saliency and by using a non-linear modulation function. Obtaining the parameters of the nonlinear function through an optimization procedure leads to an improved JND model. What make the proposed model efficient, both in terms of computational simplicity, accuracy, and applicability, are: choosing nonlinear modulation function with minimum computational complexity, choosing appropriate JND base model based on simplicity and accuracy and also Computational model for estimating visual saliency&#160; that accurately determines salient areas, Finally, determine the Efficient cost function and solve it by determining the appropriate &#160;objective Image Quality Assessment. To evaluate the proposed model, a set of objective and subjective experiments were performed on 10 selected images from the MIT database. For subjective experiment, A Two Alternative Forced Choice (2AFC) method was used to compare subjective image quality and for objective experiment SSIM and IWSSIM was used. The obtained experimental results demonstrated that in subjective experiment the proposed model achieves significant superiority than other existing models and in objective experiment, on average, outperforms the compared models. The computational complexity of proposed model is also analyzed and shows that it has faster speed than compared models.</CONTENT>
			</ABSTRACT>
		</ABSTRACTS>

		<PAGES>
			<PAGE>
			<FPAGE>84</FPAGE>
			<TPAGE>71</TPAGE>
			</PAGE>
		</PAGES>

		<RECEIVE_DATE>
			2018/09/152017/07/302018/10/222018/08/182018/09/22018/09/13
		</RECEIVE_DATE>

		<RECEIVE_DATE_FA>
			1397/6/22
		</RECEIVE_DATE_FA>

		<ACCEPT_DATE>
			2019/09/22020/06/22019/09/22019/11/32019/05/72019/09/2
		</ACCEPT_DATE>

		<ACCEPT_DATE_FA>
			1398/6/11
		</ACCEPT_DATE_FA>

		<AUTHORS>
			<AUTHOR>
				<Name>فائزه</Name>
				<MidName></MidName>
				<Family>نعمتی خلیل‌آباد</Family>
				<NameE>Faezeh</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Nemati Khalil Abad</FamilyE>
				<Organizations>
				<Organization>دانشگاه فردوسی مشهد</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>fa.nematykh@mail.um.ac.ir</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>هادی</Name>
				<MidName></MidName>
				<Family>هادی‌زاده</Family>
				<NameE>Hadi</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Hadizadeh</FamilyE>
				<Organizations>
				<Organization>دانشگاه صنعتی قوچان</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>h.hadizadeh@qiet.ac.ir</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>عباس</Name>
				<MidName></MidName>
				<Family>ابراهیمی مقدم</Family>
				<NameE>Abbas</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Ebrahimi Moghadam</FamilyE>
				<Organizations>
				<Organization>دانشگاه فردوسی مشهد</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>a.ebrahimi@um.ac.ir</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>مرتضی</Name>
				<MidName></MidName>
				<Family>خادمی درح</Family>
				<NameE>Morteza</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Khademi Darah</FamilyE>
				<Organizations>
				<Organization>دانشگاه فردوسی مشهد</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>khademi@um.ac.ir</Email>
				</EMAILS>
			</AUTHOR>
		</AUTHORS>


		<KEYWORDS>
			<KEYWORD>
				<KeyText>Visual Saliency (VS)</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Visual Attention (VA)</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Human Visual System (HVS)</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Just Noticeable Difference (JND)</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>برجستگی بصری (VS)</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>توجه بصری (VA)</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>دستگاه بینایی مغز (HVS)</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>کمترین تفاوت قابل درک (JND)</KeyText>
			</KEYWORD>
		</KEYWORDS>

		<REFRENCES>
			<REFRENCE>
				<REF>[1] A. B. Watson, Digital Images and Human Vision. The MIT press, 1993.##[2] F. A. A. Kingdom, Psychophysics: A Practical Introduction. Academic press, 2009.##[3] X. K. Yang, W. S. Lin, Z. K. Lu, E. P. Ong, and S. S. Yao, "Just noticeable distortion model and its applications in video coding," Signal Process.: Image Community, vol. 20, no. 7, pp. 662-680, 2005.##[4] X. Yang, W. Lin, Z. Lu, E. Ong, S. Yao, "Motion-compensated residue pre-processing in video coding based on just-noticeable-distortion profile," IEEE Trans. Circuits Syst. Video Techno, vol. 15, no. 6, pp. 742-752, 2005.##[5] H. R. Wu, A. R. Reibman, W. Lin, F. Pereira, and S. S. Hemami, "Perceptual visual signal compression and transmission," Proceedings of The IEEE, vol. 101, no. 9, pp. 2025-2043, 2013.##[6] C. H. Chou and K. C. Liu, "A perceptually tuned watermarking scheme for color images," IEEE Trans. Image Process, vol. 19, no. 11, pp. 2966 -2982, 2010.##[7] W. Lin and C. J. Kuo, "Perceptual visual quality metrics: A survey," J. Visual Communication and Image Representation, vol. 22, no. 4, pp. 297-312, 2011.##[8] A. Liu, W. Lin, M. Paul, C. Deng, and F. Zhang, "Just noticeable difference for images with decomposition model for separating edge and textured regions," IEEE Trans. Circuits Syst. Video Technolo, vol. 20, no. 11, pp. 1648-1652, 2010.##[9] X. Zhang, W. Lin, and P. Xue, "Just-noticeable difference estimation with pixels in images," J. Vis. Commun. Image Represent, vol. 19, no. 1, pp. 30-41, 2008.##[10] C. H. Chou and Y. C. Li, "A perceptually tuned subband image coder based on the measure of just-noticeable distortion profile," IEEE Trans. Circuits Syst. Video Technol, vol. 5, no. 6, pp. 467-476, 1995.##[11] Z. Wei and K. Ngan, "Spatio-temporal just noticeable distortion profile for grey scale image/video in dct domain," IEEE Trans. Circuits Syst. Video Technology, vol. 19, no.3, pp. 337-346, 2009.##[12] J. Wu, W. Lin, G. Shi, X. Wang, and F. Li, "Pattern masking estimation in image with structural uncertainty," IEEE Trans. Image Process, vol. 22, no. 12, pp. 4892-4904, 2013.##[13] J. Wu, L. Li, W. Dong, G. Shi, W. Lin, C. J. Kuo, "Enhanced just noticeable difference model for images with pattern complexity," IEEE Trans. Image Process, vol. 26, no. 6, pp. 2682-2693, 2017.##[14] M. Banitalebi-Dehkordi, A. Ebrahimi-moghadam, M. Khademi, H. Hadizadeh. "Compressed-Sampling-Based Image Saliency Detection in the Wavelet Domain", JSDP, vol. 16 (4), pp. 59-72, 2020##[15] L. Itti, G. Rees, and J. K. Tsotsos, Neurobiology of Attention. Academic Press, 2005.##[16] A. Borji and L. Itti, "State-of-the-art in visual attention modeling," IEEE Trans. Pattern Anal. Mach. Intell, vol.35, no. 1, pp. 185-207, 2013.##[17] L. Itti, J. Braun, C. Koch, "Modeling the modulatory effect of attention on human spatial vision," Advances in Neural Information Processing Systems (NIPS), MA, USA: MIT Press, vol. 14, pp. 1247-1254, 2002.##[18] Z. Lu, W. Lin, X. Yang, E. Ong, and S. Yao, "Modeling visual attention's modulatory aftereffects on visual sensitivity and quality evaluation," IEEE Trans. Image Process, vol. 14, no. 11, pp. 1928-1942, 2005.##[19] Y. Niu, M. Kyan, L. Ma, A. Beghdadi, S. Krishnan, "Visual saliency's modulatory effect on just noticeable distortion profile and its application in image watermarking," Signal Process. Image Commun, vol. 28, no. 8, pp. 917-928, 2013.##[20] H. Hadizadeh, "A saliency-modulated just-noticeable-distortion model with non-linear saliency modulation functions," Pattern Recogni-tion Letters, vol. 84, pp. 49-55, 2016.##[21] H. Hadizadeh, "Energy-efficient images," IEEE Trans. on Image Process, vol. 26, no. 6, pp. 2882-2891, 2017.##[22] H. Hadizadeh, A. Rajati, and I. V. Baji'c, "Saliency-guided just noticeable distortion estimation using the normalized laplacian pyramid," IEEE Signal Processing Letters, vol. 24, 2017.##[23] J. Wu, L. Li, W. Dong, G. Shi, W. Lin, C. J. Kuo, "Enhanced just noticeable difference model for images with pattern complexity," IEEE Trans. Image Process, vol. 26, no. 6, pp. 2682-2693, 2017.##[24] M. Cornia, L. Baraldi, G. Serra, and R. Cucchiara, "Predicting human eye fixations via an LSTM-based saliency attentive model," [Online]. Available: https://arxiv.org/abs/1611.09571, 2017.##[25] Z. Wang, A. C. Bovik, H. R. Sheikh, E. P. Simoncelli, "Image quality assessment: From error visibility to structural similarity," IEEE Trans. Image Process, vol. 13, no. 4, pp. 1-14, 2004.##[26] L. Zhang, L. Zhang, X. Mou, D. Zhang, "FSIM: A feature similarity index for image quality assessment," IEEE Trans. Image Process., vol. 20, no. 8, pp. 2378-2386, 2011.##[27] L. Zhang, Y. Shen, H. Li, "VSI: A visual saliency-induced index for perceptual image quality assessment," IEEE Trans. Image Process, vol. 23, no. 10, pp. 4270-4281, 2014.##[28] Z. Wang and Q. Li, "Information content weighting for perceptual image quality assessment," IEEE Trans. Image Process, vol. 20, no. 5, pp. 1185-1198, May 2011.##[29] L. Zhang, Z. Gu, and H. Li, "SDSP: A novel saliency detection method by combining simple priors," Proc. IEEE Int. Conf. Image Process, pp. 171-175, Sep. 2013.##[30] A. Borji, M.-Ming Cheng, H. Jiang, and J. Li, "Salient object detection: A benchmark," IEEE Trans. on Image Process, vol. 24, no. 12, pp. 5706-5722, 2015.##[31] T. Judd, K. Ehinger, F. Durand, and A. Torralba, "Learning to predict where humans look," Proc. IEEE Int. Conf. Comput. Vis. (ICCV), pp. 2106-2113. 2009.##[32] http://saliency.mit.edu/results_cat2000.html.##[33] M. M. Taylor, C. D. Creelman, "PEST: efficient estimates on probability functions," J. Acoust. Soc. Am., vol. 41, pp. 782-787, 1967.##[34] M. Uzair, R. D. Dony, "Estimating just-noticeable distortion for images/videos in pixel domain", IET Image Processing, vol. 11, no. 8, pp. 559-567, 2017.##[35] C. Wang, X. Han, W. Wan, J. Li, J. Sun, and M. Xu, "Visual saliency based just noticeable difference estimation in DWT domain," Information, vol. 9, no. 7, pp. 178, 2018.##[1] A. B. Watson, Digital Images and Human Vision. The MIT press, 1993.##[2] F. A. A. Kingdom, Psychophysics: A Practical Introduction. Academic press, 2009.##[3] X. K. Yang, W. S. Lin, Z. K. Lu, E. P. Ong, and S. S. Yao, "Just noticeable distortion model and its applications in video coding," Signal Process.: Image Community, vol. 20, no. 7, pp. 662-680, 2005.##[4] X. Yang, W. Lin, Z. Lu, E. Ong, S. Yao, "Motion-compensated residue pre-processing in video coding based on just-noticeable-distortion profile," IEEE Trans. Circuits Syst. Video Techno, vol. 15, no. 6, pp. 742-752, 2005.##[5] H. R. Wu, A. R. Reibman, W. Lin, F. Pereira, and S. S. Hemami, "Perceptual visual signal compression and transmission," Proceedings of The IEEE, vol. 101, no. 9, pp. 2025-2043, 2013.##[6] C. H. Chou and K. C. Liu, "A perceptually tuned watermarking scheme for color images," IEEE Trans. Image Process, vol. 19, no. 11, pp. 2966 -2982, 2010.##[7] W. Lin and C. J. Kuo, "Perceptual visual quality metrics: A survey," J. Visual Communication and Image Representation, vol. 22, no. 4, pp. 297-312, 2011.##[8] A. Liu, W. Lin, M. Paul, C. Deng, and F. Zhang, "Just noticeable difference for images with decomposition model for separating edge and textured regions," IEEE Trans. Circuits Syst. Video Technolo, vol. 20, no. 11, pp. 1648-1652, 2010.##[9] X. Zhang, W. Lin, and P. Xue, "Just-noticeable difference estimation with pixels in images," J. Vis. Commun. Image Represent, vol. 19, no. 1, pp. 30-41, 2008.##[10] C. H. Chou and Y. C. Li, "A perceptually tuned subband image coder based on the measure of just-noticeable distortion profile," IEEE Trans. Circuits Syst. Video Technol, vol. 5, no. 6, pp. 467-476, 1995.##[11] Z. Wei and K. Ngan, "Spatio-temporal just noticeable distortion profile for grey scale image/video in dct domain," IEEE Trans. Circuits Syst. Video Technology, vol. 19, no.3, pp. 337-346, 2009.##[12] J. Wu, W. Lin, G. Shi, X. Wang, and F. Li, "Pattern masking estimation in image with structural uncertainty," IEEE Trans. Image Process, vol. 22, no. 12, pp. 4892-4904, 2013.##[13] J. Wu, L. Li, W. Dong, G. Shi, W. Lin, C. J. Kuo, "Enhanced just noticeable difference model for images with pattern complexity," IEEE Trans. Image Process, vol. 26, no. 6, pp. 2682-2693, 2017.##[14] مهدی بنی‌طالبی دهکردی، عباس ابراهیمی‌مقدم، مرتضی خادمی، هادی هادی‌زاده. "تشخیص نقاط برجسته تصاویر با استفاده از نمونه‌برداری فشرده در حوزه موجک". فصل‌نامه پردازش علائم و داده‌ها. دوره ۱۶ شماره (۴) ،59-72، 1398.##[14] M. Banitalebi-Dehkordi, A. Ebrahimi-moghadam, M. Khademi, H. Hadizadeh. "Compressed-Sampling-Based Image Saliency Detection in the Wavelet Domain", JSDP, vol. 16 (4), pp. 59-72, 2020##[15] L. Itti, G. Rees, and J. K. Tsotsos, Neurobiology of Attention. Academic Press, 2005.##[16] A. Borji and L. Itti, "State-of-the-art in visual attention modeling," IEEE Trans. Pattern Anal. Mach. Intell, vol.35, no. 1, pp. 185-207, 2013.##[17] L. Itti, J. Braun, C. Koch, "Modeling the modulatory effect of attention on human spatial vision," Advances in Neural Information Processing Systems (NIPS), MA, USA: MIT Press, vol. 14, pp. 1247-1254, 2002.##[18] Z. Lu, W. Lin, X. Yang, E. Ong, and S. Yao, "Modeling visual attention's modulatory aftereffects on visual sensitivity and quality evaluation," IEEE Trans. Image Process, vol. 14, no. 11, pp. 1928-1942, 2005.##[19] Y. Niu, M. Kyan, L. Ma, A. Beghdadi, S. Krishnan, "Visual saliency's modulatory effect on just noticeable distortion profile and its application in image watermarking," Signal Process. Image Commun, vol. 28, no. 8, pp. 917-928, 2013.##[20] H. Hadizadeh, "A saliency-modulated just-noticeable-distortion model with non-linear saliency modulation functions," Pattern Recogni-tion Letters, vol. 84, pp. 49-55, 2016.##[21] H. Hadizadeh, "Energy-efficient images," IEEE Trans. on Image Process, vol. 26, no. 6, pp. 2882-2891, 2017.##[22] H. Hadizadeh, A. Rajati, and I. V. Baji'c, "Saliency-guided just noticeable distortion estimation using the normalized laplacian pyramid," IEEE Signal Processing Letters, vol. 24, 2017.##[23] J. Wu, L. Li, W. Dong, G. Shi, W. Lin, C. J. Kuo, "Enhanced just noticeable difference model for images with pattern complexity," IEEE Trans. Image Process, vol. 26, no. 6, pp. 2682-2693, 2017.##[24] M. Cornia, L. Baraldi, G. Serra, and R. Cucchiara, "Predicting human eye fixations via an LSTM-based saliency attentive model," [Online]. Available: https://arxiv.org/abs/1611.09571, 2017.##[25] Z. Wang, A. C. Bovik, H. R. Sheikh, E. P. Simoncelli, "Image quality assessment: From error visibility to structural similarity," IEEE Trans. Image Process, vol. 13, no. 4, pp. 1-14, 2004.##[26] L. Zhang, L. Zhang, X. Mou, D. Zhang, "FSIM: A feature similarity index for image quality assessment," IEEE Trans. Image Process., vol. 20, no. 8, pp. 2378-2386, 2011.##[27] L. Zhang, Y. Shen, H. Li, "VSI: A visual saliency-induced index for perceptual image quality assessment," IEEE Trans. Image Process, vol. 23, no. 10, pp. 4270-4281, 2014.##[28] Z. Wang and Q. Li, "Information content weighting for perceptual image quality assessment," IEEE Trans. Image Process, vol. 20, no. 5, pp. 1185-1198, May 2011.##[29] L. Zhang, Z. Gu, and H. Li, "SDSP: A novel saliency detection method by combining simple priors," Proc. IEEE Int. Conf. Image Process, pp. 171-175, Sep. 2013.##[30] A. Borji, M.-Ming Cheng, H. Jiang, and J. Li, "Salient object detection: A benchmark," IEEE Trans. on Image Process, vol. 24, no. 12, pp. 5706-5722, 2015.##[31] T. Judd, K. Ehinger, F. Durand, and A. Torralba, "Learning to predict where humans look," Proc. IEEE Int. Conf. Comput. Vis. (ICCV), pp. 2106-2113. 2009.##[32] http://saliency.mit.edu/results_cat2000.html.##[33] M. M. Taylor, C. D. Creelman, "PEST: efficient estimates on probability functions," J. Acoust. Soc. Am., vol. 41, pp. 782-787, 1967.##[34] M. Uzair, R. D. Dony, "Estimating just-noticeable distortion for images/videos in pixel domain", IET Image Processing, vol. 11, no. 8, pp. 559-567, 2017.##[35] C. Wang, X. Han, W. Wan, J. Li, J. Sun, and M. Xu, "Visual saliency based just noticeable difference estimation in DWT domain," Information, vol. 9, no. 7, pp. 178, 2018.## ##</REF>
			</REFRENCE>
		</REFRENCES>

	</ARTICLE>


	<ARTICLE> 
		<TitleF>ترکیب وزن‌دار خوشه‌بندی‌ها با هدف افزایش صحّت خوشه‌بندی نهایی</TitleF>
		<TitleE>Weighted Ensemble Clustering for Increasing the Accuracy of the Final Clustering</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;ها بر اساس روش AD ارائه شده است. روش AD برای برآورد صحّت انسان&#8204;ها در مسائل جمع&#173;سپاری از هماهنگی یا تضاد بین آرای آنها استفاده می&#8204;کند و با پیشنهاد مدلی احتمالاتی، فرآیند برآورد صحّت را به&#8204;کمک یک فرآیند بهینه&#8204;سازی انجام می&#8204;دهد. نوآوری اصلی این مقاله، تخمین صحت خوشه&#8204;بندی&#8204;های پایه با استفاده از روش AD و استفاده از صحت&#8204;های تخمین زده&#8204;شده در وزن&#8204;دهی به خوشه&#8204;بندی&#8204;های پایه در فرآیند ترکیب است. نحوه تطبیق مسأله خوشه&#8204;بندی به روش برآورد صحّت AD و نحوه استفاده از صحّت&#8204;های برآورد&#8204;شده در فرآیند ترکیب نهایی خوشه&#8204;ها، از چالش&#8204;هایی است که در این پژوهش به آنها پرداخته شده است. چهار روش برای تولید خوشه&#8204;بندی&#8204;های پایه شامل الگوریتم&#8204;های متفاوت، معیارهای فاصله&#8204;ی متفاوت در اجرای k-means، ویژگی&#8204;های توزیع&#8204;شده و تعداد خوشه&#8204;های متفاوت بررسی شده است. در فرآیند ترکیب، قابلیت وزن&#8204;&#8204;دهی به الگوریتم&#8204;های خوشه&#8204;بندی ترکیبی CSPA و HGPA اضافه شده است. نتایج روش پیشنهادی روی سیزده مجموعه داده مصنوعی و واقعی مختلف و بر اساس نُه معیار ارزیابی متفاوت نشان می&#8204;دهد که روش ترکیب وزن&#8204;دار ارائه&#8204;شده در بیش&#8204;تر موارد بهتر از روش ترکیب خوشه&#8204;بندی بدون وزن عمل می&#8204;کند که این بهبود برای روش HGPA نسبت به CSPA بیشتر است.</CONTENT>
			</ABSTRACT>
			<ABSTRACT>
			<Language_ID>2</Language_ID>
			<CONTENT>Clustering algorithms are highly dependent on different factors such as the number of clusters, the specific clustering algorithm, and the used distance measure. Inspired from ensemble classification, one approach to reduce the effect of these factors on the final clustering is ensemble clustering. Since weighting the base classifiers has been a successful idea in ensemble classification, in this paper we propose a method to use weighting in the ensemble clustering problem. The accuracies of base clusterings are estimated using an algorithm from crowdsourcing literature called agreement/disagreement method (AD). This method exploits the agreements or disagreements between different labelers for estimating their accuracies. It assumes different labelers have labeled a set of samples, so each two persons have an agreement ratio in their labeled samples. Under some independence assumptions, there is a closed-form formula for the agreement ratio between two labelers based on their accuracies. The AD method estimates the labelers&#8217; accuracies by minimizing the difference between the parametric agreement ratio from the closed-form formula and the agreement ratio from the labels provided by labelers. To adapt the AD method to the clustering problem, an agreement between two clusterings are defined as having the same opinion about a pair of samples. This agreement can be as either being in the same cluster or being in different clusters. In other words, if two clusterings agree that two samples should be in the same or different clusters, this is considered as an agreement. Then, an optimization problem is solved to obtain the base clusterings&#8217; accuracies such that the difference between their available agreement ratios and the expected agreements based on their accuracies is minimized. To generate the base clusterings, we use four different settings including different clustering algorithms, different distance measures, distributed features, and different number of clusters. The used clustering algorithms are mean shift, k-means, mini-batch k-means, affinity propagation, DBSCAN, spectral, BIRCH, and agglomerative clustering with average and ward metrics. For distance measures, we use correlation, city block, cosine, and Euclidean measures. In distributed features setting, the k-means algorithm is performed for 40%, 50%,&#8230;, and 100% of randomly selected features. Finally, for different number of clusters, we run the k-means algorithm by k equals to 2 and also 50%, 75%, 100%, 150%, and 200% of true number of clusters. We add the estimated weights by the AD algorithm to two famous ensemble clustering methods, i.e., Cluster-based Similarity Partitioning Algorithm (CSPA) and Hyper Graph Partitioning Algorithm (HGPA). In CSPA, the similarity matrix is computed by taking a weighted average of the opinions of different clusterings. In HGPA, we propose to weight the hyperedges by different values such as the estimated clustering accuracies, size of clusters, and the silhouette of clusterings. The experiments are performed on 13 real and artificial datasets. The reported evaluation measures include adjusted rand index, Fowlkes-Mallows, mutual index, adjusted mutual index, normalized mutual index, homogeneity, completeness, v-measure, and purity. The results show that in the majority of cases, the proposed weighted-based method outperforms the unweighted ensemble clustering. In addition, the weighting is more effective in improving the HGPA algorithm than CSPA. For different weighting methods proposed for HGPA algorithm, the best average results are obtained when we use the accuracies estimated by the AD method to weight the hyperedges, and the worst results are obtained when using the normalized silhouette measure for weighting. Finally, among different methods for generating base clusterings, the best results in weighted HGPA are obtained when we use different clustering algorithms to come up with different base clusterings.</CONTENT>
			</ABSTRACT>
		</ABSTRACTS>

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

		<RECEIVE_DATE>
			2018/09/152017/07/302018/10/222018/08/182018/09/22018/09/132017/11/30
		</RECEIVE_DATE>

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

		<ACCEPT_DATE>
			2019/09/22020/06/22019/09/22019/11/32019/05/72019/09/22020/06/8
		</ACCEPT_DATE>

		<ACCEPT_DATE_FA>
			1399/3/19
		</ACCEPT_DATE_FA>

		<AUTHORS>
			<AUTHOR>
				<Name>صدیقه</Name>
				<MidName></MidName>
				<Family>وحیدی فردوسی</Family>
				<NameE>Sedigheh</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Vahidi Ferdosi</FamilyE>
				<Organizations>
				<Organization>دانشگاه قم</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>s.vahidi@stu.qom.ac.ir</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>حسین</Name>
				<MidName></MidName>
				<Family>امیرخانی</Family>
				<NameE>Hossein</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Amirkhani</FamilyE>
				<Organizations>
				<Organization>دانشگاه قم</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>amirkhani@qom.ac.ir</Email>
				</EMAILS>
			</AUTHOR>
		</AUTHORS>


		<KEYWORDS>
			<KEYWORD>
				<KeyText>Weighted Ensemble Clustering</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Unsupervised Learning</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>HGPA</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>CSPA</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>AD</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>خوشه‌بندی ترکیبی وزندار</KeyText>
			</KEYWORD>

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

			<KEYWORD>
				<KeyText>HGPA</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>CSPA</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>AD</KeyText>
			</KEYWORD>
		</KEYWORDS>

		<REFRENCES>
			<REFRENCE>
				<REF>[1] J. Han, M. Kamber, and J. Pei, Data mining: concepts and techniques. Elsevier, 2011.##[2] S. Vega-Pons and J. Ruiz-Shulcloper, "a Survey of Clustering Ensemble Algorithms," Int. J. Pattern Recognit. Artif. Intell., vol. 25, no. 03, pp. 337-372, 2011.##[3] J. Kittler, M. Hatef, R. P. W. Duin, and J. Matas, "On combining classifiers," IEEE Trans. Pattern Anal. Mach. Intell., vol. 20, no. 3, pp. 226-239, 1998.##[4] S.-B. Cho and J. H. Kim, "Combining multiple neural networks by fuzzy integral for robust classification," Syst. Man Cybern. IEEE Trans., vol. 25, no. 2, pp. 380-384, 1995.##[5] J. Franke and E. Mandler, "A comparison of two approaches for combining the votes of cooperating classifiers," in Pattern Recognition, 1992. Vol. II. Conference B: Pattern Recognition Methodology and Systems, Proceedings., 11th IAPR International Conference on, 1992, pp. 611-614.##[6] L. K. Hansen and P. Salamon, "Neural network ensembles," IEEE Trans. Pattern Anal. Mach. Intell., no. 10, pp. 993-1001, 1990.##[7] S. Hashem and B. Schmeiser, "Improving model accuracy using optimal linear combinations of trained neural networks," Neural Networks, IEEE Trans., vol. 6, no. 3, pp. 792-794, 1995.##[8] J. Kittler, "Improving recognition rates by classifier combination: A theoretical framework," DAC and IS, editors, Progress in Handwriting Recognition, pp. 231-248, 1997.##[9] D. J. Miller and L. Yan, "Critic-driven ensemble classification," Signal Process. IEEE Trans., vol. 47, no. 10, pp. 2833-2844, 1999.##[10] K. W. De Bock, K. Coussement, and D. Van den Poel, "Ensemble classification based on generalized additive models," Comput. Stat. Data Anal., vol. 54, no. 6, pp. 1535-1546, 2010.##[11] C. Domeniconi and M. Al-Razgan, "Weighted cluster ensembles: Methods and analysis," ACM Trans. Knowl. Discov. from Data, vol. 2, no. 4, pp. 17, 2009.##[12] A. Strehl and J. Ghosh, "Cluster ensembles---a knowledge reuse framework for combining multiple partitions," J. Mach. Learn. Res., vol. 3, no. Dec, pp. 583-617, 2002.##[13] H. Amirkhani and M. Rahmati, "Agreement/disagreement based crowd labeling," Appl. Intell., vol. 41, no. 1, pp. 212-222, Jul. 2014.##[14] N. Littlestone and M. K. Warmuth, "The weighted majority algorithm," in Foundations of Computer Science, 1989., 30th Annual Symposium on, 1989, pp. 256-261.##[15] S. B. Kotsiantis, I. Zaharakis, and P. Pintelas, "Supervised machine learning: A review of classification techniques." Emerging Artificial Intelligence Applications in Computer Engineering, vol. 160, pp. 3-24, 2007.##[16] T. G. Dietterich, "Ensemble methods in machine learning," in International workshop on multiple classifier systems, 2000, pp. 1-15.##[17] T. Windeatt, "Vote counting measures for ensemble classifiers," Pattern Recognit., vol. 36, no. 12, pp. 2743-2756, 2003.##[18] S. Wang, A. Mathew, Y. Chen, L. Xi, L. Ma, and J. Lee, "Empirical analysis of support vector machine ensemble classifiers," Expert Syst. Appl., vol. 36, no. 3, pp. 6466-6476, 2009.##[19] A. J. C. Sharkey, Combining artificial neural nets: ensemble and modular multi-net systems. Springer Science &#38; Business Media, 2012.##[20] A. L. N. Fred and A. K. Jain, "Data clustering using evidence accumulation," in Pattern Recognition, 2002. Proceedings. 16th International Conference on, 2002, vol. 4, pp. 276-280.##[21] A. Topchy, A. K. Jain, and W. Punch, "A mixture model for clustering ensembles," in Society for Industrial and Applied Mathematics. Proceedings of the SIAM International Conference on Data Mining, 2004, pp. 379.##[22] S. Dudoit and J. Fridlyand, "Bagging to improve the accuracy of a clustering procedure," Bioinformatics, vol. 19, no. 9, pp. 1090-1099, 2003.##[23] D. Gondek and T. Hofmann, "Non-redundant clustering with conditional ensembles," in Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, 2005, pp. 70-77.##[24] A. Topchy, A. K. Jain, and W. Punch, "Combining multiple weak clusterings," in Data Mining, 2003. ICDM 2003. Third IEEE International Conference on, 2003, pp. 331-338.##[25] L. I. Kuncheva, S. T. Hadjitodorov, and Others, "Using diversity in cluster ensembles," in Systems, man and cybernetics, 2004 IEEE international conference on, 2004, vol. 2, pp. 1214-1219.##[26] B. Minaei-Bidgoli, A. Topchy, and W. F. Punch, "Ensembles of partitions via data resampling," in Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004. International Conference on, 2004, vol. 2, pp. 188-192.##[27] A. Topchy, A. K. Jain, and W. Punch, "Clustering ensembles: Models of consensus and weak partitions," Pattern Anal. Mach. Intell. IEEE Trans., vol. 27, no. 12, pp. 1866-1881, 2005.##[28] H. Alizadeh, M. Moshki, H. Parvin, B. Minaei Bidgoli, "Clustering ensemble based on combination of subset of primary clusters," Signal and Data Processing, vol. 7, no. 1, pp. 19-32, 2010.##[29] L. Franek and X. Jiang, "Ensemble clustering by means of clustering embedding in vector spaces," Pattern Recognit., vol. 47, no. 2, pp. 833-842, 2014.##[30] A. Mirzaei, "Combining hierarchical clusterings with emphasis on retaining the structural contents of the base clusterings," PhD dissertation, Amirkabir University of Technology, 2009.##[31] J. H. Friedman and J. J. Meulman, "Clustering objects on subsets of attributes," J. R. Stat. Soc. Ser. B (Statistical Methodol.), vol. 66, no. 4, pp. 815-849, 2004.##[32] C. Domeniconi, D. Gunopulos, S. Ma, B. Yan, M. Al-Razgan, and D. Papadopoulos, "Locally adaptive metrics for clustering high dimensional data," Data Min. Knowl. Discov., vol. 14, no. 1, pp. 63-97, 2007.##[33] M. Al-Razgan and C. Domeniconi, "Weighted clustering ensembles," in Proceedings of the 2006 SIAM International Conference on Data Mining, 2006, pp. 258-269.##[34] S. Vega-Pons, J. Correa-Morris, and J. Ruiz-Shulcloper, "Weighted cluster ensemble using a kernel consensus function," in Iberoamerican Congress on Pattern Recognition, 2008, pp. 195-202.##[35] S. Vega-Pons and J. Ruiz-Shulcloper, "Clustering ensemble method for heterogeneous partitions," in Iberoamerican Congress on Pattern Recognition, 2009, pp. 481-488.##[36] T. Li and C. Ding, "Weighted consensus clustering," in Proceedings of the 2008 SIAM International Conference on Data Mining, 2008, pp. 798-809.##[37] F. Gullo, A. Tagarelli, and S. Greco, "Diversity-Based Weighting Schemes for Clustering Ensembles," in Proceedings of the 2009 SIAM International Conference on Data Mining, 2009, pp. 437-448.##[38] J. W. C.-D. Huang Dong; Lai, "Ensemble clustering using factor graph," Pattern Recognit., vol. 50, pp. 131-142, 2015.##[39] H. Liu, J. Wu, T. Liu, D. Tao, and Y. Fu, "Spectral Ensemble Clustering via Weighted K-Means: Theoretical and Practical Evidence," IEEE Trans. Knowl. Data Eng., vol. 29, no. 5, pp. 1129-1143, 2017.##[40] Y. Ren, C. Domeniconi, G. Zhang, and G. Yu, "Weighted-object ensemble clustering: methods and analysis," Knowl. Inf. Syst., pp. 1-29, 2016.##[41] Q. Kang, S. Liu, M. Zhou, and S. Li, "A weight-incorporated similarity-based clustering ensemble method based on swarm intelligence," Knowledge-Based Syst., vol. 104, pp. 156-164, 2016.##[42] H. Parvin, " Clustering ensembles with weighting clusters and features," PhD dissertation, Iran University of Science &#38; Technology, 2013.##[43] A. Litifi Pakdehi, N. Daneshpour, "Cluster ensemble selection using voting," Signal and Data Processing, vol. 15, no. 4, pp. 17-30, 2019.##[44] Z. Yu and H. S. Wong, "Class discovery from gene expression data based on perturbation and cluster ensemble," IEEE Trans. Nanobioscience, vol. 8, no. 2, pp. 147-160, 2009.##[45] H. Liu, M. Shao, S. Li, and Y. Fu, "Infinite ensemble clustering," Data Min. Knowl. Discov., vol. 32, no. 2, pp. 385-416, 2018.##[46] D. Huang, C.-D. Wang, and J.-H. Lai, "Locally weighted ensemble clustering," IEEE Trans. Cybern., vol. 48, no. 5, pp. 1460-1473, 2018.##[47] C. Zhong, L. Hu, X. Yue, T. Luo, Q. Fu, and H. Xu, "Ensemble clustering based on evidence extracted from the co-association matrix," Pattern Recognit., vol. 92, pp. 93-106, 2019.##[48] F. Li, Y. Qian, J. Wang, C. Dang, and L. Jing, "Clustering ensemble based on sample's stability," Artif. Intell., vol. 273, pp. 37-55, 2019.##[49] G. Karypis and V. Kumar, "A fast and high quality multilevel scheme for partitioning irregular graphs," SIAM J. Sci. Comput., vol. 20, no. 1, pp. 359-392, 1998.##[50] G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar, "Multilevel hypergraph partitioning: applications in VLSI domain," IEEE Trans. Very Large Scale Integr. Syst., vol. 7, no. 1, pp. 69-79, 1999.##[51] L. Rokach and O. Maimon, "Clustering methods," in Data mining and knowledge discovery handbook, Springer, 2005, pp. 321-352.##[52] P. J. Rousseeuw, "Silhouettes: a graphical aid to the interpretation and validation of cluster analysis," J. Comput. Appl. Math., vol. 20, pp. 53-65, 1987.##[1] J. Han, M. Kamber, and J. Pei, Data mining: concepts and techniques. Elsevier, 2011.##[2] S. Vega-Pons and J. Ruiz-Shulcloper, "a Survey of Clustering Ensemble Algorithms," Int. J. Pattern Recognit. Artif. Intell., vol. 25, no. 03, pp. 337-372, 2011.##[3] J. Kittler, M. Hatef, R. P. W. Duin, and J. Matas, "On combining classifiers," IEEE Trans. Pattern Anal. Mach. Intell., vol. 20, no. 3, pp. 226-239, 1998.##[4] S.-B. Cho and J. H. Kim, "Combining multiple neural networks by fuzzy integral for robust classification," Syst. Man Cybern. IEEE Trans., vol. 25, no. 2, pp. 380-384, 1995.##[5] J. Franke and E. Mandler, "A comparison of two approaches for combining the votes of cooperating classifiers," in Pattern Recognition, 1992. Vol. II. Conference B: Pattern Recognition Methodology and Systems, Proceedings., 11th IAPR International Conference on, 1992, pp. 611-614.##[6] L. K. Hansen and P. Salamon, "Neural network ensembles," IEEE Trans. Pattern Anal. Mach. Intell., no. 10, pp. 993-1001, 1990.##[7] S. Hashem and B. Schmeiser, "Improving model accuracy using optimal linear combinations of trained neural networks," Neural Networks, IEEE Trans., vol. 6, no. 3, pp. 792-794, 1995.##[8] J. Kittler, "Improving recognition rates by classifier combination: A theoretical framework," DAC and IS, editors, Progress in Handwriting Recognition, pp. 231-248, 1997.##[9] D. J. Miller and L. Yan, "Critic-driven ensemble classification," Signal Process. IEEE Trans., vol. 47, no. 10, pp. 2833-2844, 1999.##[10] K. W. De Bock, K. Coussement, and D. Van den Poel, "Ensemble classification based on generalized additive models," Comput. Stat. Data Anal., vol. 54, no. 6, pp. 1535-1546, 2010.##[11] C. Domeniconi and M. Al-Razgan, "Weighted cluster ensembles: Methods and analysis," ACM Trans. Knowl. Discov. from Data, vol. 2, no. 4, pp. 17, 2009.##[12] A. Strehl and J. Ghosh, "Cluster ensembles---a knowledge reuse framework for combining multiple partitions," J. Mach. Learn. Res., vol. 3, no. Dec, pp. 583-617, 2002.##[13] H. Amirkhani and M. Rahmati, "Agreement/disagreement based crowd labeling," Appl. Intell., vol. 41, no. 1, pp. 212-222, Jul. 2014.##[14] N. Littlestone and M. K. Warmuth, "The weighted majority algorithm," in Foundations of Computer Science, 1989., 30th Annual Symposium on, 1989, pp. 256-261.##[15] S. B. Kotsiantis, I. Zaharakis, and P. Pintelas, "Supervised machine learning: A review of classification techniques." Emerging Artificial Intelligence Applications in Computer Engineering, vol. 160, pp. 3-24, 2007.##[16] T. G. Dietterich, "Ensemble methods in machine learning," in International workshop on multiple classifier systems, 2000, pp. 1-15.##[17] T. Windeatt, "Vote counting measures for ensemble classifiers," Pattern Recognit., vol. 36, no. 12, pp. 2743-2756, 2003.##[18] S. Wang, A. Mathew, Y. Chen, L. Xi, L. Ma, and J. Lee, "Empirical analysis of support vector machine ensemble classifiers," Expert Syst. Appl., vol. 36, no. 3, pp. 6466-6476, 2009.##[19] A. J. C. Sharkey, Combining artificial neural nets: ensemble and modular multi-net systems. Springer Science &#38; Business Media, 2012.##[20] A. L. N. Fred and A. K. Jain, "Data clustering using evidence accumulation," in Pattern Recognition, 2002. Proceedings. 16th International Conference on, 2002, vol. 4, pp. 276-280.##[21] A. Topchy, A. K. Jain, and W. Punch, "A mixture model for clustering ensembles," in Society for Industrial and Applied Mathematics. Proceedings of the SIAM International Conference on Data Mining, 2004, pp. 379.##[22] S. Dudoit and J. Fridlyand, "Bagging to improve the accuracy of a clustering procedure," Bioinformatics, vol. 19, no. 9, pp. 1090-1099, 2003.##[23] D. Gondek and T. Hofmann, "Non-redundant clustering with conditional ensembles," in Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, 2005, pp. 70-77.##[24] A. Topchy, A. K. Jain, and W. Punch, "Combining multiple weak clusterings," in Data Mining, 2003. ICDM 2003. Third IEEE International Conference on, 2003, pp. 331-338.##[25] L. I. Kuncheva, S. T. Hadjitodorov, and Others, "Using diversity in cluster ensembles," in Systems, man and cybernetics, 2004 IEEE international conference on, 2004, vol. 2, pp. 1214-1219.##[26] B. Minaei-Bidgoli, A. Topchy, and W. F. Punch, "Ensembles of partitions via data resampling," in Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004. International Conference on, 2004, vol. 2, pp. 188-192.##[27] A. Topchy, A. K. Jain, and W. Punch, "Clustering ensembles: Models of consensus and weak partitions," Pattern Anal. Mach. Intell. IEEE Trans., vol. 27, no. 12, pp. 1866-1881, 2005.##[28] علیزاده حسین، مشکی محسن، پروین حمید و مینایی بیدگلی بهروز، "خوشه‌بندی ترکیبی مبتنی بر زیرمجموعه‌ای از خوشه‌های اولیّه", پردازش علائم و داده‌ها، ۱۳۸۹، ۷ (۱): ۱۹-۳۲.##[28] H. Alizadeh, M. Moshki, H. Parvin, B. Minaei Bidgoli, "Clustering ensemble based on combination of subset of primary clusters," Signal and Data Processing, vol. 7, no. 1, pp. 19-32, 2010.##[29] L. Franek and X. Jiang, "Ensemble clustering by means of clustering embedding in vector spaces," Pattern Recognit., vol. 47, no. 2, pp. 833-842, 2014.##[30] میرزایی عبدالرضا، "ترکیب خوشه‌بندی‌های سلسله‌مراتبی با تأکید بر حفظ اطلاعات ساختاری خوشه‌بندی‌های پایه"، دانشگاه صنعتی امیر کبیر، 1388.##[30] A. Mirzaei, "Combining hierarchical clusterings with emphasis on retaining the structural contents of the base clusterings," PhD dissertation, Amirkabir University of Technology, 2009.##[31] J. H. Friedman and J. J. Meulman, "Clustering objects on subsets of attributes," J. R. Stat. Soc. Ser. B (Statistical Methodol.), vol. 66, no. 4, pp. 815-849, 2004.##[32] C. Domeniconi, D. Gunopulos, S. Ma, B. Yan, M. Al-Razgan, and D. Papadopoulos, "Locally adaptive metrics for clustering high dimensional data," Data Min. Knowl. Discov., vol. 14, no. 1, pp. 63-97, 2007.##[33] M. Al-Razgan and C. Domeniconi, "Weighted clustering ensembles," in Proceedings of the 2006 SIAM International Conference on Data Mining, 2006, pp. 258-269.##[34] S. Vega-Pons, J. Correa-Morris, and J. Ruiz-Shulcloper, "Weighted cluster ensemble using a kernel consensus function," in Iberoamerican Congress on Pattern Recognition, 2008, pp. 195-202.##[35] S. Vega-Pons and J. Ruiz-Shulcloper, "Clustering ensemble method for heterogeneous partitions," in Iberoamerican Congress on Pattern Recognition, 2009, pp. 481-488.##[36] T. Li and C. Ding, "Weighted consensus clustering," in Proceedings of the 2008 SIAM International Conference on Data Mining, 2008, pp. 798-809.##[37] F. Gullo, A. Tagarelli, and S. Greco, "Diversity-Based Weighting Schemes for Clustering Ensembles," in Proceedings of the 2009 SIAM International Conference on Data Mining, 2009, pp. 437-448.##[38] J. W. C.-D. Huang Dong; Lai, "Ensemble clustering using factor graph," Pattern Recognit., vol. 50, pp. 131-142, 2015.##[39] H. Liu, J. Wu, T. Liu, D. Tao, and Y. Fu, "Spectral Ensemble Clustering via Weighted K-Means: Theoretical and Practical Evidence," IEEE Trans. Knowl. Data Eng., vol. 29, no. 5, pp. 1129-1143, 2017.##[40] Y. Ren, C. Domeniconi, G. Zhang, and G. Yu, "Weighted-object ensemble clustering: methods and analysis," Knowl. Inf. Syst., pp. 1-29, 2016.##[41] Q. Kang, S. Liu, M. Zhou, and S. Li, "A weight-incorporated similarity-based clustering ensemble method based on swarm intelligence," Knowledge-Based Syst., vol. 104, pp. 156-164, 2016.##[42] پروین حمید، "خوشه بندی ترکیبی با وزن دهی توام خوشه ها و ویژگی ها"، دانشگاه علم و صنعت ایران، 1392.##[42] H. Parvin, " Clustering ensembles with weighting clusters and features," PhD dissertation, Iran University of Science &#38; Technology, 2013.##[43] لطیفی پاکدهی علیرضا، دانشپور نگین, "انتخاب اعضای ترکیب در خوشه‌بندی ترکیبی با استفاده از رأی‌گیری," پردازش علائم و داده‌ها، ۱۳۹۷، ۱۵ (۴): ۱۷-۳۰.##[43] A. Litifi Pakdehi, N. Daneshpour, "Cluster ensemble selection using voting," Signal and Data Processing, vol. 15, no. 4, pp. 17-30, 2019.##[44] Z. Yu and H. S. Wong, "Class discovery from gene expression data based on perturbation and cluster ensemble," IEEE Trans. Nanobioscience, vol. 8, no. 2, pp. 147-160, 2009.##[45] H. Liu, M. Shao, S. Li, and Y. Fu, "Infinite ensemble clustering," Data Min. Knowl. Discov., vol. 32, no. 2, pp. 385-416, 2018.##[46] D. Huang, C.-D. Wang, and J.-H. Lai, "Locally weighted ensemble clustering," IEEE Trans. Cybern., vol. 48, no. 5, pp. 1460-1473, 2018.##[47] C. Zhong, L. Hu, X. Yue, T. Luo, Q. Fu, and H. Xu, "Ensemble clustering based on evidence extracted from the co-association matrix," Pattern Recognit., vol. 92, pp. 93-106, 2019.##[48] F. Li, Y. Qian, J. Wang, C. Dang, and L. Jing, "Clustering ensemble based on sample's stability," Artif. Intell., vol. 273, pp. 37-55, 2019.##[49] G. Karypis and V. Kumar, "A fast and high quality multilevel scheme for partitioning irregular graphs," SIAM J. Sci. Comput., vol. 20, no. 1, pp. 359-392, 1998.##[50] G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar, "Multilevel hypergraph partitioning: applications in VLSI domain," IEEE Trans. Very Large Scale Integr. Syst., vol. 7, no. 1, pp. 69-79, 1999.##[51] L. Rokach and O. Maimon, "Clustering methods," in Data mining and knowledge discovery handbook, Springer, 2005, pp. 321-352.##[52] P. J. Rousseeuw, "Silhouettes: a graphical aid to the interpretation and validation of cluster analysis," J. Comput. Appl. Math., vol. 20, pp. 53-65, 1987.## ##</REF>
			</REFRENCE>
		</REFRENCES>

	</ARTICLE>


	<ARTICLE> 
		<TitleF>مدل‌‌سازی شبکه‌‌های تنظیم ژنی: مدل‌های کلاسیک، اختلال بهینه برای شناسایی شبکه</TitleF>
		<TitleE>Modeling gene regulatory networks: Classical models, optimal perturbation for identification of network</TitleE>
		<TitleLang_ID>1</TitleLang_ID>
		<ABSTRACTS>
			<ABSTRACT>
			<Language_ID>1</Language_ID>
			<CONTENT>ارتقای عمق و گستره درک ما از دانش زیست&#8207;شناسی ملکولی، از یک سو امکان بهره&#8207;&#8204;برداری از آن را در توسعه فناوری&#173;هایی مانند رمزگشایی فراهم ساخته است و از سوی دیگر، مداخله در سیستم ژنتیکی را امکان&#8207;&#8204;پذیر می&#8207;سازد که نویدبخش آینده&#8207;ای روشن برای علوم زیستی و پزشکی است. دست&#8204;&#8204;یابی به این هدف با مداخله در شبکه تنظیم ژنی (GRN) امکان&#8207;پذیر می&#173;شود؛ زیرا GRN کنترل&#8204;کننده فعالیت&#8207;های زیستی در سطح ملکولی است. در این مسیر، شناسایی GRN، شامل شناسایی مرز، ساختار و گره&#8204;&#173;های شبکه اهمیت به&#8207;سزایی دارد. در این مقاله به دو جنبه ساختار و گره در مدل&#8207;سازی و شناسایی GRN در شبکه&#8207;های بزرگ (با بیش از پنجاه گره) پرداخته می&#8207;شود. نخست محدودیت&#8207;&#8204;های کاربست مدل&#8204;های احتمالاتی برای گره (ژن) مورد بررسی قرار می&#8207;&#8204;گیرد. همچنین محدودیت&#8207;&#8204;های کاربست مدل چند-درختی برای ساختار GRN مورد بررسی قرار می&#8207;&#8204;گیرد. در بخش اصلی مقاله، مسأله شناسایی GRN با مدل بولی مورد بحث قرار گرفته و نشان داده می&#8207;&#8204;شود که بر&#8204;خلاف تصور معمول، آزمایش بهینه از دید شناسایی ساختار GRN، آزمایش تک&#8204;اختلال است.</CONTENT>
			</ABSTRACT>
			<ABSTRACT>
			<Language_ID>2</Language_ID>
			<CONTENT>Deep understanding of molecular biology has allowed emergence of new technologies like DNA decryption.&#160; On the other hand, advancements of molecular biology have made manipulation of genetic systems simpler than ever; this promises extraordinary progress in biological, medical and biotechnological applications.&#160; This is not an unrealistic goal since genes which are regulated by gene regulatory networks (GRNs) are the core governors of life processes at the molecular level. In fact, manipulation of GRNs would be the ultimate strategy for optimal purposeful control of cell&#8217;s life.&#160; GRNs are in charge of regulating the amounts of all the inter-cellular as well as intra-cellular molecular species produced all the time in all living organisms.&#160; Manipulation of a GRN requires comprehensive knowledge about nodes and interconnections.&#160; This paper deals with both aspects in networks having more than fifty nodes.&#160; In the first part of the paper, restrictions of probabilistic models in modeling node behavior are discussed, i.e.: 1) unfeasibility of reliably predicting the next state of GRN based on its current state, 2) impossibility of modelling logical relations among genes, and 3) scarcity of biological data needed for model identification.&#160; These findings which are supported by arguments from probability theory suggest that probabilistic models should not be used for analysis and prediction of node behavior in GRNs.&#160; Next part of the paper focuses on models of GRN structure.&#160; It is shown that the use of multi-tree models for structure for GRN poses severe limitations on network behavior, i.e. 1) increase in signal entropy while passing through the network, 2) decrease in signal bandwidth while passing through the network, and 3) lack of feedback as a key element for oscillatory and/or autonomous behavior (a requirement for any biological network).&#160; To demonstrate that, these restrictions are consequences of model selection, we use information theoretic arguments.&#160; At the last and the most important part of the paper we look into the gene perturbation experiments from a network-theoretic perspective to show that multi-perturbation experiments are not as informative as assumed so far.&#160; A generally accepted belief among researches states that multi-perturbation experiments are more informative than single-perturbation ones, i.e., multiple simultaneously applied perturbations provide more information than a single perturbation.&#160; It is shown that single-perturbation experiments are optimal for identification of network structure, provided the ultimate goal is to discover correct subnet structures.&#160;</CONTENT>
			</ABSTRACT>
		</ABSTRACTS>

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

		<RECEIVE_DATE>
			2018/09/152017/07/302018/10/222018/08/182018/09/22018/09/132017/11/302018/10/23
		</RECEIVE_DATE>

		<RECEIVE_DATE_FA>
			1397/8/1
		</RECEIVE_DATE_FA>

		<ACCEPT_DATE>
			2019/09/22020/06/22019/09/22019/11/32019/05/72019/09/22020/06/82019/01/26
		</ACCEPT_DATE>

		<ACCEPT_DATE_FA>
			1397/11/6
		</ACCEPT_DATE_FA>

		<AUTHORS>
			<AUTHOR>
				<Name>رضا</Name>
				<MidName></MidName>
				<Family>بیات</Family>
				<NameE>Reza</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Bayat</FamilyE>
				<Organizations>
				<Organization>دانشگاه یزد</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>Bayatr@semnan.ac.ir</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>مهدی</Name>
				<MidName></MidName>
				<Family>صادقی</Family>
				<NameE>Mehdi</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Sadeghi</FamilyE>
				<Organizations>
				<Organization>پژوهشکده زیست‌فناوری پزشکی، پژوهشگاه ملی مهندسی ژنتیک و زیست‌فناوری</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>Sadeghi@nigeb.ac.ir</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>محمد رضا</Name>
				<MidName></MidName>
				<Family>عارف</Family>
				<NameE>Mohammad Reza</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Aref</FamilyE>
				<Organizations>
				<Organization>دانشگاه صنعتی شریف و دانشگاه یزد</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>Aref@sharif.ac.ir</Email>
				</EMAILS>
			</AUTHOR>
		</AUTHORS>


		<KEYWORDS>
			<KEYWORD>
				<KeyText>gene regulatory network (GRN)</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>probabilistic model of gene</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>multi-tree model of GRN structure</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Boolean model of gene</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>optimal perturbation experiment</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]G. Battail, "Heredity as an encoded communication process," IEEE Trans. Information Theory, vol. 56, no. 2, pp. 678-687, Feb. 2010.##[2] L. M. Adleman, "Molecular computation of solutions to combinatorial problems," Science, vol. 266, no. 11, pp. 1021-1025, Nov. 1994.##[3] S. A. Salehi, et al, "Computing mathematical functions using DNA via fractional coding," Nature Genetics, May 2018.##[4] S. M. H. Tabatabaei Yazdi, et al, "Mutually uncorrelated primers for DNA-based data storage," IEEE Trans. Information Theory, vol. 64, no. 9, pp. 6283-6296, Sept. 2018.##[5] M. K. Gupta, "Quest for error correction in biology," IEEE Eng. in Medicine and Biology Mag, vol. 26, no. 1, Jan. 2006.##[6] B. Alberts, et al, Molecular biology of the cell, 6th edition, Garland Science, New York, 2014.##[7] S. Das, et al, Handbook of research on computational methodologies in gene regulatory networks, Hershey, New York, 2010.##[8] J. J. Pasternak, An introduction to human molecular genetics: Mechanisms of inherited diseases, 2nd edition, Wiley, New York, 2005.##[9] Beom S. Lee, et al, "A computational algorithm for personalized medicine in schizophrenia," Schizophrenia Research, vol. 192, pp. 131-136, Feb. 2018.##[10] N. Kornienko, et al, "Interfacing nature's catalytic machinery with synthetic materials for semi-artificial photosynthesis," Nature Nanotechnology, vol. 13, pp. 890-899, Oct. 2018.##[11] M.Banf, Seung Y. Rhee, "Computational inference of gene regulatory networks: Approaches, limitations and opportunities," Biochimica et Biophysica Acta, vol. 1860, no. 1, pp. 41-52, Jan 2017.##[12] N. Friedman, et al, "Using Bayesian networks to analyze expression data," J. Computational Biology, vol. 7, no. 3, pp. 601-620, March 2000.##[13] F. Fages, et al, "Influence networks compared with reaction networks: Semantics, expressivity and attractors," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 15, no. 4, pp. 1138 - 1151, July 2018.##[14] Y. Li, "The max-min high-order dynamic Bayesian network for learning gene regulatory networks with time-delayed regulations," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 13, no. 4, pp. 792-803, July 2016.##[15] H. Chen, et al, "Bayesian data fusion of gene expression and histone modification profiles for inference of gene regulatory network," IEEE/ACM Trans. Computational Biology and Bioinformatics, doi: 10.1109/TCBB.2018.2869590, early access, Sep. 2018.##[16] M. Shi, et al, "Adaptive modelling of gene regulatory network using Bayesian information criterion-guided sparse regression approach," IET Systems Biology, vol. 10, no. 6, pp. 252-59, June 2016.##[17] S. Chan, et al, "Maximum a posteriori probability and time-varying approach for inferring gene regulatory networks from time course gene microarray data," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 12, no. 1, pp. 123 - 135, Jan. 2015.##[18] H. Xu, et al, "Construction and validation of a regulatory network for pluripotency and self-renewal of mouse embryonic stem cells," PLoS One Computational Biology, vol. 10, no. 8, pp. 1-14, Aug. 2014.##[19] S. Mehra, W. Hu, G. Karypis, "A Boolean algorithm for reconstructing the structure of regulatory networks," Metabolic Engineering, vol. 6, no. 4, pp. 326-39, Nov. 2004.##[20] S. A. Kauffman, "Metabolic stability and epigenesis in randomly constructed genetic nets, J. of Theoretical Biology, vol. 22, no. 3, pp. 437-67, March 1969.##[21] S. A. Kauffman, "The large-scale structure and dynamics of gene control circuits: an ensemble approach," J. of Theoretical Biology, vol. 44, no. 1, pp. 167-90, March 1974.##[22] J. I. Joo, et al, "Determining relative dynamic stability of cell states using Boolean network mode," Nature Scientific Reports, vol. 8, no. 1, online, Aug. 2018.##[23] www.humancellatlas.org, accessed Sep. 2018.##[24] H. P. Yockey, Information theory, evolution and origin of life, 2nd edition, Cambridge University Press, New York, 2011.##[25] S. L. Salzberg, et al, "Open questions: How many genes do we have?" BMC Biology, vol. 16, no. 1, online, Aug. 2018.##[26] Y. Lee, Qing Zhou, "Co-regulation in embryonic stem cells via context-dependent binding of transcription factors," Bioinformatics, vol. 29, no. 17, pp. 2162-68, Sept. 2013.##[27] A. J. M. Walhout, "What does biologically meaningful mean? A perspective on gene regulatory network validation," Genome Biology, vol. 12, no. 4, online, April 2011.##[28] M. Hecker, et al, "Gene regulatory network inference: Data integration in dynamic models - a review," BioSystems, vol. 96, no. 1, pp. 86-103, April 2009.##[29] W. Lee, W.S. Tzou, "Computational methods for discovering gene networks from expression data," Briefings in Bioinformatics, vol. 10, no. 4, pp. 408-23, July 2009.##[30] Q. Zhang et al, "Using single-index ODEs to study dynamic gene regulatory networks," PLoS One Computational Biology, vol. 13, no. 2, online, Feb. 2018.##[31] T. M. Cover, J. A. Thomas, Elements of information theory, 2nd edition, Wiley, New York, 2006.##[32] K. Do, P. Muller, M. Vannucci, Bayesian inference for gene expression and proteomics, Cambridge University Press, New York, 2006.##[33] P. Lin and S. P. Khatri, "Determining gene function in Boolean networks using Boolean satisfiability," IEEE Int'l Workshop on Genomic Signal Processing and Statistics (GENSIPS), San Antonio, Dec. 2012.##[34] T. E. Ideker, V. Thorsson, R. M. Karp, "Discovery of regulatory interactions through perturbation: Inference and experimental design," Proc. Pacific Symposiums on Biocomputing, pp. 305-316, Hawaii, Jan. 2000.##[35] A. Kaufman, M. Kupiec, E. Ruppin, "Multi-knockout genetic network analysis: the Rad6 example, Proc. IEEE Computational Systems and Bioinformatics (CSB) Conference, pp. 332-340, Stanford, California, Feb 2004.##[36] A. Kaufman, et al, "Quantitative analysis of genetic and neuronal multi-perturbation experiments," PLoS One Computational Biology, vol. 1, no. 6, online, Nov. 2005.##[37] R. Dehghannasiri, B. Yoon, Edward R. Dougherty, "Optimal experimental design for gene regulatory networks in the presence of uncertainty," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 12, no. 4, pp. 938-950, July 2015.##[38] A. R. Alizad-Rahvar, M. Sadeghi, "Integrative perturbation analysis of logic-based models of gene regulatory networks," PLoS One Computational Biology, Accepted, Oct. 2018.##[1]G. Battail, "Heredity as an encoded communication process," IEEE Trans. Information Theory, vol. 56, no. 2, pp. 678-687, Feb. 2010.##[2] L. M. Adleman, "Molecular computation of solutions to combinatorial problems," Science, vol. 266, no. 11, pp. 1021-1025, Nov. 1994.##[3] S. A. Salehi, et al, "Computing mathematical functions using DNA via fractional coding," Nature Genetics, May 2018.##[4] S. M. H. Tabatabaei Yazdi, et al, "Mutually uncorrelated primers for DNA-based data storage," IEEE Trans. Information Theory, vol. 64, no. 9, pp. 6283-6296, Sept. 2018.##[5] M. K. Gupta, "Quest for error correction in biology," IEEE Eng. in Medicine and Biology Mag, vol. 26, no. 1, Jan. 2006.##[6] B. Alberts, et al, Molecular biology of the cell, 6th edition, Garland Science, New York, 2014.##[7] S. Das, et al, Handbook of research on computational methodologies in gene regulatory networks, Hershey, New York, 2010.##[8] J. J. Pasternak, An introduction to human molecular genetics: Mechanisms of inherited diseases, 2nd edition, Wiley, New York, 2005.##[9] Beom S. Lee, et al, "A computational algorithm for personalized medicine in schizophrenia," Schizophrenia Research, vol. 192, pp. 131-136, Feb. 2018.##[10] N. Kornienko, et al, "Interfacing nature's catalytic machinery with synthetic materials for semi-artificial photosynthesis," Nature Nanotechnology, vol. 13, pp. 890-899, Oct. 2018.##[11] M.Banf, Seung Y. Rhee, "Computational inference of gene regulatory networks: Approaches, limitations and opportunities," Biochimica et Biophysica Acta, vol. 1860, no. 1, pp. 41-52, Jan 2017.##[12] N. Friedman, et al, "Using Bayesian networks to analyze expression data," J. Computational Biology, vol. 7, no. 3, pp. 601-620, March 2000.##[13] F. Fages, et al, "Influence networks compared with reaction networks: Semantics, expressivity and attractors," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 15, no. 4, pp. 1138 - 1151, July 2018.##[14] Y. Li, "The max-min high-order dynamic Bayesian network for learning gene regulatory networks with time-delayed regulations," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 13, no. 4, pp. 792-803, July 2016.##[15] H. Chen, et al, "Bayesian data fusion of gene expression and histone modification profiles for inference of gene regulatory network," IEEE/ACM Trans. Computational Biology and Bioinformatics, doi: 10.1109/TCBB.2018.2869590, early access, Sep. 2018.##[16] M. Shi, et al, "Adaptive modelling of gene regulatory network using Bayesian information criterion-guided sparse regression approach," IET Systems Biology, vol. 10, no. 6, pp. 252-59, June 2016.##[17] S. Chan, et al, "Maximum a posteriori probability and time-varying approach for inferring gene regulatory networks from time course gene microarray data," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 12, no. 1, pp. 123 - 135, Jan. 2015.##[18] H. Xu, et al, "Construction and validation of a regulatory network for pluripotency and self-renewal of mouse embryonic stem cells," PLoS One Computational Biology, vol. 10, no. 8, pp. 1-14, Aug. 2014.##[19] S. Mehra, W. Hu, G. Karypis, "A Boolean algorithm for reconstructing the structure of regulatory networks," Metabolic Engineering, vol. 6, no. 4, pp. 326-39, Nov. 2004.##[20] S. A. Kauffman, "Metabolic stability and epigenesis in randomly constructed genetic nets, J. of Theoretical Biology, vol. 22, no. 3, pp. 437-67, March 1969.##[21] S. A. Kauffman, "The large-scale structure and dynamics of gene control circuits: an ensemble approach," J. of Theoretical Biology, vol. 44, no. 1, pp. 167-90, March 1974.##[22] J. I. Joo, et al, "Determining relative dynamic stability of cell states using Boolean network mode," Nature Scientific Reports, vol. 8, no. 1, online, Aug. 2018.##[23] www.humancellatlas.org, accessed Sep. 2018.##[24] H. P. Yockey, Information theory, evolution and origin of life, 2nd edition, Cambridge University Press, New York, 2011.##[25] S. L. Salzberg, et al, "Open questions: How many genes do we have?" BMC Biology, vol. 16, no. 1, online, Aug. 2018.##[26] Y. Lee, Qing Zhou, "Co-regulation in embryonic stem cells via context-dependent binding of transcription factors," Bioinformatics, vol. 29, no. 17, pp. 2162-68, Sept. 2013.##[27] A. J. M. Walhout, "What does biologically meaningful mean? A perspective on gene regulatory network validation," Genome Biology, vol. 12, no. 4, online, April 2011.##[28] M. Hecker, et al, "Gene regulatory network inference: Data integration in dynamic models - a review," BioSystems, vol. 96, no. 1, pp. 86-103, April 2009.##[29] W. Lee, W.S. Tzou, "Computational methods for discovering gene networks from expression data," Briefings in Bioinformatics, vol. 10, no. 4, pp. 408-23, July 2009.##[30] Q. Zhang et al, "Using single-index ODEs to study dynamic gene regulatory networks," PLoS One Computational Biology, vol. 13, no. 2, online, Feb. 2018.##[31] T. M. Cover, J. A. Thomas, Elements of information theory, 2nd edition, Wiley, New York, 2006.##[32] K. Do, P. Muller, M. Vannucci, Bayesian inference for gene expression and proteomics, Cambridge University Press, New York, 2006.##[33] P. Lin and S. P. Khatri, "Determining gene function in Boolean networks using Boolean satisfiability," IEEE Int'l Workshop on Genomic Signal Processing and Statistics (GENSIPS), San Antonio, Dec. 2012.##[34] T. E. Ideker, V. Thorsson, R. M. Karp, "Discovery of regulatory interactions through perturbation: Inference and experimental design," Proc. Pacific Symposiums on Biocomputing, pp. 305-316, Hawaii, Jan. 2000.##[35] A. Kaufman, M. Kupiec, E. Ruppin, "Multi-knockout genetic network analysis: the Rad6 example, Proc. IEEE Computational Systems and Bioinformatics (CSB) Conference, pp. 332-340, Stanford, California, Feb 2004.##[36] A. Kaufman, et al, "Quantitative analysis of genetic and neuronal multi-perturbation experiments," PLoS One Computational Biology, vol. 1, no. 6, online, Nov. 2005.##[37] R. Dehghannasiri, B. Yoon, Edward R. Dougherty, "Optimal experimental design for gene regulatory networks in the presence of uncertainty," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 12, no. 4, pp. 938-950, July 2015.##[38] A. R. Alizad-Rahvar, M. Sadeghi, "Integrative perturbation analysis of logic-based models of gene regulatory networks," PLoS One Computational Biology, Accepted, Oct. 2018.## ##</REF>
			</REFRENCE>
		</REFRENCES>

	</ARTICLE>


	<ARTICLE> 
		<TitleF>طبقه‌‎بندی سیگنال‎های مغزی EEG برای تشخیص بین دو واژه در گفتار خاموش</TitleF>
		<TitleE>Classification of EEG Signals for Discrimination of Two Imagined Words</TitleE>
		<TitleLang_ID>1</TitleLang_ID>
		<ABSTRACTS>
			<ABSTRACT>
			<Language_ID>1</Language_ID>
			<CONTENT>در این پژوهش، یک رابط مغز-رایانه در کاربرد مکالمه خاموش برای شناسایی و تفکیک بین دو واژه پیاده&#8206;سازی شده &#8206;است. در طی آزمایش، بر اساس یک زمان&#8204;بندی مشخص، افراد یکی از دو واژه یا سکوت را&#160; که به&#8204;صورت تصادفی انتخاب شده &#8206;است، بدون آن&#8204;که برزبان آورند؛ در ذهن خود تکرار می&#8206;کنند و سیگنال&#8206;های مغزی آنان توسط یک دستگاه ثبت EEG آزمایشگاهی چهارده کاناله ثبت می&#8206;شود. پس از پیش&#8206;پردازش و حذف داده&#8206;های مخدوش، ویژگی&#8206;های مناسب از این سیگنال&#8206;ها استخراج و برای شناسایی به یک رده&#8206;بند داده می&#8206;شود. دو ترکیب برای استخراج ویژگی و رده&#8204;بندی انتخاب و بررسی شدند: استخراج ضرایب ویولت همراه با رده&#8204;&#8206;بند SVM و ویژگی حاصل از تحلیل مؤلفه&#8206;های اساسی همراه با رده&#8204;&#8206;بند کمینه فاصله که ترکیب نخست عملکرد بهتری از خود نشان داد. تعداد کل رده&#8204;&#8206;ها در این آزمایش سه عدد بوده که شامل دو واژه منتخب و سکوت می&#8206;باشد. نتایج حاصل، نشان&#8204;دهنده امکان تفکیک واژگان با دقت متوسط 8/56 درصد (بیش از 7/1 برابر نرخ تصادف) است که در سازگاری با نتایج گزارش&#8204;شده در فعالیت&#8206;های مشابه است؛ اما هنوز دقت کافی برای کاربردهای واقعی ندارد.</CONTENT>
			</ABSTRACT>
			<ABSTRACT>
			<Language_ID>2</Language_ID>
			<CONTENT>In this study, a Brain-Computer Interface (BCI) in Silent-Talk application was implemented. The goal was an electroencephalograph (EEG) classifier for three different classes including two imagined words (Man and Red) and the silence. During the experiment, subjects were requested to silently repeat one of the two words or do nothing in a pre-selected random order. EEG signals were recorded by a 14 channel EMOTIV wireless headset. Two combinations of features and classifiers were used: Discrete Wavelet Transform (DWT) features with Support Vector Machine (SVM) classifier and Principle Component Analysis (PCA) features with a Minimum-Distance classifier. Both combinations were capable of discriminating between the three classes much better than the chance level (33.3%), none of them was reliable and accurate enough for a real application though. The first method (DWT+SVM) showed better results. In this case, feature set was D2, D3, D4 and A4 coefficients of 4-level DWT decomposition of the EEG signals, roughly corresponding to major frequency bands (Delta, Theta, Alpha and Beta) of these signals. Three binary SVM machines were used. Each machine was trained to classify between two of the three classes, namely Man/Red, Man/Silence or Red/Silence. Majority Selection Rule was used to determine final class. Once two of these classifiers presented the true class, a win (correct classification) was counted, otherwise a loss (false classification) was considered. Finally, Monte-Carlo Cross Validation showed an overall performance of about 56.8% correct classification which is comparable with the results reported for similar experiments.</CONTENT>
			</ABSTRACT>
		</ABSTRACTS>

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

		<RECEIVE_DATE>
			2018/09/152017/07/302018/10/222018/08/182018/09/22018/09/132017/11/302018/10/232018/05/6
		</RECEIVE_DATE>

		<RECEIVE_DATE_FA>
			1397/2/16
		</RECEIVE_DATE_FA>

		<ACCEPT_DATE>
			2019/09/22020/06/22019/09/22019/11/32019/05/72019/09/22020/06/82019/01/262020/05/13
		</ACCEPT_DATE>

		<ACCEPT_DATE_FA>
			1399/2/24
		</ACCEPT_DATE_FA>

		<AUTHORS>
			<AUTHOR>
				<Name>محمدرضا</Name>
				<MidName></MidName>
				<Family>اصغری بجستانی</Family>
				<NameE>Mohammad Reza</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Asghari Bejestani</FamilyE>
				<Organizations>
				<Organization>پژوهشکده برق و فناوری ‎اطلاعات، سازمان پژوهش‌های علمی و صنعتی ایران</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>bejestani@irost.ir</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>غلامرضا</Name>
				<MidName></MidName>
				<Family>محمدخانی</Family>
				<NameE>Gholam Reza</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Mohammadkhani</FamilyE>
				<Organizations>
				<Organization>پژوهشکده برق و فناوری ‎اطلاعات، سازمان پژوهش‌های علمی و صنعتی ایران</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>mohammadkhani@irost.org</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>سعید</Name>
				<MidName></MidName>
				<Family>گرگین</Family>
				<NameE>Saeed</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Gorgin</FamilyE>
				<Organizations>
				<Organization>پژوهشکده برق و فناوری ‎اطلاعات، سازمان پژوهش‌های علمی و صنعتی ایران</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>gorgin@irost.ir</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>وحیدرضا</Name>
				<MidName></MidName>
				<Family>نفیسی</Family>
				<NameE>Vahid Reza</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Nafisi</FamilyE>
				<Organizations>
				<Organization>پژوهشکده برق و فناوری ‎اطلاعات، سازمان پژوهش‌های علمی و صنعتی ایران</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>vr_nafisi@irost.org</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>غلامرضا</Name>
				<MidName></MidName>
				<Family>فراهانی</Family>
				<NameE>Ghaolam Reza</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Farahani</FamilyE>
				<Organizations>
				<Organization>پژوهشکده برق و فناوری ‎اطلاعات، سازمان پژوهش‌های علمی و صنعتی ایران</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>farahani.gh@irost.org</Email>
				</EMAILS>
			</AUTHOR>
		</AUTHORS>


		<KEYWORDS>
			<KEYWORD>
				<KeyText>Silent Talk</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Imagined Speech</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>EEG signals</KeyText>
			</KEYWORD>

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

			<KEYWORD>
				<KeyText>Brain-Computer interface</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>مکالمه خاموش</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>رابط‌ ‎مغز-رایانه</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>تصور گفتار</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>سیگنال‎های مغزی</KeyText>
			</KEYWORD>
		</KEYWORDS>

		<REFRENCES>
			<REFRENCE>
				<REF>[1] N. Birbaumer and L. G. Cohen, "Brain-computer interfaces: communication and resto-ration of movement in paralysis", The Journal of physiology, vol. 579, no. 3, pp. 621-636, 2007.##[2] Ivan S. Kotchetkov, Brian Y. Hwang and et. al., "Brain-computer Interfaces: military, neuro-surgical and ethical prespective", Neurosurg Focus, vol. 28, no. 5, pp. 1-6, 2010.##[3] M. A. Lebedev and M. A. L. Nicolelis, "Brain-Machine interfaces: past, present and future", TRENDS in Neurosciences, vol. 29, no. 9, pp. 536-546, 2006.##[4] Defense Advanced Research Projects Agency: Department of Defense Fiscal Year 2010 Budget Estimates Washington, DC, Department of Defense, 2009##[5] F. Nijboer, E. W. Sellers, J. Mellinger, M. A. Jordan, T. Matuz, A. Furdea, S. Halder, U. Mochty, D. J. Krusienski, and T. M. Vaughan, "A P300-based brain-computer interface for people with amyotrophic lateral sclerosis", Clinical neurophysiology, vol. 119, no. 8, pp. 1909-1916, 2008.##[6] E. Donchin and Y. Arbel, "P300 based brain computer interfaces: a progress report", Foundations of Augmented Cognition, Neuroer-gonomics and Operational Neuroscience, pp. 724-731, 2009.##[7] L. A.Farwell, E.Donchin, "Talking off the top of your head: toward a mental prosthesis utilizing event-related brain potentials", Electroenceph clin Neurophysiol, Vol. 70, pp. 510-523, 1988.##[8] S. Iqbal , Y.U. Khan , O. Farooq ," EEG based classification of imagined vowel sounds", 2nd International Conference on Computing for Sustainable Global Development (INDIACom),pp. 1591-1594, IEEE 2015.##[9] K. Brigham, B.V.K.V Kumar, " Imagined Speech Classification with EEG Signals for Silent Communication: A Preliminary Investigation into Synthetic Telepathy", 4th International Con-ference on Bioinformatics and Biomedical Engineering (iCBBE), pp. 1-4, IEEE 2010.##[10] R. Kamalakkannan, R. Rajkumar, R. M. Madan, D. S. Shenbaga, "Imagined Speech Classi-fication using EEG", Advances in Biomedical Science and Engineering, Vol. 1, No. 2, pp.20-32, 2014.##[11] X. Chi, J. B. Hagedorna, D. Schoonovera, and M. D'Zmuraa, "EEG-based discrimination of imagined speech phonemes", International Journal of Bioelectromagnetism, vol. 13, no. 4, 2011.##[12] T. Kim, J. Lee, H. Choi, H. Lee et al., "Meaning based covert speech classification for brain-computer interface based on electroencephalo-graphy", 6th International IEEE/EMBS Con-ference on Neural Engineering (NER), pp. 53-56, 2013.##[13] K. Brigham , B.V.K.V. Kumar, "Subject identification from electroencephalogram (EEG) signals during imagined speech", Fourth IEEE International Conference on Biometrics: Theory Applications and Systems (BTAS) ,pp. 1-8, 2010.##[14] M. D'Zmura, S. Deng, T. Lappas, S. Thorpe, and R. Srinivasan, "Toward EEG sensing of imagined speech", Human-Computer Inter-action New Trends, pp. 40-48, 2009.##[15] S. Deng, R. Srinivasan, T. Lappas, and M. D'Zmura, "EEG classification of imagined syllable rhythm using Hilbert spectrum methods", Journal of neural engineering, vol. 7, no. 4,pp. 046006, 2010.##[16] K. Yaser Arafat, S. S. Kanade, "Imagined Speech EEG Signal Processing For Brain Computer Interface", International Journal of Application or Innovation in Engineering &#38; Management (IJAIEM), Vol. 3, No. 7, pp. 123, 2014.##[17] A. Shahbahrami, K. Nadjafi, T.Nadjafi, "Different Application Fields of Brain Signal Processing", Quarterly Journal of Signal and Data Processing(JSDP), Vol.13, No.3, pp129-154, 2016.##[18] C. S. DaSalla, H. Kambara, M. Sato, and Y. Koike, "Single-trial classification of vowel speech imagery using common spatial patterns", Neural Networks, vol. 22, no. 9, pp. 1334-1339, 2009.##[1] N. Birbaumer and L. G. Cohen, "Brain-computer interfaces: communication and resto-ration of movement in paralysis", The Journal of physiology, vol. 579, no. 3, pp. 621-636, 2007.##[2] Ivan S. Kotchetkov, Brian Y. Hwang and et. al., "Brain-computer Interfaces: military, neuro-surgical and ethical prespective", Neurosurg Focus, vol. 28, no. 5, pp. 1-6, 2010.##[3] M. A. Lebedev and M. A. L. Nicolelis, "Brain-Machine interfaces: past, present and future", TRENDS in Neurosciences, vol. 29, no. 9, pp. 536-546, 2006.##[4] Defense Advanced Research Projects Agency: Department of Defense Fiscal Year 2010 Budget Estimates Washington, DC, Department of Defense, 2009##[5] F. Nijboer, E. W. Sellers, J. Mellinger, M. A. Jordan, T. Matuz, A. Furdea, S. Halder, U. Mochty, D. J. Krusienski, and T. M. Vaughan, "A P300-based brain-computer interface for people with amyotrophic lateral sclerosis", Clinical neurophysiology, vol. 119, no. 8, pp. 1909-1916, 2008.##[6] E. Donchin and Y. Arbel, "P300 based brain computer interfaces: a progress report", Foundations of Augmented Cognition, Neuroer-gonomics and Operational Neuroscience, pp. 724-731, 2009.##[7] L. A.Farwell, E.Donchin, "Talking off the top of your head: toward a mental prosthesis utilizing event-related brain potentials", Electroenceph clin Neurophysiol, Vol. 70, pp. 510-523, 1988.##[8] S. Iqbal , Y.U. Khan , O. Farooq ," EEG based classification of imagined vowel sounds", 2nd International Conference on Computing for Sustainable Global Development (INDIACom),pp. 1591-1594, IEEE 2015.##[9] K. Brigham, B.V.K.V Kumar, " Imagined Speech Classification with EEG Signals for Silent Communication: A Preliminary Investigation into Synthetic Telepathy", 4th International Con-ference on Bioinformatics and Biomedical Engineering (iCBBE), pp. 1-4, IEEE 2010.##[10] R. Kamalakkannan, R. Rajkumar, R. M. Madan, D. S. Shenbaga, "Imagined Speech Classi-fication using EEG", Advances in Biomedical Science and Engineering, Vol. 1, No. 2, pp.20-32, 2014.##[11] X. Chi, J. B. Hagedorna, D. Schoonovera, and M. D'Zmuraa, "EEG-based discrimination of imagined speech phonemes", International Journal of Bioelectromagnetism, vol. 13, no. 4, 2011.##[12] T. Kim, J. Lee, H. Choi, H. Lee et al., "Meaning based covert speech classification for brain-computer interface based on electroencephalo-graphy", 6th International IEEE/EMBS Con-ference on Neural Engineering (NER), pp. 53-56, 2013.##[13] K. Brigham , B.V.K.V. Kumar, "Subject identification from electroencephalogram (EEG) signals during imagined speech", Fourth IEEE International Conference on Biometrics: Theory Applications and Systems (BTAS) ,pp. 1-8, 2010.##[14] M. D'Zmura, S. Deng, T. Lappas, S. Thorpe, and R. Srinivasan, "Toward EEG sensing of imagined speech", Human-Computer Inter-action New Trends, pp. 40-48, 2009.##[15] S. Deng, R. Srinivasan, T. Lappas, and M. D'Zmura, "EEG classification of imagined syllable rhythm using Hilbert spectrum methods", Journal of neural engineering, vol. 7, no. 4,pp. 046006, 2010.##[16] K. Yaser Arafat, S. S. Kanade, "Imagined Speech EEG Signal Processing For Brain Computer Interface", International Journal of Application or Innovation in Engineering &#38; Management (IJAIEM), Vol. 3, No. 7, pp. 123, 2014.##[17] ا. شاه بهرامی، ک. نجفی، ط. نجفی. "حوزه‌های مختلف کاربردی پردازش سیگنال مغزی در ایران ". فصل‌نامه پردازش علائم و داده‌ها، جلد ۱۳، شماره ۳، صفحات ۱۲۹-۱۵۴، 1395.##[17] A. Shahbahrami, K. Nadjafi, T.Nadjafi, "Different Application Fields of Brain Signal Processing", Quarterly Journal of Signal and Data Processing(JSDP), Vol.13, No.3, pp129-154, 2016.##[18] C. S. DaSalla, H. Kambara, M. Sato, and Y. Koike, "Single-trial classification of vowel speech imagery using common spatial patterns", Neural Networks, vol. 22, no. 9, pp. 1334-1339, 2009.## ##</REF>
			</REFRENCE>
		</REFRENCES>

	</ARTICLE>


	<ARTICLE> 
		<TitleF>مرجع‌گزینی در زبان فارسی با استفاده از شبکه عصبی عمیق</TitleF>
		<TitleE>Corefrence resolution with deep learning in the Persian Labnguage</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;گامِ شناسایی موجودیت&#173;&#8204;های نامدار، استخراج ویژگی&#8204;های موجودیت&#173;&#8204;های نامدار و مرجع&#8204;گزینی آن&#8204;ها تشکیل &#8204;شده است. موجودیت&#173;های نامدار ویژگی&#8204;های فراوانی دارند، وجود ویژگی&#8204;های مختلف (متناسب و متناقض با مرجع) در گراف&#8204;ها این امکان را می&#8204;دهند که بتوان حد آستانه&#8204;ای را از ترکیب ویژگی&#8204;های مختلف استخراج کرد. در مقاله ارائه&#8204;شده ابتدا پیش&#8204;پردازش&#8204;های مختلف روی پیکره پژوهشگاه خواجه&#8204;نصیر [1] انجام گرفت؛ سپس با استفاده از الگوریتم&#8204;های مبتنی بر شبکه عصبی عمیق داده&#8204;های موجود به بردارهای عددی تبدیل شدند و پس از آن با استفاده از گراف و با ویژگی&#8204;هایی که در متن مقاله عنوان&#8204;شده هرس اولیه انجام گرفت؛ درواقع رویکردهای مبتنی بر گراف، موجودیت&#8204;ها را همچون مجموعه&#8204;ای از عناصر مرتبط با یکدیگر می&#8204;شناسد که تحلیل روابط میان موجودیت&#8204;های اولیه در گراف و وزن&#8204;دهی به این ارتباط&#8204;ها، منجر به استخراج ویژگی&#8204;های سطح بالاتر و مرتبط&#8204;تری می&#8204;&#8204;شود و نیز تناقضات ایجادشده بر اساس کمبود اطلاعات را تا حدودی کاهش می&#8204;دهد. سپس با استفاده از شبکه&#8204;های عصبی، روی پیکره مورداشاره در [30] (پیکره آزمون اپسلا) مرجع&#8204;گزینی انجام گرفت که نتایج حاصل بیان&#8204;گر بهبود روش پیشنهادی (رسیدن به دقت 09/62) است که در متن مقاله به&#8204;طور مشروح بیان&#8204;شده است.</CONTENT>
			</ABSTRACT>
			<ABSTRACT>
			<Language_ID>2</Language_ID>
			<CONTENT>Coreference resolution is an advanced issue in natural language processing. Nowadays, due to the extension of social networks, TV channels, news agencies, the Internet, etc. in human life, reading all the contents, analyzing them, and finding a relation between them require time and cost. 
In the present era, text analysis is performed using various natural language processing techniques, one of the challenges in this field is the low accuracy in detecting name entities&#39; reference, which detection process has been named as coreference resolution. Coreference resolution is finding all expressions that refer to a name entity, and two expressions are coreference together when these expressions located in the same coreference cluster.
&#160;&#160;&#160;&#160; Coreference resolution could be used in many natural language processing tasks such as question answering, text summarization, machine translation, information extraction, etc.
Coreference resolution methods are into two main categories; machine learning and rule-based approaches. In the rule-based approaches for detecting coreferences, a set of rich rule ordinary which written by a specialist is execued. These methods are quick, but these are language-dependent and necessary written to each language firstly again by a specialist. The machine learning method divides into supervised and unsupervised methods, in a supervised approach, it is require to have data labeled by a specialist.
Coreference resolution included three main phases: named entities recognition, features extraction of name entities, and analyzes the coreferences, in which the primary phase is feature extraction. 
After corpus creation, name entities should be recognized in the corpus. This step depends on a corpus, in some corpora entities named as golden data, in this paper, we used RCDAT corpus, which determined name entities itself.
After the name entities recognition phase, the mention pairs are determined, and the features are extracted. The proposed method uses two categories of the features: the first is word embedding vector, the second is handcrafted features, which are the distance between the mentions, head matching, gender matching, etc.
This paper used a deep neural network to train the features extracted, in the analyze coreferences phase a Feed Forward Neural Network (FFNN) is trained by the candidate mention pairs (extracted features from them) and their labels (coreference / non-coreference or 1/0) so that the trained FFNN assigns a probability (between 0 and 1) to any given mention pair. Then used the graph technique with a threshold level to determine different or compatible name entities in the coreference resolution cluster.&#160; This step creates the graph by using the extracted mention pairs from the previous step. In this graph, nodes are the mention pairs that are clustered by using the agglomerative hierarchical clustering algorithm inorder to locate similar mention pairs in a group. The resulting clusters are considered as coreference resolution chains.
In this paper, RCDAT Persian language corpus is used for training the proposed coreference resolution approach and for testing the Uppsala Persian language dataset which is used and in the calculation of the accurate of system, different tools have been taken for features extraction which each of them effects on the accuracy of the whole system. The corpora, tools, and methods used in the system are standard. They are quite comparable to the ACE and Ontonotes corpora and tools used at the same time in the coreference resolution algorithm.&#160; The results of the improvements proposed method (F1 = 62.09) is expressed in the text of the paper.</CONTENT>
			</ABSTRACT>
		</ABSTRACTS>

		<PAGES>
			<PAGE>
			<FPAGE>138</FPAGE>
			<TPAGE>121</TPAGE>
			</PAGE>
		</PAGES>

		<RECEIVE_DATE>
			2018/09/152017/07/302018/10/222018/08/182018/09/22018/09/132017/11/302018/10/232018/05/62018/08/21
		</RECEIVE_DATE>

		<RECEIVE_DATE_FA>
			1397/5/30
		</RECEIVE_DATE_FA>

		<ACCEPT_DATE>
			2019/09/22020/06/22019/09/22019/11/32019/05/72019/09/22020/06/82019/01/262020/05/132019/09/2
		</ACCEPT_DATE>

		<ACCEPT_DATE_FA>
			1398/6/11
		</ACCEPT_DATE_FA>

		<AUTHORS>
			<AUTHOR>
				<Name>حسین</Name>
				<MidName></MidName>
				<Family>سهلانی</Family>
				<NameE>hossein</NameE>
				<MidNameE></MidNameE>
				<FamilyE>sahlani</FamilyE>
				<Organizations>
				<Organization>دانشگاه صنعتی مالک اشتر</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>sahlani_h@yahoo.com</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>مریم</Name>
				<MidName></MidName>
				<Family>حورعلی</Family>
				<NameE>maryam</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Hourali</FamilyE>
				<Organizations>
				<Organization>دانشگاه صنعتی مالک اشتر</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>hourali@mut.ac.ir</Email>
				</EMAILS>
			</AUTHOR>

			<AUTHOR>
				<Name>بهروز</Name>
				<MidName></MidName>
				<Family>مینایی بیدگلی</Family>
				<NameE>Behrouz</NameE>
				<MidNameE></MidNameE>
				<FamilyE>Minaei-Bidgoli</FamilyE>
				<Organizations>
				<Organization>دانشگاه علم و صنعت ایران</Organization>
				</Organizations>
				<Countries>
				<Country>ایران</Country>
				</Countries>
				<EMAILS>
				<Email>b.minaii@iust.ac.ir</Email>
				</EMAILS>
			</AUTHOR>
		</AUTHORS>


		<KEYWORDS>
			<KEYWORD>
				<KeyText>Coreference resolution</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Deep neural networks</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Graph</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Named entities  ecognition</KeyText>
			</KEYWORD>

			<KEYWORD>
				<KeyText>Information extraction</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] Z. Rahimi, S. HosseinNejad "Corpus based coreference resolution for Farsi text", JSDP, vol. 17 (1), pp. 79-98, 2020.##[2] Y. Shekofteh, T. Emami Azadi, "A'laam Corpus: A Standard Corpus of Named Entity for Persian Language", JSDP, Vol. 14 (3), pp.127-142, 2017.##[3] P. S. Mortazavi and M.Shamsfard "Recognition of named entities in Persian texts," in 15-th annual conference of computer society of Iran, Tehran, 2009.##[4] A. AleAhmad, H. Amiri, E. Darrudi, M. Rahgozar, and F. Oroumchian, "Hamshahri: A Standard Persian text collection", Knowledge-Based Systems, Vol. 22(5), pp.382-387, 2009.##[5] A. Rahman, Ng. Vincent, "Coreference resolution with world knowledge," 49th Annual Meeting of the Association for Computational Linguistics, Vol. 1, 2013.##[6] B. Amit, B. Breck, "Algorithms for scoring coreference chains", In Proceedings of the LREC Workshop on Linguistic Coreference, pp. 563-566, 1998.##[7] M. Bijankhan, J.Sheykhzadegan, M. Bahrani, and M.Ghayoomi, "Lessons from Building a Persian Written Corpus: Peykare", Language Resources and Evaluation, Vol. 45(2), pp.143-164, 2011.##[8] Ch.Prafulla, Ch. Kumar and R. Huang, "Event coreference resolution by iteratively unfolding inter-dependencies among events", In Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing, pp. 2124-2133, 2017.##[9] C. Kevin and Ch. D. Manning, "Deep Reinforcement Learning for Mention-Ranking Coreference Models," In Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing, pp. 2256-2262, 2016.##[10] C. Kevin and Ch. D. Manning, "Improving Coreference Resolution by Learning Entity-Level Distributed Representations," In Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics Vol.1, pp. 643-653. 2016.##[11] C. Nicolae, G. Nicolae, "Bestcut: A graph algorithm for coreference resolution," conference on empirical methods in natural language processing, 2014.##[12] D. Pascal and B. Jason, "Specialized models and ranking for coreference resolution," In Proceedings of the 2008 Conference on Empirical Methods in Natural Language Processing, pp. 660-669, 2008.##[13] D. Chase, L. Chan, H. Peng, H. Wu, Sh. Upadhyay, N. Gupta, C. Tsai, M. Sammons, and D. Roth, "UI CCG TAC-KBP2017 submissions: Entity discovery and linking, and event nugget detection and co-reference," In Proceedings of the Text Analysis Conference, 2017.##[14] A. Haghighi, and D. Klein, "Simple coreference resolution with rich syntactic and semantic features," In Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing, Vol.3, pp. 1152-1161, Association for Computational Linguistics, 2009.##[15] Lee. Heeyoung, A. Chang, Y. Peirsman, N. Chambers, M. Surdeanu, and D. Jurafsky, "Deterministic coreference resolution based on entity-centric, precision-ranked rules". Computational Linguistics, 2013.##[16] J.Heng and R. Grishman, "Knowledge base population: Successful approaches and challenges", In Proceedings of the 49th Annual Meeting of the Association for ComProceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI-18) putational Linguistics: Human Language Technologies, pp. 1148-1158, 2011.##[17] J. Shanshan, Y. Li, T. Qin, Q. Meng, and B. Dong, "SRCB entity discovery and linking (EDL) and event nugget systems for TAC 2017", In Proceedings of the Text Analysis Conference, 2017.##[18] P. Haoruo, Y. Song, and D. Roth, "Event detection and co-reference with minimal supervision", In Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing, pp. 392-402, 2016.##[19] P. S. Paolo, S. Michael, "Exploiting semantic role labeling, WordNet and Wikipedia for coreference resolution," main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, 2014.##[20] H. Poon, P. Domingos, "Joint unsupervised coreference resolution with markov logic", In: Proceedings of the conference on empirical methods in natural language processing, Association for Computational Linguistics, pp 650-659, 2008.##[21] L. Heeyoung, A. Chang, Y. Peirsman, N. Chambers, M. Surdeanu, and D. Jurafsky, "Deterministic coreference resolution based on entity-centric, precision-ranked rules" Computational Linguistics, Vol. 39(4), pp.885- 916, 2013.##[22] L. Zhengzhong, J. Araki, E. Hovy, and T. Mitamura, "Supervised within-document event coreference using information pro-pagation", In Proceedings of the Ninth Lan-guage Resources and Evaluation Conference, pp. 4539- 4544, 2014.##[23] L. Jing and V. Ng, "Joint learning for event coreference resolution", In Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics, Vol.1, pp. 90-101, 2017.##[24] L. Jing and V. Ng, "Learning antecedent structures for event coreference resolution", In Proceedings of the 16th IEEE International Conference on Machine Learning and##Applications, pp. 113-118, 2017.##[25] L. Jing and V. Ng, "UTD's event nugget detection and coreference system at KBP 2017", In Proceedings of the Text Analysis Conference, 2017.##[26] L. Xiaoqiang, "On coreference resolution performance metrics" In Proceedings of the Conference on Human Language Technology and Empirical Methods in Natural Language Processing, pp. 25-32, 2005.##[27] A. McCallum, B.Wellner, "Conditional models of identity uncertainty with application to noun coreference", In: Advances in neural info-rmation processing systems, pp. 905-912, 2005.##[28] V. Ng, "Supervised noun phrase coreference research", The first fifteen years. In: Proceedings of the 48th annual meeting of the association for computational linguistics, Association for Computational Linguistics, 2010, pp. 1396-1411.##[29] M. Rasooli, M. Kouhestani, and A. Moloodi, "Development of a Persian Syntactic Dependency Treebank", In The 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL HLT), Atlanta, USA, 2013, pp. 306-314.##[30] M. Seraji, B.Megyesi, J.Nivre, "Bootstrapping a Persian Dependency Treebank", Published as a Journal in Special Issue of the Linguistic Issues in Language Technology (LiLT), Heidelberg, Germany, 2012.##[31] S. W. Meng, H. T. Ng, D. Chung, Y. Lim, "A machine learning approach to coreference resolution of noun phrases", Computational Linguistics, Vol.27(4), pp. 521-544, 2001.##[32] T. Mikolov, I. Sutskever, K. Chen, G. S Corrado and J. Dean, "Distributed represent-tations of words and phrases and their compositionality", In C.J.C. Burges, L. Bottou, M. Welling, Z. Ghahramani, and K.Q. Wein-berger, editors, Advances in Neural Information Processing Systems 26, pp. 3111:3119. Curran Associates, Inc, 2013.##[33] U. Olga, M. Poesio, C. Giuliano and K. Tymoshenko, "Disambiguation and Filtering Methods in Using Web Knowledge for Coreference Resolution," FLAIRS Conference, 2013.##[34] Ng. Vincent, "Shallow Semantics for Core-ference Resolution," 43rd Annual Meeting on Association for Computational Linguistics, 2017.##[35] V. Marc, J. Burger, J. Aberdeen, D. Connolly, and L. Hirschman, "A model-theoretic coreference scoring scheme,"Proceedings of the 6th conference on Message understanding. Association for Computational Linguistics, 1995.##[36] S. Wiseman, A. M. Rush, S. M. Shieber, and Jason Weston, "Learning anaphoricity and antecedent ranking features for coreference resolution", ACL-IJCNLP, pp. 1416-1426, 2015, Beijing, China.##[37] Y. Xiaofeng, G. Zhou, J. Su, and Ch. L. Tan, "Coreference resolution using competition learning approach," 41st Annual Meeting on Association for Computational Linguistics, Volume 1, 2013.##[38] Y. Xiaofeng, J. Su, G. Zhou, and Ch. Lim Tan, "An NP-cluster based approach to coreference resolution," Proceedings of the 20th inter-national conference on Computational Linguis-tics, Association for Computational Linguistics, 2014.##[39] X. Luo, "On coreference resolution performance metrics," Proceedings of the conference on human language technology and empirical methods in natural language processing, Association for Computational Linguistics, 2005.##[40] Y. Bishan, C. Cardie, and P. Frazier, "A hierarchical distance-dependent Bayesian model for event coreference resolution," Transactions of the Association for Computational Lin-guistics, Vol.3, pp.517-528, 2015.##[41] Y. Dian, X. Pan, B. Zhang, L. Huang, D. Lu, S. Whitehead, and H. Ji, "RPI BLENDER TAC-KBP2016 system description", In Proceedings of the Text Analysis Conference, 2016.##[1] رحیمی زینب، حسین نژاد شادی. هم‌مرجع‌یابی مبتنی بر پیکره در متون فارسی. پردازش علائم و داده‌ها. ۱۳۹۹; ۱۷ (۱) :۷۹-۹۸##[1] Z. Rahimi, S. HosseinNejad "Corpus based coreference resolution for Farsi text", JSDP, vol. 17 (1), pp. 79-98, 2020.##[2] حسین نژاد، شادی؛ شکفته، یاسر و امامی آزادی، طاهره. «پیکره اعلام، یک پیکره استاندارد موجودیت‌های نامدار فارسی»؛ پردازش علائم و داده‌ها، دوره 14، شماره 3; صص. 127-142، 1396.##[2] Y. Shekofteh, T. Emami Azadi, "A'laam Corpus: A Standard Corpus of Named Entity for Persian Language", JSDP, Vol. 14 (3), pp.127-142, 2017.##[3] سادات‌مرتضوی، پونه؛ شمس‌فرد، مهرنوش. «شناسایی موجودیت‌های نامدار در متون فارسی.» پانزدهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر، تهران، 1388.##[3] P. S. Mortazavi and M.Shamsfard "Recognition of named entities in Persian texts," in 15-th annual conference of computer society of Iran, Tehran, 2009.##[4] A. AleAhmad, H. Amiri, E. Darrudi, M. Rahgozar, and F. Oroumchian, "Hamshahri: A Standard Persian text collection", Knowledge-Based Systems, Vol. 22(5), pp.382-387, 2009.##[5] A. Rahman, Ng. Vincent, "Coreference resolution with world knowledge," 49th Annual Meeting of the Association for Computational Linguistics, Vol. 1, 2013.##[6] B. Amit, B. Breck, "Algorithms for scoring coreference chains", In Proceedings of the LREC Workshop on Linguistic Coreference, pp. 563-566, 1998.##[7] M. Bijankhan, J.Sheykhzadegan, M. Bahrani, and M.Ghayoomi, "Lessons from Building a Persian Written Corpus: Peykare", Language Resources and Evaluation, Vol. 45(2), pp.143-164, 2011.##[8] Ch.Prafulla, Ch. Kumar and R. Huang, "Event coreference resolution by iteratively unfolding inter-dependencies among events", In Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing, pp. 2124-2133, 2017.##[9] C. Kevin and Ch. D. Manning, "Deep Reinforcement Learning for Mention-Ranking Coreference Models," In Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing, pp. 2256-2262, 2016.##[10] C. Kevin and Ch. D. Manning, "Improving Coreference Resolution by Learning Entity-Level Distributed Representations," In Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics Vol.1, pp. 643-653. 2016.##[11] C. Nicolae, G. Nicolae, "Bestcut: A graph algorithm for coreference resolution," conference on empirical methods in natural language processing, 2014.##[12] D. Pascal and B. Jason, "Specialized models and ranking for coreference resolution," In Proceedings of the 2008 Conference on Empirical Methods in Natural Language Processing, pp. 660-669, 2008.##[13] D. Chase, L. Chan, H. Peng, H. Wu, Sh. Upadhyay, N. Gupta, C. Tsai, M. Sammons, and D. Roth, "UI CCG TAC-KBP2017 submissions: Entity discovery and linking, and event nugget detection and co-reference," In Proceedings of the Text Analysis Conference, 2017.##[14] A. Haghighi, and D. Klein, "Simple coreference resolution with rich syntactic and semantic features," In Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing, Vol.3, pp. 1152-1161, Association for Computational Linguistics, 2009.##[15] Lee. Heeyoung, A. Chang, Y. Peirsman, N. Chambers, M. Surdeanu, and D. Jurafsky, "Deterministic coreference resolution based on entity-centric, precision-ranked rules". Computational Linguistics, 2013.##[16] J.Heng and R. Grishman, "Knowledge base population: Successful approaches and challenges", In Proceedings of the 49th Annual Meeting of the Association for ComProceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI-18) putational Linguistics: Human Language Technologies, pp. 1148-1158, 2011.##[17] J. Shanshan, Y. Li, T. Qin, Q. Meng, and B. Dong, "SRCB entity discovery and linking (EDL) and event nugget systems for TAC 2017", In Proceedings of the Text Analysis Conference, 2017.##[18] P. Haoruo, Y. Song, and D. Roth, "Event detection and co-reference with minimal supervision", In Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing, pp. 392-402, 2016.##[19] P. S. Paolo, S. Michael, "Exploiting semantic role labeling, WordNet and Wikipedia for coreference resolution," main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, 2014.##[20] H. Poon, P. Domingos, "Joint unsupervised coreference resolution with markov logic", In: Proceedings of the conference on empirical methods in natural language processing, Association for Computational Linguistics, pp 650-659, 2008.##[21] L. Heeyoung, A. Chang, Y. Peirsman, N. Chambers, M. Surdeanu, and D. Jurafsky, "Deterministic coreference resolution based on entity-centric, precision-ranked rules" Computational Linguistics, Vol. 39(4), pp.885- 916, 2013.##[22] L. Zhengzhong, J. Araki, E. Hovy, and T. Mitamura, "Supervised within-document event coreference using information pro-pagation", In Proceedings of the Ninth Lan-guage Resources and Evaluation Conference, pp. 4539- 4544, 2014.##[23] L. Jing and V. Ng, "Joint learning for event coreference resolution", In Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics, Vol.1, pp. 90-101, 2017.##[24] L. Jing and V. Ng, "Learning antecedent structures for event coreference resolution", In Proceedings of the 16th IEEE International Conference on Machine Learning and Applications, pp. 113-118, 2017.##[25] L. Jing and V. Ng, "UTD's event nugget detection and coreference system at KBP 2017", In Proceedings of the Text Analysis Conference, 2017.##[26] L. Xiaoqiang, "On coreference resolution performance metrics" In Proceedings of the Conference on Human Language Technology and Empirical Methods in Natural Language Processing, pp. 25-32, 2005.##[27] A. McCallum, B.Wellner, "Conditional models of identity uncertainty with application to noun coreference", In: Advances in neural info-rmation processing systems, pp. 905-912, 2005.##[28] V. Ng, "Supervised noun phrase coreference research", The first fifteen years. In: Proceedings of the 48th annual meeting of the association for computational linguistics, Association for Computational Linguistics, 2010, pp. 1396-1411.##[29] M. Rasooli, M. Kouhestani, and A. Moloodi, "Development of a Persian Syntactic Dependency Treebank", In The 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL HLT), Atlanta, USA, 2013, pp. 306-314.##[30] M. Seraji, B.Megyesi, J.Nivre, "Bootstrapping a Persian Dependency Treebank", Published as a Journal in Special Issue of the Linguistic Issues in Language Technology (LiLT), Heidelberg, Germany, 2012.##[31] S. W. Meng, H. T. Ng, D. Chung, Y. Lim, "A machine learning approach to coreference resolution of noun phrases", Computational Linguistics, Vol.27(4), pp. 521-544, 2001.##[32] T. Mikolov, I. Sutskever, K. Chen, G. S Corrado and J. Dean, "Distributed represent-tations of words and phrases and their compositionality", In C.J.C. Burges, L. Bottou, M. Welling, Z. Ghahramani, and K.Q. Wein-berger, editors, Advances in Neural Information Processing Systems 26, pp. 3111:3119. Curran Associates, Inc, 2013.##[33] U. Olga, M. Poesio, C. Giuliano and K. Tymoshenko, "Disambiguation and Filtering Methods in Using Web Knowledge for Coreference Resolution," FLAIRS Conference, 2013.##[34] Ng. Vincent, "Shallow Semantics for Core-ference Resolution," 43rd Annual Meeting on Association for Computational Linguistics, 2017.##[35] V. Marc, J. Burger, J. Aberdeen, D. Connolly, and L. Hirschman, "A model-theoretic coreference scoring scheme,"Proceedings of the 6th conference on Message understanding. Association for Computational Linguistics, 1995.##[36] S. Wiseman, A. M. Rush, S. M. Shieber, and Jason Weston, "Learning anaphoricity and antecedent ranking features for coreference resolution", ACL-IJCNLP, pp. 1416-1426, 2015, Beijing, China.##[37] Y. Xiaofeng, G. Zhou, J. Su, and Ch. L. Tan, "Coreference resolution using competition learning approach," 41st Annual Meeting on Association for Computational Linguistics, Volume 1, 2013.##[38] Y. Xiaofeng, J. Su, G. Zhou, and Ch. Lim Tan, "An NP-cluster based approach to coreference resolution," Proceedings of the 20th inter-national conference on Computational Linguis-tics, Association for Computational Linguistics, 2014.##[39] X. Luo, "On coreference resolution performance metrics," Proceedings of the conference on human language technology and empirical methods in natural language processing, Association for Computational Linguistics, 2005.##[40] Y. Bishan, C. Cardie, and P. Frazier, "A hierarchical distance-dependent Bayesian model for event coreference resolution," Transactions of the Association for Computational Lin-guistics, Vol.3, pp.517-528, 2015.##[41] Y. Dian, X. Pan, B. Zhang, L. Huang, D. Lu, S. Whitehead, and H. Ji, "RPI BLENDER TAC-KBP2016 system description", In Proceedings of the Text Analysis Conference, 2016.## ##</REF>
			</REFRENCE>
		</REFRENCES>

	</ARTICLE>

</ARTICLES>

</JOURNAL>
</XML>
