http://10.9.150.37:8080/dspace//handle/atmiyauni/466 Mon, 27 Apr 2026 18:44:57 GMT 2026-04-27T18:44:57Z http://10.9.150.37:8080/dspace//handle/atmiyauni/1764 Title: Deriving Meaning of Trending Words for Expanding Thesaurus Authors: Joshi, Bhoomi; Borisaniya, Bhavesh; Modi, Darshankumar Abstract: Nowadays there is a huge increase in the types of new or trending words being generated and used across social media. Though these words are used frequently, neither these trending words i.e. buzzwords are present in any dictionary, nor are they declared as official word-forms. However, these are the terms that drive a language to a different level. Thus, to take a look at the linguistic changes occurring across the world, this study is carried out of the approaches that can be used to find such new words that are highly in use, but have not yet attained an official status. Finding such words can be helpful in tracking the language change. Therefore, an approach for finding such words and imparting semantic relationship to find out their possible meanings or opposites is proposed in this paper. Tue, 01 Jan 2019 00:00:00 GMT http://10.9.150.37:8080/dspace//handle/atmiyauni/1764 2019-01-01T00:00:00Z http://10.9.150.37:8080/dspace//handle/atmiyauni/1762 Title: Perfect Domination Number of a Cycle graph 𝑪𝒏 and its Corona product with another Cycle graph 𝑪𝒏-𝟏 Authors: Bhatt, Tushharkumar; Kavathiya, Hiren; Gohel, Milan Abstract: According to the research paper on Perfect Dominating Sets by Marilynn Livingston and Quentin F. stout[1]they have been constructed the PDSs in families of graphs arising from the interconnected networks of parallel computers also contained perfect domination numbers of trees, dags, series-parallel graphs, meshes, tori, hypercubes, cube connected cycles and de Bruijin graphs and give linear algorithms for determining if a PDS exist, and generate a PDS when one does. They also proved that 2 and 3-dimensional hypercube graph having infinitely many PDSs. In this paper we are trying to apply their concept on cycle graphs and obtained their perfect domination number we also trying to find such applications of it. Mon, 01 Jan 2024 00:00:00 GMT http://10.9.150.37:8080/dspace//handle/atmiyauni/1762 2024-01-01T00:00:00Z http://10.9.150.37:8080/dspace//handle/atmiyauni/1761 Title: An Examination of High Utility Item Set Mining using Different Techniques Authors: Gohel, Milan N. Abstract: Finding high utility itemset from transaction databases refers to finding itemset that are profitable and useful. Frequent Itemset mining, which identifies often occurring itemsets, is expanded upon in Itemset Utility Mining. Recognising itemsets with utility values over a certain ven utility threshold is the aim of high utility itemset mining. The user-specified minimum support threshold value must be met for an itemset to be considered a high utility itemset; otherwise, it is treated as a low utility itemset. In this article, we give a literature review of the current state of research, as well as a look at different algorithms and their potential drawbacks for high utility dataset mining. Mon, 01 May 2023 00:00:00 GMT http://10.9.150.37:8080/dspace//handle/atmiyauni/1761 2023-05-01T00:00:00Z http://10.9.150.37:8080/dspace//handle/atmiyauni/618 Title: A Survey on Latest Wireless Technologies Authors: Mewada, K.M. Abstract: Wireless communication is among technology’s biggest contributions to mankind. Wireless communication involves the transmission of information over a distance without the help of wires, cables, or any other forms of electrical conductors. The transmitted distance can be anywhere between a few meters (for example, a television’s remote control) and thousands of kilometers (for example, radio communication). It is used as an advantage for working professionals in remote areas to remain in touch with their main headquarters. Moreover, it is wireless so it can be easily accessible without cables and wires. It is cheaper to install and maintain. Mon, 01 Feb 2016 00:00:00 GMT http://10.9.150.37:8080/dspace//handle/atmiyauni/618 2016-02-01T00:00:00Z