Nitin Katakdound Email & Phone Number

Pune

Module Lead | Sr. System Analyst | Sr. Software Developer Continuous Product code integration and code deployment. GIT, Jenkins, shell scripting, CI/CD product release automation, code review from different teams. Working in card payment domain. POS systems, credit card terminals. MSD/EMV/CTLS/Wallet Payments etc. Product Development, Maintenance, Improvements, having work experience with VeriFone devices.worked on online payment transaction processing sensitive card data and its security. both symmetric and asymmetric encryption algorithms, AES128, AES256, RSA, E2E, P2PE,SSL,TLS.encryption key management techniques, private keys, public keys management techniques etc.Product issue analysis, product designing, product development, product maintenance etc.

Pune

Worked as an Research Assistant, for nano technology central govt. project.internally, worked on two projects which are used internally,one for examination section & another for centre Library Mgmt. both the projects are live.nano technology work has done to publish two research papers.

Pune

Automate bullet train breaking system-identify objects and its movement on bullet train tracks and accordingly apply break with required pressure to pass object and avoid accidents, regulate bullet train speed at run time. the whole mechanism was for the high speed bullet train control system. it was demo piece which was covered using cloud computing, image processing, Hadoop C, C++ etc. technology,

Pune

Solved TSP Mona Lisa Optimisation Problem. [Scientific And Engineering Computing Group. CDAC, Pune.]Under Guidance of Dr. V.Sunderrajan & Dr.V. Jayraman.its computational complex problem-Problem statement- there are n number of dots, join these dots in a way that once used dot will not used again, and find best path, lets start joining dots from any dot and finally rich to the same dot at the end. optimised/perfect solution will given sharp image of Monalisa. Mathematical approach[distance formula for n number of dot joining combination] is a computationally complex problem and it will take long time to find best path. the problem solve using genetic algorithm-[Genetic Algorithm] one sample was generated for 100000 dots and find path, mutation, etc. performed and n number of samples tried and find solution, we don't get exact solution but using this approach for n number of trials most optimised generation identified which considered optimised solution.The program written in C, C++, MPI. and CUDA C. The same program was submit/run on PARAM super computing facility at CDAC Pune.same program written for CUDA C and ruined on NVIDIA CUDA Tesla Machine.and we got optimised solution for 100000 dots and we viewed Monalisa pic

Master Of Technology (M.Tech.), Modeling & Simulation

Centre For Modeling & Simulation, University Of Pune. Conducts M.Tech. In Modeling & Simulation. Modeling & simulation is a sub branch.

Master'S Degree, Scientific Computing, Computer Science.

Formerly MCS. in Scientific Computing its a broad area in computational science. Artificial Inelegance, Machine Learning, GIS.

Bachelor'S Degree, Bcs Computer Science, A

Hsc, Mathematics And Computer Science, A

Activities and Societies: physics, chemistry, math, biology intermediate education