<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "journalpublishing3.dtd">
<article article-type="Research Paper" dtd-version="3.0" xml:lang="en">
			  <front>
			    <journal-meta>
			      <journal-id journal-id-type="pmc">J. Algorithm Comput.</journal-id>
			      <journal-id journal-id-type="publisher-id">University of Tehran</journal-id>
			    	<journal-title-group>
				      <journal-title>Journal of Algorithms and Computation</journal-title>
			    	</journal-title-group>
			      <issn pub-type="ppub">2476-2776</issn>
			      <publisher>
			        <publisher-name>University of Tehran</publisher-name>
			      </publisher>
			    </journal-meta>
			    <article-meta>
 			      <article-id pub-id-type="publisher-id">129</article-id>
			      <article-id pub-id-type="doi"></article-id>		
			      <ext-link xlink:href="https://jac.ut.ac.ir/article_7803_e0e201d1b3fca4ca1b51316dfec44571.pdf"/>		
			      <article-categories>
			        <subj-group subj-group-type="heading">
			          		<subject>Research Paper</subject>
			        	</subj-group>
			      </article-categories>
			      <title-group>
			        <article-title>تولید خودکار الگوهای نفوذ جدید با استفاده از طبقه‌بندهای تک کلاسی و روش‌های یادگیری استقرایی</article-title>
			        <subtitle>Automatic Generation of Novel Intrusion Signatures Using One-Class Classifiers and Inductive Learning Methods (Technical note)</subtitle>
			      </title-group>
			      
			       <contrib-group>
			       <contrib contrib-type="author" id="c1">
			          <name>
			            <surname>Abadi</surname>
			            <given-names>Mehdi</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			       <contrib-group>
			       <contrib contrib-type="author" id="c2" corresp="yes">
			          <name>
			            <surname>Jalili</surname>
			            <given-names>Sa&amp;#039;eed</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			      <pub-date pub-type="ppub">
			        <day>07</day>
			        <month>05</month>
			        <year>2013</year>
			      </pub-date>
			      <volume>42</volume>
			      <issue>7</issue>
			      <fpage>823</fpage>
			      <lpage>829</lpage>
			      <history>
			        <date date-type="received">
			          <day>07</day>
			          <month>05</month>
			          <year>2013</year>
			        </date>
			        <date date-type="accepted">
			          <day>07</day>
			          <month>05</month>
			          <year>2013</year>
			        </date>
			      </history>
			      <permissions>
			      	<copyright-statement>Copyright &#x000a9; 2013, University of Tehran. </copyright-statement>	
			        <copyright-year>2013</copyright-year>
			      </permissions>
			       <self-uri xlink:href="https://jac.ut.ac.ir/article_7803.html">https://jac.ut.ac.ir/article_7803.html</self-uri> 		
			      <abstract>
			        <p>In this paper, we propose an approach for automatic generation of novel intrusion signatures. This approach can be used in the signature-based Network Intrusion Detection Systems (NIDSs) and for the automation of the process of intrusion detection in these systems. In the proposed approach, first, by using several one-class classifiers, the profile of the normal network traffic is established. Then, in the detection phase, any traffic that does not match with the known intrusion signatures and deviates from the established normal profile is detected as a novel intrusion. Using an inductive learning method, the signature of this novel intrusion is generated and the signature database is automatically updated. We evaluate our approach by performing experiments on the dataset provided by the DARPA Intrusion Detection Evaluation Program. The results of experiments show that our proposed approach can be successfully used for automatic generation of novel intrusion signatures.</p>
			      </abstract>
					<kwd-group kwd-group-type="author">
						<kwd>Network Intrusion Detection</kwd>
						<kwd>Intrusion Signature</kwd>
						<kwd>One</kwd>
						<kwd>Class Classifier</kwd>
						<kwd>Inductive Learning</kwd>
					</kwd-group>
			    </article-meta>
			  </front>
</article>
<article article-type="Research Paper" dtd-version="3.0" xml:lang="en">
			  <front>
			    <journal-meta>
			      <journal-id journal-id-type="pmc">J. Algorithm Comput.</journal-id>
			      <journal-id journal-id-type="publisher-id">University of Tehran</journal-id>
			    	<journal-title-group>
				      <journal-title>Journal of Algorithms and Computation</journal-title>
			    	</journal-title-group>
			      <issn pub-type="ppub">2476-2776</issn>
			      <publisher>
			        <publisher-name>University of Tehran</publisher-name>
			      </publisher>
			    </journal-meta>
			    <article-meta>
 			      <article-id pub-id-type="publisher-id">129</article-id>
			      <article-id pub-id-type="doi"></article-id>		
			      <ext-link xlink:href="https://jac.ut.ac.ir/article_7804_2d18a07c38ac8b27235500757451addb.pdf"/>		
			      <article-categories>
			        <subj-group subj-group-type="heading">
			          		<subject>Research Paper</subject>
			        	</subj-group>
			      </article-categories>
			      <title-group>
			        <article-title>بررسی پدیده جرقه زنی چند باره کلیدهای خلاء و اثرات آن بر سایر عناصر شبکه</article-title>
			        <subtitle>Investigation on Vacuum Circuit Breaker Multiple Re-Ignition Phenomenon and its Influence on the Performance of the other Power System Apparatus</subtitle>
			      </title-group>
			      
			       <contrib-group>
			       <contrib contrib-type="author" id="c1">
			          <name>
			            <surname>Hassanzadeh</surname>
			            <given-names>Sa&amp;#039;eed</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			       <contrib-group>
			       <contrib contrib-type="author" id="c2">
			          <name>
			            <surname>Niayesh</surname>
			            <given-names>Kaveh</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			       <contrib-group>
			       <contrib contrib-type="author" id="c3">
			          <name>
			            <surname>Mohseni</surname>
			            <given-names>Hossein</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			       <contrib-group>
			       <contrib contrib-type="author" id="c4" corresp="yes">
			          <name>
			            <surname>Shayegani Akmal</surname>
			            <given-names>Amir Abbas</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			      <pub-date pub-type="ppub">
			        <day>07</day>
			        <month>05</month>
			        <year>2013</year>
			      </pub-date>
			      <volume>42</volume>
			      <issue>7</issue>
			      <fpage>831</fpage>
			      <lpage>840</lpage>
			      <history>
			        <date date-type="received">
			          <day>07</day>
			          <month>05</month>
			          <year>2013</year>
			        </date>
			        <date date-type="accepted">
			          <day>07</day>
			          <month>05</month>
			          <year>2013</year>
			        </date>
			      </history>
			      <permissions>
			      	<copyright-statement>Copyright &#x000a9; 2013, University of Tehran. </copyright-statement>	
			        <copyright-year>2013</copyright-year>
			      </permissions>
			       <self-uri xlink:href="https://jac.ut.ac.ir/article_7804.html">https://jac.ut.ac.ir/article_7804.html</self-uri> 		
			      <abstract>
			        <p>unavailable</p>
			      </abstract>
					<kwd-group kwd-group-type="author">
						<kwd>Model of Vacuum Circuit Breakers</kwd>
						<kwd>High Frequency Transients</kwd>
						<kwd>Multiple Re</kwd>
						<kwd>ignition Phenomena</kwd>
						<kwd>Over</kwd>
						<kwd>Voltages</kwd>
					</kwd-group>
			    </article-meta>
			  </front>
</article>
<article article-type="Research Paper" dtd-version="3.0" xml:lang="en">
			  <front>
			    <journal-meta>
			      <journal-id journal-id-type="pmc">J. Algorithm Comput.</journal-id>
			      <journal-id journal-id-type="publisher-id">University of Tehran</journal-id>
			    	<journal-title-group>
				      <journal-title>Journal of Algorithms and Computation</journal-title>
			    	</journal-title-group>
			      <issn pub-type="ppub">2476-2776</issn>
			      <publisher>
			        <publisher-name>University of Tehran</publisher-name>
			      </publisher>
			    </journal-meta>
			    <article-meta>
 			      <article-id pub-id-type="publisher-id">129</article-id>
			      <article-id pub-id-type="doi"></article-id>		
			      <ext-link xlink:href="https://jac.ut.ac.ir/article_7805_25cec3224d0b6c9d59a713af59921f91.pdf"/>		
			      <article-categories>
			        <subj-group subj-group-type="heading">
			          		<subject>Research Paper</subject>
			        	</subj-group>
			      </article-categories>
			      <title-group>
			        <article-title>بهینه سازی تقسیم بار در شبکه سیگنالینگ شماره 7</article-title>
			        <subtitle>Optimization of Signaling Loadsharing in SS7 Network</subtitle>
			      </title-group>
			      
			       <contrib-group>
			       <contrib contrib-type="author" id="c1">
			          <name>
			            <surname>Khalili</surname>
			            <given-names>Reza</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			       <contrib-group>
			       <contrib contrib-type="author" id="c2">
			          <name>
			            <surname>Shirazi</surname>
			            <given-names>Mehdi</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			       <contrib-group>
			       <contrib contrib-type="author" id="c3" corresp="yes">
			          <name>
			            <surname>Salahi</surname>
			            <given-names>Ahmad</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			      <pub-date pub-type="ppub">
			        <day>07</day>
			        <month>05</month>
			        <year>2013</year>
			      </pub-date>
			      <volume>42</volume>
			      <issue>7</issue>
			      <fpage>841</fpage>
			      <lpage>850</lpage>
			      <history>
			        <date date-type="received">
			          <day>07</day>
			          <month>05</month>
			          <year>2013</year>
			        </date>
			        <date date-type="accepted">
			          <day>07</day>
			          <month>05</month>
			          <year>2013</year>
			        </date>
			      </history>
			      <permissions>
			      	<copyright-statement>Copyright &#x000a9; 2013, University of Tehran. </copyright-statement>	
			        <copyright-year>2013</copyright-year>
			      </permissions>
			       <self-uri xlink:href="https://jac.ut.ac.ir/article_7805.html">https://jac.ut.ac.ir/article_7805.html</self-uri> 		
			      <abstract>
			        <p>unavailable</p>
			      </abstract>
					<kwd-group kwd-group-type="author">
						<kwd>Signaling</kwd>
						<kwd>SS7</kwd>
						<kwd>Loadsharing</kwd>
						<kwd>SLS</kwd>
						<kwd>MSU</kwd>
						<kwd>DPC</kwd>
					</kwd-group>
			    </article-meta>
			  </front>
</article>
<article article-type="Research Paper" dtd-version="3.0" xml:lang="en">
			  <front>
			    <journal-meta>
			      <journal-id journal-id-type="pmc">J. Algorithm Comput.</journal-id>
			      <journal-id journal-id-type="publisher-id">University of Tehran</journal-id>
			    	<journal-title-group>
				      <journal-title>Journal of Algorithms and Computation</journal-title>
			    	</journal-title-group>
			      <issn pub-type="ppub">2476-2776</issn>
			      <publisher>
			        <publisher-name>University of Tehran</publisher-name>
			      </publisher>
			    </journal-meta>
			    <article-meta>
 			      <article-id pub-id-type="publisher-id">129</article-id>
			      <article-id pub-id-type="doi"></article-id>		
			      <ext-link xlink:href="https://jac.ut.ac.ir/article_7806_f7b2c18cfa34dd6679ea805a89d39dcb.pdf"/>		
			      <article-categories>
			        <subj-group subj-group-type="heading">
			          		<subject>Research Paper</subject>
			        	</subj-group>
			      </article-categories>
			      <title-group>
			        <article-title>مدل سازی و طراحی بهینه موتور پسماند نوع تخت</article-title>
			        <subtitle>Modeling and Optimization of a Flat-Type Hysteresis Motor</subtitle>
			      </title-group>
			      
			       <contrib-group>
			       <contrib contrib-type="author" id="c1">
			          <name>
			            <surname>Darabi</surname>
			            <given-names>Ahmad</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			       <contrib-group>
			       <contrib contrib-type="author" id="c2" corresp="yes">
			          <name>
			            <surname>Lesani</surname>
			            <given-names>Hamid</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			       <contrib-group>
			       <contrib contrib-type="author" id="c3">
			          <name>
			            <surname>Ghanbari Hashemabadi</surname>
			            <given-names>Teymour</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			      <pub-date pub-type="ppub">
			        <day>07</day>
			        <month>05</month>
			        <year>2013</year>
			      </pub-date>
			      <volume>42</volume>
			      <issue>7</issue>
			      <fpage>851</fpage>
			      <lpage>861</lpage>
			      <history>
			        <date date-type="received">
			          <day>07</day>
			          <month>05</month>
			          <year>2013</year>
			        </date>
			        <date date-type="accepted">
			          <day>07</day>
			          <month>05</month>
			          <year>2013</year>
			        </date>
			      </history>
			      <permissions>
			      	<copyright-statement>Copyright &#x000a9; 2013, University of Tehran. </copyright-statement>	
			        <copyright-year>2013</copyright-year>
			      </permissions>
			       <self-uri xlink:href="https://jac.ut.ac.ir/article_7806.html">https://jac.ut.ac.ir/article_7806.html</self-uri> 		
			      <abstract>
			        <p>unavailable</p>
			      </abstract>
					<kwd-group kwd-group-type="author">
						<kwd>Equivalent Circuit</kwd>
						<kwd>Flat</kwd>
						<kwd>Type</kwd>
						<kwd>Hysteresis Motor</kwd>
						<kwd>Modeling</kwd>
						<kwd>Sensitivity Analysis</kwd>
						<kwd>Variable Parameters</kwd>
					</kwd-group>
			    </article-meta>
			  </front>
</article>
<article article-type="Research Paper" dtd-version="3.0" xml:lang="en">
			  <front>
			    <journal-meta>
			      <journal-id journal-id-type="pmc">J. Algorithm Comput.</journal-id>
			      <journal-id journal-id-type="publisher-id">University of Tehran</journal-id>
			    	<journal-title-group>
				      <journal-title>Journal of Algorithms and Computation</journal-title>
			    	</journal-title-group>
			      <issn pub-type="ppub">2476-2776</issn>
			      <publisher>
			        <publisher-name>University of Tehran</publisher-name>
			      </publisher>
			    </journal-meta>
			    <article-meta>
 			      <article-id pub-id-type="publisher-id">129</article-id>
			      <article-id pub-id-type="doi"></article-id>		
			      <ext-link xlink:href="https://jac.ut.ac.ir/article_7807_bb6f72b42850172223769c62d5001299.pdf"/>		
			      <article-categories>
			        <subj-group subj-group-type="heading">
			          		<subject>Research Paper</subject>
			        	</subj-group>
			      </article-categories>
			      <title-group>
			        <article-title>ارائه الگوریتم حذف بار وفقی جهت حفاظت سیستم قدرت در مقابل حوادث ترکیبی منجر به خاموشی سراسری</article-title>
			        <subtitle>Adaptive Load Shedding Algorithm to Protect Power Systems against Combinational Disturbances Leading to Blackout</subtitle>
			      </title-group>
			      
			       <contrib-group>
			       <contrib contrib-type="author" id="c1">
			          <name>
			            <surname>Seyyedi</surname>
			            <given-names>Hirosh</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			       <contrib-group>
			       <contrib contrib-type="author" id="c2" corresp="yes">
			          <name>
			            <surname>Sanaye Pasand</surname>
			            <given-names>Majid</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			      <pub-date pub-type="ppub">
			        <day>07</day>
			        <month>05</month>
			        <year>2013</year>
			      </pub-date>
			      <volume>42</volume>
			      <issue>7</issue>
			      <fpage>863</fpage>
			      <lpage>878</lpage>
			      <history>
			        <date date-type="received">
			          <day>07</day>
			          <month>05</month>
			          <year>2013</year>
			        </date>
			        <date date-type="accepted">
			          <day>07</day>
			          <month>05</month>
			          <year>2013</year>
			        </date>
			      </history>
			      <permissions>
			      	<copyright-statement>Copyright &#x000a9; 2013, University of Tehran. </copyright-statement>	
			        <copyright-year>2013</copyright-year>
			      </permissions>
			       <self-uri xlink:href="https://jac.ut.ac.ir/article_7807.html">https://jac.ut.ac.ir/article_7807.html</self-uri> 		
			      <abstract>
			        <p>In recent years several catastrophic power systems blackouts have occurred worldwide. Various reasons have been declared for these failures. Economical limitations due to power system restructuring restrictions, inadvertent operation of protective relays and inefficient design of conventional load shedding schemes are of the most important reasons causing these blackouts. In fact, due to both economical and technological restrictions, it is not possible to completely prevent these blackouts. However, with the aid of some protection and control strategies, frequency and intensity of these blackouts may be reduced. One of the important protection strategies used for this purpose is a class of protection schemes known as ‘System Protection Schemes’ or ‘Wide Area Protection Schemes’. One of the most commonly used types of system protection schemes, generally accepted after the north-eastern blackout of 1965, is Under Frequency Load Shedding (UFLS) scheme. Conventional under frequency load shedding scheme is designed to retrieve the balance of generation and consumption following a disturbance. In the conventional load shedding method frequency settings, time delay settings and the amount of load to be shed in each step are constant values. The loads to be shed by this scheme are also constant load feeders and are not selected adaptively. Using this constant non-adaptive load shedding algorithm is not the most efficient scheme for all power system disturbances. In some combinational disturbances, events causing frequency to drop are followed by other events causing voltage drop. In these cases, since loads are voltage dependent, total system load is reduced and system frequency might not decrease so much to activate UFLS relays. However, the system could eventually collapse due to voltage instability. In many such cases the system would survive if the load shedding relays operate adaptively and appropriately. For example if for large disturbances, higher frequency settings and lower time delays are used adaptively, a faster load shedding response is obtained and as a result system collapses may be prevented. In this paper a new UFLS algorithm is proposed. The purpose of this algorithm is to adaptively adjust speed of load shedding based on the magnitude of disturbance. In this method rate of frequency decline is used as a criterion to determine intensity of disturbance. Thereby, for large disturbances higher frequency settings and lower time delays are used. Application of the proposed algorithm to the simulated model of Khorasan network in Iran confirms its satisfactory performance. As the results of simulations show, several voltage collapse instabilities may be prevented by using the proposed adaptive UFLS method.</p>
			      </abstract>
					<kwd-group kwd-group-type="author">
						<kwd>Blackout</kwd>
						<kwd>Adaptive Load Shedding</kwd>
						<kwd>Power System Protection</kwd>
					</kwd-group>
			    </article-meta>
			  </front>
</article>
<article article-type="Research Paper" dtd-version="3.0" xml:lang="en">
			  <front>
			    <journal-meta>
			      <journal-id journal-id-type="pmc">J. Algorithm Comput.</journal-id>
			      <journal-id journal-id-type="publisher-id">University of Tehran</journal-id>
			    	<journal-title-group>
				      <journal-title>Journal of Algorithms and Computation</journal-title>
			    	</journal-title-group>
			      <issn pub-type="ppub">2476-2776</issn>
			      <publisher>
			        <publisher-name>University of Tehran</publisher-name>
			      </publisher>
			    </journal-meta>
			    <article-meta>
 			      <article-id pub-id-type="publisher-id">129</article-id>
			      <article-id pub-id-type="doi"></article-id>		
			      <ext-link xlink:href="https://jac.ut.ac.ir/article_7808_4c746c4c4ad38cb804c80aa8364c2f69.pdf"/>		
			      <article-categories>
			        <subj-group subj-group-type="heading">
			          		<subject>Research Paper</subject>
			        	</subj-group>
			      </article-categories>
			      <title-group>
			        <article-title>کاربرد روش معادله سهموی در تحلیل مسائل انتشار امواج داخل ساختمان</article-title>
			        <subtitle>Application of the Parabolic Equation Method for Analyisis of Indoor Propagation Problems</subtitle>
			      </title-group>
			      
			       <contrib-group>
			       <contrib contrib-type="author" id="c1" corresp="yes">
			          <name>
			            <surname>Oraizi</surname>
			            <given-names>Homayoun</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			       <contrib-group>
			       <contrib contrib-type="author" id="c2">
			          <name>
			            <surname>Nouri</surname>
			            <given-names>Narges</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			      <pub-date pub-type="ppub">
			        <day>07</day>
			        <month>05</month>
			        <year>2013</year>
			      </pub-date>
			      <volume>42</volume>
			      <issue>7</issue>
			      <fpage>879</fpage>
			      <lpage>890</lpage>
			      <history>
			        <date date-type="received">
			          <day>07</day>
			          <month>05</month>
			          <year>2013</year>
			        </date>
			        <date date-type="accepted">
			          <day>07</day>
			          <month>05</month>
			          <year>2013</year>
			        </date>
			      </history>
			      <permissions>
			      	<copyright-statement>Copyright &#x000a9; 2013, University of Tehran. </copyright-statement>	
			        <copyright-year>2013</copyright-year>
			      </permissions>
			       <self-uri xlink:href="https://jac.ut.ac.ir/article_7808.html">https://jac.ut.ac.ir/article_7808.html</self-uri> 		
			      <abstract>
			        <p>With the rapid growth of indoor wireless communication systems, the need to accurately model radio wave propagation inside the building environments has increased. Many site-specific methods have been proposed for modeling indoor radio channels. Among these methods, the ray tracing algorithm and the finite-difference time domain (FDTD) method are the most popular ones. The ray tracing approach as a high frequency technique is efficient for calculating the received field at a small number of receiver locations. Application of FDTD method as a full wave technique for indoor propagation modeling is time consuming and requires large amounts of memory. The parabolic equation method (PEM) is a fast full-wave technique which allows accurate modeling of the propagation environment and its electrical parameters. This paraxial version of the wave equation can be solved by marching techniques which need far less computation resources than a full elliptic equation. The PEM has been extensively used as an efficient algorithm for outdoor propagation modeling. In this paper we propose an unprecedented application of PEM for indoor propagation problems. Depending on the required speed and accuracy of computations, two and three-dimensional versions of the PEM can be used for indoor problems. Without loss of generality, we restrict ourselves to the two-dimensional problems and use two-dimensional approximation of the parabolic equation for fast and accurate radio wave propagation modeling in indoor environments. The parabolic equation has been derived for lossless media where the refractive index is very close to unity. To the authors&#039; best knowledge the paraxial version of the wave equation has not yet been derived for propagation in general lossy dielectric media. In this paper, we first derive the general form of the parabolic wave equation for lossy dielectric media where it can be used for modeling the radio wave propagation through walls. The special form of the parabolic equation for modeling wave propagation in free space can be derived from this general form. We then apply PEM to model propagation of radio waves through a row of windows, reinforced concrete walls and typical corridors inside buildings. As windows are one of the most prevailing architectural elements in buildings, the phenomenon of plane wave transmission through them is of interest. In this paper PEM is used to model the radio wave propagation through windows. The numerical simulation results are presented for both normal and oblique incidence and compared with some reported results. The transmission and reflection characteristics of inhomogeneous walls have been studied by many numerical and analytical methods such as the finite-element method (FEM) and FDTD. In this paper, we use PEM to characterize reflection and transmission properties of reinforced concrete walls under plane wave incidence. The effect of several parameters namely wall thickness, bar diameter and spacing on the transmission coefficients of reinforced concrete walls will be analyzed. Corridors are also popular elements of buildings, so that the analysis of radio wave propagation in corridors has involved many researchers. The PEM is an effective method for modeling wave propagation in these environments. The effect of obstacles such as cupboards and cabinets inside a corridor can be modeled by PEM. This method is also able to model the effects of variations of the corridor direction on the wave propagation. The numerical simulation results will be presented and compared with the available data in the literature.</p>
			      </abstract>
					<kwd-group kwd-group-type="author">
						<kwd>Parabolic Wave Equation</kwd>
						<kwd>Indoor Radio Wave Propagation</kwd>
						<kwd>Site</kwd>
						<kwd>Specific Methods</kwd>
					</kwd-group>
			    </article-meta>
			  </front>
</article>
<article article-type="Research Paper" dtd-version="3.0" xml:lang="en">
			  <front>
			    <journal-meta>
			      <journal-id journal-id-type="pmc">J. Algorithm Comput.</journal-id>
			      <journal-id journal-id-type="publisher-id">University of Tehran</journal-id>
			    	<journal-title-group>
				      <journal-title>Journal of Algorithms and Computation</journal-title>
			    	</journal-title-group>
			      <issn pub-type="ppub">2476-2776</issn>
			      <publisher>
			        <publisher-name>University of Tehran</publisher-name>
			      </publisher>
			    </journal-meta>
			    <article-meta>
 			      <article-id pub-id-type="publisher-id">129</article-id>
			      <article-id pub-id-type="doi"></article-id>		
			      <ext-link xlink:href="https://jac.ut.ac.ir/article_7809_a6c3c9edea0afa7385bc6b972c842451.pdf"/>		
			      <article-categories>
			        <subj-group subj-group-type="heading">
			          		<subject>Research Paper</subject>
			        	</subj-group>
			      </article-categories>
			      <title-group>
			        <article-title>ارزیابی کارآیی TCSCدرکاهش اضافه بار خطوط و پایداری ولتاژ درهنگام وقوع خطا</article-title>
			        <subtitle>Evaluation of TCSC Efficiency on Lines Overloads Reduction and Voltage Stability Enhancement in Fault Conditions</subtitle>
			      </title-group>
			      
			       <contrib-group>
			       <contrib contrib-type="author" id="c1" corresp="yes">
			          <name>
			            <surname>Tarafdar Hagh</surname>
			            <given-names>Mehrdad</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			       <contrib-group>
			       <contrib contrib-type="author" id="c2">
			          <name>
			            <surname>Kazempour</surname>
			            <given-names>Seyyed Jalal</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			      <pub-date pub-type="ppub">
			        <day>07</day>
			        <month>05</month>
			        <year>2013</year>
			      </pub-date>
			      <volume>42</volume>
			      <issue>7</issue>
			      <fpage>891</fpage>
			      <lpage>899</lpage>
			      <history>
			        <date date-type="received">
			          <day>07</day>
			          <month>05</month>
			          <year>2013</year>
			        </date>
			        <date date-type="accepted">
			          <day>07</day>
			          <month>05</month>
			          <year>2013</year>
			        </date>
			      </history>
			      <permissions>
			      	<copyright-statement>Copyright &#x000a9; 2013, University of Tehran. </copyright-statement>	
			        <copyright-year>2013</copyright-year>
			      </permissions>
			       <self-uri xlink:href="https://jac.ut.ac.ir/article_7809.html">https://jac.ut.ac.ir/article_7809.html</self-uri> 		
			      <abstract>
			        <p>Although many mathematics-based and heuristic approaches have been recently developed on optimally allocation of TCSCs for lines overloads reduction and buses voltage stability enhancement during fault conditions, the works on the TCSCs efficiency to achieve the abovementioned goals are rare. This idea that TCSCs can surely enhance the system’s security must be comprehensively investigated. In this paper, after the optimal allocation of TCSCs, their efficiencies on lines overloads reduction and buses voltage stability enhancement during fault conditions are investigated using two new indices named “transmission index” and “voltage stability index”. The numerical results show TCSCs can remarkably enhance the buses voltage stability, but they can not significantly reduce the lines overloads. In addition, the impact of TCSCs installation on mitigation of load shedding aim to enhance the buses voltage stability is presented as a new work. The IEEE standard 14 and 30 buses systems are selected as case studies.</p>
			      </abstract>
					<kwd-group kwd-group-type="author">
						<kwd>Thyristor Controlled Series Capacitor (TCSC)</kwd>
						<kwd>TCSC Allocation</kwd>
						<kwd>Fault Occurrence</kwd>
						<kwd>Lines Overloads</kwd>
						<kwd>Buses Voltage Stability</kwd>
						<kwd>Load Shedding</kwd>
					</kwd-group>
			    </article-meta>
			  </front>
</article>
<article article-type="Research Paper" dtd-version="3.0" xml:lang="en">
			  <front>
			    <journal-meta>
			      <journal-id journal-id-type="pmc">J. Algorithm Comput.</journal-id>
			      <journal-id journal-id-type="publisher-id">University of Tehran</journal-id>
			    	<journal-title-group>
				      <journal-title>Journal of Algorithms and Computation</journal-title>
			    	</journal-title-group>
			      <issn pub-type="ppub">2476-2776</issn>
			      <publisher>
			        <publisher-name>University of Tehran</publisher-name>
			      </publisher>
			    </journal-meta>
			    <article-meta>
 			      <article-id pub-id-type="publisher-id">129</article-id>
			      <article-id pub-id-type="doi"></article-id>		
			      <ext-link xlink:href="https://jac.ut.ac.ir/article_7810_54aa192fd208eb6f622f0a87bd52eb3d.pdf"/>		
			      <article-categories>
			        <subj-group subj-group-type="heading">
			          		<subject>Research Paper</subject>
			        	</subj-group>
			      </article-categories>
			      <title-group>
			        <article-title>حذف هارمونیک های انتخابی مراتب بالا در مبدل های چندسطحی با استفاده از الگوریتم مهاجرت پرندگان</article-title>
			        <subtitle>Elimination of Specific Higher Order Harmonics in Multilevel Converters Using Particle Swarm Optimization</subtitle>
			      </title-group>
			      
			       <contrib-group>
			       <contrib contrib-type="author" id="c1">
			          <name>
			            <surname>Taghizadeh</surname>
			            <given-names>Hassan</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			       <contrib-group>
			       <contrib contrib-type="author" id="c2" corresp="yes">
			          <name>
			            <surname>Tarafdar Hagh</surname>
			            <given-names>Mehrdad</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			      <pub-date pub-type="ppub">
			        <day>07</day>
			        <month>05</month>
			        <year>2013</year>
			      </pub-date>
			      <volume>42</volume>
			      <issue>7</issue>
			      <fpage>901</fpage>
			      <lpage>912</lpage>
			      <history>
			        <date date-type="received">
			          <day>07</day>
			          <month>05</month>
			          <year>2013</year>
			        </date>
			        <date date-type="accepted">
			          <day>07</day>
			          <month>05</month>
			          <year>2013</year>
			        </date>
			      </history>
			      <permissions>
			      	<copyright-statement>Copyright &#x000a9; 2013, University of Tehran. </copyright-statement>	
			        <copyright-year>2013</copyright-year>
			      </permissions>
			       <self-uri xlink:href="https://jac.ut.ac.ir/article_7810.html">https://jac.ut.ac.ir/article_7810.html</self-uri> 		
			      <abstract>
			        <p>This paper presents a new method to find the optimum switching angles in voltage source multilevel converters in order to minimize specific higher order harmonics and decrease the total harmonic distortion (THD) of their output voltage waveform. The output voltage waveform of inverter can either be in the form of staircase or PWM. In order to increase the degrees of freedom and elimination of more harmonics, one can increase the number of levels or use PWM waveform which has more switching than once at each level. However, both of them result in complexity of nonlinear transcendental equations which solving them by using conventional numerical iterative techniques such as Newton-Raphson method is not feasible. In this paper, particle swarm optimization algorithm is presented to find optimum switching angles of PWM waveform in multilevel converters. These angles must be determined so that the desired fundamental harmonic is maintained and at the same time undesired higher order harmonics are suppressed. Theoretical and simulation results for an eleven-level converter show the efficiency of the proposed algorithm to determine the optimum angles in order to decrease the undesired harmonics and produce very high quality output voltage waveform.</p>
			      </abstract>
					<kwd-group kwd-group-type="author">
						<kwd>Cascaded Multilevel Inverter</kwd>
						<kwd>Particle Swarm Optimization</kwd>
						<kwd>Selective Harmonic Elimination</kwd>
					</kwd-group>
			    </article-meta>
			  </front>
</article>
<article article-type="Research Paper" dtd-version="3.0" xml:lang="en">
			  <front>
			    <journal-meta>
			      <journal-id journal-id-type="pmc">J. Algorithm Comput.</journal-id>
			      <journal-id journal-id-type="publisher-id">University of Tehran</journal-id>
			    	<journal-title-group>
				      <journal-title>Journal of Algorithms and Computation</journal-title>
			    	</journal-title-group>
			      <issn pub-type="ppub">2476-2776</issn>
			      <publisher>
			        <publisher-name>University of Tehran</publisher-name>
			      </publisher>
			    </journal-meta>
			    <article-meta>
 			      <article-id pub-id-type="publisher-id">129</article-id>
			      <article-id pub-id-type="doi"></article-id>		
			      <ext-link xlink:href="https://jac.ut.ac.ir/article_7811_3f13f6a01ecf8980b28b8eff42b38024.pdf"/>		
			      <article-categories>
			        <subj-group subj-group-type="heading">
			          		<subject>Research Paper</subject>
			        	</subj-group>
			      </article-categories>
			      <title-group>
			        <article-title>معرفی روش تطبیقی اصلاح شده برای اندازه‌گیری دقیق ولتاژ در مبدل ولتاژ نوری</article-title>
			        <subtitle>Modified Adaptive Method for Accurate Voltage Measurement in Optical Voltage Transducers</subtitle>
			      </title-group>
			      
			       <contrib-group>
			       <contrib contrib-type="author" id="c1" corresp="yes">
			          <name>
			            <surname>Monsef</surname>
			            <given-names>Hassan</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			       <contrib-group>
			       <contrib contrib-type="author" id="c2">
			          <name>
			            <surname>Ghomian</surname>
			            <given-names>Taher</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			      <pub-date pub-type="ppub">
			        <day>07</day>
			        <month>05</month>
			        <year>2013</year>
			      </pub-date>
			      <volume>42</volume>
			      <issue>7</issue>
			      <fpage>913</fpage>
			      <lpage>922</lpage>
			      <history>
			        <date date-type="received">
			          <day>07</day>
			          <month>05</month>
			          <year>2013</year>
			        </date>
			        <date date-type="accepted">
			          <day>07</day>
			          <month>05</month>
			          <year>2013</year>
			        </date>
			      </history>
			      <permissions>
			      	<copyright-statement>Copyright &#x000a9; 2013, University of Tehran. </copyright-statement>	
			        <copyright-year>2013</copyright-year>
			      </permissions>
			       <self-uri xlink:href="https://jac.ut.ac.ir/article_7811.html">https://jac.ut.ac.ir/article_7811.html</self-uri> 		
			      <abstract>
			        <p>There are fewer problems encountered with optical voltage transducers in comparison with their inductive and capacitive counterparts. Although capacitive and inductive transformers are used vastly for the purpose of measurement and protection in the networks, they cause problems such as core saturation and improper transient responses which decrease the accuracy of measurement and eficiency of the protection schemes. As a result, optical voltage transducers are considered as proper candidates for replacing the conventional inductive and capacitive transformers. Lighter weight, smaller size, larger dynamic range, wider bandwidth, insensitivity to electromagnetic interference, stability over temperature change, absence of iron core saturation, low maintenance and replacement cost, etc. are some of the advantages of optical voltage transducers over inductive and capacitive transformers. 
In this paper, the Modified Adaptive Method is introduced in order to measure the integral of electric field with minimum number of sensors. Using this algorithm makes the effects of other fields minimum. One more advantage of this method is the possibility of improving the accuracy of the measurement by using a correction factor. The correction factor is determined by considering the level of accuracy, environmental conditions and the number of sensors. Simulation results show the great validity and effectiveness of this method over a wide range of variations.</p>
			      </abstract>
					<kwd-group kwd-group-type="author">
						<kwd>Optical Voltage Transducer</kwd>
						<kwd>Electric Field</kwd>
						<kwd>Correction Factor</kwd>
						<kwd>Modified Adaptive Method</kwd>
					</kwd-group>
			    </article-meta>
			  </front>
</article>
<article article-type="Research Paper" dtd-version="3.0" xml:lang="en">
			  <front>
			    <journal-meta>
			      <journal-id journal-id-type="pmc">J. Algorithm Comput.</journal-id>
			      <journal-id journal-id-type="publisher-id">University of Tehran</journal-id>
			    	<journal-title-group>
				      <journal-title>Journal of Algorithms and Computation</journal-title>
			    	</journal-title-group>
			      <issn pub-type="ppub">2476-2776</issn>
			      <publisher>
			        <publisher-name>University of Tehran</publisher-name>
			      </publisher>
			    </journal-meta>
			    <article-meta>
 			      <article-id pub-id-type="publisher-id">129</article-id>
			      <article-id pub-id-type="doi"></article-id>		
			      <ext-link xlink:href="https://jac.ut.ac.ir/article_7812_9461bfe81d227f5219b56f6c72aa17d0.pdf"/>		
			      <article-categories>
			        <subj-group subj-group-type="heading">
			          		<subject>Research Paper</subject>
			        	</subj-group>
			      </article-categories>
			      <title-group>
			        <article-title>حل مسئله زمان بندی ماشینهای موازی نامرتبط با اهداف کل زودکرد وزنی و کل دیرکرد وزنی با استفاده از الگوریتم جستجوی پراکنده چند هدفه</article-title>
			        <subtitle>A Parallel Machine Scheduling Problem Minimizing the Total Weighted Earliness and Total Weighted Tardiness by a Multi-Objective Scatter Search Method</subtitle>
			      </title-group>
			      
			       <contrib-group>
			       <contrib contrib-type="author" id="c1" corresp="yes">
			          <name>
			            <surname>Tavakoli Moghadam</surname>
			            <given-names>Reza</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			       <contrib-group>
			       <contrib contrib-type="author" id="c2">
			          <name>
			            <surname>Jolai</surname>
			            <given-names>Fariborz</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			       <contrib-group>
			       <contrib contrib-type="author" id="c3">
			          <name>
			            <surname>Ghandi Beygi</surname>
			            <given-names>Somayyeh</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			      <pub-date pub-type="ppub">
			        <day>07</day>
			        <month>05</month>
			        <year>2013</year>
			      </pub-date>
			      <volume>42</volume>
			      <issue>7</issue>
			      <fpage>923</fpage>
			      <lpage>934</lpage>
			      <history>
			        <date date-type="received">
			          <day>07</day>
			          <month>05</month>
			          <year>2013</year>
			        </date>
			        <date date-type="accepted">
			          <day>07</day>
			          <month>05</month>
			          <year>2013</year>
			        </date>
			      </history>
			      <permissions>
			      	<copyright-statement>Copyright &#x000a9; 2013, University of Tehran. </copyright-statement>	
			        <copyright-year>2013</copyright-year>
			      </permissions>
			       <self-uri xlink:href="https://jac.ut.ac.ir/article_7812.html">https://jac.ut.ac.ir/article_7812.html</self-uri> 		
			      <abstract>
			        <p>The parallel machine scheduling problem is an important and difficult problem to be considered in the real-world situations. Traditionally, this problem consists of the scheduling of a set of independent jobs on parallel machines with the aim of minimizing the maximum job completion. In today&#039;s manufacturing systems, in which both early and tardy finishing of job processing are undesired, the objectives related to earliness and tardiness penalties have become increasingly popular. In this paper, two major goals are considered as follows: (1) total weighted earliness; (2) total weighted tardiness. Due to the complexity of such a hard problem, a new multi-objective meta-heuristic method, i.e. multi-objective scatter search (MOSS), is proposed to obtain the locally Pareto-optimal frontier where the simultaneous minimization of the above-mentioned objectives is desired. In order to validate the performance of the proposed MOSS method, in terms of solution quality and diversity level, various test problems are considered and the reliability of this method, based on different comparison metrics, is compared with the Elite Tabu Search (ETS) devised in this paper. The computational results show the high capability of the proposed MOSS method.</p>
			      </abstract>
					<kwd-group kwd-group-type="author">
						<kwd>Parallel Machine Scheduling Problem</kwd>
						<kwd>Total Weighted Earliness</kwd>
						<kwd>Total Weighted Tardiness</kwd>
						<kwd>Multi</kwd>
						<kwd>Objective Scatter Search</kwd>
					</kwd-group>
			    </article-meta>
			  </front>
</article>
<article article-type="Research Paper" dtd-version="3.0" xml:lang="en">
			  <front>
			    <journal-meta>
			      <journal-id journal-id-type="pmc">J. Algorithm Comput.</journal-id>
			      <journal-id journal-id-type="publisher-id">University of Tehran</journal-id>
			    	<journal-title-group>
				      <journal-title>Journal of Algorithms and Computation</journal-title>
			    	</journal-title-group>
			      <issn pub-type="ppub">2476-2776</issn>
			      <publisher>
			        <publisher-name>University of Tehran</publisher-name>
			      </publisher>
			    </journal-meta>
			    <article-meta>
 			      <article-id pub-id-type="publisher-id">129</article-id>
			      <article-id pub-id-type="doi"></article-id>		
			      <ext-link xlink:href="https://jac.ut.ac.ir/article_7813_21309f95c106b6622e8d774ead2ade90.pdf"/>		
			      <article-categories>
			        <subj-group subj-group-type="heading">
			          		<subject>Research Paper</subject>
			        	</subj-group>
			      </article-categories>
			      <title-group>
			        <article-title>انتخاب تأمین‌کننده با استفاده از تکنیک فرآیند تحلیل شبکه‌ای فازی</article-title>
			        <subtitle>Introducing a Fuzzy ANP Model to Solve Supplier Selection Problem</subtitle>
			      </title-group>
			      
			       <contrib-group>
			       <contrib contrib-type="author" id="c1" corresp="yes">
			          <name>
			            <surname>Razmi</surname>
			            <given-names>Jafar</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			       <contrib-group>
			       <contrib contrib-type="author" id="c2">
			          <name>
			            <surname>sadegh Amal Nik</surname>
			            <given-names>Mohsen</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			       <contrib-group>
			       <contrib contrib-type="author" id="c3">
			          <name>
			            <surname>Hashemi</surname>
			            <given-names>Mehdi</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			      <pub-date pub-type="ppub">
			        <day>07</day>
			        <month>05</month>
			        <year>2013</year>
			      </pub-date>
			      <volume>42</volume>
			      <issue>7</issue>
			      <fpage>935</fpage>
			      <lpage>946</lpage>
			      <history>
			        <date date-type="received">
			          <day>07</day>
			          <month>05</month>
			          <year>2013</year>
			        </date>
			        <date date-type="accepted">
			          <day>07</day>
			          <month>05</month>
			          <year>2013</year>
			        </date>
			      </history>
			      <permissions>
			      	<copyright-statement>Copyright &#x000a9; 2013, University of Tehran. </copyright-statement>	
			        <copyright-year>2013</copyright-year>
			      </permissions>
			       <self-uri xlink:href="https://jac.ut.ac.ir/article_7813.html">https://jac.ut.ac.ir/article_7813.html</self-uri> 		
			      <abstract>
			        <p>unavailable</p>
			      </abstract>
					<kwd-group kwd-group-type="author">
					</kwd-group>
			    </article-meta>
			  </front>
</article>
<article article-type="Research Paper" dtd-version="3.0" xml:lang="en">
			  <front>
			    <journal-meta>
			      <journal-id journal-id-type="pmc">J. Algorithm Comput.</journal-id>
			      <journal-id journal-id-type="publisher-id">University of Tehran</journal-id>
			    	<journal-title-group>
				      <journal-title>Journal of Algorithms and Computation</journal-title>
			    	</journal-title-group>
			      <issn pub-type="ppub">2476-2776</issn>
			      <publisher>
			        <publisher-name>University of Tehran</publisher-name>
			      </publisher>
			    </journal-meta>
			    <article-meta>
 			      <article-id pub-id-type="publisher-id">129</article-id>
			      <article-id pub-id-type="doi"></article-id>		
			      <ext-link xlink:href="https://jac.ut.ac.ir/article_7814_9f2ed081202457ea7ee76ce290db956e.pdf"/>		
			      <article-categories>
			        <subj-group subj-group-type="heading">
			          		<subject>Research Paper</subject>
			        	</subj-group>
			      </article-categories>
			      <title-group>
			        <article-title>یک الگوریتم ممتیک برای طراحی یکپارچه شبکه لجستیک مستقیم و معکوس در یک زنجیره تأمین</article-title>
			        <subtitle>A Memetic Algorithm for Integrated Forward/Reverse Logistics Network Design in a Supply Chain</subtitle>
			      </title-group>
			      
			       <contrib-group>
			       <contrib contrib-type="author" id="c1">
			          <name>
			            <surname>Pishvaei</surname>
			            <given-names>Mir Saman</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			       <contrib-group>
			       <contrib contrib-type="author" id="c2" corresp="yes">
			          <name>
			            <surname>Zanjirani Farahani</surname>
			            <given-names>Reza</given-names>
			          </name>
					  <aff></aff>
			        </contrib>
			       </contrib-group>
			      <pub-date pub-type="ppub">
			        <day>07</day>
			        <month>05</month>
			        <year>2013</year>
			      </pub-date>
			      <volume>42</volume>
			      <issue>7</issue>
			      <fpage>947</fpage>
			      <lpage>960</lpage>
			      <history>
			        <date date-type="received">
			          <day>07</day>
			          <month>05</month>
			          <year>2013</year>
			        </date>
			        <date date-type="accepted">
			          <day>07</day>
			          <month>05</month>
			          <year>2013</year>
			        </date>
			      </history>
			      <permissions>
			      	<copyright-statement>Copyright &#x000a9; 2013, University of Tehran. </copyright-statement>	
			        <copyright-year>2013</copyright-year>
			      </permissions>
			       <self-uri xlink:href="https://jac.ut.ac.ir/article_7814.html">https://jac.ut.ac.ir/article_7814.html</self-uri> 		
			      <abstract>
			        <p>unavailable</p>
			      </abstract>
					<kwd-group kwd-group-type="author">
						<kwd>Logistics Network Design</kwd>
						<kwd>Supply Chain Network</kwd>
						<kwd>Memetic Algorithm</kwd>
						<kwd>Integrated Logistics Network Design</kwd>
					</kwd-group>
			    </article-meta>
			  </front>
</article>