Search

Your search keyword '"Geetha, J."' showing total 203 results
Start Over Author "Geetha, J."
203 results on '"Geetha, J."'

1. Every Elementary Graph is Chromatic Choosable

Author

Vasudevan, Nandana K, Somasundaram, K, and Geetha, J

Subjects
Mathematics - Combinatorics, 05C15, 05C17
Abstract

Elementary graphs are graphs whose edges can be colored using two colors in such a way that the edges in any induced $P_3$ get distinct colors. They constitute a subclass of the class of claw-free perfect graphs. In this paper, we show that for any elementary graph, its list chromatic number and chromatic number are equal.

Published
2023

2. Thermo-structural Qualification of a Composite Control Surface

Author

Justina Geetha, J., Narendar, S., Gopikrishna, R., Varadanam, M., Bhagat, Atul R., Ghosh, Arindam, Series Editor, Chua, Daniel, Series Editor, de Souza, Flavio Leandro, Series Editor, Aktas, Oral Cenk, Series Editor, Han, Yafang, Series Editor, Gong, Jianghong, Series Editor, Jawaid, Mohammad, Series Editor, Manohara Babu, Mulakaluri Rama, editor, Buragohain, Manoj Kumar, editor, and Kuchipudi, Srinivas, editor

Published
2024
Full Text
View/download PDF

3. A Comparative Study of Approaches to Short Text Document Clustering

Author

Meena, N., Jayalakshmi, D. S., Geetha, J., Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, Gunjan, Vinit Kumar, editor, and Zurada, Jacek M., editor

Published
2024
Full Text
View/download PDF

4. Interpreting Fake Reviews Using Machine Learning and Deep Learning

Author

Bhat, Mohammad Qazim, Jayalakshmi, D. S., Mallegowda, M., Geetha, J., Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, Iglesias, Andres, editor, Shin, Jungpil, editor, Patel, Bharat, editor, and Joshi, Amit, editor

Published
2024
Full Text
View/download PDF

5. Federated Learning-Based Techniques for COVID-19 Detection—A Systematic Review

Author

Hosmani, Bhagyashree, Shariff, Mohammad Jawaad, Geetha, J., Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, Joby, P. P., editor, Alencar, Marcelo S., editor, and Falkowski-Gilski, Przemyslaw, editor

Published
2024
Full Text
View/download PDF

9. Total Colorings of Some Classes of FourRegular Circulant Graphs

Author

Navaneeth, R., Geetha, J., Somasundaram, K., and Fu, Hung-Lin

Subjects
Mathematics - Combinatorics, 05C15
Abstract

The total chromatic number, $\chi''(G)$ is the minimum number of colors which need to be assigned to obtain a total coloring of the graph $G$. The Total Coloring Conjecture (TCC) made independently by Behzad and Vizing that for any graph, $\chi''(G) \leq \Delta(G)+2 $, where $\Delta(G)$ represents the maximum degree of $G$. In this paper we obtained the total chromatic number for some classes of four regular circulant graphs.

Published
2021

11. Total, Equitable Total and Neighborhood sum distinguishing Total Colorings of Some Classes of Circulant Graphs

Author

Prajnanaswaroopa, S., Geetha, J., and Somasundaram, K.

Subjects
Mathematics - Combinatorics, Computer Science - Discrete Mathematics, Computer Science - Data Structures and Algorithms, 05C15, 05C25, 05B15, G.2.2, G.2.1
Abstract

In this paper, we have obtained the total chromatic as well as equitable and neighborhood sum distinguishing total chromatic numbers of some classes of the circulant graphs., Comment: 13 Pages, 6 Tables

Published
2021

12. Speech Recognition for Kannada Using LSTM

Author

Jayalakshmi, D. S., Sathvik, K. P., Geetha, J., Angrisani, Leopoldo, Series Editor, Arteaga, Marco, Series Editor, Chakraborty, Samarjit, Series Editor, Chen, Jiming, Series Editor, Chen, Shanben, Series Editor, Chen, Tan Kay, Series Editor, Dillmann, Rüdiger, Series Editor, Duan, Haibin, Series Editor, Ferrari, Gianluigi, Series Editor, Ferre, Manuel, Series Editor, Jabbari, Faryar, Series Editor, Jia, Limin, Series Editor, Kacprzyk, Janusz, Series Editor, Khamis, Alaa, Series Editor, Kroeger, Torsten, Series Editor, Li, Yong, Series Editor, Liang, Qilian, Series Editor, Martín, Ferran, Series Editor, Ming, Tan Cher, Series Editor, Minker, Wolfgang, Series Editor, Misra, Pradeep, Series Editor, Mukhopadhyay, Subhas, Series Editor, Ning, Cun-Zheng, Series Editor, Nishida, Toyoaki, Series Editor, Oneto, Luca, Series Editor, Panigrahi, Bijaya Ketan, Series Editor, Pascucci, Federica, Series Editor, Qin, Yong, Series Editor, Seng, Gan Woon, Series Editor, Speidel, Joachim, Series Editor, Veiga, Germano, Series Editor, Wu, Haitao, Series Editor, Zamboni, Walter, Series Editor, Zhang, Junjie James, Series Editor, Tan, Kay Chen, Series Editor, Unhelkar, Bhuvan, editor, Pandey, Hari Mohan, editor, Agrawal, Arun Prakash, editor, and Choudhary, Ankur, editor

Published
2023
Full Text
View/download PDF

13. Total Coloring of some classes of Powers of Cycles

Author

S, Prajnanaswaroopa, Geetha, J, Somasundaram, K, Fu, Hung-Lin, and Narayanan, N

Subjects
Mathematics - Combinatorics, 05C15, 05B15
Abstract

In this paper, we have obtained the total chromatic number of some classes of Cayley graphs, odd graphs and mock threshold graphs., Comment: This paper has significant overlap with arXiv:1812.05833

Published
2019
Full Text
View/download PDF

14. List of contributors

Author

Abdulhayan, Sayed, primary, Amin, Imran ul, additional, Arun Sampaul Thomas, G., additional, Bhat, Ishfaq Hussain, additional, Bose, Ranit Kumar, additional, Dar, Aehsan Ahmad, additional, Dhamodharan, M., additional, Ebenesar Anna Bagyam, J., additional, Fathima, Y., additional, Gupta, Chabi, additional, Helen, D., additional, Hepziba Gnanamalar, R., additional, Kalaiarasi, H., additional, Kavitha, M., additional, Kirubahari, S., additional, Mahesh Nayak, B., additional, Muthukaruppasamy, S., additional, Pachiyappan, Sathish, additional, Padmapriya, V., additional, Paramasivan, Senthilmurugan, additional, Polisetty, Aruna, additional, Pratiksha, S., additional, Rajalakshmi, N.R., additional, Ramadass, Ravichandran, additional, Ramu, Senthil Kumar, additional, Sai Krishnan, S., additional, Sankar, Mallika, additional, Saravanan, S., additional, Saravanan, K., additional, Sathish Kumar, S., additional, Sathyanarayana, N., additional, Sharma, Anuradha, additional, Sofiya, L., additional, Sowmya, G., additional, Srivastava, Anubha, additional, Suba Geetha, J., additional, Sujatha, D.N., additional, Surya, S., additional, Thanga Mariappan, L., additional, Verma, Babita, additional, and Vimalkumar, M., additional

Published
2023
Full Text
View/download PDF

16. A Survey on Various Techniques and Proposals for Improving the Cryptocurrency Protocol

Author

Geetha, J., Jagadish, Raviteja, Venkatesh, S., Varun, B. V., Kumar, J. Nitesh, Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, Saini, H. S., editor, Sayal, Rishi, editor, Govardhan, A., editor, and Buyya, Rajkumar, editor

Published
2022
Full Text
View/download PDF

17. Real-Time Traffic Response Processing Using Convolutional Neural Network and Edge Computing

Author

Geetha, J., Jayalakshmi, D. S., Shavin, K., Varun, M., Venkat Satish, A., Venkatesh, S., Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, Saini, H. S., editor, Sayal, Rishi, editor, Govardhan, A., editor, and Buyya, Rajkumar, editor

Published
2022
Full Text
View/download PDF

20. Improvised Distributed Data Streaming Scheduler in Storm

Author

Geetha, J., Jayalakshmi, D. S., Ganiga, Riya R., Kottur, Shaguftha Zuveria, Surabhi, Tallapalli, Angrisani, Leopoldo, Series Editor, Arteaga, Marco, Series Editor, Panigrahi, Bijaya Ketan, Series Editor, Chakraborty, Samarjit, Series Editor, Chen, Jiming, Series Editor, Chen, Shanben, Series Editor, Chen, Tan Kay, Series Editor, Dillmann, Rüdiger, Series Editor, Duan, Haibin, Series Editor, Ferrari, Gianluigi, Series Editor, Ferre, Manuel, Series Editor, Hirche, Sandra, Series Editor, Jabbari, Faryar, Series Editor, Jia, Limin, Series Editor, Kacprzyk, Janusz, Series Editor, Khamis, Alaa, Series Editor, Kroeger, Torsten, Series Editor, Liang, Qilian, Series Editor, Martín, Ferran, Series Editor, Ming, Tan Cher, Series Editor, Minker, Wolfgang, Series Editor, Misra, Pradeep, Series Editor, Möller, Sebastian, Series Editor, Mukhopadhyay, Subhas, Series Editor, Ning, Cun-Zheng, Series Editor, Nishida, Toyoaki, Series Editor, Pascucci, Federica, Series Editor, Qin, Yong, Series Editor, Seng, Gan Woon, Series Editor, Speidel, Joachim, Series Editor, Veiga, Germano, Series Editor, Wu, Haitao, Series Editor, Zhang, Junjie James, Series Editor, Bindhu, V., editor, Tavares, João Manuel R. S., editor, Boulogeorgos, Alexandros-Apostolos A., editor, and Vuppalapati, Chandrasekar, editor

Published
2021
Full Text
View/download PDF

26. Chromatic choosability for some classes of perfect graphs.

Author

Vasudevan, Nandana K., Geetha, J., and Somasundaram, K.

Abstract

A graph G = G(V,E) is called L-list colorable if there is a vertex coloring of G in which the color assigned to a vertex v is chosen from a list L(v) associated with this vertex. We say G is k-choosable if all lists L(v) have the cardinality k and G is L-list colorable for all possible assignments of such lists. A graph G is said to be chromatic choosable if its chromatic and list chromatic numbers are equal. Investigation of χ-choosable graphs is one of the open problems. In this paper, we investigate this problem for classes of perfect graphs. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

29. An Advanced Circular Adaptive Search Butterfly Optimization Algorithm for the CNN-based Sleep Apnea Detection Approach.

Author

Geetha, J. and Benadict Raja, J.

Subjects
*OPTIMIZATION algorithms, *FISHER discriminant analysis, *SLEEP apnea syndromes, *HILBERT-Huang transform, *FEATURE extraction, *FEATURE selection
Abstract

The analysis of pulse photoplethysmography (PPG) signals using computerized techniques is a developing field in research. Various effective signal-processing tools have been presented for automatic disease detection systems. Sleep apnea is a syndrome that affects the respiratory system and it commonly occurs due to Oxygen desaturation while sleeping. This paper develops an automatic system to detect sleep apnea from PPG signals. The detection of this syndrome is very important and many approaches were presented to improve the performance. The proposed method improves the classification accuracy through the enhancement of the feature extraction method and using the optimized classifier. As a feature extraction process, Hilbert Huang Transform (HHT) with extrema selection reformed (ESR) Empirical mode decomposition (EMD) is presented in this work. The development of the ESR-EMD system provides a better decomposition of signals and makes feature extraction effective. In addition, the computation time process is reduced as the interpolation is done using the more significant extrema points. Afterward, the feature selection is implemented using fisher discriminant analysis (FDA). An improved CNN classifier with a circular adaptive search butterfly optimization algorithm (CASBOA) is presented for classification. The optimum results obtained using BOA can be increased by employing an adaptive circular search function. This approach can increase the accuracy of the classifier and reduce computational time. The proposed approach is validated in MATLAB with a dataset and the performance metrics are compared with the conventional approaches. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

31. An Investigation of the Effect of Interventions Based on Common Core Mathematical Practices on the Math Achievement of Struggling Students in Grade 6

Author

Murthy, Geetha J.

Abstract

This study examined the effect of the eight Common Core mathematical practices on math achievement and math attitudes for a sample of low-performing students in Grade 6. The treatment sample (n = 63) consisted of four classes of Grade 6 students who had scored below proficient levels in state math assessments. This study was conducted in a high-performing, ethnically and economically diverse public middle school located in suburban New York State. The intervention was a combination of self-regulation and instructional strategies based on the Common Core mathematical practices. Data were collected to measure academic growth from fall to spring for the treatment group (n = 63) using the standardized Measures of Academic Progress (NWEA, 2014) and were compared with the following groups: (a) a control group (n = 39) of similar students who received extra time but did not receive these specific interventions and (b) a comparison group (n = 62) of students who did not receive any extended instructional time. A repeated measure, two-way ANOVA analysis was conducted on the math growth score from fall to winter to determine if there was a significant difference in the performance of general education students, special education students, and students classified as English language learners (ELL) in each of the three groups. The survey "Attitudes towards mathematics inventory" (ATMI) (Tapia & Marsh 2002) was administered to students in the experimental group. A repeated measures ANOVA analysis was conducted on the scores from pre-test and post-test of four factors: self-confidence, value, enjoyment, and motivation in mathematics. The results from the NWEA data analyses did not show significant difference in the math achievement of the experimental group as compared to the control or comparison group after 12 weeks of intervention. The results from the ATMI data analyses showed improvement in motivation and the value of mathematics but no significant difference in enjoyment of mathematics or the self-confidence of students in mathematics. Findings of the study suggest that developing mathematical practices and creating an environment of growth mindset in math classrooms for students who struggle in math can lead to improved outcomes in attitudes and achievement in math. [The dissertation citations contained here are published with the permission of ProQuest LLC. Further reproduction is prohibited without permission. Copies of dissertations may be obtained by Telephone 1-800-521-0600. Web page: http://www.proquest.com/en-US/products/dissertations/individuals.shtml.]

Published
2016

40. Total colorings of some classes of four regular circulant graphs

Author

Navaneeth, R., Geetha, J., Somasundaram, K., and Fu, Hung-Lin

Abstract

AbstractThe total chromatic number, χ″(G)is the minimum number of colors which need to be assigned to obtain a total coloring of the graph G. The Total Coloring Conjecture (TCC) made independently by Behzad and Vizing that for any graph, χ″(G)≤Δ(G)+2,where Δ(G)represents the maximum degree of G. In this paper we obtained the total chromatic number for some classes of four regular circulant graphs.

Published
2024
Full Text
View/download PDF

49. JAK2 Negative Polycythemia Vera

Author

Geetha J P., Arathi C A., Shalini M., and Srinivasa Murthy A G.

Subjects
jak 2 v617f mutation, polycythemia vera, bcsh guidelines, Medicine
Abstract

Polycythemia vera (PV) is a stem cell disorder, characterized as a panhyperplastic, malignant, and neoplastic marrow disorder. Several reasons suggest that a mutation on the Janus kinase-2 gene (JAK2) is the most probable candidate gene involved in PV pathogenesis, as JAK2 is directly involved in intracellular signaling, following its exposure to cytokines, to which PV progenitor cells display hypersensitivity. A recurrent unique acquired clonal mutation in JAK2 was found in most patients with PV and other myeloproliferative diseases (MPDs). A female patient of age 50 years, presented with hemiplegia, diplopia, and had a consistent rise in hemoglobin and hematocrit. Serum Erythropoietin (Epo) was decreased. JAK2 mutation analysis was found to be negative. A diagnosis of polycythemia vera was made on the basis of the British Committee for Standards in Hematology (BCSH) guidelines.

Published
2010
Full Text
View/download PDF

50. Improvised Distributed Data Streaming Scheduler in Storm

Author

Tallapalli Surabhi, Shaguftha Zuveria Kottur, D. S. Jayalakshmi, Riya R. Ganiga, and Geetha J

Subjects
Task (computing), Schedule, Computer science, Data stream mining, Distributed computing, Scalability, Response time, Storm, Context switch, Scheduling (computing)
Abstract

Apache Storm is one of the most widely used platforms for processing of data streams due to its properties of being distributed, highly scalable, and fault-tolerant. It provides real-time processing, is fast and stateless, and uses master–slave architecture with ZooKeeper. In the Hadoop ecosystem, Apache Storm is the one that fills the present real-time functionality and provides strong coupling with many tools and technologies. In Storm framework, the Storm default scheduler is commonly used to schedule the task or data to be processed, whose basis for scheduling the task is the time quanta or time slots, which leads to increase in context switches and longer response time. In Storm default scheduler, the workload of a topology equally distributed among worker processes or Java virtual machine (JVM) all over the cluster using a simple round-robin algorithm without considering any priority or criteria. The proposed algorithm addresses the above-specified issues. An improvised the custom Storm scheduler was developed where the scheduling is based on the workload, which is calculated based on the total memory utilized per task and the total processing unit utilized per task, thereby resulting in lesser context switches and faster response time of distributed streaming applications.

Published
2021

Catalog

Books, media, physical & digital resources
See catalog results