Pradeep Kumar Singh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Pradeep Kumar Singh has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Rajendra Kumar
Sharda University
5 shared publications - Rajeev Ranjan Kumar Tripathi
Madan Mohan Malaviya University of Technology
4 shared publications Aditi Tripathi
Madan Mohan Malaviya University Of technology, Gorakhpur, Uttar Pradesh, India
3 shared publicationsMayank Deep Khare
Madan Mohan Malaviya University Of technology, Gorakhpur, Uttar Pradesh, India
3 shared publicationsR. K. Singh
Department of CSE, UTU, Dehradoon, India
3 shared publications- Rajeev Kumar
Department of Computer Science, Madan Mohan Malaviya University of Technology, Gorakhpur, India
3 shared publications
Latest Publications
- Open Access
- 10 September 2026
- Published by Springer Nature in Discover Artificial Intelligence
- Vol. 6 (1) , 1111
Comparative evaluation of classical machine learning and deep learning models for early weed detection in precision agriculture
- 10 September 2026
- Published by Springer Nature in Discover Artificial Intelligence
- Vol. 6 (1) , 1111
Open AccessComparative evaluation of classical machine learning and deep learning models for early weed detection in precision agriculture
- Open Access
- 15 August 2026
- Published by Springer Nature in Discover Artificial Intelligence
- Vol. 6 (1) , 796
Prediction of agricultural production based on multivariate data with feature aware machine learning models
- 15 August 2026
- Published by Springer Nature in Discover Artificial Intelligence
- Vol. 6 (1) , 796
Open AccessPrediction of agricultural production based on multivariate data with feature aware machine learning models
- Open Access
- 22 May 2026
- Published by Ediciones Universidad de Salamanca in ADCAIJ: Advances in Distributed Computing and Artificial Intelligence Journal
- Vol. 15, e32785
Access Control in Cloud-Based Computing Environments Using a Novel Quantum Digital Signature Scheme
Access control in cloud-based computing environments is in essence a security mechanism enabling decisions as to which subjects may access which protected resources and under what operations. The rapid emergence of quantum computing threatens the hardness assumptions underlying classical digital signatures and public‑key infrastructures. The authors of this work recently proposed a novel quantum ice-cream model to demonstrate the basic concepts of quantum cryptography in a simple and intuitive manner. In this work we present a novel quantum ice-cream digital signature scheme by using our proposed quantum ice-cream model. Our quantum ice-cream digital signature scheme maps two non-commuting measurement bases to the ‘flavor’ and ‘shape’ attributes of the quantum ice-cream model. It achieves information-theoretic security against forgery and repudiation via threshold tests and natively supports signer–verifier–arbiter workflow that is suitable for cloud access control. Although our scheme is presented theoretically, a rigorous mathematical analysis has been carried out using Hoeffding-type inequalities. We also discuss the implementation of our proposed scheme by using weak-coherent BB84-like optics with decoy states. This article demonstrates that our proposed quantum ice-cream digital signature scheme preserves the practicality of memoryless quantum digital signature schemes while aligning with cloud authorization requirements. Furthermore, we draw analogies between the design of our proposed QIDS and robust control theory to provide an interdisciplinary perspective on system stability and security.
- 22 May 2026
- Published by Ediciones Universidad de Salamanca in ADCAIJ: Advances in Distributed Computing and Artificial Intelligence Journal
- Vol. 15, e32785
Open AccessAccess Control in Cloud-Based Computing Environments Using a Novel Quantum Digital Signature Scheme
Access control in cloud-based computing environments is in essence a security mechanism enabling decisions as to which subjects may access which protected resources and under what operations. The rapid emergence of quantum computing threatens the hardness assumptions underlying classical digital signatures and public‑key infrastructures. The authors of this work recently proposed a novel quantum ice-cream model to demonstrate the basic concepts of quantum cryptography in a simple and intuitive manner. In this work we present a novel quantum ice-cream digital signature scheme by using our proposed quantum ice-cream model. Our quantum ice-cream digital signature scheme maps two non-commuting measurement bases to the ‘flavor’ and ‘shape’ attributes of the quantum ice-cream model. It achieves information-theoretic security against forgery and repudiation via threshold tests and natively supports signer–verifier–arbiter workflow that is suitable for cloud access control. Although our scheme is presented theoretically, a rigorous mathematical analysis has been carried out using Hoeffding-type inequalities. We also discuss the implementation of our proposed scheme by using weak-coherent BB84-like optics with decoy states. This article demonstrates that our proposed quantum ice-cream digital signature scheme preserves the practicality of memoryless quantum digital signature schemes while aligning with cloud authorization requirements. Furthermore, we draw analogies between the design of our proposed QIDS and robust control theory to provide an interdisciplinary perspective on system stability and security.
- Open Access
- 1 May 2026
- Published by Moldova State University in Computer Science Journal of Moldova
- Vol. 34 (1) , 131-155
Performance Analysis of Sequential Cuckoo Hashing under Light of Switching Cost
Cuckoo Hashing has been considered the state of the art since its origin. In Cuckoo Hashing, the search operation is executed sequentially in the tables, and thus, Cuckoo Hashing is Sequential Cuckoo Hashing. Based on the size of the table, Cuckoo Hashing is implemented in two ways: Symmetric Sequential Cuckoo Hashing and Asymmetric Sequential Cuckoo Hashing. Cuckoo Hashing suffers from higher insertion latency, inefficient memory usage, and high data migration. This work investigates the performance of both versions of Cuckoo Hashing under the light of two newly proposed performance indicators: Degree of Dexterity and Table Reference Count per key.
- 1 May 2026
- Published by Moldova State University in Computer Science Journal of Moldova
- Vol. 34 (1) , 131-155
Open AccessPerformance Analysis of Sequential Cuckoo Hashing under Light of Switching Cost
Cuckoo Hashing has been considered the state of the art since its origin. In Cuckoo Hashing, the search operation is executed sequentially in the tables, and thus, Cuckoo Hashing is Sequential Cuckoo Hashing. Based on the size of the table, Cuckoo Hashing is implemented in two ways: Symmetric Sequential Cuckoo Hashing and Asymmetric Sequential Cuckoo Hashing. Cuckoo Hashing suffers from higher insertion latency, inefficient memory usage, and high data migration. This work investigates the performance of both versions of Cuckoo Hashing under the light of two newly proposed performance indicators: Degree of Dexterity and Table Reference Count per key.
- 30 March 2026
- Published by Springer Nature in Journal of Molecular Modeling
- Vol. 32 (4) , 115
Optimized deep intelligent parameter efficient fine-tuning protein language model system for predicting dephosphorylation site
Context Protein dephosphorylation is essential for regulating cellular processes, and accurate prediction of dephosphorylation sites is crucial for understanding protein function and signaling mechanisms. Existing predictive methods often lack flexibility and fail to capture complex sequence dependencies across diverse proteins. Methods A novel Termite Life Cycle Boltzmann Machine (TLCBM) integrated with Low-Rank Adaptation (LoRA), forming a protein language model that efficiently learns high-dimensional sequence representations. TLCBM–LoRA leverages a sliding window to extract local sequence contexts while simultaneously modeling long-range dependencies, focusing on key residues tyrosine (Y), serine (S), and threonine (T). The model achieves high predictive performance, with accuracy of 0.92 and 0.96, MCC of 0.91 and 0.94, specificity of 0.92 and 0.97, sensitivity of 0.93 and 0.95, and ROC_AUC of 0.95 and 0.98 for Y and ST residues, respectively. Compared to the traditional model, 3% performance was improved for the proposed system. The results demonstrate that TLCBM–LoRA is a flexible and powerful tool for enhanced protein sequence analysis and dephosphorylation site recognition.
- 30 March 2026
- Published by Springer Nature in Journal of Molecular Modeling
- Vol. 32 (4) , 115
Optimized deep intelligent parameter efficient fine-tuning protein language model system for predicting dephosphorylation site
Context Protein dephosphorylation is essential for regulating cellular processes, and accurate prediction of dephosphorylation sites is crucial for understanding protein function and signaling mechanisms. Existing predictive methods often lack flexibility and fail to capture complex sequence dependencies across diverse proteins. Methods A novel Termite Life Cycle Boltzmann Machine (TLCBM) integrated with Low-Rank Adaptation (LoRA), forming a protein language model that efficiently learns high-dimensional sequence representations. TLCBM–LoRA leverages a sliding window to extract local sequence contexts while simultaneously modeling long-range dependencies, focusing on key residues tyrosine (Y), serine (S), and threonine (T). The model achieves high predictive performance, with accuracy of 0.92 and 0.96, MCC of 0.91 and 0.94, specificity of 0.92 and 0.97, sensitivity of 0.93 and 0.95, and ROC_AUC of 0.95 and 0.98 for Y and ST residues, respectively. Compared to the traditional model, 3% performance was improved for the proposed system. The results demonstrate that TLCBM–LoRA is a flexible and powerful tool for enhanced protein sequence analysis and dephosphorylation site recognition.
- Open Access
- 21 February 2026
- Published by Springer Nature in Discover Artificial Intelligence
- Vol. 6 (1)
Leaf-level sugarcane disease detection using CNN models: enhancing agricultural intelligence
- 21 February 2026
- Published by Springer Nature in Discover Artificial Intelligence
- Vol. 6 (1)
Open AccessLeaf-level sugarcane disease detection using CNN models: enhancing agricultural intelligence
- 20 August 2025
- Published by Springer Nature in Journal of Optics
- p. 1-14
Design of a novel quantum computing primitive to demonstrate quantum cryptography
- 20 August 2025
- Published by Springer Nature in Journal of Optics
- p. 1-14
Design of a novel quantum computing primitive to demonstrate quantum cryptography
- Open Access
- 1 July 2025
- Published by AGH University Press in Computer Science
- Vol. 26 (2)
STABLE AND LOW ASSOCIATIVE LEFT-RIGHT HASHING
Hashing is indispensable for efficient search operations, captivating the interest of numerous researchers. Among the diverse array of techniques, Cuckoo Hashing has emerged as particularly effective across a wide range of applications. It is implemented in two primary forms: Parallel Cuckoo Hashing and Sequential Cuckoo Hashing. Nonetheless, Cuckoo Hashing encounters significant challenges, including high insertion latency, inefficient memory usage, and high data migration costs. The concept of Combinatorial Hashing has inspired this research. Our proposed scheme enhances Combinatorial Hashing and introduces an innovative collision resolution technique called Left-Right Random Probing. This advanced variant of random probing strategically utilizes prime numbers and Fibonacci sequences to improve performance. This paper introduces two performance indicators, the degree of dexterity and table reference count per key. This paper identifies switching cost as a new challenge in Cuckoo Hashing and quantifies this switching cost using the parameter, table reference count per key.
- 1 July 2025
- Published by AGH University Press in Computer Science
- Vol. 26 (2)
Open AccessSTABLE AND LOW ASSOCIATIVE LEFT-RIGHT HASHING
Hashing is indispensable for efficient search operations, captivating the interest of numerous researchers. Among the diverse array of techniques, Cuckoo Hashing has emerged as particularly effective across a wide range of applications. It is implemented in two primary forms: Parallel Cuckoo Hashing and Sequential Cuckoo Hashing. Nonetheless, Cuckoo Hashing encounters significant challenges, including high insertion latency, inefficient memory usage, and high data migration costs. The concept of Combinatorial Hashing has inspired this research. Our proposed scheme enhances Combinatorial Hashing and introduces an innovative collision resolution technique called Left-Right Random Probing. This advanced variant of random probing strategically utilizes prime numbers and Fibonacci sequences to improve performance. This paper introduces two performance indicators, the degree of dexterity and table reference count per key. This paper identifies switching cost as a new challenge in Cuckoo Hashing and quantifies this switching cost using the parameter, table reference count per key.
- Open Access
- 6 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 102688-102705
Smart Chaining: Templing and Temple Search
Hash tables continue to be at the forefront of applications that require fast data lookup, but its usefulness in practice depends on effective collision resolution. Classical approaches like chaining (linked lists) and open addressing (linear/quadratic/random probing)—have inherent challenges like, chaining degrades with increasing lists, whereas universal hash functions impose unrealistic computational costs on bulk operations. Here, two complementary innovations are introduced that can circumvent these flaws. First, Even-Odd Hash Function optimizes prime-number selection for modulo computations so that 95% uniformly distributed load is achieved at zero overhead. Second, chaining is structurally re-architected with linked lists substituted by B-trees of order 5, which gives the Templing and Temple Search framework. By combining combinatorial hashing with hierarchical collision resolution, the scheme avoids linear search delays and resists clustering without increasing the memory footprint. Experimental evidence illustrates the dominance of Templing and Temple Search as it delivers 4.5x faster searches and 3.5x faster insertions over plain chaining at equal space complexity. Light-weight prime selection and non-contiguous memory structure within the methodology guarantee scalability even under heavy loads. It restates hash table performance, resolving algorithmic advancement against practical exigencies to set the agenda for contemporary data structure design.
- 6 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 102688-102705
Open AccessSmart Chaining: Templing and Temple Search
Hash tables continue to be at the forefront of applications that require fast data lookup, but its usefulness in practice depends on effective collision resolution. Classical approaches like chaining (linked lists) and open addressing (linear/quadratic/random probing)—have inherent challenges like, chaining degrades with increasing lists, whereas universal hash functions impose unrealistic computational costs on bulk operations. Here, two complementary innovations are introduced that can circumvent these flaws. First, Even-Odd Hash Function optimizes prime-number selection for modulo computations so that 95% uniformly distributed load is achieved at zero overhead. Second, chaining is structurally re-architected with linked lists substituted by B-trees of order 5, which gives the Templing and Temple Search framework. By combining combinatorial hashing with hierarchical collision resolution, the scheme avoids linear search delays and resists clustering without increasing the memory footprint. Experimental evidence illustrates the dominance of Templing and Temple Search as it delivers 4.5x faster searches and 3.5x faster insertions over plain chaining at equal space complexity. Light-weight prime selection and non-contiguous memory structure within the methodology guarantee scalability even under heavy loads. It restates hash table performance, resolving algorithmic advancement against practical exigencies to set the agenda for contemporary data structure design.
- Open Access
- 11 April 2025
- Published by Ediciones Universidad de Salamanca in ADCAIJ: Advances in Distributed Computing and Artificial Intelligence Journal
- Vol. 14, e31782
ADDP: The Data Prefetching Protocol for Monitoring Capacity Misses
Prefetching is essential to minimizing the number of misses in cache and improving processor performance. Many prefetchers have been proposed, including simple but highly effective stream-based prefetchers and prefetchers that predict complex access patterns based on structures such as history buffers and bit vectors. However, many cache misses still occur in many applications. After analyzing the various techniques in Instruction and Data Prefetcher, several key features were extracted which impact system performance. Data prefetching is an essential technique used in all commercial processors. Data prefetchers aim at hiding the long data access latency. In this paper, we present the design of an Adaptive Delta-based Data Prefetching (ADDP) that employs four different tables organized in a hierarchical manner to address the diversity of access patterns. Firstly, the Entry Table is queue, which tracks recent cache fill. Secondly, the Predict Table which has trigger (Program Counter) PCs as tags. Thirdly, the (Address Difference Table) ADT which has target PCs as tags. Lastly, the Prefetch Table is divided into two parts, i.e., Prefetch Filter and the actual Prefetch Table. The Prefetch Filter table filters unnecessary prefetch accesses and the Prefetch Table is used to track other additional information for each prefetch. The ADDP has been implemented in a multicache-level prefetching system under the 3rd Data Prefetching Championship (DPC-3) framework. ADDP is an effective solution for data-intensive applications since it shows notable gains in cache hit rates and latency reduction. The simulation results show that ADDP outperforms the top three data prefetchers MLOP, SPP and BINGO by 5.312 %, 13.213 % and 10.549 %, respectively.
- 11 April 2025
- Published by Ediciones Universidad de Salamanca in ADCAIJ: Advances in Distributed Computing and Artificial Intelligence Journal
- Vol. 14, e31782
Open AccessADDP: The Data Prefetching Protocol for Monitoring Capacity Misses
Prefetching is essential to minimizing the number of misses in cache and improving processor performance. Many prefetchers have been proposed, including simple but highly effective stream-based prefetchers and prefetchers that predict complex access patterns based on structures such as history buffers and bit vectors. However, many cache misses still occur in many applications. After analyzing the various techniques in Instruction and Data Prefetcher, several key features were extracted which impact system performance. Data prefetching is an essential technique used in all commercial processors. Data prefetchers aim at hiding the long data access latency. In this paper, we present the design of an Adaptive Delta-based Data Prefetching (ADDP) that employs four different tables organized in a hierarchical manner to address the diversity of access patterns. Firstly, the Entry Table is queue, which tracks recent cache fill. Secondly, the Predict Table which has trigger (Program Counter) PCs as tags. Thirdly, the (Address Difference Table) ADT which has target PCs as tags. Lastly, the Prefetch Table is divided into two parts, i.e., Prefetch Filter and the actual Prefetch Table. The Prefetch Filter table filters unnecessary prefetch accesses and the Prefetch Table is used to track other additional information for each prefetch. The ADDP has been implemented in a multicache-level prefetching system under the 3rd Data Prefetching Championship (DPC-3) framework. ADDP is an effective solution for data-intensive applications since it shows notable gains in cache hit rates and latency reduction. The simulation results show that ADDP outperforms the top three data prefetchers MLOP, SPP and BINGO by 5.312 %, 13.213 % and 10.549 %, respectively.