0 Project complete
Indraprastha Institute of Information Technology, Delhi is a state university located in Delhi, India. It is research-oriented with a focus on Computer Science and allied areas.
Its an institution of eminence exposer to technology, new studies and renowed faculty with the moto "Dissolving Boundaries and Evolving Senses"
Deliverable:
Implemented efficient public-key cryptosystem based on an elliptic curve from scratch, relying only on large-number arithmetic libraries like GMP NTL & MPI in C/C++.
Cross-border infiltration presents a national concern. Defense and monitoring of border areas require the inclusion of a wide range of tactics to interdict infiltrators. In an infiltration situation, human habitats along the infiltration route present numerous advantages to an infiltrator. The security personnel can adopt various strategies with a habitat to ambush the infiltrator since it is highly likely for the infiltrator to visit a habitat. The habitat acts as a proactive ambush site for the defender and therefore presents him with a high probability of deceiving the infiltrating agent. In this paper, a two-player zero-sum game is proposed between a defender and an infiltrator for habitat selection under the threat of ambush with and without deception. Both players apply various strategies to maximize their benefit out of the options available to them and adjust to each other’s options over the play only to eventually settle on an optimum strategy. The two players determine the tactical options available to them. The ambusher assigns a numerical value (Measure of Effectiveness, MOE) to each possible outcome by judging the potential gain or loss from an encounter. With the proposed game models the players can check to see if the outcome of the encounter in either deceptive or non-deceptive scenarios favors him or the opponent and what optimum strategy is possible with a desirable outcome. To the best of our knowledge, the present paper is the first application of game theory to human-human interaction similar to a predator-prey scenario for habitat selection.
This paper is an effort of expounding the recursive formula for the Josephus problem (which is the essence of the popular game “Akkad Bakad Bambai Bo” played in Indian households). The academic extension of this game has been to deal with the cases where elimination steps vary with each turn. Josephus problem is essentially heralded with objective of finding the position of the player who survives the game. Most of the available literature deals with the problem of finding the survival’s position when sequential elimination of persons takes place in steps for circled people. There is a simple algorithm known to solve this problem; however the rigorous procedure can be replaced with a formula. The nature of this formula can be either recursive or non-recursive; both of which comprise this paper. We have extended the problem to the situation wherein the elimination step varies with iterations.
Professional Data Scientist with 1.5+ years of experiece in Data Analysis, Machine Learning and Computer Vision
To Know about my research and more about my drop a message to me. I will be glad to connect with you.
E-1305, Arihant Arden, Greater Noida, UP, India
https://orcid.org/0000-0002-2043-7192