Analysing Cyberattacks Using Attack Tree and Fuzzy Rules. 

Nitin Naik, Paul Jenkins, Paul Grace, Dishita Naik, Shaligram Prajapat, Jingping Song, Jian Xu & Ricardo M. Czekster 

In: Naik, N., Jenkins, P., Grace, P., Yang, L., Prajapat, S. (eds) Advances in Computational Intelligence Systems. UKCI 2023.

Advances in Intelligent Systems and Computing, vol 1453. Springer, Cham. 

https://doi.org/10.1007/978-3-031-47508-5_29

https://link.springer.com/chapter/10.1007/978-3-031-47508-5_29#citeas

Cyberattack Analysis Utilising Attack Tree with Weighted Mean Probability and Risk of Attack.

 Nitin Naik, Paul Jenkins, Paul Grace, Shaligram Prajapat, Dishita Naik, Jingping Song, Jian Xu & Ricardo M. Czekster 

In: Naik, N., Jenkins, P., Grace, P., Yang, L., Prajapat, S. (eds) Advances in Computational Intelligence Systems. UKCI 2023. 

Advances in Intelligent Systems and Computing, vol 1453. Springer, Cham. 

https://doi.org/10.1007/978-3-031-47508-5_28

https://link.springer.com/chapter/10.1007/978-3-031-47508-5_28#citeas

Cryptic Mining for AVK-based IoT Cryptosystem and Client-side Encryption Perspective

Shaligram Prajapat;

BookTitle: Internet of Things Security Fundamentals, Techniques and Applications, River Publishers, Pages 26

eBook ISBN: 81003338642 , Taylor & Francis Group

https://doi.org/10.1201/9781003338642 

The chapter "Cryptic Mining for AVK-based IoT Cryptosystem and Client-side Encryption Perspective" discusses the use of cryptic mining to improve the security of IoT devices. The work proposes a new cryptosystem based on the AVK algorithm and suggests the use of client-side encryption as a way to enhance the privacy of IoT devices. The chapter describes the implementation and testing of the proposed cryptosystem, highlighting its effectiveness in providing secure and efficient communication between IoT devices. The chapter makes a significant contribution to the field of IoT security by proposing a novel approach to cryptosystem design and implementation.

Generalised Parametric Model for AVK-Based Cryptosystem

Prajapat, Shaligram; Porwal, Adisha; Jaiswal, Swati; Saifee, Fatema; Thakur, RS;

Networking Communication and Data Knowledge Engineering, pp. 217-227,2018

Springer, Singapore, ISBN 978-981-10-4599-8 ISBN 978-981-10-4600-1 

https://link.springer.com/content/pdf/bfm:978-981-10-4600-1/1.pdf , http://www.springer.com/series/15362

Lecture Notes on Data Engineering and Communications Technologies

https://doi.org/10.1007/978-981-10-4600-1

The paper presents a generalised parametric model for AVK-based (Audio, Video, and Keystroke) cryptosystem, which is used to secure multimedia data transmitted over the internet. The proposed model enhances the security of the AVK-based cryptosystem by introducing two additional parameters, which are used to generate the encryption key. The paper also proposes a mechanism to optimise the performance of the cryptosystem. The contribution of this work is the development of a more secure and efficient AVK-based cryptosystem. The proposed model can be used in various applications, including secure transmission of multimedia data over the internet, secure communication in IoT networks, and secure storage of multimedia data.

Towards parameterized shared key for AVK approach

Shaligram Prajapat,Ramjeevan Singh Thakur

Book Title: Pattern and Data Analysis in Healthcare Setting

IGI Global, 2017,Pages: 18, pp.61-78, 2017

https://www.igi-global.com/chapter/towards-parameterized-shared-key-for-AVK-approach/160671 

DOI: 10.4018/978-1-5225-0536-5.ch004

The work discusses the development of a parameterized shared key for the Attribute Value Key (AVK) approach, which can be applied in the healthcare sector to secure sensitive data transmission. The authors propose a scheme for the generation of keys that are parameterized based on the attributes of the data. This approach is designed to improve security in the transmission of data over networks. The work provides a useful contribution to the field of healthcare data security by proposing a novel approach to generating shared keys for secure data transmission.

Encryption and Decryption of Data by Genetic Algorithms

Shubham, Dubey; Divya, Gaur; Ritesh, Jhaggar; Anjali; Rajendra; Shaligram, Prajapat; 

National Conference on Computational Sciences-NCCS 2017

In an Abstract Book published by the Department of Computer Science Govt. Holkar Sc  College

The paper "Encryption and Decryption of Data by Genetic Algorithms" presents a novel approach for encryption and decryption of data using genetic algorithms. The authors propose a genetic algorithm-based key generation technique for symmetric key encryption and decryption, and evaluate its performance using various metrics such as execution time, encryption time, decryption time, and key length. The paper also compares the proposed technique with other encryption techniques such as the Data Encryption Standard (DES) and Advanced Encryption Standard (AES). Overall, the paper provides insights into the use of genetic algorithms for encryption and decryption of data and highlights its potential as a viable alternative to traditional encryption techniques.

Video Steganography an approach for hiding text and image data files

Rajendra, Verma; Shubham, Dubey; Ritesh, Jhaggar; Patidar, Naina; Sapan, Jain; Shaligram, Prajapat; 2017

In an Abstract Book published by the Department of Computer Science Govt. Holkar Sc College, Indore,  [Abstract ][Presented] 

The paper  describes a technique for hiding text and image data files inside a video file using steganography. The authors begin by discussing the concept of steganography and its applications, and then propose their approach for video steganography. The proposed approach involves dividing the video file into frames and then using LSB (Least Significant Bit) substitution technique to hide the text or image data inside the frames.

The contribution of this paper is the proposed approach for video steganography using the LSB substitution technique. The authors provide a detailed explanation of the proposed approach and also provide experimental results to evaluate its effectiveness. The experiments were conducted using different types of video files and data files and the results showed that the proposed approach was effective in hiding the data files inside the video files without any visible distortion.

However, one limitation of this paper is that the authors did not discuss the security of the proposed approach in detail. It would have been useful to see a more in-depth analysis of the security of the proposed approach and its potential vulnerabilities.The utility of this paper lies in the application of steganography to hide data inside video files. The proposed approach can be useful in situations where confidentiality of data is critical, such as in military or intelligence applications. Additionally, the experimental results provide a basis for further research in the field of video steganography.

Parameterised Key Diffusion Approach of AVK Based Cryptosystem.

Shaligram Prajapat

Communication Technology, vol. 5, no. 1, pp. 45-54, June 2017. Available: https://journals.covenantuniversity.edu.ng/index.php/cjict/article/view/449.

The paper proposes a new approach for improving the security of AVK-based cryptosystems by incorporating parameterized key diffusion.The paper begins by discussing the importance of cryptography and the need for secure cryptosystems. The author then discusses the AVK cryptosystem and its limitations, particularly in terms of key security. The proposed approach involves the use of parameterised key diffusion to improve the security of the AVK cryptosystem.

The contribution of this paper is the proposed parameterised key diffusion approach for AVK-based cryptosystems, which is a novel technique for improving the security of these systems. The author provides a detailed explanation of the proposed approach and its implementation. The utility of this paper lies in the potential for improving the security of AVK-based cryptosystems, which are widely used in a variety of applications. The proposed approach can be useful in situations where confidentiality of data is critical, such as in financial transactions or military communications. The paper also provides a basis for further research in the field of cryptosystems and the use of parameterised key diffusion techniques.

Crypto-system for AVK-Based Symmetric Algorithms and Analysis Using Cryptic Pattern Mining

Shaligram, Prajapat;

Lecture Notes in Electrical Engineering, 453, pp. 353-364.2017

Springer, Singapore ,

https://link.springer.com/chapter/10.1007/978-981-10-5565-2_31

Print: ISBN 978-981-10-5564-5

Online: ISBN 978-981-10 

The paper presents a new cryptosystem for AVK-based symmetric algorithms and analyses it using cryptic pattern mining. The proposed cryptosystem is based on the Advanced Variable Key (AVK) algorithm and uses a parameterized shared key to increase its security. The paper also uses a cryptic pattern mining approach to analyse the proposed cryptosystem and validate its security. The contribution of the work is the proposal of a new cryptosystem that uses a parameterized shared key to enhance its security and the application of cryptic pattern mining to validate its security. However, a limitation of the work is that the proposed cryptosystem has not been compared to other state-of-the-art cryptosystems, and its performance has not been evaluated. 

Cryptic Mining for Automatic Variable Key Based Cryptosystem

Shaligram Prajapat, Ramjeevan Singh Thakur

Elsevier Procedia Computer Science, Volume 78, 2016, Pages 199-209

https://www.sciencedirect.com/science/article/pii/S1877050916000363

https://doi.org/10.1016/j.procs.2016.02.034

In this paper, proposes a novel cryptosystem called Automatic Variable Key-Based (AVK) cryptosystem, which uses a genetic algorithm to generate the keys dynamically. They also introduce a cryptic mining technique to identify the most suitable key for encryption, based on the characteristics of the plaintext. The proposed cryptosystem is evaluated on various cryptographic parameters and compared with other existing cryptosystems. The results show that the proposed AVK cryptosystem offers better security and performance than the existing symmetric key-based cryptosystems. However, one of the limitations of this work is that it only considers the encryption process and does not discuss the decryption process in detail.

Cryptic mining: apriori analysis of parameterized automatic variable key based symmetric cryptosystem

Prajapat, Shaligram; Thakur, Ramjeevan Singh;

International Journal of Computer Science and Information Security, Vol (14), 2, 233, 2016

The paper proposes an automatic variable key-based symmetric cryptosystem that uses cryptic mining to analyse the system's security. The authors have used apriori analysis to identify cryptic patterns in the data, which can be used to improve the security of the cryptosystem. The paper provides a detailed description of the proposed cryptosystem and its implementation. The contribution of the work is the proposal of a new cryptosystem and the use of cryptic mining to analyse its security. However, the limitation of the work is that it lacks experimental results to validate the effectiveness of the proposed system.

Realisation of information exchange with Fibo-Q based Symmetric Cryptosyste

Prajapat, Shaligram; Thakur, Ramjeevan Singh; 

Int. J. Comput. Sci. Inf. Secur.(IJCSIS), Vol.(14),2, pp. (216-223), 2016 .

Web of Science 2016

The paper proposes a new symmetric cryptosystem based on Fibonacci and Lucas number sequences, called Fibo-Q. The authors provide a detailed description of the Fibo-Q cryptosystem, including its encryption and decryption processes. They also evaluate the performance of Fibo-Q in terms of key sensitivity and randomness, as well as its resistance against various attacks such as brute-force, ciphertext-only, and known-plaintext attacks. The main contribution of this work is the proposal of a new symmetric cryptosystem that offers a high level of security and efficiency. However, the limitation of the work is that it has not been extensively tested or compared with other popular cryptosystems.

AVK based Cryptosystem and Recent Directions Towards Cryptanalysis

Shaligram Prajapat, Ashok Sharma , Ramjeevan Singh Thakur 

Journal of Internet Computing and Services (인터넷정보학회논문지)

Volume 17, Issue 5, Pages.97-110,  2016 

p-ISSN  1598-0170, e-ISSN  2287-1136

Korean Society for Internet Information (한국인터넷정보학회)

https://koreascience.kr/article/JAKO201634347630990.pdf

https://doi.org/10.7472/jksii.2016.17.5.97

The paper presents an AVK (Automatic Variable Key) based symmetric cryptosystem and discusses recent directions towards cryptanalysis. The authors propose a symmetric cryptosystem based on the AVK concept, which involves automatic generation of keys for encryption and decryption. The paper also discusses the security aspects of the proposed cryptosystem and the cryptanalysis techniques that can be used to attack it. The contribution of this work is the proposal of a new AVK-based symmetric cryptosystem and an analysis of its security. However, the limitation of this work is that the proposed cryptosystem has not been compared with other state-of-the-art cryptosystems in terms of performance and security.

Key Diffusion Approach for AVK based Cryptosystem

Shaligram Prajapat, Ramjeevan Singh Thakur

ICTCS '16: Proceedings of the Second International Conference on Information and Communication Technology for Competitive Strategies, March 2016 

March 2016, Article 78, Pages 1–9, https://doi.org/10.1145/2905055.2905288

https://dl.acm.org/doi/10.1145/2905055.2905288

https://doi.org/10.1145/2905055.2905288

This paper proposes a key diffusion approach for the AVK (Automatic Variable Key) based cryptosystem, which aims to improve the security and performance of the existing AVK based system. The authors suggest using a diffusion matrix to generate the subkeys for encryption and decryption, which can improve the key space of the system and reduce the time complexity of the cryptosystem. The paper provides a theoretical analysis of the proposed approach and presents experimental results showing its effectiveness in terms of security and performance. One limitation of the work is that it is focused only on the AVK based cryptosystem, and the proposed approach may not be applicable to other types of cryptosystemss

Cryptic Mining for AVK based cryptosystem and client side encryption perspective

Shaligram, Prajapat; Pulkit, Vaishnav; Ramjeevan, Singh, Thakur; 

Fourth International Conference on Recent Trends in Communication and Computer Networks-ComNet2016, pp. (78-83), 2016

McGraw Hill Education Professional, ACEECom, IDES and Narosa

https://www.researchgate.net/publication/315658024_IDES_ComNet_2016_McGraw_Hill_and_Narosa_Publication_Full_length_papers

This paper presents the Cryptic Mining approach for the AVK (Automatic Variable Key) based symmetric cryptosystem from a client-side encryption perspective. The authors propose an apriori analysis to identify potential threats and vulnerabilities in the system. The contribution of this work is to improve the security of the AVK-based cryptosystem by using Cryptic Mining to identify weaknesses in the system. The limitations of the study include the lack of experimental evaluation of the proposed approach and the focus on a specific type of symmetric cryptosystems.

Cryptic Mining in the light of AI

Shaligram Prajapat, Aditi Thakur, Kajol Maheshwari and Ramjeevan Singh Thakur, “Cryptic Mining in Light of Artificial Intelligence” International Journal of Advanced Computer Science and Applications(IJACSA), 6(8), 2015. http://dx.doi.org/10.14569/IJACSA.2015.060808

Parental Control System For Secure And Controlled  Browsing

Prajapat, Shaligram; Verma, Parth; Lele, Monika;

National Conference on “ Contemporary Computing",(NC3 –2K16),2016

Various approaches towards cryptanalysis

Prajapat, Shaligram; Thakur, Ramjeevan Singh; 

International Journal of Computer Applications, Vol.(127),14, pp. (15-24), 2015

Foundation of Computer Science

The paper presents an overview of various approaches towards cryptanalysis, which is the process of analyzing cryptographic systems to uncover hidden aspects of the system. The authors discuss the importance of cryptanalysis in the field of cryptography and present different types of attacks on cryptographic systems such as brute force attack, dictionary attack, and differential cryptanalysis. They also discuss various methods to enhance the security of cryptographic systems.

The contribution of the paper lies in providing a comprehensive overview of various approaches towards cryptanalysis, which can serve as a useful resource for researchers and practitioners in the field of cryptography. However, the limitation of the paper is that it provides only a broad overview and does not delve into the technical details of each approach.

Markov Analysis of AVK Approach of Symmetric Key Based Cryptosystem.

Shaligram Prajapat, Thakur, R.S. (2015).

Computational Science and Its Applications, ICCSA 2015.

Lecture Notes in Computer Science(), vol 9159. Springer, Cham.

Print ISBN 978-3-319-21412-2, Online ISBN 978-3-319-21413-9

https://link.springer.com/chapter/10.1007/978-3-319-21413-9_12

https://doi.org/10.1007/978-3-319-21413-9_12

The paper presents a Markov analysis of the AVK approach of symmetric key-based cryptosystems. The authors have analysed the performance of the AVK algorithm using the Markov model and evaluated the key space and key sensitivity of the algorithm. The paper provides insights into the behaviour of the algorithm under different input conditions and the impact of the key size on the security and performance of the algorithm.

The contribution of this work is that it provides a novel approach to evaluate the security and performance of the AVK algorithm. The authors have used the Markov model to analyse the algorithm and evaluate its key space and key sensitivity. This provides valuable insights into the algorithm's behavior and its strengths and weaknesses.

The limitations of this work are that the analysis is limited to the AVK algorithm, and the results may not be applicable to other symmetric key-based cryptosystems. Also, the analysis assumes that the attacker has complete knowledge of the algorithm, which may not be a realistic assumption in real-world scenarios.

Cryptic-Mining: Association Rules Extractions Using Session Log. 

Prajapat, Shaligram, Thakur, R.S. (2015). 

Computational Science and Its Applications -ICCSA 2015. ICCSA 2015.

Lecture Notes in Computer Science(), vol 9158. Springer, Cham.

Online ISBN- 978-3-319-21410-8, Print ISBN 978-3-319-21409-2

https://doi.org/10.1007/978-3-319-21410-8_53

https://link.springer.com/chapter/10.1007/978-3-319-21410-8_53

The paper proposes a new approach called Cryptic-Mining for extracting association rules from the session logs. The proposed approach uses a combination of clustering and association rule mining techniques for finding the association rules. The paper also provides a comparative analysis of the proposed approach with other existing techniques. The results indicate that the proposed approach outperforms other approaches in terms of accuracy and efficiency.

The contribution of this work is that it provides a novel approach for association rule extraction, which can be useful in various applications such as web mining, e-commerce, and recommendation systems. The paper also highlights the limitations of existing approaches and addresses them by proposing a new approach.

One of the limitations of the proposed approach is that it assumes that the session logs are already available and preprocessed. However, in real-world scenarios, the session logs may not be readily available or may require significant preprocessing efforts.

Cryptic mining in light of artificial intelligence

Prajapat, Shaligram; Thakur, Aditi; Maheshwari, Kajol; Thakur, Ramjeevan Singh; 

second International Conference On Advances In Computing, Control And Networking-ACCN , pp. (131-135), 2015.

DOI : 10.15224/978-1-63248-073-6-77

https://www.seekdl.org/conferences/paper/details/6209.html

The paper "Cryptic Mining in Light of Artificial Intelligence" by Prajapat et al. proposes a novel approach called "cryptic mining" that combines data mining techniques with artificial intelligence to extract useful patterns from session logs. The authors argue that the combination of these two approaches can lead to more accurate and efficient analysis of session logs and can help in various applications such as improving website performance and identifying potential security threats.

The contribution of this work lies in the development of the cryptic mining approach, which utilizes a combination of frequent pattern mining, classification, and clustering techniques to extract useful information from session logs. The authors demonstrate the effectiveness of their approach through experiments conducted on a sample dataset.

One limitation of this work is that it is limited to the analysis of session logs and may not be applicable to other types of data. Additionally, the experiments conducted in the paper are limited to a small dataset, and further evaluation on larger datasets may be necessary to determine the scalability of the approach.

An optimal key size of the AVK for symmetric key Encryption

Prajapat, Shaligram; Thakur, Ramjeevan Singh;

Covenant Journal of Informatics and Communication Technology, Vol (3) 2, pp. (71-81), 2015

https://journals.covenantuniversity.edu.ng/index.php/cjict/article/view/257/226

In this paper, the authors focus on the determination of an optimal key size for the AVK approach of symmetric key encryption. They use a Markov analysis to determine the ideal key size that ensures the highest level of security while also maintaining efficiency in terms of computation time and memory usage.

The contribution of this work lies in the determination of the optimal key size for the AVK approach of symmetric key encryption, which is important in ensuring the security of data in transmission. The authors' use of Markov analysis provides a method for determining key size that is grounded in mathematical theory.

A limitation of this work is that it focuses solely on the AVK approach, and the results may not be applicable to other methods of symmetric key encryption. Additionally, the paper does not consider the impact of other factors, such as the strength of the encryption algorithm, on the security of the system.

Investigation For Efficient Cryptosystem Using SGcrypter

Shaligram Prajapat, Gaurav Parmar and Ramjeevan Singh Thakur

International Journal of Applied Engineering Research (IJAER)

Volume 10, Number 79, pp.853-858, (2015)   Special Issues

In proceedings of International Conference on Computing Paradigms (ICCP-2015) , 2015

Research India Publications New Delhi

https://www.ripublication.com/Volume/ijaerv10n79spl.htm

The paper, explores the use of a new algorithm called SGcrypter for secure data encryption and decryption. The authors begin by providing an overview of traditional encryption algorithms such as DES and RSA and their limitations. They then introduce SGcrypter, a new algorithm based on the permutation and substitution method that is designed to be efficient and secure.

The contribution of this paper is the development and evaluation of SGcrypter. The authors provide a detailed description of the algorithm and its implementation. They also conduct performance and security analyses, comparing SGcrypter with other well-known encryption algorithms.In terms of performance, the authors found that SGcrypter outperformed other algorithms in terms of execution time and memory usage. They also found that SGcrypter is resistant to various attacks, including brute force and differential attacks.one limitation of this paper is that the authors did not provide a thorough analysis of the security of SGcrypter, especially in comparison to other state-of-the-art encryption algorithms. It would have been useful to see a more in-depth analysis of the security of SGcrypter and how it compares to other well-known encryption algorithms.The utility of this paper lies in the development and evaluation of a new encryption algorithm that is designed to be efficient and secure. The authors provide a detailed description of the algorithm and its implementation, making it accessible to other researchers and practitioners in the field. Additionally, the performance and security analyses provide useful insights into the strengths and weaknesses of SGcrypter compared to other encryption algorithms.

Various Approaches towards Cryptanalysis

Shaligram Prajapat and Ramjeevan Singh Thakur.

International Journal of Computer Applications 127(14):15-24, October 2015.

Published by Foundation of Computer Science (FCS), NY, USA

https://www.ijcaonline.org/research/volume127/number14/prajapat-2015-ijca-906518.pdf

 doi: 10.5120/ijca2015916518. 

Available: https://www.ijcaonline.org/research/volume127/number14/prajapat-2015-ijca-906518.pdf.

The paper discusses various approaches towards cryptanalysis, which is the study of cryptographic systems with the aim of finding weaknesses that can be exploited to recover the plaintext. The paper covers different types of attacks on cryptographic systems, such as brute-force attacks, differential attacks, linear attacks, and others.It provides an overview of various cryptanalysis techniques and attacks that can be used to compromise cryptographic systems. It provides a comprehensive discussion of different approaches towards cryptanalysis, including statistical attacks, algebraic attacks, and machine learning-based attacks. It also discusses the limitations of these techniques and their applications in different scenarios.

The paper does not provide an in-depth analysis of each cryptanalysis technique and their mathematical foundations. Additionally, the paper does not provide practical examples or case studies to illustrate the effectiveness of each technique.The paper provides a valuable resource for researchers and practitioners working in the field of cryptanalysis. It provides a comprehensive overview of different approaches towards cryptanalysis and their limitations. The paper can be used as a reference to select appropriate cryptanalysis techniques and evaluate their effectiveness in different scenarios.

Various ANN approaches towards crypt analysis

Prajapat, Shaligram; Chaudhary, R.; Khan, A.; Raikwar, S.; Thakur, R.S.;

Proceedings of the International Conference on Innovations in Computer Science and Information Technology ICICSIT-2015, pp. ( 723-729), 2015.

Paramount Publisher ISBN 978-93-85100-08-6

The paper presents a comprehensive study of different ANN approaches for cryptanalysis, which can help researchers and practitioners to understand the potential of ANNs in this field. The authors also provide a comparison of different ANN techniques, highlighting their strengths and weaknesses. The study presented in this paper is limited to the use of ANNs in cryptanalysis, and it does not explore other techniques that can be used for this purpose. Additionally, the authors do not provide a detailed analysis of the performance of each ANN approach, which could have helped readers to better understand their strengths and limitations.This paper can be useful for researchers and practitioners who are interested in using ANNs for cryptanalysis. It provides an overview of different ANN techniques and can help readers to select the most appropriate approach for their specific needs. Additionally, the comparison of different techniques presented in this paper can help readers to understand the trade-offs between different approaches.

Sparse approach for realising AVK for Symmetric Key Encryption. 

Prajapat, Shaligram; Ashok Sharma, D. Rajput, Shashank Swami, Thakur, RS;

IJRDET & proceeding of International Research Conference on Engineering Science and Management (IRCESM 2014)2, pp. (15-18), 2014)

International Journal of Recent Development in Engineering and Technology

www.ijrdet.com (ISSN 2347-6435(Online), Volume 2, Special Issue 4, June 2014)

https://www.ijrdet.com/files/IRCESM2014/IJRDET_IRCESM_03.pdf

The paper "Sparse approach for realising AVK for Symmetric Key Encryption" proposes a new method for generating Automatic Variable Key (AVK) for symmetric key encryption. The authors introduce a sparse approach, which reduces the number of bits needed for the key while maintaining its effectiveness in securing the data. The paper provides a detailed explanation of the proposed approach and its implementation, along with the results of experimental tests to demonstrate its efficiency and effectiveness.

The paper contributes to the field of information security by introducing a new approach for generating AVKs for symmetric key encryption, which reduces the number of bits required for the key while maintaining its security. The proposed approach offers potential benefits such as reduced storage requirements, faster encryption, and decreased computation time.The main limitation of the proposed approach is that it may not be suitable for applications that require the highest levels of security, as reducing the number of bits required for the key could potentially decrease its resistance to attacks. Additionally, the paper does not provide a detailed analysis of the approach's performance against various types of attacks.

The paper is useful for researchers and practitioners in the field of information security who are interested in developing and implementing new encryption methods for securing data communication in computer networks. The proposed approach could be used as a basis for further research and development of more advanced security solutions that require reduced storage requirements and computation time. Additionally, the experimental results presented in the paper could help inform the selection of encryption methods for specific applications.

Time variant approach towards symmetric key

Prajapat, Shaligram; Rajput, D; Thakur, Ramjeevan Singh; 

Science and Information Conference, pp. (398-405), 2013, IEEE

ISBN:978-0-9893193-0-0

https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6661769&isnumber=6661709

The paper "Time variant approach towards symmetric key" proposes a new method for generating time-variant symmetric keys, which can be used for secure communication in computer networks. The authors describe the algorithm in detail and provide a theoretical analysis of its security properties. The paper also presents experimental results to demonstrate the effectiveness of the proposed method.

The paper makes a significant contribution to the field of cryptography by introducing a new method for generating time-variant symmetric keys, which can enhance the security of data communication in computer networks. The proposed method is based on a combination of mathematical functions and time parameters, which makes it difficult for attackers to predict the keys. The paper also provides a theoretical analysis of the security properties of the algorithm, which can be used as a basis for further research in the field.

The main limitation of the proposed algorithm is its computational complexity, which can be a bottleneck for applications where speed is a critical factor. Additionally, the paper does not provide a detailed analysis of the algorithm's resistance to various attacks, which limits its applicability in real-world scenarios.The paper is useful for researchers and practitioners in the field of cryptography who are interested in developing and implementing new methods for secure communication in computer networks. The proposed algorithm can be used as a basis for further research in the field, and the theoretical analysis of its security properties can help to inform the design of more advanced encryption methods. Additionally, the experimental results presented in the paper can serve as a benchmark for evaluating the performance of other encryption algorithms.

A novel approach for information security with automatic variable key using Fibonacci Q-matrix

Prajapat, Shaligram; Jain, Amber; Thakur, RAMJEEVAN SINGH;  

International Journal of Computer & Communication Technology (IJCCT) ISSN (ONLINE): 2231 - 0371 ISSN (PRINT): 0975 –7449 Vol-3, Iss-3, 2012

https://idc-online.com/technical_references/pdfs/data_communications/A%20Novel%20Approach.pdf

The article "A novel approach for information security with automatic variable key using Fibonacci Q-matrix" presents a new encryption algorithm based on the Fibonacci Q-Matrix for securing data communication in computer networks. The authors propose a new approach for generating automatic variable keys using the Fibonacci sequence, which makes it difficult for attackers to decode the encrypted data. The article provides a detailed description of the algorithm and its implementation, along with the results of experimental tests to demonstrate its effectiveness. The article makes a significant contribution to the field of information security by introducing a new encryption algorithm that offers enhanced security compared to traditional encryption methods. The use of automatic variable keys based on the Fibonacci sequence makes the algorithm more resistant to attacks, and the experimental results presented in the article demonstrate its effectiveness in real-world scenarios.

The main limitation of the algorithm is its computational complexity, which makes it less efficient than some other encryption methods. This could make it unsuitable for applications where speed is a critical factor. Additionally, the article does not provide a detailed analysis of the security of the algorithm against various attacks.

The article is useful for researchers and practitioners in the field of information security who are interested in developing and implementing new encryption algorithms for securing data communication in computer networks. The algorithm proposed in the article could be used as a basis for further research and development of more advanced security solutions. Additionally, the experimental results presented in the article provide valuable insights into the effectiveness of the algorithm in real-world scenarios. The use of automatic variable keys based on the Fibonacci sequence could also be applied to other encryption algorithms to enhance their security.

Implementation of Information Security with Fibonacci Q-Matrix

Prajapat, Shaligram; Saxena, Sachin; Jain, Amber; Sharma, Pradeep; 

International Journal of Electronics Communication and Computer Engineering, pp. 118-124, 2012

https://www.ijecce.org/index.php/urgent-notice/86-ijecce-pages/41-icicis

The article introduces a new algorithm based on the Fibonacci Q-Matrix that offers enhanced security compared to traditional encryption methods. The algorithm is particularly useful for securing data communication in computer networks, which is an area of growing concern due to the increasing prevalence of cyber attacks and data breaches.The main limitation of the algorithm is its computational complexity, which makes it less efficient than some other encryption methods. This could make it unsuitable for applications where speed is a critical factor. Additionally, the article does not provide a detailed analysis of the security of the algorithm against various attacks. The article is useful for researchers and practitioners in the field of information security who are interested in developing and implementing new encryption algorithms for securing data communication in computer networks. The Fibonacci Q-Matrix algorithm introduced in the article could be used as a basis for further research and development of more advanced security solutions. Additionally, the experimental results presented in the article provide valuable insights into the effectiveness of the algorithm in real-world scenarios.

Analyzing and Comparing Clustering Algorithms for Student Academic Data.

Bhurre, S., Raikwar, S., Prajapat, S., Pathak, D. (2024).

In: Naik, N., Jenkins, P., Grace, P., Yang, L., Prajapat, S. (eds) Advances in Computational Intelligence Systems. UKCI 2023. 

Advances in Intelligent Systems and Computing, vol 1453. Springer, Cham.

https://doi.org/10.1007/978-3-031-47508-5_49

https://link.springer.com/chapter/10.1007/978-3-031-47508-5_49#citeas

 Analyzing Supervised Learning Models for Predicting Student Dropout and Success in Higher Education.

Bhurre, S., Prajapat, S. (2024).

In: Naik, N., Jenkins, P., Grace, P., Yang, L., Prajapat, S. (eds) Advances in Computational Intelligence Systems.

UKCI 2023. Advances in Intelligent Systems and Computing, vol 1453. Springer, Cham. 

https://doi.org/10.1007/978-3-031-47508-5_19

https://link.springer.com/chapter/10.1007/978-3-031-47508-5_19#citeas

"Comparative Study of Classification Algorithms for Analysis of Students’ Academic Performance in Online Learning,"

S. Bhurre and S. Prajapat,

 in Proceedings of International Conference on Perspectives in Teaching, Learning and Assessment during COVID-19 Pandemic, MIER Jammu. March 19-10, 2022.

Towards Realisation of Assessment Module using Learning Management System for Integrated Course

Prajapat, Shaligram; Agrawal, Aishwarya; Anita, MC; 2019

6th International Conference on Computing for Sustainable Global Development (INDIACom), pp. 1179-1183, 2019

IEEE Electronic ISBN:978-9-3805-4434-2

DVD ISBN:978-93-80544-32-8

Print ISBN:978-1-5386-9271-4

https://ieeexplore.ieee.org/document/8991412

Towards Realisation of Assessment Module using Learning Management System for Integrated Course. 

Prajapat, S., Agrawal, A., & Anita, M. (2019, March). 

In 2019 6th International Conference on Computing for Sustainable Global Development (INDIACom) (pp. 1179-1183). IEEE. Electronic ISBN: 978-9-3805-4434-2. DVD ISBN: 978-93-80544-32-8. Print ISBN: 978-1-5386-9271-4. DOI: 10.1109/INDIACom.2019.8991412.

This paper presents a model for designing an assessment module using Learning Management System (LMS) for an integrated course. The proposed model includes the use of LMS for automatic assessment, student performance analysis, and feedback generation. The paper also discusses the advantages and limitations of using an LMS for assessment in higher education. The contribution of this work is the proposed model, which can be used as a guideline for designing an assessment module using LMS. It also highlights the importance of using technology for enhancing the assessment process and improving the learning outcomes of students.

Graph mining approach towards recommendation system using feedback

C. A. Dhawale, S. Prajapat, R. Hegadi and S. Agrawal,

IEEE International WIE Conference on Electrical and Computer Engineering (WIECON-ECE), Dhaka, Bangladesh, 2015, 

pp. 365-369, Electronic ISBN:978-1-4673-8786-6

doi: 10.1109/WIECON-ECE.2015.7443994.

https://ieeexplore.ieee.org/document/7443994

Dhawale, C. A., Prajapat, S., Hegadi, R., & Agrawal, S. (2015, December). Graph mining approach towards recommendation system using feedback. In IEEE International WIE Conference on Electrical and Computer Engineering (WIECON-ECE) (pp. 365-369). Dhaka, Bangladesh: IEEE. doi: 10.1109/WIECON-ECE.2015.7443994. Available: https://ieeexplore.ieee.org/document/7443994

The paper proposes a graph mining approach for building a recommendation system using feedback data. The proposed approach includes three steps: graph construction, feature extraction, and recommendation generation. In the graph construction step, the authors construct a graph model to represent user behavior and feedback data. In the feature extraction step, they extract features from the constructed graph to represent the similarity between items. Finally, in the recommendation generation step, they generate recommendations for users based on the extracted features. The main contribution of the paper is the proposal of a graph mining approach for building a recommendation system that uses feedback data, which can help improve the accuracy of recommendations. However, one limitation of the work is that the proposed approach has not been evaluated on a large dataset, which could limit the generalizability of the results.

Security Modeling of Parametric Capturing Tool (PCT) in Analytical layer Service for e-Learning Resources

Harshit Mahajan, Sunny Raikwar,Shubham Dubey, Shaligram Prajapat

International Journal of Advanced Studies of Scientific Research, Vol. 4, No. 1, 2019

https://ssrn.com/abstract=3330009

4th International Conference on Cyber Security-ICCS 2018

The paper presents a security modeling of the Parametric Capturing Tool (PCT) used in the analytical layer service for e-learning resources. The authors propose a novel security model that is intended to identify and mitigate the security threats in the PCT. The proposed model consists of several layers such as data layer, application layer, network layer, and user interface layer. The contribution of this work is to provide a comprehensive security model for PCT that addresses the security issues of e-learning resources. It also helps the e-learning system providers to identify and manage the security risks associated with the PCT.

DC-model for quality improvement in technical education

Kulkarni, Ankit; Khan, Ajeet; Mishra, Nitesh; Raikwar, Sunny; Prajapat, Shaligram;

2014 IEEE International Conference on MOOC, Innovation and Technology in Education (MITE), pp.( 308-312),2014

DOI: 10.1109/MITE.2014.7020293

Electronic ISBN:978-1-4799-6876-3

https://ieeexplore.ieee.org/document/7020293

The paper "DC-model for quality improvement in technical education" presents a new model for improving the quality of technical education. The authors propose a DC (Determine and Check) model that aims to enhance the effectiveness of the teaching-learning process by integrating feedback mechanisms and continuous assessment. The paper describes the model in detail and provides insights into its implementation in technical education institutions.The paper makes a significant contribution to the field of technical education by introducing a new model for quality improvement that can be applied to various aspects of the teaching-learning process. The DC model offers a systematic approach for determining the effectiveness of instructional strategies and making necessary adjustments. The paper provides a valuable resource for educators and policymakers interested in improving the quality of technical education.

The main limitation of the paper is that it does not provide a detailed analysis of the effectiveness of the DC model compared to other quality improvement models in technical education. Additionally, the paper does not address the challenges associated with the implementation of the DC model in different contexts. The paper is useful for educators, policymakers, and researchers in the field of technical education who are interested in improving the quality of instruction and learning outcomes. The DC model proposed in the paper offers a practical framework for implementing quality improvement initiatives in technical education institutions. The paper also provides insights into the challenges and opportunities associated with the implementation of the DC model.

Investigation of SPM Approaches for Academic IT–Projects

Karandikar, Varsha; Mehra, Ankit; Prajapat, Shaligram; 

International Conference on Computational Science and Its Applications, pp. (265-282), 2014, Springer

https://link.springer.com/chapter/10.1007/978-3-319-09156-3_20

https://doi.org/10.1007/978-3-319-09156-3_20

Print ISBN 978-3-319-09155-6, Online ISBN 978-3-319-09156-3

The paper titled "Investigation of SPM Approaches for Academic IT-Projects" discusses various project management approaches that can be applied in academic IT projects. The authors have investigated various project management methodologies such as Agile, Waterfall, and Spiral model and compared their effectiveness in academic IT projects. The paper presents a case study that demonstrates the application of these approaches in an academic IT project. The contribution of this research lies in identifying the best-suited project management approach for academic IT projects, which can improve project outcomes. The limitation of the research is that it is based on a single case study, which may not represent the entire academic IT project scenario. The paper's utility lies in providing valuable insights to academic IT project managers in choosing an appropriate project management methodology based on the project's nature and scope.

MIS for New-Bies Big-Buddy based Collaborative SIG Learning Environment

Amarpreet,Kaur, Jethra; Himanshi, Nigam; Shaligram, Prajapat;

National Conference on Computational Sciences-NCCS 2017, 

In an Abstract Book published by the Department of Computer Science Govt. Holkar Sc  College, Indore, [Abstract ][Presented] 

The paper presents a collaborative learning environment named "New-Bies Big-Buddy" which is designed to help students learn through collaboration with peers. The environment is based on the concept of Special Interest Group (SIG) where students with similar interests collaborate and learn together. The work discusses the development of the Management Information System (MIS) for the New-Bies Big-Buddy learning environment. The MIS is designed to manage the user data, user authentication, user profile management, and data analytics. The authors propose the use of Big Data analytics to improve the learning outcomes of the users.

The contribution of the paper lies in the development of a collaborative learning environment that promotes peer-to-peer learning and the use of MIS for user management and data analytics. The use of Big Data analytics is a novel approach that can provide insights into the learning behavior of the users and improve the learning outcomes.

The limitation of the paper is that it does not provide a detailed analysis of the effectiveness of the New-Bies Big-Buddy learning environment. The authors only present the design and development of the MIS and do not provide any empirical evidence of its effectiveness.The utility of the paper lies in the development of a collaborative learning environment that can promote peer-to-peer learning and the use of MIS for user management and data analytics. The New-Bies Big-Buddy learning environment can be used by educational institutions to facilitate collaborative learning and improve the learning outcomes of the students.

Investigation of Efficient Approaches and Applications for Image Classification Through Deep Learning.

Khandelwal, S., Prajapat, S. (2024).

In: Naik, N., Jenkins, P., Grace, P., Yang, L., Prajapat, S. (eds) Advances in Computational Intelligence Systems. UKCI 2023.

Advances in Intelligent Systems and Computing, vol 1453. Springer, Cham. 

https://doi.org/10.1007/978-3-031-47508-5_37

https://link.springer.com/chapter/10.1007/978-3-031-47508-5_37#citeas

Exploring Community Detection Algorithms and Their Applications in Social Networks.

Sakle, M., Prajapat, S. (2024).

In: Naik, N., Jenkins, P., Grace, P., Yang, L., Prajapat, S. (eds) Advances in Computational Intelligence Systems. UKCI 2023.

Advances in Intelligent Systems and Computing, vol 1453. Springer, Cham. 

https://doi.org/10.1007/978-3-031-47508-5_46

https://link.springer.com/chapter/10.1007/978-3-031-47508-5_46#citeas

Probability Approximation Based Link Prediction Method for Online Social Network.

Bhanodia, P.K., Khamparia, A., Prajapat, S., Pandey, B., Sethi, K.K. (2024).

In: Naik, N., Jenkins, P., Grace, P., Yang, L., Prajapat, S. (eds) Advances in Computational Intelligence Systems.

UKCI 2023. Advances in Intelligent Systems and Computing, vol 1453. Springer, Cham.

https://doi.org/10.1007/978-3-031-47508-5_47

https://link.springer.com/chapter/10.1007/978-3-031-47508-5_47#citeas

Effect of Financial News Headlines on Crypto Prices Using Sentiment Analysis. 

Limone, A., Gupta, M., Nagar, N., Prajapat, S. (2024). 

In: Naik, N., Jenkins, P., Grace, P., Yang, L., Prajapat, S. (eds) Advances in Computational Intelligence Systems. UKCI 2023.

Advances in Intelligent Systems and Computing, vol 1453. Springer, Cham. 

https://doi.org/10.1007/978-3-031-47508-5_17

https://link.springer.com/chapter/10.1007/978-3-031-47508-5_17#citeas

Investigation of Decision Support System for Indian Penal Code Section Using Similarity Algorithm and Fuzzy Logic. 

Srivastav, A., Prajapat, S. (2024). 

In: Naik, N., Jenkins, P., Grace, P., Yang, L., Prajapat, S. (eds) Advances in Computational Intelligence Systems. UKCI 2023.

Advances in Intelligent Systems and Computing, vol 1453. Springer, Cham. 

https://doi.org/10.1007/978-3-031-47508-5_50

https://link.springer.com/chapter/10.1007/978-3-031-47508-5_50#citeas

Text Processor for IPC Prediction

Harode, Balkrishna; Shaligram Prajapat; Bhurre, Shraddha; 

Recent Innovations in Computing ,  pp. 107-117, 2022

Springer, Singapore

https://doi.org/10.1007/978-981-16-8248-3_9

The article "Text Processor for IPC Prediction" presents a new method for predicting International Patent Classification (IPC) codes using a text processing approach. Article presents a technique that employs natural language processing (NLP) and machine learning (ML) algorithms to analyze patent documents and predict their IPC codes. The article provides a detailed description of the proposed method and presents the results of the experiments conducted to evaluate its performance. 

Text similarity algorithms to determine Indian penal code sections for offence report

Srivastav, Ambrish;  Shaligram Prajapat; 

IAES International Journal of Artificial Intelligence, Vol.(11), Number 1, 34, 2022

http://doi.org/10.11591/ijai.v11.i1.pp34-40

The article "Text similarity algorithms to determine Indian penal code sections for offence report" proposes a method for determining the appropriate Indian Penal Code (IPC) sections for a given offence report by analysing the text similarity between the report and the IPC sections. The authors, employ various text similarity algorithms, including cosine similarity and Jaccard similarity, to compare the text of the offence report with the IPC sections. The article describes the proposed method in detail and presents the results of experiments conducted to evaluate its performance. 

Similarity-Based Indices or Metrics for Link Prediction

Praveen Kumar Bhanodia, Kamal Kumar Sethi, Aditya Khamparia, Babita Pandey,Shaligram Prajapat 

Book Title: Hidden Link Prediction in Stochastic Social Networks, 2019 |Pages: 29

IGI Global Information Science Reference (an imprint of IGI Global) 2019

DOI: 10.4018/978-1-5225-9096-5.ch001, 

https://www.igi-global.com/chapter/similarity-based-indices-or-metrics-for-link-prediction/227195

The work titled "Similarity-Based Indices or Metrics for Link Prediction" is a chapter in the book "Hidden Link Prediction in Stochastic Social Networks". Focus was on link prediction in social networks using similarity-based indices or metrics. The authors propose various similarity-based indices or metrics for link prediction, including cosine similarity, Jaccard index, Pearson correlation coefficient, and others. The proposed indices are evaluated using real-world social network datasets, and the authors provide a detailed analysis of the experimental results. This work's contribution is providing a comprehensive evaluation of similarity-based indices or metrics for link prediction in social networks and proposing new indices that can be used for this task. 

Online Social Network Analysis

Praveen Kumar Bhanodia, Aditya Khamparia, Babita Pandey, and Shaligram Prajapat

Book Title: Hidden Link Prediction in Stochastic Social Networks, 2019,Pages: 14

IGI Global Information Science Reference (an imprint of IGI Global) 2019

DOI: 10.4018/978-1-5225-9096-5.ch003

https://www.igi-global.com/chapter/online-social-network-analysis/227197

The work titled "Online Social Network Analysis" by P.K. Bhanodia, A. Khamparia, B. Pandey, and S. Prajapat, published in the book "Hidden Link Prediction in Stochastic Social Networks," provides an overview of online social network analysis. The chapter discusses various concepts related to social network analysis, including centrality measures, community detection, and link prediction techniques. It also highlights the importance of social network analysis in various fields, such as marketing, sociology, and political science. The contribution of this work is that it provides an accessible introduction to social network analysis, making it useful for beginners in the field.

Smart home and security system with intelligent monitoring

Balkrishna Harode, Lakhanveer Lodhi, Shaligram Prajapat

International Journal of Advance Research, Ideas and Innovations in Technology, Volume 5, Issue 4,2019. ISSN: 2454-132X

https://www.ijariit.com/manuscripts/v5i4/V5I4-1349.pdf

The paper titled "Smart home and security system with intelligent monitoring" presents the design and implementation of a smart home security system. The proposed system is based on Internet of Things (IoT) technology and is capable of monitoring various parameters like temperature, humidity, and presence of smoke, fire or intruders in the home environment. The system comprises a set of sensors, actuators and a microcontroller that communicate with each other and with the user's smartphone via the internet. The system provides real-time monitoring, alerts and remote control of home devices.

The contribution of the paper lies in the implementation of an intelligent smart home security system that can be easily controlled and monitored remotely via the user's smartphone. The system is capable of detecting and alerting the user about potential safety hazards in the home environment, such as fire, smoke or intruders, and can take appropriate actions in response to these hazards. The paper also presents the use of machine learning algorithms to improve the accuracy of the system in detecting intruders.

The limitations of the paper are that the proposed system is limited in its scope and may not be suitable for larger homes or more complex security requirements. The system also relies on a stable internet connection, which may not always be available in certain regions.The utility of the paper lies in its contribution to the field of smart home security systems. The proposed system provides an efficient and effective solution for monitoring and controlling various parameters in the home environment. The system can be useful for homeowners, security personnel, and insurance companies in ensuring the safety and security of homes and their occupants.

A prototype for grievance redressal system

Shaligram Prajapat; Sabharwal, Vaibhav; Wadhwani, Varun;

Proceedings of International Conference on Recent Advancement on Computer and Communication

pp. 41-49, 2018Springer, Singapore

DOI: 10.1007/978-981-10-8198-9_5 ,

https://link.springer.com/chapter/10.1007/978-981-10-8198-9_5

This paper presents a prototype for a grievance redressal system that utilises web-based technologies for efficient handling and resolution of complaints. The system was designed to be user-friendly and scalable, allowing for easy integration with existing complaint management systems. The authors highlight the importance of grievance redressal systems in improving public services and ensuring accountability. The prototype was tested and evaluated, and the results indicate that the system is effective in addressing complaints in a timely and efficient manner.This work contributes to the development of technology-based solutions for better public service delivery.

M-Grev: Modeling of Mobile Notification and Grievance Registration System for UTD

Aishwarya, Halwe; Sunny, Raikwar; Shaligram, Prajapat; 

VirtualCom-2016,  2016

ISBN: 978-93-85895-44-9 2016, VirtualCom-2016, Organized by ISROSET

Quality Controlled process framework for Procurement and Purchase System

Ravindra Yadav, Shaligram Prajapat, Manju Suchdeo, A.K. Sapre

International Journal of Computer Sciences and Engineering

Volume-6 , Issue-6 , Page no. 1574-1578, June-2018

DOI: https://doi.org/10.26438/ijcse/v6i6.15741578

The paper proposes a quality-controlled process framework for the procurement and purchase system. The framework aims to ensure quality in the procurement process, reducing the risk of procurement failure and improving procurement performance. The proposed framework consists of four stages: planning, supplier selection, procurement execution, and evaluation. Each stage has a set of quality control parameters, and the authors have provided a checklist for each parameter to ensure compliance with the framework. The paper's contribution is in providing a comprehensive framework for ensuring quality in the procurement process, which can be useful for organisations in various industries. The proposed framework can help organizations to make informed decisions in the procurement process, reduce procurement failure, and improve procurement performance.

Generic Model for Online Course Promotion of HRDC in Social Network  (An open source model for all universities in the world )

Shaligram, Prajapat; Shubham, Dubey;

Lambert Academic Publishing, LAP, 2017

ISBN-13:978-3-330-33155-6 

Publisher ‏ : ‎ LAP LAMBERT Academic Publishing; 1st edition (1 August 2017)

ISBN-10 ‏ : ‎ 9783330331556

ISBN-13 ‏ : ‎ 978-3330331556

https://www.amazon.in/Generic-Online-Course-Promotion-Network/dp/3330331550

The work titled "Generic Model for Online Course Promotion of HRDC in Social Network" by Shaligram Prajapat and Shubham Dubey is a book that presents an open-source model for promoting online courses offered by Human Resource Development Centres (HRDC) in universities across the world. The book provides insights into the benefits and challenges of promoting online courses through social networks and offers a generic model that can be customized and implemented by universities according to their specific needs. The authors have discussed the importance of online course promotion in the current digital era and have proposed an innovative and effective approach for universities to reach out to a larger audience.

The authors provide a step-by-step guide to creating effective online course promotion campaigns, including how to create attractive and engaging content, target specific audiences, and measure the success of the campaign. This work contributes to the field of online education and digital marketing, providing a valuable resource for universities to increase their visibility and attract more 

students to their online courses.

 The book is published by LAP LAMBERT Academic Publishing and is available on various platforms, including Amazon.

Shaligram Prajapat and Shubham Dubey presented a "Generic Model for Online Course Promotion of HRDC in Social Network," an open source model for all universities worldwide. This book provides a comprehensive framework for universities to promote their online courses on social media platforms, including Facebook, Twitter, LinkedIn, and Google+. 

Challenges Associated With Automation of NPO: Requirement Engineering Phase.

Mathai, M.P., Raikwar, S., Sagore, R., Prajapat, S. (2015).

Proceedings of the 21st International Conference on Industrial Engineering and Engineering Management 2014.

Atlantis Press, Paris.

Online ISBN 978-94-6239-102-4,Print ISBN 978-94-6239-101-7

https://link.springer.com/chapter/10.2991/978-94-6239-102-4_135

https://doi.org/10.2991/978-94-6239-102-4_135

The paper discusses the challenges faced in the automation of non-profit organisations (NPOs) during the requirement engineering phase. The authors identify various challenges such as stakeholder communication, requirement elicitation, requirement specification, and requirement verification, and propose possible solutions to mitigate these challenges.

The paper's contribution lies in identifying the specific challenges faced in the requirement engineering phase of NPO automation, which has not been explored extensively in the literature. The proposed solutions can serve as a useful guideline for organisations planning to automate their processes.The limitation of the work is that the proposed solutions are not empirically validated, and their effectiveness cannot be assessed. Moreover, the study's scope is limited to the requirement engineering phase, and challenges in other phases of NPO automation are not addressed.

Towards Modeling of Android enabled Parking Management System

Aishwarya, Surana; Sheetal, Vishwakarma; Shraddha, Bhurre; Prajapat, Shaligram; 

National Conference on Computational Sciences-NCCS 2017, 2017

In an Abstract Book published by the Department of Computer Science Govt. Holkar Sc College, India , [Abstract ][Presented] 

The paper "Towards Modeling of Android enabled Parking Management System" discusses the development of a parking management system using the Android platform. The authors introduce an Android-based mobile application that can be used to reserve parking spots and locate available parking spaces.The contribution of this paper is the proposal of an efficient parking management system that can help to reduce traffic congestion and improve parking utilization. The paper presents a systematic approach to modeling the system and demonstrates its feasibility through a prototype implementation.

The limitation of this paper is that it only discusses the modeling and prototype implementation of the parking management system, and does not provide a detailed evaluation of its effectiveness or performance.The utility of this paper lies in its potential to inspire further research and development in the field of parking management systems. It provides a valuable reference for researchers and practitioners who are interested in developing similar systems. Additionally, the paper provides insights into the design and implementation of Android-based mobile applications for practical purposes.

Towards Comparative Performance Analysis of Parallel Sort

Divya, Gaur; Shubham, Dubey; Rajendra, Verma; Prajpat, Shaligram;

National Conference on Computational Sciences-NCCS 2017

In an Abstract Book published by the Department of Computer Science Govt. Holkar Sc College, India,  [Abstract ][Presented] 

The paper titled "Towards Comparative Performance Analysis of Parallel Sort" by D. Gaur, S. Dubey, R. Verma, and S. Prajapat discusses the performance analysis of parallel sorting algorithms and compares their efficiency in terms of time and space complexity. The paper begins with a discussion on the importance of sorting algorithms and their use in various applications. The authors then provide an overview of various parallel sorting algorithms and discuss their advantages and limitations. The main contribution of this paper is the comparative analysis of parallel sorting algorithms based on their performance and efficiency.

The authors have implemented the parallel sorting algorithms and evaluated their performance based on execution time and space complexity. The results obtained from their analysis provide insights into the performance of various parallel sorting algorithms and can be useful in choosing the appropriate algorithm for a given application.One limitation of this paper is that the authors do not consider the impact of various factors, such as the number of processors, memory access time, and communication overhead, on the performance of parallel sorting algorithms. Future research could consider these factors to provide a more comprehensive performance analysis of parallel sorting algorithms.

The utility of this paper lies in the insights it provides into the performance of parallel sorting algorithms. The results obtained from this analysis can be useful in choosing the appropriate algorithm for a given application, thereby improving the efficiency and performance of the system. Furthermore, the paper provides a basis for further research in the field of parallel computing and sorting algorithms.

Solution of differential equations by parallel processing and analysis for performance improvement   

Rajendra, Verma; Shubham, Dubey; Divya, Gaur; Shaligram, Prajapat;

National Conference on Computational Sciences-NCCS 2017, 2017

DOI :10.13140/RG.2.2.13284.42886

In an Abstract Book published by the Department of Computer Science Govt. Holkar Sc College, Indore, [Abstract ][Presented] 

The paper discusses the application of parallel processing to improve the performance of solving differential equations.The authors begin by introducing the concept of differential equations and the various methods used to solve them. They then discuss the limitations of traditional methods, such as finite difference and finite element methods, and propose the use of parallel processing as a solution to improve the performance of solving differential equations.

The contribution of this paper is the application of parallel processing to solve differential equations. The authors provide a detailed description of the implementation of parallel processing using OpenMP and MPI, and then conduct experiments to evaluate the performance of the parallel approach compared to traditional methods.In terms of experimentation, the authors found that the parallel approach significantly improved the performance of solving differential equations, especially for large systems of equations. They also found that the parallel approach can be used with different types of differential equations, including first-order and higher-order equations.

However, one limitation of this paper is that the authors did not provide a thorough analysis of the accuracy of the parallel approach compared to traditional methods. It would have been useful to see a more in-depth analysis of the accuracy of the parallel approach and how it compares to traditional methods.The utility of this paper lies in the application of parallel processing to solve differential equations. The authors provide a detailed description of the implementation, making it accessible to other researchers and practitioners in the field. Additionally, the experiments conducted provide useful insights into the performance of the parallel approach and its potential to improve the efficiency of solving differential equations.

Issues of Parallel Binary Search over Sequential Processing

Shubham, Dubey; Divya, Gaur; Ritesh, Jhaggar; Shaligram, Prajapat;

National Conference on Computational Sciences-NCCS 2017

In an Abstract Book published by the Department of Computer Science Govt. Holkar Sc College, India,  [Abstract ][Presented] 

The paper discusses the challenges and limitations faced during parallel binary search over sequential processing.The contribution of the paper is that it identifies the limitations and challenges of parallel binary search, which is widely used in various fields such as information retrieval, database management, and computational sciences. The authors examine the factors that limit the performance of parallel binary search, such as the number of processors, search key, and the size of the dataset.

The limitations of the paper are that it does not propose any new algorithm or technique for improving the performance of parallel binary search. Instead, the paper mainly focuses on identifying the limitations and challenges of parallel binary search.

The utility of the paper is that it provides useful insights into the limitations and challenges of parallel binary search, which can be useful for researchers and practitioners working in the field of parallel computing, data management, and computational sciences. The paper can help researchers to understand the factors that affect the performance of parallel binary search and to design efficient algorithms and techniques for improving the performance of parallel binary search.