<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>Shahrood University of Technology</PublisherName>
				<JournalTitle>Journal of AI and Data Mining</JournalTitle>
				<Issn>2322-5211</Issn>
				<Volume>2</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2014</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Image quality enhancement in digital panoramic radiograph</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>1</FirstPage>
			<LastPage>6</LastPage>
			<ELocationID EIdType="pii">112</ELocationID>
			
<ELocationID EIdType="doi">10.22044/jadm.2014.112</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Sekine</FirstName>
					<LastName>Asadi Amiri</LastName>
<Affiliation>Shrood University of Technology</Affiliation>

</Author>
<Author>
					<FirstName>Ehsan</FirstName>
					<LastName>Moudi</LastName>
<Affiliation>Department of Dental Maxillofacial Radiology, University of Medical Science Babol, Babol, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2013</Year>
					<Month>01</Month>
					<Day>29</Day>
				</PubDate>
			</History>
		<Abstract>One of the most common positioning errors in panoramic radiography is palatoglossal air space above the apices of the root of maxillary teeth. It causes a radiolucency obscuring the apices of maxillary teeth. In the case of this positioning error, the imaging should be repeated. This causes the patient be exposed to radiation again. To avoid the repetition of exposing harmful X-rays to the patient, it is necessary to improve the panoramic images. This paper presents a new automatic panoramic image enhancement method to reduce the effect of this positioning error. Experimental results indicate that the enhanced panoramic images provide with adequate diagnostic information specially in maxilla sinusoid region. Hence, this technique dispenses the need for repetition of X-ray imaging.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Image Enhancement</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Gamma Correction</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Panoramic Radiography</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Gray Level Co-Occurrence Matrix</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Homogeneity</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jad.shahroodut.ac.ir/article_112_39a9dc559a9e7dddb43fbdbded89d7e5.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Shahrood University of Technology</PublisherName>
				<JournalTitle>Journal of AI and Data Mining</JournalTitle>
				<Issn>2322-5211</Issn>
				<Volume>2</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2014</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Data mining for decision making in engineering optimal design</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>7</FirstPage>
			<LastPage>14</LastPage>
			<ELocationID EIdType="pii">125</ELocationID>
			
<ELocationID EIdType="doi">10.22044/jadm.2014.125</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Amir</FirstName>
					<LastName>Mosavi</LastName>
<Affiliation>University of Debrecen</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2013</Year>
					<Month>03</Month>
					<Day>02</Day>
				</PubDate>
			</History>
		<Abstract>Often in modeling the engineering optimization design problems, the value of objective function(s) is not clearly defined in terms of design variables. Instead it is obtained by some numerical analysis such as FE structural analysis, fluid mechanic analysis, and thermodynamic analysis, etc. Yet, the numerical analyses are considerably time consuming to obtain the final value of objective function(s). For the reason of reducing the number of analyses as few as possible our methodology works as a supporting tool to the meta-models. The research in meta-modeling for multiobjective optimization are relatively young and there is still much to do. Here is shown that visualizing the problem on the basis of the randomly sampled geometrical big-data of computer aided design (CAD) and computer aided engineering (CAE) simulation results, combined with utilizing classification tool of data mining could be effective as a supporting system to the available meta-modeling approaches. &lt;br /&gt;To evaluate the effectiveness of the proposed method a study case in 3D wing optimal design is given. Along with the study case, it is discussed that how effective the proposed methodology could be in further practical engineering design problems.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">data mining</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Classification</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Multiobjective Optimization</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Engineering Optimization</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Meta-Modeling</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jad.shahroodut.ac.ir/article_125_dbf5620361c9364931cf67338c1b3b0d.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Shahrood University of Technology</PublisherName>
				<JournalTitle>Journal of AI and Data Mining</JournalTitle>
				<Issn>2322-5211</Issn>
				<Volume>2</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2014</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Applying mean shift and motion detection approaches to hand tracking in sign language</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>15</FirstPage>
			<LastPage>24</LastPage>
			<ELocationID EIdType="pii">145</ELocationID>
			
<ELocationID EIdType="doi">10.22044/jadm.2014.145</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Mohammad Mehdi</FirstName>
					<LastName>Hosseini</LastName>
<Affiliation>islamic azad university, branch of shahrood</Affiliation>

</Author>
<Author>
					<FirstName>Jalal</FirstName>
					<LastName>Hassanian</LastName>
<Affiliation>Islamic Azad University, Shahrood branch, Shahrood</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2013</Year>
					<Month>02</Month>
					<Day>25</Day>
				</PubDate>
			</History>
		<Abstract>Hand gesture recognition is very important to communicate in sign language. In this paper, an effective object tracking and hand gesture recognition method is proposed. This method is combination of two well-known approaches, the mean shift and the motion detection algorithm. The mean shift algorithm can track objects based on the color, then when hand passes the face occlusion happens. Several solutions such as the particle filter, kalman filter and dynamic programming tracking have been used, but they are complicated, time consuming and so expensive. The proposed method is so easy, fast, efficient and low cost. In the first step, the motion detection algorithm subtracts the previous frame from the current frame to obtain the changes between two images and white pixels (motion level) are detected by using the threshold level. Then the mean shift algorithm is applied for tracking the hand motion. Simulation results show this method is faster than two times to compared with the old common algorithms</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Hand tracking</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Motion detection</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Mean shift</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Hand gesture recognition</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">sign language</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jad.shahroodut.ac.ir/article_145_8143568b83f13deb39474fd3d5a4e854.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Shahrood University of Technology</PublisherName>
				<JournalTitle>Journal of AI and Data Mining</JournalTitle>
				<Issn>2322-5211</Issn>
				<Volume>2</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2014</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Prioritize the ordering of URL queue in Focused crawler</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>25</FirstPage>
			<LastPage>31</LastPage>
			<ELocationID EIdType="pii">146</ELocationID>
			
<ELocationID EIdType="doi">10.22044/jadm.2014.146</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Deepika</FirstName>
					<LastName>Koundal</LastName>
<Affiliation>panjab university</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2013</Year>
					<Month>03</Month>
					<Day>14</Day>
				</PubDate>
			</History>
		<Abstract>The enormous growth of the World Wide Web in recent years has made it necessary to perform resource discovery efficiently. For a crawler it is not an simple task to download the domain specific web pages. This unfocused approach often shows undesired results. Therefore, several new ideas have been proposed, among them a key technique is focused crawling which is able to crawl particular topical portions of the World Wide Web quickly without having to explore all web pages. Focused crawling is a technique which is able to crawled particular topics quickly and efficiently without exploring all WebPages. The proposed approach does not only use keywords for the crawl, but rely on high-level background knowledge with concepts and relations, which are compared with the texts of the searched page. &lt;br /&gt;In this paper a combined crawling strategy is proposed that integrates the link analysis algorithm with association metric. An approach is followed to find out the relevant pages before the process of crawling and to prioritizing the URL queue for downloading higher relevant pages, to an optimal level based on domain dependent ontology. This strategy make use of ontology to estimate the semantic contents of the URL without exploring which in turn strengthen the ordering metric for URL queue and leads to the retrieval of most relevant pages.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">WebCrawler</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Importance-metrics</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Association - metric</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Ontology</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jad.shahroodut.ac.ir/article_146_850e14631252e827aae124f6bc171dce.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Shahrood University of Technology</PublisherName>
				<JournalTitle>Journal of AI and Data Mining</JournalTitle>
				<Issn>2322-5211</Issn>
				<Volume>2</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2014</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Local gradient pattern - A novel feature representation for facial expression recognition</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>33</FirstPage>
			<LastPage>38</LastPage>
			<ELocationID EIdType="pii">147</ELocationID>
			
<ELocationID EIdType="doi">10.22044/jadm.2014.147</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Mohammad Shahidol</FirstName>
					<LastName>Islam</LastName>
<Affiliation>NIDA, Bangkok</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2013</Year>
					<Month>04</Month>
					<Day>23</Day>
				</PubDate>
			</History>
		<Abstract>Many researchers adopt Local Binary Pattern for pattern analysis. However, the long histogram created by Local Binary Pattern is not suitable for large-scale facial database. This paper presents a simple facial pattern descriptor for facial expression recognition. Local pattern is computed based on local gradient flow from one side to another side through the center pixel in a 3x3 pixels region. The center pixel of that region is represented by two separate two-bit binary patterns, named as Local Gradient Pattern-LGP for that pixel. LGP pattern is extracted from each pixel. Facial image is divided into 81 equal sized blocks and the histograms of local LGP features for all 81 blocks are concatenated to build the feature vector. Experimental results prove that the proposed technique along with Support Vector Machine is effective for facial expression recognition.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Facial  Expression  Recognition</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Local  Feature Descriptor</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Pattern  Recognition</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">CK+</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">LIBSVM</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jad.shahroodut.ac.ir/article_147_65fecf9ec71ccfdba7f9ba1bf07251b1.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Shahrood University of Technology</PublisherName>
				<JournalTitle>Journal of AI and Data Mining</JournalTitle>
				<Issn>2322-5211</Issn>
				<Volume>2</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2014</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Solution of Multi-Objective optimal reactive power dispatch using pareto optimality particle swarm optimization method</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>39</FirstPage>
			<LastPage>52</LastPage>
			<ELocationID EIdType="pii">149</ELocationID>
			
<ELocationID EIdType="doi">10.22044/jadm.2014.149</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Syed Abbas</FirstName>
					<LastName>Taher</LastName>
<Affiliation>Department of Electrical Engineering, University of Kashan, Kashan, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Mojtaba</FirstName>
					<LastName>Pakdel</LastName>
<Affiliation>Department of Electrical Engineering, University of Kashan, Kashan, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2013</Year>
					<Month>02</Month>
					<Day>23</Day>
				</PubDate>
			</History>
		<Abstract>For multi-objective optimal reactive power dispatch (MORPD), a new approach is proposed where simultaneous minimization of the active power transmission loss, the bus voltage deviation and the voltage stability index of a power system are achieved. Optimal settings of continuous and discrete control variables (e.g. generator voltages, tap positions of tap changing transformers and the number of shunt reactive compensation devices to be switched)are determined. MORPD is solved using particle swarm optimization (PSO). Also, Pareto Optimality PSO (POPSO) is proposed to improve the performance of the multi-objective optimization task defined with competing and non-commensurable objectives. The decision maker requires managing a representative Pareto-optimal set which is being provided by imposition of a hierarchical clustering algorithm. The proposed approach was tested using IEEE 30-bus and IEEE 118-bus test systems. When simulation results are compared with several commonly used algorithms, they indicate better performance and good potential for their efficient applications in solving MORPD problems.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Multi-objective 0ptimal reactive power dispatch</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Pareto optimality</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Particle Swarm Optimization</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jad.shahroodut.ac.ir/article_149_947c5e34f179d1577d7c2e162ec6f0e6.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Shahrood University of Technology</PublisherName>
				<JournalTitle>Journal of AI and Data Mining</JournalTitle>
				<Issn>2322-5211</Issn>
				<Volume>2</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2014</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Classification of emotional speech using spectral pattern features</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>53</FirstPage>
			<LastPage>61</LastPage>
			<ELocationID EIdType="pii">150</ELocationID>
			
<ELocationID EIdType="doi">10.22044/jadm.2014.150</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Ali</FirstName>
					<LastName>Harimi</LastName>
<Affiliation>Faculty of Electrical &amp; Computer Engineering, Semnan University</Affiliation>

</Author>
<Author>
					<FirstName>Ali</FirstName>
					<LastName>Shahzadi</LastName>
<Affiliation>Faculty of Electrical &amp; Computer Engineering, Semnan University</Affiliation>

</Author>
<Author>
					<FirstName>Alireza</FirstName>
					<LastName>Ahmadyfard</LastName>
<Affiliation>Department of Electrical Engineering and Robotics, Shahrood University of technology</Affiliation>

</Author>
<Author>
					<FirstName>Khashayar</FirstName>
					<LastName>Yaghmaie</LastName>
<Affiliation>Faculty of Electrical &amp; Computer Engineering, Semnan University</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2013</Year>
					<Month>03</Month>
					<Day>11</Day>
				</PubDate>
			</History>
		<Abstract>Speech Emotion Recognition (SER) is a new and challenging research area with a wide range of applications in man-machine interactions. The aim of a SER system is to recognize human emotion by analyzing the acoustics of speech sound. In this study, we propose Spectral Pattern features (SPs) and Harmonic Energy features (HEs) for emotion recognition. These features extracted from the spectrogram of speech signal using image processing techniques. For this purpose, details in the spectrogram image are firstly highlighted using histogram equalization technique. Then, directional filters are applied to decompose the image into 6 directional components. Finally, binary masking approach is employed to extract SPs from sub-banded images. The proposed HEs are also extracted by implementing the band pass filters on the spectrogram image. The extracted features are reduced in dimensions using a filtering feature selection algorithm based on fisher discriminant ratio. The classification accuracy of the pro-posed SER system has been evaluated using the 10-fold cross-validation technique on the Berlin database. The average recognition rate of 88.37% and 85.04% were achieved for females and males, respectively. By considering the total number of males and females samples, the overall recognition rate of 86.91% was obtained.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Speech emotion recognition</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">spectral pattern features</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">harmonic energy features</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">cross validation</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jad.shahroodut.ac.ir/article_150_91f7a51f3a7917443555dfe0b2992b62.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Shahrood University of Technology</PublisherName>
				<JournalTitle>Journal of AI and Data Mining</JournalTitle>
				<Issn>2322-5211</Issn>
				<Volume>2</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2014</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A Time-Frequency approach for EEG signal segmentation</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>63</FirstPage>
			<LastPage>71</LastPage>
			<ELocationID EIdType="pii">151</ELocationID>
			
<ELocationID EIdType="doi">10.22044/jadm.2014.151</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Milad</FirstName>
					<LastName>Azarbad</LastName>
<Affiliation>Babol University of Technology</Affiliation>

</Author>
<Author>
					<FirstName>Hamed</FirstName>
					<LastName>Azami</LastName>
<Affiliation>Iran University of Science and Technology</Affiliation>

</Author>
<Author>
					<FirstName>Saeid</FirstName>
					<LastName>Sanei</LastName>
<Affiliation>Faculty of Engineering and Physical Sciences, University of Surrey</Affiliation>

</Author>
<Author>
					<FirstName>A</FirstName>
					<LastName>Ebrahimzadeh</LastName>
<Affiliation>Department of Electrical and Computer Engineering, Babol University of Technology, Babol, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2013</Year>
					<Month>03</Month>
					<Day>18</Day>
				</PubDate>
			</History>
		<Abstract>The record of human brain neural activities, namely electroencephalogram (EEG), is generally known as a non-stationary and nonlinear signal. In many applications, it is useful to divide the EEGs into segments within which the signals can be considered stationary. Combination of empirical mode decomposition (EMD) and Hilbert transform, called Hilbert-Huang transform (HHT), is a new and powerful tool in signal processing. Unlike traditional time-frequency approaches, HHT exploits the nonlinearity of the medium and non-stationarity of the EEG signals. In addition, we use singular spectrum analysis (SSA) in the pre-processing step as an effective noise removal approach. By using synthetic and real EEG signals, the proposed method is compared with wavelet generalized likelihood ratio (WGLR) as a well-known signal segmentation method. The simulation results indicate the performance superiority of the proposed method.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">EEG signal segmentation</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">time-frequency</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">empirical mode decomposition (EMD)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">singular spectrum analysis (SSA)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Hilbert-Huang transform (HHT)</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jad.shahroodut.ac.ir/article_151_7bf964d0d2b1ef1353e582625f70df1e.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Shahrood University of Technology</PublisherName>
				<JournalTitle>Journal of AI and Data Mining</JournalTitle>
				<Issn>2322-5211</Issn>
				<Volume>2</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2014</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Yarn tenacity modeling using artificial neural networks and development of a decision support system based on genetic algorithms</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>73</FirstPage>
			<LastPage>78</LastPage>
			<ELocationID EIdType="pii">187</ELocationID>
			
<ELocationID EIdType="doi">10.22044/jadm.2014.187</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Mohaddeseh</FirstName>
					<LastName>Dashti</LastName>
<Affiliation>Textile Engineering Department, Yazd University</Affiliation>

</Author>
<Author>
					<FirstName>Vali</FirstName>
					<LastName>Derhami</LastName>
<Affiliation>Electrical and computer engineering department, Yazd University</Affiliation>

</Author>
<Author>
					<FirstName>Esfandiar</FirstName>
					<LastName>Ekhtiyari</LastName>
<Affiliation>Textile Engineering Department, Yazd University</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2013</Year>
					<Month>04</Month>
					<Day>25</Day>
				</PubDate>
			</History>
		<Abstract>Yarn tenacity is one of the most important properties in yarn production. This paper addresses modeling of yarn tenacity as well as optimally determining the amounts of the effective inputs to produce yarn with desired tenacity. The artificial neural network is used as a suitable structure for tenacity modeling of cotton yarn with 30 Ne. As the first step for modeling, the empirical data is collected for cotton yarns. Then, the structure of the neural network is determined and its parameters are adjusted by back propagation method. The efficiency and accuracy of the neural model is measured based on percentage of error as well as coefficient determination. The obtained experimental results show that the neural model could predicate the tenacity with less than 3.5% error. Afterwards, utilizing genetic algorithms, a new method is proposed for optimal determination of input values in yarn production to reach the desired tenacity. We conducted several experiments for different ranges with various production cost functions. The proposed approach could find the best input values to reach the desired tenacity considering the production costs.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Artificial Neural Network</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Genetic Algorithm</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Yarn tenacity</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">modeling</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jad.shahroodut.ac.ir/article_187_058313a8a2fe80c3c91d6ad7a1ebc483.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Shahrood University of Technology</PublisherName>
				<JournalTitle>Journal of AI and Data Mining</JournalTitle>
				<Issn>2322-5211</Issn>
				<Volume>2</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2014</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Query expansion based on relevance feedback and latent semantic analysis</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>79</FirstPage>
			<LastPage>84</LastPage>
			<ELocationID EIdType="pii">188</ELocationID>
			
<ELocationID EIdType="doi">10.22044/jadm.2014.188</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Marziea</FirstName>
					<LastName>Rahimi</LastName>
<Affiliation>Shahrood University of Technology</Affiliation>

</Author>
<Author>
					<FirstName>Morteza</FirstName>
					<LastName>Zahedi</LastName>
<Affiliation>School of IT and computer engineering- Shahrood University of Technology</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2013</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</History>
		<Abstract>Web search engines are one of the most popular tools on the Internet which are widely-used by expert and novice users. Constructing an adequate query which represents the best specification of users’ information need to the search engine is an important concern of web users. Query expansion is a way to reduce this concern and increase user satisfaction. In this paper, a new method of query expansion is introduced. This method which is a combination of relevance feedback and latent semantic analysis, finds the relative terms to the topics of user original query based on relevant documents selected by the user in relevance feedback step. The method is evaluated and compared with the Rocchio relevance feedback. The results of this evaluation indicate the capability of the method to better representation of user’s information need and increasing significantly user satisfaction.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Query expansion</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">latent semantic analysis</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">relevant feedback</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jad.shahroodut.ac.ir/article_188_bab40eb3dcf4327ccbbeabe3ca854fff.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Shahrood University of Technology</PublisherName>
				<JournalTitle>Journal of AI and Data Mining</JournalTitle>
				<Issn>2322-5211</Issn>
				<Volume>2</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2014</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Wireless sensor network design through genetic algorithm</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>85</FirstPage>
			<LastPage>96</LastPage>
			<ELocationID EIdType="pii">189</ELocationID>
			
<ELocationID EIdType="doi">10.22044/jadm.2014.189</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Seyed Mojtaba</FirstName>
					<LastName>Hosseinirad</LastName>
<Affiliation>Department of Computer Science, Banaras Hindu University, India</Affiliation>

</Author>
<Author>
					<FirstName>S.K.</FirstName>
					<LastName>Basu</LastName>
<Affiliation>Department of Computer Science, Banaras Hindu University, India</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2013</Year>
					<Month>05</Month>
					<Day>18</Day>
				</PubDate>
			</History>
		<Abstract>In this paper, we study WSN design, as a multi-objective optimization problem using GA technique. We study the effects of GA parameters including population size, selection and crossover method and mutation probability on the design. Choosing suitable parameters is a trade-off between different network criteria and characteristics. Type of deployment, effect of network size, radio communication radius, density of sensors in an application area, and location of base station are the WSN’s characteristics investigated here. The simulation results of this study indicate that the value of radio communication radius has direct effect on radio interference, cluster-overlapping, sensor node distribution uniformity, communication energy. The optimal value of radio communication radius is not dependent on network size and type of deployment but on the density of network deployment. Location of the base station affects radio communication energy, cluster-overlapping and average number of communication per cluster head. BS located outside the application domain is preferred over that located inside. In all the network situations, random deployment has better performance compared with grid deployment.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Wireless sensor network</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">cluster head</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Genetic Algorithm</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">activesensor</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">base station</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jad.shahroodut.ac.ir/article_189_e5fef0226ad48afe5af1fc158eb8f96c.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
