PARAG NAMJOSHI CONTACT INFORMATION Dept. of Computer Science & Electrical Engg., University of Maryland Baltimore County, 1000 Hilltop Circle, Baltimore, MD 21250. Email: p a r a gn @ g m a i l . c o m URL: http://www.csee.umbc.edu/~nam1 EDUCATION UNIVERSITY OF MARYLAND BALTIMORE COUNTY Ph.D. Candidate in Computer Science Dissertation Title: Computational Problems in Haplotype Inference UNIVERSITY OF MARYLAND BALTIMORE COUNTY M.S. in Computer Science Thesis Title: Maximum Lifetime Data Gathering and Aggregation in Wireless Sensor Networks. MAHARASHTRA INST. OF TECHNOLOGY, PUNE UNIVERSITY B.E. in Computer Engineering, “First Class with Distinction.” SKILLS Programming Languages Databases Optimization Tools IDE/Applications Operating Systems Work: +1-(410) 455–8945 Cell : +1-(443) 315–7739 India :+91-(202) 4470810 Baltimore, MD Jan 2003 – Oct 2009 Baltimore, MD Jan 2001 – Dec 2002 Pune, India Aug 1994 – Jun 1998 Proficient in C, C++, Java, MATLAB, Python, SQL. Conversant with Perl, Unix shell scripts, and x86 assembly language. DB2, DB2 spatial extender, Oracle, and MySQL. MATLAB optimization toolbox, Semidefinite programming toolbox (SDPT3), IBM ILOG CPLEX. Visual Studio, Eclipse, and MATLAB. Microsoft Windows (Kernel Level Programming), Linux, and Solaris. WORK EXPERIENCE SAN DIEGO SUPERCOMPUTER CENTER Intern (Programmer/Analyst II) Analyzed massive Light Detection and Ranging (LIDAR) datasets in MATLAB to understand the structure of the LIDAR datasets. Tuned DB2 spatial grid index for the LIDAR datasets. Implemented different physical organizations for the LIDAR datasets based on equi-depth histograms and Hilbert scans. Designed and performed experiments to evaluate performance of these organizations on parallel DB2. Analyzed query-load to identify opportunities for improving query performance including caching and pre-computed derived products. AGNIK, LLC. Intern (Software Engineer II) Designed an Intrusion Detection System (IDS). Designed and analyzed Distributed Privacy Preserving (DPP) data mining algorithms for the IDS including a novel DPP approximate scan detection algorithm. Collaborated with Univ. of Minnesota researchers to develop privacy preserving trend detection algorithms. Led a team of four engineers to implement the DPP anomaly San Diego, CA Jun 2007 – Aug 2007 Baltimore, MD Feb 2006 – Jul 2006 detection algorithm, scalable streaming components, GUI, and database backend. UNIVERSITY OF MARYLAND BALTIMORE COUNTY Instructor Database Management Systems (Undergraduate). Graduate Assistant Research in energy efficient algorithms for sensor networks. Worked as a teaching assistant for Algorithms (grad and undergrad), Operating Systems, Database, Data Structures, Discrete Mathematics, Automata Theory, and C/C++ programming courses. E-L O C K T E C H N O L O G I E S Senior Software Engineer Led a team of three engineers to design and implement E-lock Policy and Profile Manager for enterprise document security management using public key infrastructure (PKI). Designed and implemented RFC 3161 compliant Time-stamp Client and Server. Software Engineer Designed and implemented E-lock Policy API for policy creation, management, and enforcement. Designed and Implemented Digital signature and encryption components. Implemented caching for windows Network File System client (device driver). Made improvements to the NFS client and Server. Baltimore, MD Summer 2005 and Spring 2007 Jan 2001 – Dec 2005, Sep 2007- present Pune, India Aug 2000 – Dec 2000 Aug 1998 – Aug 2000 RELATED COURSE WORK Advanced Operating Systems, Applied Bioinformatics, Automata Theory, Complexity Theory, Design and Analysis of Algorithms, Introduction to Machine Learning, Knowledge Representation, Mobile Computing, and Principles of Databases. PUBLICATIONS [1] Konstantinos Kalpakis and Parag Namjoshi, "On a Divide and Conquer Approach for Haplotype Inference with Pure Parsimony." In the Proceedings of the Annual Biotechnology and Bioinformatics Symposium (BIOT 08), Arlington, TX, USA, October, 2008. [2] Konstantinos Kalpakis and Parag Namjoshi, "Haplotype Inference Using Semidefinite Programming." In the Proceedings of the IEEE Bioinformatics and Bioengineering (BIBE 05), Minneapolis, MN, USA, October, 2005. [3] Konstantinos Kalpakis, Vasundhara Puttagunta, and Parag Namjoshi, "Accuracy Vs. Lifetime: Linear Sketches for Approximate Aggregate Range Queries in Sensor Networks." In the Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, Philadelphia, PA, USA, October, 2004 [4] Konstantinos Kalpakis, Koustuv Dasgupta, and Parag Namjoshi, "Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks." Computer Networks, Volume 42, Issue 6, August 2003. [5] Koustuv Dasgupta, Konstantinos Kalpakis, and Parag Namjoshi, "Improving the Lifetime of Sensor Networks via Intelligent Selection of Data Aggregation Trees." In the Proceedings of the Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS 03), Orlando, FL, USA, January, 2003. [6] Koustuv Dasgupta, Konstantinos Kalpakis, and Parag Namjoshi "An Efficient Clustering--based Heuristic for Data Gathering and Aggregation in Sensor Networks." In the Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC 03), New Orleans, LA, March 2003. [7] Konstantinos Kalpakis, Koustuv Dasgupta, and Parag Namjoshi, "Maximum Lifetime Data Gathering and Aggregation in Wireless Sensor Networks." In the Proceedings of the IEEE International Conference on Networking (ICN 02), Atlanta, GA, August, 2002. PUBLICATIONS (IN PREPARATION OR UNDER REVIEW) [1] Parag Namjoshi and Konstantinos Kalpakis, "On Haplotype Inference for Polyploid Genotypes." [2] Parag Namjoshi and Konstantinos Kalpakis, "Memory efficient Haplotype Inference with Pure Parsimony." [3] Parag Namjoshi and Konstantinos Kalpakis, "Haplotyping for Disease Association and Pure Parsimony Principle." PROFESSIONAL SERVICES Represented Computer Science Department as a Senator to the UMBC Graduate Student Association (2004 – 2005). External Reviewer for European Transactions on Telecommunications, and ACM CIKM 2002. CITIZENSHIP STATUS CITIZEN OF INDIA. REFERENCES: AVAILABLE UPON REQUEST.