Anil Kumar Tripathi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Anil Kumar Tripathi has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Amit Biswas
Department of Computer Science and Engineering, Motilal Nehru National Institute of Technology Allahabad, Prayagraj, India
7 shared publications - Gaurav Baranwal
Department of Computer Science, Banaras Hindu University, Varanasi, India
7 shared publications - Ashish Kumar Maurya
Motilal Nehru National Institute of Technology Allahabad
5 shared publications - Sushant Kumar Pandey
University of Groningen, Groningen, Netherlands
5 shared publications - Samir Aknine
Univ Lyon, UCBL, CNRS, INSA Lyon, Centrale Lyon, Univ Lyon 2, LIRIS, UMR5205, Lyon, France
4 shared publications - Vinay Kumar
Department of Computer Science and Engineering, National Institute of Technology Jamshedpur, Jamshedpur, India
4 shared publications
Latest Publications
- 7 August 2025
- Published by Springer Nature
- p. 524-533
Automating Project Idea Generation for Engineering Students: A Tailored Approach
- 7 August 2025
- Published by Springer Nature
- p. 524-533
Automating Project Idea Generation for Engineering Students: A Tailored Approach
- Open Access
- 17 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 91-101
DS-Generator: Generating Software Metrics for Subsequent Versions of a Software System
- 17 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 91-101
Open AccessDS-Generator: Generating Software Metrics for Subsequent Versions of a Software System
- Open Access
- 20 May 2025
- Published by Springer Nature in Journal of Intelligent Information Systems
- p. 1-2
Correction to: Evaluating user story quality with LLMs: a comparative study
- 20 May 2025
- Published by Springer Nature in Journal of Intelligent Information Systems
- p. 1-2
Open AccessCorrection to: Evaluating user story quality with LLMs: a comparative study
- 21 April 2025
- Published by Springer Nature in Journal of Intelligent Information Systems
- Vol. 63 (4) , 1423-1451
Evaluating user story quality with LLMs: a comparative study
- 21 April 2025
- Published by Springer Nature in Journal of Intelligent Information Systems
- Vol. 63 (4) , 1423-1451
Evaluating user story quality with LLMs: a comparative study
- Open Access
- 10 March 2025
- Published by Springer Nature in Innovations in Systems and Software Engineering
- p. 1-36
SDC-estimator: an effectual software defect count estimation technique for the upcoming version of software project
Estimating the number of defects in a software project before the testing phase can reduce the enormous amount of development cost and help in allocating testing resources optimally and efficiently. However, estimating the number of defects in each module of a successive version of the software system will be more efficient in minimizing the development cost. The article proposed a method for estimating the number of defects in the successive version of a software system. The Cross Version Defect Count Estimation (CVDCE) technique estimates the number of defects in the next version of a software system. We proposed a new CVDCE model named Software Defect Count Estimator (SDC-Estimator). We utilized Long and Short Term Memory along with Attention layer architecture in our proposed model. We used seven software projects and their existing versions from the PROMISE repository. First, we have created a meta-content dataset from the different versions of the same software and used it for the training of the proposed model. We compared the performance of the SDC-Estimator with fourteen baseline and three state-of-the-art deep learning methods. We found, that in six out of seven and four out of seven projects, MAE is lowermost, and accuracy is higher respectively, whereas, in two out of seven software, MSE is minimum. We also found the mean of performance measures produced by the proposed model across all seven projects is most optimal compared to baseline methods. The proposed model tackles class imbalance and overfitting problems using random oversampling and dropout regularization, respectively, to produce fair and unbiased results. We observed the improvement of the proposed model on benchmark techniques by inspecting 20% of lines of code. In most situations, the improvements are significant, and it has a large effect size across all seven projects.
- 10 March 2025
- Published by Springer Nature in Innovations in Systems and Software Engineering
- p. 1-36
Open AccessSDC-estimator: an effectual software defect count estimation technique for the upcoming version of software project
Estimating the number of defects in a software project before the testing phase can reduce the enormous amount of development cost and help in allocating testing resources optimally and efficiently. However, estimating the number of defects in each module of a successive version of the software system will be more efficient in minimizing the development cost. The article proposed a method for estimating the number of defects in the successive version of a software system. The Cross Version Defect Count Estimation (CVDCE) technique estimates the number of defects in the next version of a software system. We proposed a new CVDCE model named Software Defect Count Estimator (SDC-Estimator). We utilized Long and Short Term Memory along with Attention layer architecture in our proposed model. We used seven software projects and their existing versions from the PROMISE repository. First, we have created a meta-content dataset from the different versions of the same software and used it for the training of the proposed model. We compared the performance of the SDC-Estimator with fourteen baseline and three state-of-the-art deep learning methods. We found, that in six out of seven and four out of seven projects, MAE is lowermost, and accuracy is higher respectively, whereas, in two out of seven software, MSE is minimum. We also found the mean of performance measures produced by the proposed model across all seven projects is most optimal compared to baseline methods. The proposed model tackles class imbalance and overfitting problems using random oversampling and dropout regularization, respectively, to produce fair and unbiased results. We observed the improvement of the proposed model on benchmark techniques by inspecting 20% of lines of code. In most situations, the improvements are significant, and it has a large effect size across all seven projects.
- 27 February 2025
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (4) , 1-35
Multi-attribute-based self-stabilizing algorithm for leader election in distributed systems
- 27 February 2025
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (4) , 1-35
Multi-attribute-based self-stabilizing algorithm for leader election in distributed systems
- 20 November 2023
- Published by Springer Nature in SN Computer Science
- Vol. 5 (1) , 1-28
DBDNN-Estimator: A Cross-Project Number of Fault Estimation Technique
- 20 November 2023
- Published by Springer Nature in SN Computer Science
- Vol. 5 (1) , 1-28
DBDNN-Estimator: A Cross-Project Number of Fault Estimation Technique
- Open Access
- 8 November 2023
- Published by Springer Nature in Research Square
Multi-attribute based self-stabilizing algorithm for leader election in distributed systems
Cloud computing, edge computing, replicated databases, and various modern technologies are adopting distributed computing concepts for a reliable, high-performance, large-scale computational platform. In distributedcomputing, leader election is a fundamental problem because the elected leader helps coordinate andutilize the resources efficiently. Several state-of-the-art works mentioned that a good quality leader is essentialas it improves system performance, simplifies management procedures, reduces coordinational complexity, andmakes the system more fault-tolerant. However, designing a self-stabilizing leader election algorithm with weakassumptions in a failure-prone distributed environment is challenging. This paper proposes a multi-attributebased,self-stabilizing, network partition-tolerant leader election method for failure-prone distributed systems.Here, based on the system requirements, the pertinent attributes of a good quality leader are identified and assignedweights according to their importance. Then the identified attributes and their weight are used to elect asuitable node as the leader.We show that the algorithm is self-stabilizing and can tolerate multiple nodes and linkfailures. Further, we analyze the proposed algorithm’s time, communication, and bit complexities. We consider adistributed database system scenario to simulate the proposed method and compare it with existing approachesto evaluate and validate the proposed method’s performance and the elected leader’s quality.
- 8 November 2023
- Published by Springer Nature in Research Square
Open AccessMulti-attribute based self-stabilizing algorithm for leader election in distributed systems
Cloud computing, edge computing, replicated databases, and various modern technologies are adopting distributed computing concepts for a reliable, high-performance, large-scale computational platform. In distributedcomputing, leader election is a fundamental problem because the elected leader helps coordinate andutilize the resources efficiently. Several state-of-the-art works mentioned that a good quality leader is essentialas it improves system performance, simplifies management procedures, reduces coordinational complexity, andmakes the system more fault-tolerant. However, designing a self-stabilizing leader election algorithm with weakassumptions in a failure-prone distributed environment is challenging. This paper proposes a multi-attributebased,self-stabilizing, network partition-tolerant leader election method for failure-prone distributed systems.Here, based on the system requirements, the pertinent attributes of a good quality leader are identified and assignedweights according to their importance. Then the identified attributes and their weight are used to elect asuitable node as the leader.We show that the algorithm is self-stabilizing and can tolerate multiple nodes and linkfailures. Further, we analyze the proposed algorithm’s time, communication, and bit complexities. We consider adistributed database system scenario to simulate the proposed method and compare it with existing approachesto evaluate and validate the proposed method’s performance and the elected leader’s quality.
- 8 October 2023
- Published by Springer Nature in Innovations in Systems and Software Engineering
- Vol. 21 (2) , 501-516
Is deep learning good enough for software defect prediction?
- 8 October 2023
- Published by Springer Nature in Innovations in Systems and Software Engineering
- Vol. 21 (2) , 501-516
Is deep learning good enough for software defect prediction?
- 1 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 299-304
A Consensus Model to Manage Unavailability of Decision-Makers in Group Decision Making
All the known Group Decision Making (GDM) models assume the continuous availability of all decision-makers (DMs) during the Consensus Reaching Process (CRP). Factually, the constant presence of a DM means that the concerned DMs are interested in adequately contributing to the decision-making process, and the technical support continuously enables their support. However, in a realistic situation, one or more DMs may be unavailable at times in CRP iterations due to technical or non-technical reasons. This paper considers such a scenario wherein the DMs are sparsely present. Hence, working out a model to take care of such pertinent absences that eventually make GDM possible. The bounded confidence of an individual DM is used to facilitate CRP in evaluating the opinions of the unavailable DMs. We propose to assign weight to a DM based on their cumulative presence in the decision process. Consideration of the opinion of a DM in a particular iteration based on the opinion in the previous iterations in case of the absence of the concerned DM in an implementation shown here is shown to be helpful.
- 1 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 299-304
A Consensus Model to Manage Unavailability of Decision-Makers in Group Decision Making
All the known Group Decision Making (GDM) models assume the continuous availability of all decision-makers (DMs) during the Consensus Reaching Process (CRP). Factually, the constant presence of a DM means that the concerned DMs are interested in adequately contributing to the decision-making process, and the technical support continuously enables their support. However, in a realistic situation, one or more DMs may be unavailable at times in CRP iterations due to technical or non-technical reasons. This paper considers such a scenario wherein the DMs are sparsely present. Hence, working out a model to take care of such pertinent absences that eventually make GDM possible. The bounded confidence of an individual DM is used to facilitate CRP in evaluating the opinions of the unavailable DMs. We propose to assign weight to a DM based on their cumulative presence in the decision process. Consideration of the opinion of a DM in a particular iteration based on the opinion in the previous iterations in case of the absence of the concerned DM in an implementation shown here is shown to be helpful.