Resume of Utkarsh Jain, utkarsh@it.iitb.ac.in

Utkarsh Jain

Redmond, WA

Email: utkarshjain [at] gmail [dot] com

Software Development Engineer	Live Search, Microsoft Corp, Redmond, WA	Oct 2006 – Present
At Live Search, we routinely deal with solutions which need to scale to billions of documents, and thousands of computers, with 24*7 availability facing users from all over the WWW. I work in the Search Platforms team, which is responsible for maintaining the backend infrastructure of Search. Among various projects on the team, I have worked on scaling server performance, when we quadrupled our index from 5B to 20B documents, and researched in exploiting latest advances in multi-core and solid state disk technologies. I have designed, implemented, and tested a thumbnail serving solution which is an asynchronous, multi-threaded, caching server solution to improve latencies and end-user experience in geographically remote markets like China. I primarily use C++ for software development, with Perl & C# used for data analysis and scripting work.

Indian Institute of Technology Bombay KReSIT, IIT Bombay, India	M. Tech. (Information Technology) Advisor : Prof. Sunita Sarawagi CPI 9.62 / 10	2004 - 2006
Institute of Technology and Management ITM Gurgaon, India	B.E. (Information Technology) Marks 80%	2000 - 2004

ACM ICPC, 2004: Won 2^nd place at the 28th ACM International Collegiate Programming Contest Regionals, Oct. 2003 held at Roorkee-Kolkatta site. As part of top 73 teams among 3,150 teams selected from 1,411 universities in 75 countries, qualified & participated in the prestigious ACM-ICPC World Finals held in Prague, Czech Republic (March 2004).
Google India Code Jam, 2005: Selected as finalist from over 14,000 contestants to participate in finals for Google India Code Jam at Bangalore and ranked 35^th overall.
Fair Isaac Programming Challenge, 2005: Ranked 1^st among contestants from various IITs and other premier colleges in India.
Code Craft Programming Competition, IIIT Hyderabad, 2004: Ranked 2^nd among 267 teams from all over India.
"Algorhythm" Problem Solving Contest, Tryst, IIT Delhi, 2004: Ranked 1^st among various teams from all over India.

M. Tech. Project: Exploiting Local Regularities in Text Segmentation using Conditional Random Fields
Guide: Prof. Sunita Sarawagi

In this project, I worked on designing a model based on Conditional Random Fields that can model and extract local regularities from data having additional grouping in form of locales. Using the model, we obtained an improved solution to the problem of automatically segmenting text records into structured elements.
Summit Information Technologies Ltd, Gurgaon: Integration of Hindi Spell Check in Microsoft Word.

This project was taken as part of six week summer training in 2002 at Summit Information Technologies Ltd, Gurgaon. The project involved seamless integration of multilingual spell checking features in MS-Word to a company proprietary back-end library using Visual Basic for Applications.
Seminar: Fine-grained Access Control in Databases
Guide: Prof. Bernard Menezes

I surveyed various theoretical and currently implemented models and mechanisms of Fine-grained access control in databases providing access control at level finer than tables.
B. Tech. Project: Automated Program Evaluation and Contest Hosting System
Guide: Mr. Manoj Wadhwa

In this project we designed and implemented a system that provided secure and automated checking of C/C++ programs. Using this automated evaluator, we designed and implemented a programming contest hosting system.
Course Projects

DBMS, Lock manager for 2PL/Strict 2PL/Rigorous 2PL: DELITE is an open source memory-resident database system targeted at resource-constrained platforms like Simputer. In this project, we designed and implemented the lock management portion of the database in C.
Data Mining, Implementing Scalable EM in Weka: A scalable version of EM algorithm used for clustering of data was implemented in Java as an extension to popular data mining tool Weka.
Hypertext retrieval and mining, personalizing relevance ranking: In information networks where nodes represent entities and links represent relationships, an example being a Citation graph.
Computational Biology, Classification of Pharmacokinetic and Toxicological Properties of Chemical Agents based on Molecular Descriptors: Application of SVMs, other learning methods, and feature selection were studied on prediction accuracy of specific properties of various drugs.
Network Security, Study and characterization of various Network Attacks: In this project we studied various DoS attacks and Flash events and developed a Linux kernel module to prevent ARP spoofing attacks.
Systems Lab, Smart Card Based Information Security: In this project, using smart cards embedded in Identity cards of IIT Bombay, we designed and implemented a security system which ensured clients that their information hosted on servers is un-tampered.

Data Structures and Algorithms, Design and Analysis of Algorithms, Discrete Mathematics, Theory of Computation, Combinatorics.
Data Mining and Data Warehousing, Hypertext retrieval and mining, Implementation techniques in RDBMS, Computational Biology.
Statistical Foundations of Machine learning, Foundations of Probability and Statistics.

I hereby declare that the particulars given herein are true to the best of my knowledge and belief.

Utkarsh Jain
April, 2008
Redmond, WA
USA