8/9/2019 %2For...idyut_CSE_Vidyut%20Ghosal.pdf

1/2

Vidyut Ghosalvidyut@iitk.ac.in, +91 9336461464 H-313, Hall 8, IIT Kanpur, Kanpur 208016

Education

Year Examination/Degree Institute/School, City Performance

2009 B.Tech-M.Tech Dual Degree Indian Institute of Technology M.Tech: 10/10*(May) (Computer Science and Engineering) Kanpur B.Tech: 8.6/10*

2004 Class XII (Andhra Pradesh Board) Vikas Junior College, Visakhapatnam 94.6%2002 Class X (ICSE) Timpany School, Visakhapatnam 91.83%

(*)Cumulative Performance Index

Scholastic Achievements

• Secured an  All India Rank of 427 in IIT-Joint Entrance Examination (IIT-JEE) (2004).

• Secured an All India Rank of 150 in the All India Engineering Entrance Examination (AIEEE) (2004).

• Represented Coastal Andhra region at the National Mathematics Olympiad (Among top 4 students fromthe region) (2004).

Internship

INRIA Rocquencourt, Paris, France (May-July 2007)Manager: Dr. Francesco Zappa Nardelli, Researcher in-charge, Moscova project Burfiks: Bayesian web filtering

− Implemented a Firefox browser addon for Linux and Mac to learn and predict user browsing behaviourusing an existing bayesian classifier.

− Coded the tool’s proxy module and back end module to communicate with the bayesian classifer (OCaml).Worked with another intern.

−  Designed and coded the user interface (XUL,Javascript). Worked individually.

− The  project led to the first public release of the tool. It is being used by researchers to evaluatethe performance of bayesian filters in predicting browsing patterns.

Master’s Thesis

Face Biometrics

Mentor: Dr. Phalguni Gupta, Professor, IIT Kanpur 

− Conceptualized a novel approach to reduce the dimensionality of Gabor wavelets for face recognitionusing a data structure called Random Forests.

− Achieved reduction in number of distinctive features from 100,000 to as low as 500 with minimal increasein error rates.

− Working on using Random Forests as a classification tool for face images with focus on tackling occlusionin images.

Technical Projects

• Spam detection based on social networks(Jan-April’07): A system to detect spammers based one-mail interactions of a closed community with the outside world.

− Generated user ranks using a ranking algorithm based on ratio of mails sent to mails received.

− Implemented a prototype filter (C#, Perl and MySQL) which detects spammers using user ranks andvarious personal control lists.

− Highly accurate results on test set of mail logs of 3300 users and 55000 mail transactions.

• KNotepad - Concurrent text editing(Jan-April’08)

− Notepad like editor for concurrent editing of shared text files over a network.− Real time locking (collision avoidance using exclusive locks) for concurrency control.

− Highly fine grained locking. Minimum editable region is a line.

− Central file manager for lock allocation/recovery and file saving. Written in C++ for the KDE Desktopenvironment.

8/9/2019 %2For...idyut_CSE_Vidyut%20Ghosal.pdf

2/2

• Compact object based transaction system(Aug-Nov’07)

− Designed the compact object structure (encapsulated data with small operations) and the protocol forits transfer in a mobile environment (handling issues like mobility, disconnection and data consistency).

− Implemented a prototype server and mobile client (C#) to demonstrate the feasibility of the proposedapproach.

• Querying Wikipedia(Jan-April’08)

− Generated concept maps for given terms by querying Wikipedia’s content using Web2.0 technologies.− Developed a prototype search system for movies (using Wikipedia’s content) to handle complex queries

of the form: ‘Movies after 1980 starring X but not Y, directed by Z’ etc.

− Wikipedia’s content was obtained in Resource Description Framework (RDF) format using dbpedia.organd queried using the SPARQL query language.

• Estimating Rarity In Data Streams(Jan-April’08): Implemented & compared two algorithms toestimate   α-rarity of a data stream.   α-rarity is a measure of the number of items that appear exactly   αtimes in a stream.

•  Pascal Compiler(Jan-April’07)

− Correctly compiles programs for a subset of Pascal containing constructs like arrays, if & switch state-ments and loops to SPIM assembly code.

− Written in C and using lex and yacc for lexical analysis and parsing.

• Extension of Nachos(Aug-Nov’06): Implemented multiprogramming, system calls, virtual memoryetc on top of a primitive OS.

• A network performance measurement tool(Aug-Nov’06): A command line tool written in C tomeasure UDP, TCP throughput and UDP loss between two nodes in a network.

Technical Skills & Coursework

Programming Languages, Tools: C, C++, Java, C#, PHP, Matlab, Visual Studio.

Coursework: Data Structures and Algorithms, Data Streaming Algorithms, Discrete Maths, Theory of Computation, Operating Systems, Networks, Internet Technologies, Compiler Design, Software Engineer-ing, Computer Organization, Databases, Mobile Computing, Distributed Systems, Multimodal Biometrics.

Extra Curricular Activities

• Instructor, Summer School on Data Structures, May’08: Designed the course structure, syllabusand taught a class of 120 students, mostly IIT Kanpur freshmen. Worked in a team of 5 peers. Organizedby Department of Computer Science & Engineering, IIT Kanpur.

•   Senior Marketing Executive, Antaragni’07   (Inter college cultural festival): Led a two tier 10member team to manage the publicity material and requirements of festival sponsers. Member of theMarketing PR team to help sponser’s representatives.

•   Coordinator, Gearloose-Gadget Design Event, Techkriti’07  (Inter college technical festival):Lead a 3 tier 15 member team to successfully manage one of the largest events of the festival. Worked withanother coordinator. Increased the participation substantially over previous year by framing innovativeand challenging problems.

• Coordinator, Microsoft .NET Club (06-07): In charge of the activities of the club for the year.

• Won 3rd prize in Techkriti’06 and special prize in Techkriti’05, in Gearloose - the gadget design compe-tition (over 30 teams).