Page Not Found
Page not found. Your pixels are in another canvas.
Sitemap
A list of all the posts and pages found on the site. For you robots out there is an XML version available for digesting as well.
Pages
About Me
About me
Page not in menu
This is a page not in th emain menu
Posts
Long Short-Term Memory (LSTM) Networks: A Beginner’s Guide
Published:
Long Short-Term Memory (LSTM) networks are a type of neural network that are specifically designed to handle sequential data. They are commonly used in natural language processing, speech recognition, and other applications that require the processing of sequences of data. In this article, we will explore the basics of LSTM networks, including their structure, how they work, and some of the innovative applications that they have been used for.
portfolio
Best Poster Award
Won the best poster award at JTG/IEEE ITSoc 2022, IIT Mandi for poster on Tandem Queue Decomposition: A Throughput Optimal Routing Policy for Quantum Key Distribution Networks [poster] (2022)
JEE Advanced
Secured an All India Rank of 331 in JEE Advanced 2016 and an All India Rank of 434 in JEE Mains 2016 from about 1.5 million applicants, being in the top 0.02%. (2016)
Olympiads
Qualified and placed among the top 0.1% of students in Regional Maths Olympiad (RMO) and National Standard Examination in Chemistry (NSEC); thereby selected for Indian National Maths and Chemistry Olympiads (2015)
NTSE
Awarded National Talent Search Examination (NTSE) Scholarship by NCERT (New Delhi). (2012)
KVPY
Two time awardee of Kishore Vaigyanik Protsahan Yojana (KVPY) Fellowship (Young Scientist Fellowship) by the Department of Science & Technology, Govt. of India and administered by IISc, Bangalore.(2015, 2016)
Prime Minister Scholarship
Awarded Prime Minister’s Scholarship (PMSS) by the Ministry of Defense for academic excellence.(2019)
projects
Tandem Queue Decomposition
Published:
publications
Fast and Secure Routing Algorithms for Quantum Key Distribution Networks
Published in Journal 1, 2022
This paper considers the problem of secure packet routing at the maximum achievable rate in a Quantum key distribution (QKD) network. Assume that a QKD protocol generates symmetric private keys for secure communication over each link in a multi-hop network. The quantum key generation process, which is affected by noise, is assumed to be modeled by a stochastic counting process. Packets are first encrypted with the available quantum keys for each hop and then transmitted on a point-to-point basis over the communication links.
Recommended citation: V. B and A. Sinha, "Fast and Secure Routing Algorithms for Quantum Key Distribution Networks," 2022 14th International Conference on COMmunication Systems & NETworkS (COMSNETS), 2022, pp. 120-128, doi: 10.1109/COMSNETS53615.2022.9668578. https://ieeexplore.ieee.org/abstract/document/9668578/
talks
Tandem Queue Decomposition
Published:
TQD method which is discussed in our paper, was presented in an Invited Talk delivered at University Massachussets Amherst, Quantum Networks Seminar by Prof Abhishek Sinha and myself. CQN website. Slides Deck