<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Volume-7 Issue-6S2, April 2019 &#8211; International Journal of Recent Technology and Engineering (IJRTE)</title>
	<atom:link href="https://www.ijrte.org/portfolio_entries/volume-7-issue-6s2-april-2019/feed/" rel="self" type="application/rss+xml" />
	<link>https://www.ijrte.org</link>
	<description>Exploring Innovation &#124; ISSN:2277-3878(Online) &#124; A Periodical Journal &#124; Reg. No.: C/819981 &#124; Published By BEIESP</description>
	<lastBuildDate>Tue, 18 Jul 2023 07:26:59 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	

<image>
	<url>https://www.ijrte.org/wp-content/uploads/2021/02/cropped-IJRTE-Logo-WS-32x32.png</url>
	<title>Volume-7 Issue-6S2, April 2019 &#8211; International Journal of Recent Technology and Engineering (IJRTE)</title>
	<link>https://www.ijrte.org</link>
	<width>32</width>
	<height>32</height>
</image> 
	<item>
		<title>F11190476S219</title>
		<link>https://www.ijrte.org/portfolio-item/f11190476s219/</link>
		
		<dc:creator><![CDATA[IJRTE Journal]]></dc:creator>
		<pubDate>Tue, 18 Jul 2023 07:26:59 +0000</pubDate>
				<guid isPermaLink="false">https://www.ijrte.org/?post_type=portfolio&#038;p=46226</guid>

					<description><![CDATA[<p>The post <a rel="nofollow" href="https://www.ijrte.org/portfolio-item/f11190476s219/">F11190476S219</a> appeared first on <a rel="nofollow" href="https://www.ijrte.org">International Journal of Recent Technology and Engineering (IJRTE)</a>.</p>
]]></description>
										<content:encoded><![CDATA[<div  class='flex_column av-av_one_full-7714eba142aeda1f8b5272a3c372b279 av_one_full  avia-builder-el-0  avia-builder-el-no-sibling  first flex_column_div  '     ><div  class='av_promobox av-lk7z1gyg-626bda059b080ed02a87421eb75f91e4 avia-button-yes  avia-builder-el-1  avia-builder-el-no-sibling '><div class='avia-promocontent'></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif;"><span style="font-size: 14pt;"><strong><span style="font-size: 24px;">Restaurant Recommendation System Using Clusteringtechniques</span><br />
</strong><span style="font-size: 10pt;"><span style="font-size: 14pt;">Kuppani Sathish<span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><strong><sup>1</sup></strong></span>, Somula Ramasubbareddy.<span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><strong><sup>2</sup></strong></span>, K. Govinda<span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><strong><sup>3</sup></strong></span>, E. Swetha<span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><strong><sup>4</sup></strong></span></span></span></span></span><span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><span style="font-family: 'times new roman', times, serif;"><span style="font-family: 'times new roman', times, serif;"><br />
<strong><sup>1</sup></strong>Kuppani Sathish, Tirumala Engineering College, Narsaraopet, Guntur (Andhra Pradesh), India.<br />
<strong><sup>2</sup></strong>Somula Ramasubbareddy, VNRVJIET, Hyderabad (Telangana), India.<br />
<strong><sup>3</sup></strong>K. Govinda, VIT University, Vellore (Tamil Nadu), India.<br />
<strong><sup>4</sup></strong>E. Swetha, SV College of Engineering, Tirupati, (Andhra Pradesh), India.<br />
</span></span></span><span style="font-family: 'times new roman', times, serif; font-size: 10pt;">Manuscript received on 30 March 2019<strong> |</strong> Revised Manuscript received on 09 April 2019 <strong>|</strong> Manuscript Published on 27 April 2019 <strong>|</strong> PP: 917-921 <strong>|</strong> Volume-7 Issue-6S2 April 2019 <strong>|</strong> Retrieval Number: F11190476S219/2019©BEIESP </span><br />
<span style="font-family: 'times new roman', times, serif; font-size: 16px;"> <i class="fa fa-unlock-alt" style="font-size: 12px; color: blue;"></i> <a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener"> Open Access</a><strong> |</strong> <i class="far fa-file-alt" style="color: blue;"></i><a href="https://www.ijrte.org/ethics-policies/" target="_blank" rel="noopener"> Editorial and Publishing Policies</a> <strong>|</strong> <i class="fa fa-quote-right" style="color: blue;"></i> <a href="https://citation.crosscite.org/" target="_blank" rel="noopener">Cite</a> <strong>|</strong> <i class="fa fa-plus" style="font-size: 12px; color: blue;" aria-hidden="true"></i><a href="https://www.mendeley.com" target="_blank" rel="noopener"> Mendeley</a> </span><span style="font-family: 'times new roman', times, serif;"><strong>|</strong> <i class="fa fa-database" style="color: blue;" aria-hidden="true"></i><span style="font-size: 12pt;"><a href="https://www.ijrte.org/indexing/"> Indexing and Abstracting</a></span></span><br />
<span style="font-size: 12px; font-family: 'times new roman', times, serif;">© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an <a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener">open access</a> article under the CC-BY-NC-ND license <a href="https://creativecommons.org/licenses/by-nc-nd/4.0/" target="_blank" rel="noopener">(http://creativecommons.org/licenses/by-nc-nd/4.0/)</a></span></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif; font-size: 16px;"><strong>Abstract:</strong> In this system, we propose a propelled Eatery Audit framework that identifies concealed conclusions in input of the client and rates the eatery as needs be. The framework utilizes feeling mining procedure with the end goal to accomplish wanted usefulness. Assessment Digging for Eatery Surveys is a web application which gives audit of the criticism that is posted. The Framework takes criticism of different clients, in light of the supposition, framework will indicate whether the posted eatery is great, terrible, or most exceedingly terrible. We utilize a database of assumption based watchwords alongside energy or cynicism weight in database and afterward dependent on these notion catchphrases mined in client input is positioned. When the client login to the framework he sees the eatery and gives input about the eatery. Framework will utilize database and will coordinate the input with the catchphrases in database and will rank the criticism. The job of the administrator is to post new eatery and includes catchphrases in database. This application is valuable for every one of the general population who are sustenance darlings. This application additionally functions as a commercial which makes numerous individuals mindful about the eatery quality. At the point when the client taps on a specific eatery, client can see the eatery and give remark about the eatery. This application can be utilized for the clients who get a kick out of the chance to attempt diverse assortment of nourishments. This application is additionally helpful for the clients who travel around the nation. This framework discovers great eatery with delectable sustenance. The framework is likewise valuable for the individuals who get a kick out of the chance to comment. A solid connection between consumer loyalty and client unwaveringness can be gotten from overseeing client encounter . A few investigations uncovered discoveries that overseeing client encounter has potential relationship with food related properties. For instance, a few characteristics, for example, taste, staff conduct, and nourishment configuration have been recognized as key factors in creating client involvement in eatery . So also, a few traits, for example, sustenance introduction, staff competency, and nourishment taste turn into the key clincher to consumer loyalty.</span><br />
<span style="font-family: 'times new roman', times, serif; font-size: 16px;"> <strong>Keywords: </strong>Framework Application Properties Clusteringtechniques.<br />
<strong>Scope of the Article:</strong> System Integration<br />
</span></p>
<p>
</div><div  class='avia-button-wrap av-lk7z1gyg-9e8eae72b5137982d09b71ec52644a7a-wrap avia-button-right '><a href="https://www.ijrte.org/wp-content/uploads/papers/v7i6s2/F11190476S219.pdf" class="avia-button av-lk7z1gyg-9e8eae72b5137982d09b71ec52644a7a av-link-btn avia-icon_select-yes-left-icon avia-size-medium avia-position-right avia-color-theme-color" aria-label="Download PDF"><span class='avia_button_icon avia_button_icon_left avia-iconfont avia-font-entypo-fontello' data-av_icon='' data-av_iconfont='entypo-fontello' ></span><span class='avia_iconbox_title' >Download PDF</span></a></div></div></div>
<p>The post <a rel="nofollow" href="https://www.ijrte.org/portfolio-item/f11190476s219/">F11190476S219</a> appeared first on <a rel="nofollow" href="https://www.ijrte.org">International Journal of Recent Technology and Engineering (IJRTE)</a>.</p>
]]></content:encoded>
					
		
		
			</item>
		<item>
		<title>F11120476S219</title>
		<link>https://www.ijrte.org/portfolio-item/f11120476s219/</link>
		
		<dc:creator><![CDATA[IJRTE Journal]]></dc:creator>
		<pubDate>Tue, 18 Jul 2023 07:17:44 +0000</pubDate>
				<guid isPermaLink="false">https://www.ijrte.org/?post_type=portfolio&#038;p=46224</guid>

					<description><![CDATA[<p>The post <a rel="nofollow" href="https://www.ijrte.org/portfolio-item/f11120476s219/">F11120476S219</a> appeared first on <a rel="nofollow" href="https://www.ijrte.org">International Journal of Recent Technology and Engineering (IJRTE)</a>.</p>
]]></description>
										<content:encoded><![CDATA[<div  class='flex_column av-av_one_full-7714eba142aeda1f8b5272a3c372b279 av_one_full  avia-builder-el-0  avia-builder-el-no-sibling  first flex_column_div  '     ><div  class='av_promobox av-lk7yplfh-8ff5756dda52df1cb82440fbc4a793ed avia-button-yes  avia-builder-el-1  avia-builder-el-no-sibling '><div class='avia-promocontent'></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif;"><span style="font-size: 14pt;"><strong><span style="font-size: 24px;">A Review on Data Mining &amp; Big Data, Machine Learning Techniques</span><br />
</strong><span style="font-size: 10pt;"><span style="font-size: 14pt;">J. Nageswara Rao<span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><strong><sup>1</sup></strong></span>, M. Ramesh<span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><strong><sup>2</sup></strong></span></span></span></span></span><span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><span style="font-family: 'times new roman', times, serif;"><span style="font-family: 'times new roman', times, serif;"><br />
<strong><sup>1</sup></strong>Mr. J. Nageswara Rao, Research Scholar, Acharya Nagarjuna University, (Andhra Pradesh), India.<br />
<strong><sup>2</sup></strong>Dr. M. Ramesh, Associate Professor, Department of IT, RVR &amp; JC COE, Guntur (Andhra Pradesh), India.<br />
</span></span></span><span style="font-family: 'times new roman', times, serif; font-size: 10pt;">Manuscript received on 30 March 2019<strong> |</strong> Revised Manuscript received on 09 April 2019 <strong>|</strong> Manuscript Published on 27 April 2019 <strong>|</strong> PP: 914-916 <strong>|</strong> Volume-7 Issue-6S2 April 2019 <strong>|</strong> Retrieval Number: F11120476S219/2019©BEIESP </span><br />
<span style="font-family: 'times new roman', times, serif; font-size: 16px;"> <i class="fa fa-unlock-alt" style="font-size: 12px; color: blue;"></i> <a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener"> Open Access</a><strong> |</strong> <i class="far fa-file-alt" style="color: blue;"></i><a href="https://www.ijrte.org/ethics-policies/" target="_blank" rel="noopener"> Editorial and Publishing Policies</a> <strong>|</strong> <i class="fa fa-quote-right" style="color: blue;"></i> <a href="https://citation.crosscite.org/" target="_blank" rel="noopener">Cite</a> <strong>|</strong> <i class="fa fa-plus" style="font-size: 12px; color: blue;" aria-hidden="true"></i><a href="https://www.mendeley.com" target="_blank" rel="noopener"> Mendeley</a> </span><span style="font-family: 'times new roman', times, serif;"><strong>|</strong> <i class="fa fa-database" style="color: blue;" aria-hidden="true"></i><span style="font-size: 12pt;"><a href="https://www.ijrte.org/indexing/"> Indexing and Abstracting</a></span></span><br />
<span style="font-size: 12px; font-family: 'times new roman', times, serif;">© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an <a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener">open access</a> article under the CC-BY-NC-ND license <a href="https://creativecommons.org/licenses/by-nc-nd/4.0/" target="_blank" rel="noopener">(http://creativecommons.org/licenses/by-nc-nd/4.0/)</a></span></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif; font-size: 16px;"><strong>Abstract:</strong> Now a day’s large amount data stored from different data sources, which is increased based on KDD from various data sources . in the direction of acquire necessary along with useful facts from data sources, some of the techniques and tools to combine the vast amount of data sets. the main aspire of data mining is to mine necessary information from huge amount of data and to retrieval information. in data mining classification and clustering main techniques to organize and come together clear-cut data in a big set of data into essential collection sets of group labels. we present a complete analysis of various clustering and categorization approaches in data mining for capable of information recovery, which includes NN, BN and decision trees.</span><br />
<span style="font-family: 'times new roman', times, serif; font-size: 16px;"> <strong>Keywords: </strong>Clustering, Supervised, Semi Supervised, KDD, Categorical Data.<br />
<strong>Scope of the Article:</strong> Data Mining<br />
</span></p>
<p>
</div><div  class='avia-button-wrap av-lk7yplfh-61279f28d30627a2ce926aa21e0285dc-wrap avia-button-right '><a href="https://www.ijrte.org/wp-content/uploads/papers/v7i6s2/F11120476S219.pdf" class="avia-button av-lk7yplfh-61279f28d30627a2ce926aa21e0285dc av-link-btn avia-icon_select-yes-left-icon avia-size-medium avia-position-right avia-color-theme-color" aria-label="Download PDF"><span class='avia_button_icon avia_button_icon_left avia-iconfont avia-font-entypo-fontello' data-av_icon='' data-av_iconfont='entypo-fontello' ></span><span class='avia_iconbox_title' >Download PDF</span></a></div></div></div>
<p>The post <a rel="nofollow" href="https://www.ijrte.org/portfolio-item/f11120476s219/">F11120476S219</a> appeared first on <a rel="nofollow" href="https://www.ijrte.org">International Journal of Recent Technology and Engineering (IJRTE)</a>.</p>
]]></content:encoded>
					
		
		
			</item>
		<item>
		<title>F11090476S219</title>
		<link>https://www.ijrte.org/portfolio-item/f11090476s219/</link>
		
		<dc:creator><![CDATA[IJRTE Journal]]></dc:creator>
		<pubDate>Tue, 18 Jul 2023 07:12:58 +0000</pubDate>
				<guid isPermaLink="false">https://www.ijrte.org/?post_type=portfolio&#038;p=46222</guid>

					<description><![CDATA[<p>The post <a rel="nofollow" href="https://www.ijrte.org/portfolio-item/f11090476s219/">F11090476S219</a> appeared first on <a rel="nofollow" href="https://www.ijrte.org">International Journal of Recent Technology and Engineering (IJRTE)</a>.</p>
]]></description>
										<content:encoded><![CDATA[<div  class='flex_column av-av_one_full-7714eba142aeda1f8b5272a3c372b279 av_one_full  avia-builder-el-0  avia-builder-el-no-sibling  first flex_column_div  '     ><div  class='av_promobox av-lk7yjdqn-3d10fdd30a5cc34eac54306ec946877a avia-button-yes  avia-builder-el-1  avia-builder-el-no-sibling '><div class='avia-promocontent'></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif;"><span style="font-size: 14pt;"><strong><span style="font-size: 24px;">Improving Efficiency in EEG process using Linear Discriminant Analysis and Support Vector Machine</span><br />
</strong><span style="font-size: 10pt;"><span style="font-size: 14pt;">Lella Kranthi Kumar</span></span></span></span><span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><span style="font-family: 'times new roman', times, serif;"><span style="font-family: 'times new roman', times, serif;"><br />
Mr. Lella Kranthi Kumar, Assistant Professor, Department of CSE, LBRCE, Mylavaram (Andhra Pradesh), India.<br />
</span></span></span><span style="font-family: 'times new roman', times, serif; font-size: 10pt;">Manuscript received on 30 March 2019<strong> |</strong> Revised Manuscript received on 09 April 2019 <strong>|</strong> Manuscript Published on 27 April 2019 <strong>|</strong> PP: 910-913 <strong>|</strong> Volume-7 Issue-6S2 April 2019 <strong>|</strong> Retrieval Number: F11090476S219/2019©BEIESP </span><br />
<span style="font-family: 'times new roman', times, serif; font-size: 16px;"> <i class="fa fa-unlock-alt" style="font-size: 12px; color: blue;"></i> <a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener"> Open Access</a><strong> |</strong> <i class="far fa-file-alt" style="color: blue;"></i><a href="https://www.ijrte.org/ethics-policies/" target="_blank" rel="noopener"> Editorial and Publishing Policies</a> <strong>|</strong> <i class="fa fa-quote-right" style="color: blue;"></i> <a href="https://citation.crosscite.org/" target="_blank" rel="noopener">Cite</a> <strong>|</strong> <i class="fa fa-plus" style="font-size: 12px; color: blue;" aria-hidden="true"></i><a href="https://www.mendeley.com" target="_blank" rel="noopener"> Mendeley</a> </span><span style="font-family: 'times new roman', times, serif;"><strong>|</strong> <i class="fa fa-database" style="color: blue;" aria-hidden="true"></i><span style="font-size: 12pt;"><a href="https://www.ijrte.org/indexing/"> Indexing and Abstracting</a></span></span><br />
<span style="font-size: 12px; font-family: 'times new roman', times, serif;">© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an <a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener">open access</a> article under the CC-BY-NC-ND license <a href="https://creativecommons.org/licenses/by-nc-nd/4.0/" target="_blank" rel="noopener">(http://creativecommons.org/licenses/by-nc-nd/4.0/)</a></span></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif; font-size: 16px;"><strong>Abstract:</strong> The advancement in the bio medical examinations with the help of advanced technologies is tremendously increasing. Here we represent a model in which the EEG images of frequency signals can be processed with the help of machine learning techniques and finding their seizure. We mentioned the accuracy to let the readers know how to get the most out of the given EEG images if processed. This also is process in which we process the images by extracting the features of the EEG by the usage of LDA and then changing over to SVM for the latter classification. This can also be useful for calculation of sleep states and neural disorders due to lack of neural activity in the brain. BCI plays a key role in the supply of the images of EEG and its analysis.</span><br />
<span style="font-family: 'times new roman', times, serif; font-size: 16px;"> <strong>Keywords: </strong>EEG, Linear Discriminate Analysis, SVM, Classification, Seizure.<br />
<strong>Scope of the Article:</strong> Machine Learning<br />
</span></p>
<p>
</div><div  class='avia-button-wrap av-lk7yjdqn-1f03dd5b9536ea0416ade781090f7f96-wrap avia-button-right '><a href="https://www.ijrte.org/wp-content/uploads/papers/v7i6s2/F11090476S219.pdf" class="avia-button av-lk7yjdqn-1f03dd5b9536ea0416ade781090f7f96 av-link-btn avia-icon_select-yes-left-icon avia-size-medium avia-position-right avia-color-theme-color" aria-label="Download PDF"><span class='avia_button_icon avia_button_icon_left avia-iconfont avia-font-entypo-fontello' data-av_icon='' data-av_iconfont='entypo-fontello' ></span><span class='avia_iconbox_title' >Download PDF</span></a></div></div></div>
<p>The post <a rel="nofollow" href="https://www.ijrte.org/portfolio-item/f11090476s219/">F11090476S219</a> appeared first on <a rel="nofollow" href="https://www.ijrte.org">International Journal of Recent Technology and Engineering (IJRTE)</a>.</p>
]]></content:encoded>
					
		
		
			</item>
		<item>
		<title>F11180476S219</title>
		<link>https://www.ijrte.org/portfolio-item/f11180476s219/</link>
		
		<dc:creator><![CDATA[IJRTE Journal]]></dc:creator>
		<pubDate>Tue, 18 Jul 2023 07:05:37 +0000</pubDate>
				<guid isPermaLink="false">https://www.ijrte.org/?post_type=portfolio&#038;p=46220</guid>

					<description><![CDATA[<p>The post <a rel="nofollow" href="https://www.ijrte.org/portfolio-item/f11180476s219/">F11180476S219</a> appeared first on <a rel="nofollow" href="https://www.ijrte.org">International Journal of Recent Technology and Engineering (IJRTE)</a>.</p>
]]></description>
										<content:encoded><![CDATA[<div  class='flex_column av-av_one_full-7714eba142aeda1f8b5272a3c372b279 av_one_full  avia-builder-el-0  avia-builder-el-no-sibling  first flex_column_div  '     ><div  class='av_promobox av-lk7ya0di-dc7aa5adfc2eecfb58d1d9385b19aa83 avia-button-yes  avia-builder-el-1  avia-builder-el-no-sibling '><div class='avia-promocontent'></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif;"><span style="font-size: 14pt;"><strong><span style="font-size: 24px;">Implementing the Data Mining Approaches to Classify the Images with Visual Words</span><br />
</strong><span style="font-size: 10pt;"><span style="font-size: 14pt;">Annaluri Sreenivasa Rao<span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><strong><sup>1</sup></strong></span>, Attili Venkata Ramana<span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><strong><sup>2</sup></strong></span>, S. Ramakrishna<span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><strong><sup>3</sup></strong></span></span></span></span></span><span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><span style="font-family: 'times new roman', times, serif;"><span style="font-family: 'times new roman', times, serif;"><br />
<strong><sup>1</sup></strong>Dr. Annaluri Sreenivasa Rao, Department of Information Technology, Vallurupalli Nageswara Rao Vignana Jyothi Institute of Engineering &amp; Technology, Hyderabad (Telangana), India.<br />
<strong><sup>2</sup></strong>Dr. Attili Venkata Ramana, Associate Professor, Department of ECM, Sreenidhi Institute of Science and Technology, Hyderabad, (Telangana), India.<br />
<strong><sup>3</sup></strong>Dr. S. Ramakrishna, Professor, Department of Computer Science, SVUCM &amp; CS, SV University, Tirupati (A.P), India.<br />
</span></span></span><span style="font-family: 'times new roman', times, serif; font-size: 10pt;">Manuscript received on 30 March 2019<strong> |</strong> Revised Manuscript received on 09 April 2019 <strong>|</strong> Manuscript Published on 27 April 2019 <strong>|</strong> PP: 901-909 <strong>|</strong> Volume-7 Issue-6S2 April 2019 <strong>|</strong> Retrieval Number: F11180476S219/2019©BEIESP </span><br />
<span style="font-family: 'times new roman', times, serif; font-size: 16px;"> <i class="fa fa-unlock-alt" style="font-size: 12px; color: blue;"></i> <a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener"> Open Access</a><strong> |</strong> <i class="far fa-file-alt" style="color: blue;"></i><a href="https://www.ijrte.org/ethics-policies/" target="_blank" rel="noopener"> Editorial and Publishing Policies</a> <strong>|</strong> <i class="fa fa-quote-right" style="color: blue;"></i> <a href="https://citation.crosscite.org/" target="_blank" rel="noopener">Cite</a> <strong>|</strong> <i class="fa fa-plus" style="font-size: 12px; color: blue;" aria-hidden="true"></i><a href="https://www.mendeley.com" target="_blank" rel="noopener"> Mendeley</a> </span><span style="font-family: 'times new roman', times, serif;"><strong>|</strong> <i class="fa fa-database" style="color: blue;" aria-hidden="true"></i><span style="font-size: 12pt;"><a href="https://www.ijrte.org/indexing/"> Indexing and Abstracting</a></span></span><br />
<span style="font-size: 12px; font-family: 'times new roman', times, serif;">© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an <a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener">open access</a> article under the CC-BY-NC-ND license <a href="https://creativecommons.org/licenses/by-nc-nd/4.0/" target="_blank" rel="noopener">(http://creativecommons.org/licenses/by-nc-nd/4.0/)</a></span></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif; font-size: 16px;"><strong>Abstract:</strong> In the recent times, image classification got a significant importance and is going through wide range of challenges. In this work, a unique system is built to reveal the information of the image based on its category and relevant labels associated with it. To accomplish this task different data mining techniques are used for image classifications using Bag of Visual Words (BoVW) feature extraction algorithm. This algorithm is constructed with the help of grey level features and along with some of the colour features. Grey level features include speed up robust features (SURF), maximum stable external regions (MESR) and improved colour coherence vector (ICCV). Apart from that different techniques involved in data mining are being used includes neural networks (NN), decision trees (DT), Bayesian networks (BN), discriminant analysis (DA) and K-nearest neighbour (KNN). These techniques are used to evaluate the datasets included with Corel-1000 and COIL-100. BN and DA outperformed other methods as they are achieved a specificity of 99.9%, sensitivity of 99.5% and accuracy of 99.4% for Coral-1000. Whereas the same experimented results reported to be 100%, 98.5% and 98.9% respectively for COIL-100.</span><br />
<span style="font-family: 'times new roman', times, serif; font-size: 16px;"> <strong>Keywords: </strong>Data mining, Machine Learning, Image Classification, NN, KNN, BN, DA.<br />
<strong>Scope of the Article:</strong> Data Mining<br />
</span></p>
<p>
</div><div  class='avia-button-wrap av-lk7ya0di-7d6fbe0af7ce7474ff34d19bd3c12a68-wrap avia-button-right '><a href="https://www.ijrte.org/wp-content/uploads/papers/v7i6s2/F11180476S219.pdf" class="avia-button av-lk7ya0di-7d6fbe0af7ce7474ff34d19bd3c12a68 av-link-btn avia-icon_select-yes-left-icon avia-size-medium avia-position-right avia-color-theme-color" aria-label="Download PDF"><span class='avia_button_icon avia_button_icon_left avia-iconfont avia-font-entypo-fontello' data-av_icon='' data-av_iconfont='entypo-fontello' ></span><span class='avia_iconbox_title' >Download PDF</span></a></div></div></div>
<p>The post <a rel="nofollow" href="https://www.ijrte.org/portfolio-item/f11180476s219/">F11180476S219</a> appeared first on <a rel="nofollow" href="https://www.ijrte.org">International Journal of Recent Technology and Engineering (IJRTE)</a>.</p>
]]></content:encoded>
					
		
		
			</item>
		<item>
		<title>F11040476S219</title>
		<link>https://www.ijrte.org/portfolio-item/f11040476s219/</link>
		
		<dc:creator><![CDATA[IJRTE Journal]]></dc:creator>
		<pubDate>Tue, 18 Jul 2023 07:00:05 +0000</pubDate>
				<guid isPermaLink="false">https://www.ijrte.org/?post_type=portfolio&#038;p=46218</guid>

					<description><![CDATA[<p>The post <a rel="nofollow" href="https://www.ijrte.org/portfolio-item/f11040476s219/">F11040476S219</a> appeared first on <a rel="nofollow" href="https://www.ijrte.org">International Journal of Recent Technology and Engineering (IJRTE)</a>.</p>
]]></description>
										<content:encoded><![CDATA[<div  class='flex_column av-av_one_full-7714eba142aeda1f8b5272a3c372b279 av_one_full  avia-builder-el-0  avia-builder-el-no-sibling  first flex_column_div  '     ><div  class='av_promobox av-lk7y2w2t-5ada5c3fdb8b1ce0f93c116d1cd1431f avia-button-yes  avia-builder-el-1  avia-builder-el-no-sibling '><div class='avia-promocontent'></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif;"><span style="font-size: 14pt;"><strong><span style="font-size: 24px;">Crop Condition Assessment using Machine Learning</span><br />
</strong><span style="font-size: 10pt;"><span style="font-size: 14pt;">R. Poonguzhali<span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><strong><sup>1</sup></strong></span>, A.Vijayabhanu<span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><strong><sup>2</sup></strong></span></span></span></span></span><span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><span style="font-family: 'times new roman', times, serif;"><span style="font-family: 'times new roman', times, serif;"><br />
<strong><sup>1</sup></strong>R. Poonguzhali, Assistant Professor, Department of Computer Science and Engineering, India.<br />
<strong><sup>2</sup></strong>A. Vijayabhanu, Deputy Director,  Department of Information System, EDPO, ISRO.<br />
</span></span></span><span style="font-family: 'times new roman', times, serif; font-size: 10pt;">Manuscript received on 30 March 2019<strong> |</strong> Revised Manuscript received on 09 April 2019 <strong>|</strong> Manuscript Published on 27 April 2019 <strong>|</strong> PP: 897-900 <strong>|</strong> Volume-7 Issue-6S2 April 2019 <strong>|</strong> Retrieval Number: F11040476S219/2019©BEIESP </span><br />
<span style="font-family: 'times new roman', times, serif; font-size: 16px;"> <i class="fa fa-unlock-alt" style="font-size: 12px; color: blue;"></i> <a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener"> Open Access</a><strong> |</strong> <i class="far fa-file-alt" style="color: blue;"></i><a href="https://www.ijrte.org/ethics-policies/" target="_blank" rel="noopener"> Editorial and Publishing Policies</a> <strong>|</strong> <i class="fa fa-quote-right" style="color: blue;"></i> <a href="https://citation.crosscite.org/" target="_blank" rel="noopener">Cite</a> <strong>|</strong> <i class="fa fa-plus" style="font-size: 12px; color: blue;" aria-hidden="true"></i><a href="https://www.mendeley.com" target="_blank" rel="noopener"> Mendeley</a> </span><span style="font-family: 'times new roman', times, serif;"><strong>|</strong> <i class="fa fa-database" style="color: blue;" aria-hidden="true"></i><span style="font-size: 12pt;"><a href="https://www.ijrte.org/indexing/"> Indexing and Abstracting</a></span></span><br />
<span style="font-size: 12px; font-family: 'times new roman', times, serif;">© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an <a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener">open access</a> article under the CC-BY-NC-ND license <a href="https://creativecommons.org/licenses/by-nc-nd/4.0/" target="_blank" rel="noopener">(http://creativecommons.org/licenses/by-nc-nd/4.0/)</a></span></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif; font-size: 16px;"><strong>Abstract:</strong> Agriculture is considered to be the backbone of our country. Crops play an important role in our daily routine providing us with nourishments. Due to environmental conditions, crops are getting affected with many diseases. Farmers are not able to detect these diseases at an early stage. Thus, assessment of crop condition is vital. The growing technology plays a major role and techniques like Machine Learning, Deep Learning are used. This paper focuses on the assessment of the crop condition with the help of their leaves. Healthy as well as diseased leaves are captured using cameras from real-time environments. The captured images undergo processes like preprocessing and segmentation. K-means clustering is used for segmentation. After segmentation, they undergo classification using Machine learning algorithms in which healthy and diseased leaves are detected. Thus this system helps to reduce the difficulties faced by the farmers during crop cultivation which helps in increasing the crop yield.</span><br />
<span style="font-family: 'times new roman', times, serif; font-size: 16px;"> <strong>Keywords: </strong>Crop Cultivation, Machine Learning, Deep Learning, K-means Clustering.<br />
<strong>Scope of the Article:</strong> Machine Learning<br />
</span></p>
<p>
</div><div  class='avia-button-wrap av-lk7y2w2t-59edc161b0465d8f4e85f5f2ce8a68a5-wrap avia-button-right '><a href="https://www.ijrte.org/wp-content/uploads/papers/v7i6s2/F11040476S219.pdf" class="avia-button av-lk7y2w2t-59edc161b0465d8f4e85f5f2ce8a68a5 av-link-btn avia-icon_select-yes-left-icon avia-size-medium avia-position-right avia-color-theme-color" aria-label="Download PDF"><span class='avia_button_icon avia_button_icon_left avia-iconfont avia-font-entypo-fontello' data-av_icon='' data-av_iconfont='entypo-fontello' ></span><span class='avia_iconbox_title' >Download PDF</span></a></div></div></div>
<p>The post <a rel="nofollow" href="https://www.ijrte.org/portfolio-item/f11040476s219/">F11040476S219</a> appeared first on <a rel="nofollow" href="https://www.ijrte.org">International Journal of Recent Technology and Engineering (IJRTE)</a>.</p>
]]></content:encoded>
					
		
		
			</item>
		<item>
		<title>F11060476S219</title>
		<link>https://www.ijrte.org/portfolio-item/f11060476s219/</link>
		
		<dc:creator><![CDATA[IJRTE Journal]]></dc:creator>
		<pubDate>Tue, 18 Jul 2023 06:54:09 +0000</pubDate>
				<guid isPermaLink="false">https://www.ijrte.org/?post_type=portfolio&#038;p=46215</guid>

					<description><![CDATA[<p>The post <a rel="nofollow" href="https://www.ijrte.org/portfolio-item/f11060476s219/">F11060476S219</a> appeared first on <a rel="nofollow" href="https://www.ijrte.org">International Journal of Recent Technology and Engineering (IJRTE)</a>.</p>
]]></description>
										<content:encoded><![CDATA[<div  class='flex_column av-o7h5t3-59630b2269f24ecfa458de0ce7d5d31f av_one_full  avia-builder-el-0  avia-builder-el-no-sibling  first flex_column_div  '     ><div  class='av_promobox av-lk7xv7l7-ab1feab853e9ef249676d862f3f211e6 avia-button-yes  avia-builder-el-1  avia-builder-el-no-sibling '><div class='avia-promocontent'></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif;"><span style="font-size: 14pt;"><strong><span style="font-size: 24px;">Evaluating the Natural Language Understanding of a Machine by Answering Multiple Choice Questions for a Comprehension Text using Proposed LKD Model</span><br />
</strong><span style="font-size: 10pt;"><span style="font-size: 14pt;">K.M. Arivu Chelvan<span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><strong><sup>1</sup></strong></span>, K. Lakshmi<span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><strong><sup>2</sup></strong></span></span></span></span></span><span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><span style="font-family: 'times new roman', times, serif;"><span style="font-family: 'times new roman', times, serif;"><br />
<strong><sup>1</sup></strong>K.M. Arivu Chelvan, Research Scholar, Department of CSE, Periyar Maniammai Institute of Science &amp; Technology Thanjavur (Tamil Nadu), India.<br />
<strong><sup>2</sup></strong>K. Lakshmi, Professor, Department of CSE, Periyar Maniammai Institute of Science &amp; Technology Thanjavur (Tamil Nadu), India.<br />
</span></span></span><span style="font-family: 'times new roman', times, serif; font-size: 10pt;">Manuscript received on 30 March 2019<strong> |</strong> Revised Manuscript received on 09 April 2019 <strong>|</strong> Manuscript Published on 27 April 2019 <strong>|</strong> PP: 891-896 <strong>|</strong> Volume-7 Issue-6S2 April 2019 <strong>|</strong> Retrieval Number: F11060476S219/2019©BEIESP </span><br />
<span style="font-family: 'times new roman', times, serif; font-size: 16px;"> <i class="fa fa-unlock-alt" style="font-size: 12px; color: blue;"></i> <a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener"> Open Access</a><strong> |</strong> <i class="far fa-file-alt" style="color: blue;"></i><a href="https://www.ijrte.org/ethics-policies/" target="_blank" rel="noopener"> Editorial and Publishing Policies</a> <strong>|</strong> <i class="fa fa-quote-right" style="color: blue;"></i> <a href="https://citation.crosscite.org/" target="_blank" rel="noopener">Cite</a> <strong>|</strong> <i class="fa fa-plus" style="font-size: 12px; color: blue;" aria-hidden="true"></i><a href="https://www.mendeley.com" target="_blank" rel="noopener"> Mendeley</a> </span><span style="font-family: 'times new roman', times, serif;"><strong>|</strong> <i class="fa fa-database" style="color: blue;" aria-hidden="true"></i><span style="font-size: 12pt;"><a href="https://www.ijrte.org/indexing/"> Indexing and Abstracting</a></span></span><br />
<span style="font-size: 12px; font-family: 'times new roman', times, serif;">© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an <a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener">open access</a> article under the CC-BY-NC-ND license <a href="https://creativecommons.org/licenses/by-nc-nd/4.0/" target="_blank" rel="noopener">(http://creativecommons.org/licenses/by-nc-nd/4.0/)</a></span></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif; font-size: 16px;"><strong>Abstract:</strong> Machine Reading (MR) is an art of understanding text by the machine and one of the best tools to evaluate the understanding level of the machine is Reading Comprehension System (RCS) with Multiple Choice Questions (MCQ). In this paper, we proposed with a new knowledge representation, for understanding the given text, called Linguistic Knowledge Document (LKD). Such, LKD is generated from the given comprehension text. Natural Logic is used for generating the LKD. It is like an inference engine which contains all possible inference for each sentence in the comprehension text. The proposed LKD is acting like a human brain for the machine for answering the questions inquired by MCQA system. We use token based alignment model for finding answers from the LKD. We evaluate our system on RACE dataset and the obtained results are compared with recent methods. The comparison results show that the proposed model outperforms the recent results.</span><br />
<span style="font-family: 'times new roman', times, serif; font-size: 16px;"> <strong>Keywords: </strong>Machine Reading; Reading Comprehension System; Multiple Choice Questions; Natural Language Inference; Alignment; Natural Logic.<br />
<strong>Scope of the Article:</strong> Machine Learning<br />
</span></p>
<p>
</div><div  class='avia-button-wrap av-lk7xv7l7-b43d7767168abff6f50e12215c9224df-wrap avia-button-right '><a href="https://www.ijrte.org/wp-content/uploads/papers/v7i6s2/F11060476S219.pdf" class="avia-button av-lk7xv7l7-b43d7767168abff6f50e12215c9224df av-link-btn avia-icon_select-yes-left-icon avia-size-medium avia-position-right avia-color-theme-color" aria-label="Download PDF"><span class='avia_button_icon avia_button_icon_left avia-iconfont avia-font-entypo-fontello' data-av_icon='' data-av_iconfont='entypo-fontello' ></span><span class='avia_iconbox_title' >Download PDF</span></a></div></div></div>
<p>The post <a rel="nofollow" href="https://www.ijrte.org/portfolio-item/f11060476s219/">F11060476S219</a> appeared first on <a rel="nofollow" href="https://www.ijrte.org">International Journal of Recent Technology and Engineering (IJRTE)</a>.</p>
]]></content:encoded>
					
		
		
			</item>
		<item>
		<title>F10890476S219</title>
		<link>https://www.ijrte.org/portfolio-item/f10890476s219/</link>
		
		<dc:creator><![CDATA[IJRTE Journal]]></dc:creator>
		<pubDate>Tue, 18 Jul 2023 06:45:06 +0000</pubDate>
				<guid isPermaLink="false">https://www.ijrte.org/?post_type=portfolio&#038;p=46213</guid>

					<description><![CDATA[<p>The post <a rel="nofollow" href="https://www.ijrte.org/portfolio-item/f10890476s219/">F10890476S219</a> appeared first on <a rel="nofollow" href="https://www.ijrte.org">International Journal of Recent Technology and Engineering (IJRTE)</a>.</p>
]]></description>
										<content:encoded><![CDATA[<div  class='flex_column av-av_one_full-7714eba142aeda1f8b5272a3c372b279 av_one_full  avia-builder-el-0  avia-builder-el-no-sibling  first flex_column_div  '     ><div  class='av_promobox av-lk7xjk7o-619e86ecd207ff21ca6409a0b92a353a avia-button-yes  avia-builder-el-1  avia-builder-el-no-sibling '><div class='avia-promocontent'></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif;"><span style="font-size: 14pt;"><strong><span style="font-size: 24px;">Heterogeneous Server Queue with A Threshold on Slow Server</span><br />
</strong><span style="font-size: 10pt;"><span style="font-size: 14pt;">R. Kalyanaraman<span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><strong><sup>1</sup></strong></span>, S. Kalaiselvi<span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><strong><sup>2</sup></strong></span></span></span></span></span><span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><span style="font-family: 'times new roman', times, serif;"><span style="font-family: 'times new roman', times, serif;"><br />
<strong><sup>1</sup></strong>R. Kalyanaraman, Department of Mathematics, Annamalai University, Annamalainagar (Tamil Nadu), India.<br />
<strong><sup>2</sup></strong>S. Kalaiselvi, Department of Mathematics, Annamalai University, Annamalainagar (Tamil Nadu), India.<br />
</span></span></span><span style="font-family: 'times new roman', times, serif; font-size: 10pt;">Manuscript received on 30 March 2019<strong> |</strong> Revised Manuscript received on 09 April 2019 <strong>|</strong> Manuscript Published on 27 April 2019 <strong>|</strong> PP: 887-890 <strong>|</strong> Volume-7 Issue-6S2 April 2019 <strong>|</strong> Retrieval Number: F10890476S219/2019©BEIESP </span><br />
<span style="font-family: 'times new roman', times, serif; font-size: 16px;"> <i class="fa fa-unlock-alt" style="font-size: 12px; color: blue;"></i> <a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener"> Open Access</a><strong> |</strong> <i class="far fa-file-alt" style="color: blue;"></i><a href="https://www.ijrte.org/ethics-policies/" target="_blank" rel="noopener"> Editorial and Publishing Policies</a> <strong>|</strong> <i class="fa fa-quote-right" style="color: blue;"></i> <a href="https://citation.crosscite.org/" target="_blank" rel="noopener">Cite</a> <strong>|</strong> <i class="fa fa-plus" style="font-size: 12px; color: blue;" aria-hidden="true"></i><a href="https://www.mendeley.com" target="_blank" rel="noopener"> Mendeley</a> </span><span style="font-family: 'times new roman', times, serif;"><strong>|</strong> <i class="fa fa-database" style="color: blue;" aria-hidden="true"></i><span style="font-size: 12pt;"><a href="https://www.ijrte.org/indexing/"> Indexing and Abstracting</a></span></span><br />
<span style="font-size: 12px; font-family: 'times new roman', times, serif;">© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an <a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener">open access</a> article under the CC-BY-NC-ND license <a href="https://creativecommons.org/licenses/by-nc-nd/4.0/" target="_blank" rel="noopener">(http://creativecommons.org/licenses/by-nc-nd/4.0/)</a></span></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif; font-size: 16px;"><strong>Abstract:</strong> In this paper we consider a two heterogeneous server Markovian queue. In which, the second server has a threshold for service. For this model, the steady state results have been obtained. Some particular models, performance measure and numerical models are presented.</span><br />
<span style="font-family: 'times new roman', times, serif; font-size: 16px;"> <strong>Keywords: </strong>Heterogeneous Server &#8211; Slow Server &#8211; Threshold &#8211; Steady State -Performance Measures. 2000 Mathematics Subject Classification: 90B22, 60K25 and 60K30.<br />
<strong>Scope of the Article:</strong> Heterogeneous and Streaming Data<br />
</span></p>
<p>
</div><div  class='avia-button-wrap av-lk7xjk7o-381d13f2ae455337cdebb1c664e0730b-wrap avia-button-right '><a href="https://www.ijrte.org/wp-content/uploads/papers/v7i6s2/F10890476S219.pdf" class="avia-button av-lk7xjk7o-381d13f2ae455337cdebb1c664e0730b av-link-btn avia-icon_select-yes-left-icon avia-size-medium avia-position-right avia-color-theme-color" aria-label="Download PDF"><span class='avia_button_icon avia_button_icon_left avia-iconfont avia-font-entypo-fontello' data-av_icon='' data-av_iconfont='entypo-fontello' ></span><span class='avia_iconbox_title' >Download PDF</span></a></div></div></div>
<p>The post <a rel="nofollow" href="https://www.ijrte.org/portfolio-item/f10890476s219/">F10890476S219</a> appeared first on <a rel="nofollow" href="https://www.ijrte.org">International Journal of Recent Technology and Engineering (IJRTE)</a>.</p>
]]></content:encoded>
					
		
		
			</item>
		<item>
		<title>F11130476S219</title>
		<link>https://www.ijrte.org/portfolio-item/f11130476s219/</link>
		
		<dc:creator><![CDATA[IJRTE Journal]]></dc:creator>
		<pubDate>Tue, 18 Jul 2023 06:37:21 +0000</pubDate>
				<guid isPermaLink="false">https://www.ijrte.org/?post_type=portfolio&#038;p=46210</guid>

					<description><![CDATA[<p>The post <a rel="nofollow" href="https://www.ijrte.org/portfolio-item/f11130476s219/">F11130476S219</a> appeared first on <a rel="nofollow" href="https://www.ijrte.org">International Journal of Recent Technology and Engineering (IJRTE)</a>.</p>
]]></description>
										<content:encoded><![CDATA[<div  class='flex_column av-lkt8ma-0fc5189e64b55333510a7207f502c7aa av_one_full  avia-builder-el-0  avia-builder-el-no-sibling  first flex_column_div  '     ><div  class='av_promobox av-lk7x9n0b-585bb1084efdefa6e130e0b6201bdfde avia-button-yes  avia-builder-el-1  avia-builder-el-no-sibling '><div class='avia-promocontent'></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif;"><span style="font-size: 14pt;"><strong><span style="font-size: 24px;">A Special Study on Homo Cordial Labeling of Triangular Belt Graph</span><br />
</strong><span style="font-size: 10pt;"><span style="font-size: 14pt;">S. Sriram<span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><strong><sup>1</sup></strong></span>, R. Govindarajan<span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><strong><sup>2</sup></strong></span></span></span></span></span><span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><span style="font-family: 'times new roman', times, serif;"><span style="font-family: 'times new roman', times, serif;"><br />
<strong><sup>1</sup></strong>S. Sriram, Assistant Professor, Department of Mathematics, Patrician College of Arts and Science, Adyar, Chennai (Tamil Nadu), India.<br />
<strong><sup>2</sup></strong>Dr. R. Govindarajan, Associate Professor and Head (Retd), U.G and P.G Department of Mathematics, D.G.Vaishnav College, Arumbakkam Chennai (Tamil Nadu), India.<br />
</span></span></span><span style="font-family: 'times new roman', times, serif; font-size: 10pt;">Manuscript received on 30 March 2019<strong> |</strong> Revised Manuscript received on 09 April 2019 <strong>|</strong> Manuscript Published on 27 April 2019 <strong>|</strong> PP: 882-884 <strong>|</strong> Volume-7 Issue-6S2 April 2019 <strong>|</strong> Retrieval Number: F11130476S219/2019©BEIESP </span><br />
<span style="font-family: 'times new roman', times, serif; font-size: 16px;"> <i class="fa fa-unlock-alt" style="font-size: 12px; color: blue;"></i> <a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener"> Open Access</a><strong> |</strong> <i class="far fa-file-alt" style="color: blue;"></i><a href="https://www.ijrte.org/ethics-policies/" target="_blank" rel="noopener"> Editorial and Publishing Policies</a> <strong>|</strong> <i class="fa fa-quote-right" style="color: blue;"></i> <a href="https://citation.crosscite.org/" target="_blank" rel="noopener">Cite</a> <strong>|</strong> <i class="fa fa-plus" style="font-size: 12px; color: blue;" aria-hidden="true"></i><a href="https://www.mendeley.com" target="_blank" rel="noopener"> Mendeley</a> </span><span style="font-family: 'times new roman', times, serif;"><strong>|</strong> <i class="fa fa-database" style="color: blue;" aria-hidden="true"></i><span style="font-size: 12pt;"><a href="https://www.ijrte.org/indexing/"> Indexing and Abstracting</a></span></span><br />
<span style="font-size: 12px; font-family: 'times new roman', times, serif;">© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an <a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener">open access</a> article under the CC-BY-NC-ND license <a href="https://creativecommons.org/licenses/by-nc-nd/4.0/" target="_blank" rel="noopener">(http://creativecommons.org/licenses/by-nc-nd/4.0/)</a></span></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif; font-size: 16px;"><strong>Abstract:</strong> Let G= (V, E) be a graph with p vertices and q edges. A Homo Cordial Labeling of a graph G with vertex set V is a bijection from V to {0, 1} such that each edge uv is assigned the label 1 if f(u)=f(v) or 0 if f u f v ( ) ( )  with the condition that the number of vertices labelled with 0 and the number of vertices labelled with 1 differ by at most 1 and the number of edges labelled with 0 and the number of edges labelled with 1 differ by at most 1. The graph that admits a Homo- Cordial labelling is called Homo Cordial graph. In this paper we prove that triangular belt is Homo-Cordial labelling graph and further study on the generalization of labelling a triangular belt graph.</span><br />
<span style="font-family: 'times new roman', times, serif; font-size: 16px;"> <strong>Keywords: </strong>Homo Cordial Graphs, Homo Cordial Labelling.<br />
<strong>Scope of the Article:</strong> Cryptography and Applied Mathematics<br />
</span></p>
<p>
</div><div  class='avia-button-wrap av-lk7x9n0b-c7b63dab625590103feffaceb8462e5a-wrap avia-button-right '><a href="https://www.ijrte.org/wp-content/uploads/papers/v7i6s2/F11130476S219.pdf" class="avia-button av-lk7x9n0b-c7b63dab625590103feffaceb8462e5a av-link-btn avia-icon_select-yes-left-icon avia-size-medium avia-position-right avia-color-theme-color" aria-label="Download PDF"><span class='avia_button_icon avia_button_icon_left avia-iconfont avia-font-entypo-fontello' data-av_icon='' data-av_iconfont='entypo-fontello' ></span><span class='avia_iconbox_title' >Download PDF</span></a></div></div></div>
<p>The post <a rel="nofollow" href="https://www.ijrte.org/portfolio-item/f11130476s219/">F11130476S219</a> appeared first on <a rel="nofollow" href="https://www.ijrte.org">International Journal of Recent Technology and Engineering (IJRTE)</a>.</p>
]]></content:encoded>
					
		
		
			</item>
		<item>
		<title>F11070476S219</title>
		<link>https://www.ijrte.org/portfolio-item/f11070476s219/</link>
		
		<dc:creator><![CDATA[IJRTE Journal]]></dc:creator>
		<pubDate>Tue, 18 Jul 2023 06:31:57 +0000</pubDate>
				<guid isPermaLink="false">https://www.ijrte.org/?post_type=portfolio&#038;p=46208</guid>

					<description><![CDATA[<p>The post <a rel="nofollow" href="https://www.ijrte.org/portfolio-item/f11070476s219/">F11070476S219</a> appeared first on <a rel="nofollow" href="https://www.ijrte.org">International Journal of Recent Technology and Engineering (IJRTE)</a>.</p>
]]></description>
										<content:encoded><![CDATA[<div  class='flex_column av-av_one_full-7714eba142aeda1f8b5272a3c372b279 av_one_full  avia-builder-el-0  avia-builder-el-no-sibling  first flex_column_div  '     ><div  class='av_promobox av-lk7x2nhn-438d357459256b15c942d2dc7f2710c2 avia-button-yes  avia-builder-el-1  avia-builder-el-no-sibling '><div class='avia-promocontent'></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif;"><span style="font-size: 14pt;"><strong><span style="font-size: 24px;">Coefficient Functional Bounds for Certain Classes of Sakaguchi Type Functions</span><br />
</strong><span style="font-size: 10pt;"><span style="font-size: 14pt;">S. Balaji<span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><strong><sup>1</sup></strong></span>, B. Srutha Keerthi<span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><strong><sup>2</sup></strong></span></span></span></span></span><span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><span style="font-family: 'times new roman', times, serif;"><span style="font-family: 'times new roman', times, serif;"><br />
<strong><sup>1</sup></strong>S. Balaji, Department of Mathematics Division, School of Advanced Sciences VIT, Chennai (Tamil Nadu), India.<br />
<strong><sup>2</sup></strong>B. Srutha Keerthi, Department of Mathematics Division, School of Advanced Sciences VIT, Chennai (Tamil Nadu), India.<br />
</span></span></span><span style="font-family: 'times new roman', times, serif; font-size: 10pt;">Manuscript received on 30 March 2019<strong> |</strong> Revised Manuscript received on 09 April 2019 <strong>|</strong> Manuscript Published on 27 April 2019 <strong>|</strong> PP: 879-881 <strong>|</strong> Volume-7 Issue-6S2 April 2019 <strong>|</strong> Retrieval Number: F11070476S219/2019©BEIESP </span><br />
<span style="font-family: 'times new roman', times, serif; font-size: 16px;"> <i class="fa fa-unlock-alt" style="font-size: 12px; color: blue;"></i> <a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener"> Open Access</a><strong> |</strong> <i class="far fa-file-alt" style="color: blue;"></i><a href="https://www.ijrte.org/ethics-policies/" target="_blank" rel="noopener"> Editorial and Publishing Policies</a> <strong>|</strong> <i class="fa fa-quote-right" style="color: blue;"></i> <a href="https://citation.crosscite.org/" target="_blank" rel="noopener">Cite</a> <strong>|</strong> <i class="fa fa-plus" style="font-size: 12px; color: blue;" aria-hidden="true"></i><a href="https://www.mendeley.com" target="_blank" rel="noopener"> Mendeley</a> </span><span style="font-family: 'times new roman', times, serif;"><strong>|</strong> <i class="fa fa-database" style="color: blue;" aria-hidden="true"></i><span style="font-size: 12pt;"><a href="https://www.ijrte.org/indexing/"> Indexing and Abstracting</a></span></span><br />
<span style="font-size: 12px; font-family: 'times new roman', times, serif;">© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an <a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener">open access</a> article under the CC-BY-NC-ND license <a href="https://creativecommons.org/licenses/by-nc-nd/4.0/" target="_blank" rel="noopener">(http://creativecommons.org/licenses/by-nc-nd/4.0/)</a></span></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif; font-size: 16px;"><strong>Abstract:</strong> The purpose of this paper is to obtain bounds on coefficient functional for certain classes of Sakaguchi type functions involving generalized multiplier transformation operator, which are defined using Quasi-subordination. Some consequences of the main result are mentioned and relevance with some of the known results are also pointed out.</span><br />
<span style="font-family: 'times new roman', times, serif; font-size: 16px;"> <strong>Keywords: </strong>About Four Key Words or Phrases in Alphabetical Order, Separated by Commas.<br />
<strong>Scope of the Article:</strong> Cryptography and Applied Mathematics<br />
</span></p>
<p>
</div><div  class='avia-button-wrap av-lk7x2nhn-96dcc474b18f4c1dd875c280c6911373-wrap avia-button-right '><a href="https://www.ijrte.org/wp-content/uploads/papers/v7i6s2/F11070476S219.pdf" class="avia-button av-lk7x2nhn-96dcc474b18f4c1dd875c280c6911373 av-link-btn avia-icon_select-yes-left-icon avia-size-medium avia-position-right avia-color-theme-color" aria-label="Download PDF"><span class='avia_button_icon avia_button_icon_left avia-iconfont avia-font-entypo-fontello' data-av_icon='' data-av_iconfont='entypo-fontello' ></span><span class='avia_iconbox_title' >Download PDF</span></a></div></div></div>
<p>The post <a rel="nofollow" href="https://www.ijrte.org/portfolio-item/f11070476s219/">F11070476S219</a> appeared first on <a rel="nofollow" href="https://www.ijrte.org">International Journal of Recent Technology and Engineering (IJRTE)</a>.</p>
]]></content:encoded>
					
		
		
			</item>
		<item>
		<title>F11020476S219</title>
		<link>https://www.ijrte.org/portfolio-item/f11020476s219/</link>
		
		<dc:creator><![CDATA[IJRTE Journal]]></dc:creator>
		<pubDate>Tue, 18 Jul 2023 06:23:23 +0000</pubDate>
				<guid isPermaLink="false">https://www.ijrte.org/?post_type=portfolio&#038;p=46206</guid>

					<description><![CDATA[<p>The post <a rel="nofollow" href="https://www.ijrte.org/portfolio-item/f11020476s219/">F11020476S219</a> appeared first on <a rel="nofollow" href="https://www.ijrte.org">International Journal of Recent Technology and Engineering (IJRTE)</a>.</p>
]]></description>
										<content:encoded><![CDATA[<div  class='flex_column av-av_one_full-7714eba142aeda1f8b5272a3c372b279 av_one_full  avia-builder-el-0  avia-builder-el-no-sibling  first flex_column_div  '     ><div  class='av_promobox av-lk7wrpd0-11c8685a44e51a2321f8f09a53c97285 avia-button-yes  avia-builder-el-1  avia-builder-el-no-sibling '><div class='avia-promocontent'></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif;"><span style="font-size: 14pt;"><strong><span style="font-size: 24px;">Lh Labeling of Some Graphs</span><br />
</strong><span style="font-size: 10pt;"><span style="font-size: 14pt;">Farisa M<span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><strong><sup>1</sup></strong></span>, Parvathy K.S<span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><strong><sup>2</sup></strong></span></span></span></span></span><span style="font-family: 'times new roman', times, serif; font-size: 10pt;"><span style="font-family: 'times new roman', times, serif;"><span style="font-family: 'times new roman', times, serif;"><br />
<strong><sup>1</sup></strong>Farisa M, Research Scholar, St. Mary&#8217;s College, Thrissur (Kerala), India.<br />
<strong><sup>2</sup></strong>Dr. Parvathy K. S, Associate Professor, Post Graduate and Research, Department of Mathematics, St. Mary&#8217;s College, Thrissur (Kerala), India.<br />
</span></span></span><span style="font-family: 'times new roman', times, serif; font-size: 10pt;">Manuscript received on 30 March 2019<strong> |</strong> Revised Manuscript received on 09 April 2019 <strong>|</strong> Manuscript Published on 27 April 2019 <strong>|</strong> PP: 874-878 <strong>|</strong> Volume-7 Issue-6S2 April 2019 <strong>|</strong> Retrieval Number: F11020476S219/2019©BEIESP </span><br />
<span style="font-family: 'times new roman', times, serif; font-size: 16px;"> <i class="fa fa-unlock-alt" style="font-size: 12px; color: blue;"></i> <a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener"> Open Access</a><strong> |</strong> <i class="far fa-file-alt" style="color: blue;"></i><a href="https://www.ijrte.org/ethics-policies/" target="_blank" rel="noopener"> Editorial and Publishing Policies</a> <strong>|</strong> <i class="fa fa-quote-right" style="color: blue;"></i> <a href="https://citation.crosscite.org/" target="_blank" rel="noopener">Cite</a> <strong>|</strong> <i class="fa fa-plus" style="font-size: 12px; color: blue;" aria-hidden="true"></i><a href="https://www.mendeley.com" target="_blank" rel="noopener"> Mendeley</a> </span><span style="font-family: 'times new roman', times, serif;"><strong>|</strong> <i class="fa fa-database" style="color: blue;" aria-hidden="true"></i><span style="font-size: 12pt;"><a href="https://www.ijrte.org/indexing/"> Indexing and Abstracting</a></span></span><br />
<span style="font-size: 12px; font-family: 'times new roman', times, serif;">© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an <a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener">open access</a> article under the CC-BY-NC-ND license <a href="https://creativecommons.org/licenses/by-nc-nd/4.0/" target="_blank" rel="noopener">(http://creativecommons.org/licenses/by-nc-nd/4.0/)</a></span></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif; font-size: 16px;"><strong>Abstract:</strong> A graph G with n vertices is said to have an LH Labeling if there exists a bijective function f : V(G) → {1,2,3,…,|V(G)|} such that the induced map f* : E(G) → N, the set of natural numbers defined by f* (uv) = is injective. ( LCM and HCF denotes the least common multiple and highest common factor respectively). A graph that admits an LH labeling is called an LH graph. In this paper we prove that the splitting graphs of a path, comb and theta, sparkler graph and H graph are LH graphs.</span><br />
<span style="font-family: 'times new roman', times, serif; font-size: 16px;"> <strong>Keywords: </strong>Graph Labeling, H Graph, Splitting Graph, Theta Graph.<br />
<strong>Scope of the Article:</strong> Cryptography and Applied Mathematics<br />
</span></p>
<p>
</div><div  class='avia-button-wrap av-lk7wrpd0-ccd3c3005ef19a0f66449237a93ab2f7-wrap avia-button-right '><a href="https://www.ijrte.org/wp-content/uploads/papers/v7i6s2/F11020476S219.pdf" class="avia-button av-lk7wrpd0-ccd3c3005ef19a0f66449237a93ab2f7 av-link-btn avia-icon_select-yes-left-icon avia-size-medium avia-position-right avia-color-theme-color" aria-label="Download PDF"><span class='avia_button_icon avia_button_icon_left avia-iconfont avia-font-entypo-fontello' data-av_icon='' data-av_iconfont='entypo-fontello' ></span><span class='avia_iconbox_title' >Download PDF</span></a></div></div></div>
<p>The post <a rel="nofollow" href="https://www.ijrte.org/portfolio-item/f11020476s219/">F11020476S219</a> appeared first on <a rel="nofollow" href="https://www.ijrte.org">International Journal of Recent Technology and Engineering (IJRTE)</a>.</p>
]]></content:encoded>
					
		
		
			</item>
	</channel>
</rss>
