
	<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"	xmlns:cr_unixml="http://www.crossref.org/xschema/1.0" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
	<responseDate>2026-06-11T13:50:54+03:30</responseDate>
	<request metadataPrefix="cr_unixml" verb="ListRecords" set="10.1002">http://ijeee.iust.ac.ir/browse.php?mag_id=3&amp;slc_lang=en&amp;sid=1</request>
	<ListRecords>
		
			
				<record>
					<header>
						<identifier>3-52</identifier>
						<datestamp>2026-06-11</datestamp>
						<setSpec>10.1002</setSpec>
					</header>
					<metadata>
						<cr_unixml:crossref xmlns="http://www.crossref.org/xschema/1.0"
							xsi:schemaLocation="http://www.crossref.org/xschema/1.0 http://www.crossref.org/schema/unixref1.0.xsd">
							<journal>
								<journal_metadata language="en">
									<full_title>Iranian Journal of Electrical and Electronic Engineering</full_title>
									<abbrev_title>IJEEE</abbrev_title>
									<issn media_type="print">1735-2827</issn>
									<issn media_type="electronic">1735-2827</issn>
									<doi_data>
										<doi></doi>
										<resource></resource>
									</doi_data>
								</journal_metadata>
								<journal_issue>
									<publication_date media_type="print">
										<year>2005</year>
									</publication_date>
									<journal_volume>
										<volume>1</volume>
									</journal_volume>
									<issue>3</issue>
									<doi_data>
										<doi></doi>
										<resource></resource>
									</doi_data>
								</journal_issue>
								<journal_article publication_type="full_text">
									<titles>
										<title>Intelligent and Robust Genetic Algorithm Based Classifier</title>
									</titles>

				<contributors>
				
				<person_name contributor_role="author" sequence="1">
					<given_name></given_name>
					<surname>S. H. Zahiri</surname>
					<email></email>
				</person_name>
					
				<person_name contributor_role="author" sequence="2">
					<given_name></given_name>
					<surname>H. Rajabi Mashhadi</surname>
					<email></email>
				</person_name>
					
				<person_name contributor_role="author" sequence="3">
					<given_name></given_name>
					<surname>S. A. Seyedin</surname>
					<email></email>
				</person_name>
				
				</contributors>
			
			<abstract>
			The concepts of robust classification and intelligently controlling the search
process of genetic algorithm (GA) are introduced and integrated with a conventional
genetic classifier for development of a new version of it, which is called Intelligent and
Robust GA-classifier (IRGA-classifier). It can efficiently approximate the decision
hyperplanes in the feature space.
It is shown experimentally that the proposed IRGA-classifier has removed two important
weak points of the conventional GA-classifiers. These problems are the large number of
training points and the large number of iterations to achieve a comparable performance with
the Bayes classifier, which is an optimal conventional classifier.
Three examples have been chosen to compare the performance of designed IRGA-classifier
to conventional GA-classifier and Bayes classifier. They are the Iris data classification, the
Wine data classification, and radar targets classification from backscattered signals. The
results show clearly a considerable improvement for the performance of IRGA-classifier
compared with a conventional GA-classifier.
			</abstract>
				<keywords>
	<keyword>Intelligent Genetic Classifiers</keyword>
	<keyword>Robust Genetic Classifiers</keyword>
	<keyword>Fuzzy Controller</keyword>
	<keyword>Genetic Algorithm</keyword>
	<keyword>Optimum Decision Hyperplanes</keyword>
	</keywords>

							  <publication_date media_type="print">
								  <year>2005</year>
								  <month>7</month>
								  <day>01</day>
							  </publication_date>
							  <pages>
								  <first_page>1</first_page>
								  <last_page>9</last_page>
							  </pages>
								  <fullTextUrl>http://ijeee.iust.ac.ir/article-1-52-en.pdf</fullTextUrl>
							  <doi_data>
								  <doi></doi>
								  <resource></resource>
							  </doi_data>
							  <citation_list>
							  </citation_list>
						  </journal_article>
					  </journal>
				  </cr_unixml:crossref>
			  </metadata>
			</record>
				
			
				<record>
					<header>
						<identifier>3-53</identifier>
						<datestamp>2026-06-11</datestamp>
						<setSpec>10.1002</setSpec>
					</header>
					<metadata>
						<cr_unixml:crossref xmlns="http://www.crossref.org/xschema/1.0"
							xsi:schemaLocation="http://www.crossref.org/xschema/1.0 http://www.crossref.org/schema/unixref1.0.xsd">
							<journal>
								<journal_metadata language="en">
									<full_title>Iranian Journal of Electrical and Electronic Engineering</full_title>
									<abbrev_title>IJEEE</abbrev_title>
									<issn media_type="print">1735-2827</issn>
									<issn media_type="electronic">1735-2827</issn>
									<doi_data>
										<doi></doi>
										<resource></resource>
									</doi_data>
								</journal_metadata>
								<journal_issue>
									<publication_date media_type="print">
										<year>2005</year>
									</publication_date>
									<journal_volume>
										<volume>1</volume>
									</journal_volume>
									<issue>3</issue>
									<doi_data>
										<doi></doi>
										<resource></resource>
									</doi_data>
								</journal_issue>
								<journal_article publication_type="full_text">
									<titles>
										<title>Improving Success Ratio in Multi-Constraint Quality of Service Routing</title>
									</titles>

				<contributors>
				
				<person_name contributor_role="author" sequence="1">
					<given_name></given_name>
					<surname>P. Khadivi</surname>
					<email></email>
				</person_name>
					
				<person_name contributor_role="author" sequence="2">
					<given_name></given_name>
					<surname>S. Samavi</surname>
					<email></email>
				</person_name>
					
				<person_name contributor_role="author" sequence="3">
					<given_name></given_name>
					<surname>H. Saidi</surname>
					<email></email>
				</person_name>
					
				<person_name contributor_role="author" sequence="4">
					<given_name></given_name>
					<surname>T. D. Todd</surname>
					<email></email>
				</person_name>
				
				</contributors>
			
			<abstract>
			Multi-constraint quality-of-service routing will become increasingly important as
the Internet evolves to support real-time services. It is well known however, that optimum
multi-constraint QoS routing is computationally complex, and for this reason various
heuristics have been proposed for routing in practical situations. Among these methods,
those that use a single mixed metric are the most popular. Although mixed metric routing
discards potentially useful information, this is compensated for by significantly reduced
complexity. Exploiting this tradeoff is becoming increasingly important where low
complexity designs are desired, such as in battery operated wireless applications. In this
paper, a novel single mixed metric multi-constraint routing algorithm is introduced. The
proposed technique has similar complexity compared with existing low complexity
methods. Simulation results are presented which show that it can obtain better performance
than comparable techniques in terms of generating feasible multi-constraint QoS routes.
			</abstract>
				<keywords>
	<keyword>QoS Routing</keyword>
	<keyword>Multi-Constraint Routing</keyword>
	<keyword>Quality Of Service</keyword>
	<keyword>Computer Networks</keyword>
	</keywords>

							  <publication_date media_type="print">
								  <year>2005</year>
								  <month>7</month>
								  <day>01</day>
							  </publication_date>
							  <pages>
								  <first_page>11</first_page>
								  <last_page>19</last_page>
							  </pages>
								  <fullTextUrl>http://ijeee.iust.ac.ir/article-1-53-en.pdf</fullTextUrl>
							  <doi_data>
								  <doi></doi>
								  <resource></resource>
							  </doi_data>
							  <citation_list>
							  </citation_list>
						  </journal_article>
					  </journal>
				  </cr_unixml:crossref>
			  </metadata>
			</record>
				
			
				<record>
					<header>
						<identifier>3-54</identifier>
						<datestamp>2026-06-11</datestamp>
						<setSpec>10.1002</setSpec>
					</header>
					<metadata>
						<cr_unixml:crossref xmlns="http://www.crossref.org/xschema/1.0"
							xsi:schemaLocation="http://www.crossref.org/xschema/1.0 http://www.crossref.org/schema/unixref1.0.xsd">
							<journal>
								<journal_metadata language="en">
									<full_title>Iranian Journal of Electrical and Electronic Engineering</full_title>
									<abbrev_title>IJEEE</abbrev_title>
									<issn media_type="print">1735-2827</issn>
									<issn media_type="electronic">1735-2827</issn>
									<doi_data>
										<doi></doi>
										<resource></resource>
									</doi_data>
								</journal_metadata>
								<journal_issue>
									<publication_date media_type="print">
										<year>2005</year>
									</publication_date>
									<journal_volume>
										<volume>1</volume>
									</journal_volume>
									<issue>3</issue>
									<doi_data>
										<doi></doi>
										<resource></resource>
									</doi_data>
								</journal_issue>
								<journal_article publication_type="full_text">
									<titles>
										<title>Pixel-Based Skin Detection for Pornography Filtering</title>
									</titles>

				<contributors>
				
				<person_name contributor_role="author" sequence="1">
					<given_name></given_name>
					<surname>A. Abadpour</surname>
					<email></email>
				</person_name>
					
				<person_name contributor_role="author" sequence="2">
					<given_name></given_name>
					<surname>S. Kasaei</surname>
					<email></email>
				</person_name>
				
				</contributors>
			
			<abstract>
			A robust skin detector is the primary need of many fields of computer vision,
including face detection, gesture recognition, and pornography filtering. Less than 10 years
ago, the first paper on automatic pornography filtering was published. Since then, different
researchers claim different color spaces to be the best choice for skin detection in
pornography filtering. Unfortunately, no comprehensive work is performed on evaluating
different color spaces and their performance for detecting naked persons. As such,
researchers usualy refer to the results of skin detection based on the work doen for face
detection, which underlies different imaging conditions. In this paper, we examine 21 color
spaces in all their possible representations for pixel-based skin detection in pornographic
images. Consequently, this paper holds a large investigation in the field of skin detection,
and a specific run on the pornographic images.
			</abstract>
				<keywords>
	<keyword>Pornography Filtering</keyword>
	<keyword>Skin Detection</keyword>
	<keyword>Content-Based Image Retrieval</keyword>
	<keyword>Color Modeling</keyword>
	<keyword>Color Image Processing</keyword>
	</keywords>

							  <publication_date media_type="print">
								  <year>2005</year>
								  <month>7</month>
								  <day>01</day>
							  </publication_date>
							  <pages>
								  <first_page>21</first_page>
								  <last_page>41</last_page>
							  </pages>
								  <fullTextUrl>http://ijeee.iust.ac.ir/article-1-54-en.pdf</fullTextUrl>
							  <doi_data>
								  <doi></doi>
								  <resource></resource>
							  </doi_data>
							  <citation_list>
							  </citation_list>
						  </journal_article>
					  </journal>
				  </cr_unixml:crossref>
			  </metadata>
			</record>
				
			
				<record>
					<header>
						<identifier>3-55</identifier>
						<datestamp>2026-06-11</datestamp>
						<setSpec>10.1002</setSpec>
					</header>
					<metadata>
						<cr_unixml:crossref xmlns="http://www.crossref.org/xschema/1.0"
							xsi:schemaLocation="http://www.crossref.org/xschema/1.0 http://www.crossref.org/schema/unixref1.0.xsd">
							<journal>
								<journal_metadata language="en">
									<full_title>Iranian Journal of Electrical and Electronic Engineering</full_title>
									<abbrev_title>IJEEE</abbrev_title>
									<issn media_type="print">1735-2827</issn>
									<issn media_type="electronic">1735-2827</issn>
									<doi_data>
										<doi></doi>
										<resource></resource>
									</doi_data>
								</journal_metadata>
								<journal_issue>
									<publication_date media_type="print">
										<year>2005</year>
									</publication_date>
									<journal_volume>
										<volume>1</volume>
									</journal_volume>
									<issue>3</issue>
									<doi_data>
										<doi></doi>
										<resource></resource>
									</doi_data>
								</journal_issue>
								<journal_article publication_type="full_text">
									<titles>
										<title>A Probabilistic Approach to Transmission Expansion Planning in Deregulated Power Systems under Uncertainties</title>
									</titles>

				<contributors>
				
				<person_name contributor_role="author" sequence="1">
					<given_name></given_name>
					<surname>H. Abdi</surname>
					<email></email>
				</person_name>
					
				<person_name contributor_role="author" sequence="2">
					<given_name></given_name>
					<surname>M. Parsa Moghaddam</surname>
					<email></email>
				</person_name>
					
				<person_name contributor_role="author" sequence="3">
					<given_name></given_name>
					<surname>M. H. Javidi</surname>
					<email></email>
				</person_name>
				
				</contributors>
			
			<abstract>
			Restructuring of power system has faced this industry with numerous
uncertainties. As a result, transmission expansion planning (TEP) like many other problems
has become a very challenging problem in such systems. Due to these changes, various
approaches have been proposed for TEP in the new environment. In this paper a new
algorithm for TEP is presented. The method is based on probabilistic locational marginal
price (LMP) considering electrical loss, transmission tariffs, and transmission congestion
costs. It also considers the load curtailment cost in LMP calculations. Furthermore, to
emphasize on competence of competition ability of the system, the final plan(s) is (are)
selected based on minimization of average of total congestion cost for transmission system.
			</abstract>
				<keywords>
	<keyword>Restructuring</keyword>
	<keyword>Transmission Expansion Planning</keyword>
	<keyword>Locational Marginal Price</keyword>
	<keyword>Load Curtailment Cost</keyword>
	</keywords>

							  <publication_date media_type="print">
								  <year>2005</year>
								  <month>7</month>
								  <day>01</day>
							  </publication_date>
							  <pages>
								  <first_page>43</first_page>
								  <last_page>52</last_page>
							  </pages>
								  <fullTextUrl>http://ijeee.iust.ac.ir/article-1-55-en.pdf</fullTextUrl>
							  <doi_data>
								  <doi></doi>
								  <resource></resource>
							  </doi_data>
							  <citation_list>
							  </citation_list>
						  </journal_article>
					  </journal>
				  </cr_unixml:crossref>
			  </metadata>
			</record>
				
			
				<record>
					<header>
						<identifier>3-56</identifier>
						<datestamp>2026-06-11</datestamp>
						<setSpec>10.1002</setSpec>
					</header>
					<metadata>
						<cr_unixml:crossref xmlns="http://www.crossref.org/xschema/1.0"
							xsi:schemaLocation="http://www.crossref.org/xschema/1.0 http://www.crossref.org/schema/unixref1.0.xsd">
							<journal>
								<journal_metadata language="en">
									<full_title>Iranian Journal of Electrical and Electronic Engineering</full_title>
									<abbrev_title>IJEEE</abbrev_title>
									<issn media_type="print">1735-2827</issn>
									<issn media_type="electronic">1735-2827</issn>
									<doi_data>
										<doi></doi>
										<resource></resource>
									</doi_data>
								</journal_metadata>
								<journal_issue>
									<publication_date media_type="print">
										<year>2005</year>
									</publication_date>
									<journal_volume>
										<volume>1</volume>
									</journal_volume>
									<issue>3</issue>
									<doi_data>
										<doi></doi>
										<resource></resource>
									</doi_data>
								</journal_issue>
								<journal_article publication_type="full_text">
									<titles>
										<title>Power Differential based Wide Area Protection</title>
									</titles>

				<contributors>
				
				<person_name contributor_role="author" sequence="1">
					<given_name></given_name>
					<surname>F. Namdari</surname>
					<email></email>
				</person_name>
					
				<person_name contributor_role="author" sequence="2">
					<given_name></given_name>
					<surname>S. Jamali</surname>
					<email></email>
				</person_name>
					
				<person_name contributor_role="author" sequence="3">
					<given_name></given_name>
					<surname>P. A. Crossley</surname>
					<email></email>
				</person_name>
				
				</contributors>
			
			<abstract>
			Current differential based wide area protection (WAP) has recently been
proposed as a technique to increase the reliability of protection systems. It increases system
stability and can prevent large contingencies such as cascading outages and blackouts. This
paper describes how power differential protection (PDP) can be used within a WAP and
shows that the algorithm operates correctly for all types of system faults whilst preventing
unwanted tripping, even if the data has been distorted by CT saturation or by data
mismatches caused by delays in the WAP data collection system.
The PDP algorithm has been simulated and tested on an Iranian 400kV transmission line
during different fault and system operating conditions. The proposed operating logic and
the PDP algorithm were also evaluated using simulation studies based on the Northern
Ireland Electricity (NIE) 275 kV network. The results presented illustrate the validity of the
proposed protection.
			</abstract>
				<keywords>
	<keyword>Wide Area Protection</keyword>
	<keyword>Power Differential Algorithm</keyword>
	<keyword>Current Differential</keyword>
	</keywords>

							  <publication_date media_type="print">
								  <year>2005</year>
								  <month>7</month>
								  <day>01</day>
							  </publication_date>
							  <pages>
								  <first_page>53</first_page>
								  <last_page>66</last_page>
							  </pages>
								  <fullTextUrl>http://ijeee.iust.ac.ir/article-1-56-en.pdf</fullTextUrl>
							  <doi_data>
								  <doi></doi>
								  <resource></resource>
							  </doi_data>
							  <citation_list>
							  </citation_list>
						  </journal_article>
					  </journal>
				  </cr_unixml:crossref>
			  </metadata>
			</record>
			
		</ListRecords>
		</OAI-PMH>
		 
  
  
  
  
 