Search

Your search keyword '"Anil Kumar, V."' showing total 368 results
Start Over Author "Anil Kumar, V."
368 results on '"Anil Kumar, V."'

6. QUICLORIS: A Slow Denial-of-Service Attack on the QUIC Protocol

Author

Balaji, Anirudh Srinivas, Anil Kumar, V., Amritha, P. P., Sethumadhavan, M., 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, Dubey, Ashwani Kumar, editor, Sugumaran, Vijayan, editor, and Chong, Peter Han Joo, editor

Published
2023
Full Text
View/download PDF

7. Indian Sign Language Recognition Using Combined Feature Extraction

Author

Itkarkar Rajeshri, R., Nandi, Anil Kumar V., Mungurwadi, Vaishali B., Lovell, Nigel H., Advisory Editor, Oneto, Luca, Advisory Editor, Piotto, Stefano, Advisory Editor, Rossi, Federico, Advisory Editor, Samsonovich, Alexei V., Advisory Editor, Babiloni, Fabio, Advisory Editor, Liwo, Adam, Advisory Editor, Magjarevic, Ratko, Advisory Editor, Mukherjee, Moumita, editor, Mandal, J.K., editor, Bhattacharyya, Siddhartha, editor, Huck, Christian, editor, and Biswas, Satarupa, editor

Published
2021
Full Text
View/download PDF

9. Stability of Complement Degree Polynomial of Graphs

Author

Safeera K and Anil Kumar V

Subjects
Complement degree polynomial, Complement of a graph, Degree of a vertex, Graph polynomial, Root of polynomial, Stability of polynomial, Science
Abstract

A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex. For a simple undirected graph G with order n, and let denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where Cdi(G) is the cardinality of the set of vertices of degree i in . A multivariable polynomial f(x1,...,xn) with real coefficients is called stable if all of its roots lie in the open left half plane. In this paper, investigate the stability of complement degree polynomial of some graphs. 2020 Mathematics Subject Classification: 05C31, 05C50

Published
2023
Full Text
View/download PDF

10. Acknowledgement Spoofing at Kernel Level and TCP Sender Behaviour Analysis

Author

Duggempudi, Srikanth Reddy, Anil Kumar, V., Sethumadhavan, M., Kacprzyk, Janusz, Series Editor, Pal, Nikhil R., Advisory Editor, Bello Perez, Rafael, Advisory Editor, Corchado, Emilio S., Advisory Editor, Hagras, Hani, Advisory Editor, Kóczy, László T., Advisory Editor, Kreinovich, Vladik, Advisory Editor, Lin, Chin-Teng, Advisory Editor, Lu, Jie, Advisory Editor, Melin, Patricia, Advisory Editor, Nedjah, Nadia, Advisory Editor, Nguyen, Ngoc Thanh, Advisory Editor, Wang, Jun, Advisory Editor, Reddy, V. Sivakumar, editor, Prasad, V. Kamakshi, editor, Wang, Jiacun, editor, and Reddy, K. T. V., editor

Published
2020
Full Text
View/download PDF

23. Current Status and Future Prospects of Next-Generation Data Management and Analytical Decision Support Tools for Enhancing Genetic Gains in Crops

Author

Rathore, Abhishek, Singh, Vikas K., Pandey, Sarita K., Rao, Chukka Srinivasa, Thakur, Vivek, Pandey, Manish K., Anil Kumar, V., Das, Roma Rani, Scheper, Thomas, Series Editor, Belkin, Shimshon, Series Editor, Bley, Thomas, Series Editor, Bohlmann, Jörg, Series Editor, Gu, Man Bock, Series Editor, Hu, Wei-Shou, Series Editor, Mattiasson, Bo, Series Editor, Nielsen, Jens, Series Editor, Seitz, Harald, Series Editor, Ulber, Roland, Series Editor, Zeng, An-Ping, Series Editor, Zhong, Jian-Jiang, Series Editor, Zhou, Weichang, Series Editor, Varshney, Rajeev K., editor, Pandey, Manish K., editor, and Chitikineni, Annapurna, editor

Published
2018
Full Text
View/download PDF

26. Multivalued fixed point theorems in cone metric spaces over Banach algebras

Author

Noushida P P and Anil Kumar V.

Abstract

In this article we prove some multivalued fixed point results for generalized set valued contraction type and generalized alpha admissible multivalued mappings in the setting of H-cone metric in cone metric spaces over Banach algebras by assuming a weaker condition on generalized contraction constant by means of spectral radius.

Published
2023
Full Text
View/download PDF

29. Risk Factors for Mortality in Melioidosis: A Single-Centre, 10-Year Retrospective Cohort Study

Author

Raviraj Menon, Poornima Baby, Anil Kumar V., Sandeep Surendran, Manu Pradeep, Aiswarya Rajendran, Gaayathri Suju, and Arathy Ashok

Subjects
Technology, Medicine, Science
Abstract

Melioidosis is a tropical infectious disease with diverse clinical presentations. We aimed to investigate the characteristics and mortality risk factors of patients diagnosed with melioidosis in the past 10 years. This was a retrospective cohort study conducted at a quaternary care centre in South India. Clinical, demographic, and biochemical data in patients diagnosed with melioidosis with cultures were collected between January 2011 and December 2020 from medical records. Logistic regression analysis was performed to screen mortality risk factors of melioidosis in addition to descriptive statistics and chi-square analysis. Seventy-three melioidosis patients’ records were analysed, and the most common comorbidity was type 2 diabetes mellitus (n = 53, 72.6%). The patients showed diverse presentations: pulmonary involvement, 30 (41.1%); splenomegaly, 29 (39.7%); abscesses and cutaneous involvement, 18 (24.7%); lymph node, 10 (13.7%); arthritis and osteomyelitis, 9 (12.3%); and genitourinary infection, 4 (5.4%). The mortality was noted to be 15 (20.5%). Logistic regression analysis indicated that chronic kidney disease (OR = 14.0), CRP >100 IU/L (OR = 6.964), and S. albumin

Published
2021
Full Text
View/download PDF

35. ON THE S3-MAGIC GRAPHS

Author

Anil Kumar V. and Anusha C.

Subjects
Computational Mathematics, Algebra and Number Theory, Applied Mathematics, Discrete Mathematics and Combinatorics, Analysis
Abstract

Let G = (V (G), E(G)) be a finite (p, q) graph and let (A, ∗) be a finite non-abelain group with identity element 1. Let f : E(G) → Nq = {1, 2, . . . , q} and let g : E(G) → A \ {1} be two edge labelings of G such that f is bijective. Using these two labelings f and g we can define another edge labeling l : E(G) → Nq × A \ {1} by l(e) := (f (e), g(e)) for all e ∈ E(G). Define a relation ≤ on the range of l by: (f (e), g(e)) ≤ (f (ej), g(ej)) if and only if f (e) ≤ f (ej). This relation ≤ is a partial order on the range of l. Let {(f (e1), g(e1)), (f (e2), g(e2)), . . . , (f (ek), g(ek))} be a chain in the range of l. We define a product of the elements of this chain as follows: k (f (ei), g(ei)) := ((((g(e1) ∗ g(e2)) ∗ g(e3)) ∗ · · · ) ∗ g(ek). i=1 Let u ∈ V and let N ∗(u) be the set of all edges incident with u. Note that the restriction of l on N ∗(u) is a chain, say (f (e1), g(e1)) ≤ (f (e2), g(e2)) ≤ · · · ≤ (f (en), g(en)). We define n l∗(u) := (f (ei), g(ei)). i=1 If l∗(u) is a constant, say a for all u V (G), we say that the graph G is A - magic. The map l∗ is called an A -magic labeling of G and the corresponding constant a is called the magic constant. In this paper, we consider the permutation group S3 and investigate graphs that are S3-magic.

Published
2022
Full Text
View/download PDF

46. List of contributors

Author

Anil Kumar, V., primary, Basu, B., additional, Chan, K.S., additional, Cooke, K.O., additional, Dinaharan, I., additional, Ferreira, M.G.S., additional, Gupta, N., additional, Gupta, R.K., additional, Khanra, G.P., additional, Liu, T., additional, Mitra, R., additional, Naplocha, K., additional, Pant, B., additional, Prakash, U., additional, Scudino, S., additional, Talaş, Ş., additional, Wang, Q., additional, Yasakau, K.A., additional, and Zheludkevich, M.L., additional

Published
2018
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results