<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" 

"journalpublishing3.dtd">

<article 
article-type="research-article"
dtd-version="3.0" xml:lang="en" 
xmlns:mml="http://www.w3.org/1998/Math/MathML"
xmlns:xlink="http://www.w3.org/1999/xlink" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
>

<front>

<journal-meta>

  <journal-id journal-id-type="publisher">1</journal-id>
  <issn>2538-4201</issn>

  <publisher>

	<publisher-name>Research Center on Developing Advanced Technologies</publisher-name>
  </publisher>

</journal-meta>



<article-meta>

  <article-id pub-id-type="publisher-id">734</article-id>

  <article-categories>
	<subj-group>
	  <subject>Paper</subject>

	</subj-group>
  </article-categories>

  <title-group>
	<article-title>A POS Tagging System in the Persian Language</article-title>

  </title-group>

  


  <contrib-group>

  
	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

  </contrib-group>

  
			<aff>

			
	</aff>
 
 
  


  <pub-date pub-type="pub">

	<day>1</day>
	<month>3</month>

	<year>2010</year>

  </pub-date>

  <volume>6</volume>

  <issue>2</issue>

  <fpage>13</fpage>

  <lpage>26</lpage>

  
			  <history>

				<date date-type="received">

				  <day>20</day>
				  <month>03</month>
				  <year>2010</year>
				</date>

			  </history>

		
			  <history>

				<date date-type="accepted">

				  <day>19</day>
				  <month>02</month>
				  <year>2018</year>
				</date>

			  </history>

		
</article-meta>

</front>



<body>

Abstract: Part-Of-Speech (POS) tagging is essential work for many models and methods in other areas in natural language processing such as machine translation, spell checker, text-to-speech, automatic speech recognition, etc. So far, high accurate POS taggers have been created in many languages. In this paper, we focus on POS tagging in the Persian language. Because of problems in Persian POS tagging, a comprehensive plan is proposed to reach a high efficient POS tagger in this language. Afterward, morphological analysis is investigated in Persian and it is shown that using a morphological analyzer in inflection level, POS tagging has been improved greatly. The results describe the fruitfulness of the proposed method.
</body>

</article>


  <article-id pub-id-type="publisher-id">735</article-id>

  <article-categories>
	<subj-group>
	  <subject>Paper</subject>

	</subj-group>
  </article-categories>

  <title-group>
	<article-title>Automatic Classification of Lung Tissue Patterns in HRCT Images of Patients Affected with ILD</article-title>

  </title-group>

  


  <contrib-group>

  
	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

  </contrib-group>

  
			<aff>

			
	</aff>
 
 
  


  <pub-date pub-type="pub">

	<day>1</day>
	<month>3</month>

	<year>2010</year>

  </pub-date>

  <volume>6</volume>

  <issue>2</issue>

  <fpage>27</fpage>

  <lpage>38</lpage>

  
			  <history>

				<date date-type="received">

				  <day>20</day>
				  <month>03</month>
				  <year>2010</year>
				</date>

			  </history>

		
			  <history>

				<date date-type="accepted">

				  <day>19</day>
				  <month>02</month>
				  <year>2018</year>
				</date>

			  </history>

		
</article-meta>

</front>



<body>

Abstract: The purpose of this study was to apply recurrence plots on event related potentials (ERPs) recorded during memory recognition tests. EEG signals recorded during memory retrieval in four scalp region were used. Two most important ERP&#8217;s components corresponding to memory retrieval, FN400 and LPC, were detected in recurrence plots computed for single-trial EEGs. In addition, the RQA was used to quantify changes in signal dynamic structure during memory retrieval, and measures of complexity as RQA variables were computed. Given the stimulus, amplitude of the RQA variables increases around 400ms, corresponding to dimension reduction of system. Furthermore, after 800ms these amplitudes decreased which can be as a consequence of an increase in system dimension and complexity and back to its basic state. The mean amplitude of Old items was more than New one. Furthermore we applied statistical analysis (t-test) to find meaningful difference between features extracted from nonlinear measures. Using this method, we found its ability to detect memory components of EEG signals and to do a distinction between Old/ New items. In contrast with linear techniques, recurrence plots and RQA do not need large number of recorded trials, and they can indicate changes in even single-trial EEGs. RQA can also show differences between old and new events in a memory process.
</body>

</article>


  <article-id pub-id-type="publisher-id">727</article-id>

  <article-categories>
	<subj-group>
	  <subject>Paper</subject>

	</subj-group>
  </article-categories>

  <title-group>
	<article-title>TTS speech databases</article-title>

  </title-group>

  


  <contrib-group>

  
	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

  </contrib-group>

  
			<aff>

			
	</aff>
 
 
  


  <pub-date pub-type="pub">

	<day>1</day>
	<month>3</month>

	<year>2010</year>

  </pub-date>

  <volume>6</volume>

  <issue>2</issue>

  <fpage>35</fpage>

  <lpage>12</lpage>

  
			  <history>

				<date date-type="received">

				  <day>20</day>
				  <month>03</month>
				  <year>2010</year>
				</date>

			  </history>

		
			  <history>

				<date date-type="accepted">

				  <day>19</day>
				  <month>02</month>
				  <year>2018</year>
				</date>

			  </history>

		
</article-meta>

</front>



<body>

Abstract Speech databases are part of the concatenative text to speech synthesis systems. Phonetic quality of the databases plays a significant role in the naturalness of the synthesized speech. This paper introduces two syllable and diphone speech databases for Persian and investigates the way of their development and their specifications and their advantages to each other.

																		

																		
																			
																				
																					
																					
																						
																							
																								
																								
																									
																										
																											
																											
																												
																													
																														
																														
																														
																														
																															
																																
																																	
																																	
																																		
																																			
																																				
																																				Abstract Speech databases are part of the concatenative text to speech synthesis systems. Phonetic quality of the databases plays a significant role in the naturalness of the synthesized speech. This paper introduces two syllable and diphone speech databases for Persian and investigates the way of their development and their specifications and their advantages to each other.
</body>

</article>


  <article-id pub-id-type="publisher-id">736</article-id>

  <article-categories>
	<subj-group>
	  <subject>Paper</subject>

	</subj-group>
  </article-categories>

  <title-group>
	<article-title>Applying Recurrence Plots for Identifying Memory Components in Single-Trial EEGs</article-title>

  </title-group>

  


  <contrib-group>

  
	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

  </contrib-group>

  
			<aff>

			
	</aff>
 
 
  


  <pub-date pub-type="pub">

	<day>1</day>
	<month>3</month>

	<year>2010</year>

  </pub-date>

  <volume>6</volume>

  <issue>2</issue>

  <fpage>39</fpage>

  <lpage>52</lpage>

  
			  <history>

				<date date-type="received">

				  <day>20</day>
				  <month>03</month>
				  <year>2010</year>
				</date>

			  </history>

		
			  <history>

				<date date-type="accepted">

				  <day>21</day>
				  <month>02</month>
				  <year>2018</year>
				</date>

			  </history>

		
</article-meta>

</front>



<body>

Abstract: The purpose of this study was to apply recurrence plots on event related potentials (ERPs) recorded during memory recognition tests. EEG signals recorded during memory retrieval in four scalp region were used. Two most important ERP&#8217;s components corresponding to memory retrieval, FN400 and LPC, were detected in recurrence plots computed for single-trial EEGs. In addition, the RQA was used to quantify changes in signal dynamic structure during memory retrieval, and measures of complexity as RQA variables were computed. Given the stimulus, amplitude of the RQA variables increases around 400ms, corresponding to dimension reduction of system. Furthermore, after 800ms these amplitudes decreased which can be as a consequence of an increase in system dimension and complexity and back to its basic state. The mean amplitude of Old items was more than New one. Furthermore we applied statistical analysis (t-test) to find meaningful difference between features extracted from nonlinear measures. Using this method, we found its ability to detect memory components of EEG signals and to do a distinction between Old/ New items. In contrast with linear techniques, recurrence plots and RQA do not need large number of recorded trials, and they can indicate changes in even single-trial EEGs. RQA can also show differences between old and new events in a memory process.
</body>

</article>


  <article-id pub-id-type="publisher-id">737</article-id>

  <article-categories>
	<subj-group>
	  <subject>Paper</subject>

	</subj-group>
  </article-categories>

  <title-group>
	<article-title>A Neural Network Model of Mapping from</article-title>

  </title-group>

  


  <contrib-group>

  
	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

  </contrib-group>

  
			<aff>

			
	</aff>
 
 
  


  <pub-date pub-type="pub">

	<day>1</day>
	<month>3</month>

	<year>2010</year>

  </pub-date>

  <volume>6</volume>

  <issue>2</issue>

  <fpage>53</fpage>

  <lpage>62</lpage>

  
			  <history>

				<date date-type="received">

				  <day>20</day>
				  <month>03</month>
				  <year>2010</year>
				</date>

			  </history>

		
			  <history>

				<date date-type="accepted">

				  <day>19</day>
				  <month>02</month>
				  <year>2018</year>
				</date>

			  </history>

		
</article-meta>

</front>



<body>

Abstract: Medial entorhinal cortex is known to be the hub of a brain system for navigation and spatial representation. These cells increase firing frequency at multiple regions in the environment, arranged in regular triangular grids. Each cell has some properties including spacing, orientation, and phase shift of the nodes of its grid. Entorhinal cortex is commonly perceived to be the major input and output structure of hippocampal formation; grid cells are one synapse upstream of place cells in hippocampus. The problem is how single confined place fields can be generated from the repetitive activity of grid cells. In this article we have proposed an artificial neural network model based on radial basis function, which allows for the single confined place fields of hippocampal pyramidal cells to be emerged from the activities of grid cells. In order to evaluate the performance of the model, it was considered in two steps in a one-dimensional and two-dimensional environment. Simulations were done considering different characteristics of grid cells and the model demonstrated a good performance in generating single spot activity for place fields.
</body>

</article>


  <article-id pub-id-type="publisher-id">738</article-id>

  <article-categories>
	<subj-group>
	  <subject>Paper</subject>

	</subj-group>
  </article-categories>

  <title-group>
	<article-title>An Introduction of New DESICA Algorithm for Blind Speech Separation in Dynamic Case</article-title>

  </title-group>

  


  <contrib-group>

  
	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

  </contrib-group>

  
			<aff>

			
	</aff>
 
 
  


  <pub-date pub-type="pub">

	<day>1</day>
	<month>3</month>

	<year>2010</year>

  </pub-date>

  <volume>6</volume>

  <issue>2</issue>

  <fpage>63</fpage>

  <lpage>74</lpage>

  
			  <history>

				<date date-type="received">

				  <day>20</day>
				  <month>03</month>
				  <year>2010</year>
				</date>

			  </history>

		
			  <history>

				<date date-type="accepted">

				  <day>19</day>
				  <month>02</month>
				  <year>2018</year>
				</date>

			  </history>

		
</article-meta>

</front>



<body>

Abstract: We consider a new scenario in blind speech separation problem in which the number and the features of active sources change with time in opposite to the previous methods in which all sources are active all the time. Accordingly, we propose the new DESICA algorithm for source separation which is a compound of the ICA and DESPRIT algorithms. In this algorithm, using the ICA, the separation process is performed initially and then using the DESPRIT algorithm, the binary mask of silence intervals is calculated. Finally, by applying the binary mask to the separated signals, the final separation is obtained. Simulation results show that the DESICA algorithm improves the SDR and SIR about 6dB compared to those of the DESPRIT algorithm. Also, the SEN is improved about 11 and 17dB with respect to those of the ICA and DESPRIT algorithms.
</body>

</article>


  <article-id pub-id-type="publisher-id">739</article-id>

  <article-categories>
	<subj-group>
	  <subject>Paper</subject>

	</subj-group>
  </article-categories>

  <title-group>
	<article-title>Review of JPEG Steganography Methods and Their Security Analysis</article-title>

  </title-group>

  


  <contrib-group>

  
	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

  </contrib-group>

  
			<aff>

			
	</aff>
 
 
  


  <pub-date pub-type="pub">

	<day>1</day>
	<month>3</month>

	<year>2010</year>

  </pub-date>

  <volume>6</volume>

  <issue>2</issue>

  <fpage>75</fpage>

  <lpage>98</lpage>

  
			  <history>

				<date date-type="received">

				  <day>20</day>
				  <month>03</month>
				  <year>2010</year>
				</date>

			  </history>

		
			  <history>

				<date date-type="accepted">

				  <day>19</day>
				  <month>02</month>
				  <year>2018</year>
				</date>

			  </history>

		
</article-meta>

</front>



<body>

Abstract: JPEG is the most applicable image format in digital communication. In recent years, various steganography methods have been proposed for it. This paper aims to study and classify JPEG steganography schemes and introduce different methods to improve their security based on cover. Accordingly, the effective factors in security that are related to the cover such as double compression, spatial frequencies and quality factor have been evaluated theoretically and experimentally. Also some well-known steganography algorithms and software tools have been introduced, evaluated and classified based on different criteria. Some of these algorithms have been implemented in Stegotest software and the destruction effects of steganography in different methods have been compared.
</body>

</article>

