Resume of Bhaskar DasGupta

Curriculum Vitae of   Bhaskar  DasGupta

(does not contain all information and may not be up-to-date. Please check other items of my homepage http://www.cs.uic.edu/~dasgupta for more up-to-date information.)

Table of contents

Present Employment

Associate Professor, Department of Computer Science, University of Illinois at Chicago, Chicago, IL 60607-7053.

Education
 

PhD in Computer Science, received on January, 1995 from Department of Computer Science, University of Minnesota, Minneapolis, MN 55455-0159, USA.

MS in Computer Science, received on August, 1992 from Department of Computer Science, The Pennsylvania State University, University Park, PA 16802, USA.

Master of Engineering (ME) in Computer Science & Automation, received on December, 1987 from Indian Institute of Science (IISc), Bangalore, India.

Bachelor of Engineering (BE) in Computer Science & Engineering, received on July, 1986 from Jadavpur University, Calcutta, India.

Professional Experiences
 

Associate Professor, in Department of Computer Science of University of Illinois at Chicago, from August 22, 2005 (continued presently).

Assistant Professor, in Department of Computer Science of University of Illinois at Chicago, from August 22, 2001 until August 22, 2005.

Assistant Professor, in Department of Computer Science of Rutgers-Camden, from July 1st 1997 until August 22, 2001.

Visiting Assistant Professor, in Department of Computer Science of Rutgers-Camden, from September, 1996 To June, 1997.

Joint Post-Doctoral Fellowship in University of Waterloo and in McMaster University in Canada, from July, 1995 to August, 1996.
I did post-doctoral research with the research groups of Prof. Ming Li (Waterloo) and Prof. Tao Jiang (McMaster) on Design and Analysis of algorithms in Computational Molecular Biology.

Part-time Professor in Wilfrid-Laurier University in Canada from January, 1996 to April, 1996.
I taught a course titled Advanced Data Structures.

Post-doctoral Fellowship in DIMACS center of Rutgers University, from January, 1995 to June, 1995.
I did post-doctoral research with Prof. Eduardo T. Sontag on Neural Networks and Learning Theory with application to Control Theory.

Teaching/Research Assistant in University of Minnesota from August, 1992 to December, 1994.

Instructor in Pennsylvania State University from June, 1992 to August, 1992.
I taught a course on Introduction to Computer Programming in PASCAL.

Teaching/Research Assistant in Pennsylvania State University from August, 1989 to May, 1992.

Industrial Experience
 

Software Application Engineer/Math Specialist, in Infinite Graphics Incorporated, Minneapolis, MN 55406, from June 1994 to August 1994.
I mostly worked on developing software for VLSI applications using the C language and other necessary software tools.

Research & Development Engineer, CMC Ltd., India, from February, 1988 to July 1989.
I mainly worked on developing software for Image Processing applications, including development of a complete system for Automatic Fingerprint Identification. We used a ZIP-3216 array processor and the ZIP-C language (which is a mixture of C and low-level assembly language).

Research Grants (click the link)

Editorial Responsibilities

Teaching Assignments in University of Illinois at Chicago
 

Sem/YrCourse TitleCourse NumberCredits Enrollments (approximate)
F08 and S09 Sabbatical leave
S08 Introduction to Computational Molecular Biology CS 502 4 10
F07 Languages and Automata CS 301 3 25
F07 Discrete Structures I CS 201 4 56
S07 Computer Algorithms I CS 401 3/4 (undergraduate/graduate) 19
S07 Introduction to Computational Molecular Biology CS 502 4 19
F06 Computer Algorithms II CS 501 4 24
S06 Discrete Structures I CS 201 4 39
F05 Discrete Structures I CS 201 4 38
F04 Computer Algorithms I CS 401 3/4 (undergraduate/graduate) 30
F04 Computer Algorithms II CS 501 4 22
S04 Introduction to Computational Molecular Biology CS 502 4 27
F03 Computer Algorithms I CS 401 3/4 (undergraduate/graduate) 32
S03 Computer Algorithms II CS 501 4 20
F02 Computer Algorithms I CS 401 3/4 (undergraduate/graduate) 50
S02 Introduction to Computational Molecular Biology CS 594 4 32
F01 Computer Algorithms I CS 401 3/4 (undergraduate/graduate) 50

Course Evaluations in University of Illinois at Chicago
 

S/Yr and Course Title Overall Comparison
Other UIC Courses Other UIC Instructors
(Max=5) (Max=5)
F08 and S09    Sabbatical leave
S08, Introduction to Computational Molecular Biology (CS 502) 4.00 4.50
F07, Discrete Structures I (CS 201) 4.45 4.55
F07, Languages and Automata (CS 301) 3.62 4.03
S07, Computer Algorithms I (CS 401) 3.93 3.93
S07, Introduction to Computational Molecular Biology (CS 502) 4.39 4.72
F06, Computer Algorithms II (CS 501) 4.59 4.71
S06, Discrete Structures I (CS 201) 3.45 3.82
F05, Discrete Structures I (CS 201) 3.94 4.06
F04, Computer Algorithms I (CS 401) 4.41 4.63
F04, Computer Algorithms II (CS 501) 4.71 4.76
S04, Introduction to Computational Molecular Biology (CS 502) 4.20 4.32
F03, Computer Algorithms I (CS 401) 3.94 4.00
S03, Computer Algorithms II (CS 501) 4.41 4.59
F02, Computer Algorithms I (CS 401) 3.89 4.18
S02, Introduction to Computational Molecular Biology (CS 594) 4.21 4.38
F01, Computer Algorithms I (CS 401) 3.86 4.14

Teaching Assignments in Rutgers-Camden
 

S/YrCourse TitleNumberCrMOIAud RespEnrl (approximate)
S01 Introduction to Computer Science using C++ (Section 40) 50:198:111 3 Lec undergrad major total 50
F00 Design & Analysis of Algorithms 50:198:271 3 Lec undergrad major total 27
F00 Introduction to Computer Science using C++ (Section 1) 50:198:111 3 Lec undergrad major total 35
F00 Introduction to Computer Science using C++ (Section 2) 50:198:111 3 Lec undergrad major total 31
S00 Design & Analysis of Algorithms 50:198:271 3 Lec undergrad major total 32
S00 Senior Design Project 50:198:493 3 Lec undergrad major total 5
F99 None (FASP leave)
S99 Design & Analysis of Algorithms 50:198:271 3 Lec undergrad major total 17
S99 Computer Organization and Assembly Language 50:198:231 3 Lec undergrad major total 38
F98 Design & Analysis of Algorithms 50:198:271 3 Lec undergrad major total 30
F98 Introduction to Unix O/S 50:198:343 3 Lec undergrad major total 11
F98 Introduction to Programming Methods Using FORTRAN 50:198:151 3 Lec undergrad major total 11
Summ98Advanced C & UNIX50:198:2433Lecundergrduate majortotal14
Summ98Introduction to Programming Using C50:198:1523Lec undergrduatetotal30
S98Introduction to Programming Methods Using FORTRAN50:198:1513Lec undergrduatetotal26
S98Advanced C & UNIX50:198:2433Lecundergrduate majortotal35
F97Introduction to Programming Methods Using FORTRAN50:198:1513Lec undergrduatetotal10
F97Design & Analysis of Algorithms50:198:3443Lec undergrduate majortotal25
F97Data Structures50:198:2283Lecundergrduate majortotal35
Summ97Advanced C & UNIX50:198:2433Lecundergrduate majortotal13
Summ97Introduction to Programming Using C50:198:1523 Lecundergrduatetotal24
S97Design & Analysis of Algorithms50:198:3443Lec undergrd major total33
S97Introduction to Programming Using C50:198:1523Lec undergrduatetotal43
S97Introduction to Programming Methods Using FORTRAN50:198:1513Lec undergrduatetotal29
F96 Introduction to Programming Using C (section 01)50:198:1523 Lecundergrduatetotal34
F96 Introduction to Programming Using C (section 40)50:198:1523 Lecundergrduatetotal15

Course Evluations (when available) in Rutgers-Camden

S/Yr and Course Title Evaluation Responses Teaching Effectiveness Course Quality
    (Max=5) (Max=5)
    InstructorDept. MeanInstructorDept. Mean
S01, Intro to Computer Science using C++ (Section 40) 35 4.55 4.2 4.3 4.1
F00, Design & Analysis of Algorithms 21 4.00 3.86 3.95 3.85
F00, Intro to Computer Science using C++ (Section 1) 24 3.79 3.86 3.63 3.85
F00, Intro to Computer Science using C++ (Section 2) 19 3.53 3.86 3.56 3.85
S00, Design & Analysis of Algorithms 28 3.88 4.02 3.8 3.93
S99, Design & Analysis of Algorithms 12 4.18 4.12 4.2 4.09
S99, Computer Organization and Assembly Language 21 3.48 4.12 3.45 4.09
F98, Intro. to UNIX Operating Systems 8 4.13 4.09 4.14 4.04
F98, Intro. to Prog. Methods Using FORTRAN 5 4.60 4.09 4.20 4.04
Summ98, Advanced C & UNIX 7 3.57 4.15 3.43 3.98
S98, Intro. to Prog. Methods Using FORTRAN 18 3.40 3.89 3.20 3.86
Summ97, Advanced C & UNIX 10 4.30 4.17 4.20 4.10
Summ97, Intro to Prog. Using C 24 4.08 4.17 4.13 4.10
S97, Design \& Analysis of Algorithms 19 4.26 3.81 3.84 3.72
S97, Intro to Prog. Using C 26 3.85 3.81 3.80 3.72
S97, Intro. to Prog. Methods Using FORTRAN 14 3.77 3.81 3.77 3.72
F96, Intro to Prog. Using C (Section 01) 19 3.44 4.05 3.28 3.97
F96, Intro to Prog. Using C (Section 40) 12 3.92 4.06 4.00 3.97

  
  
Supervising PhD students at UIC:
  
       Kedsuda Apichonbancha, Computer Science (currently continued)
       Emma Mendonca, Bioengineering (currently continued)
  
Supervising MS thesis at UIC:
  • Implementation of an Efficient Algorithm for Inferring Haplotype Configuration on Pedigrees
    • Name of student: Santhoshi Jagadeeshan
    • Status: Completed Fall 2007
  • Title: Experimental evaluation of an algorithm in reverse engineering of biological networks
    • Name of student: Tanu Garg
    • Status: Completed Summer 2007
  • Title: Model Driven Developments of Applications Based on Active Objects
    • Name of student: Paolo Beretta
    • Status: Completed Spring 2007.
  • Title: A Survey of the Protein Folding and the Inverse Protein Folding Problems
    • Name of student: Haripriya Rajamani
    • Status: Completed Spring 2006
  • Title: Inapproximability Results for the Lateral Gene Transfer Problem
    • Name of student: Sergio Ferrarini
    • Status: Completed Spring 2005
  • Title: CHISEL: Data Mining Tool for Clustering and Classification of Protein Functions
    • Name of student: Tanuja Bompada
    • Status: Completed Fall 2004
  • Title: Efficient Implementations of Combinatorial Algorithms for String Barcoding Problems in Bioinformatics
    • Name of student: Venkatram Vishwanath
    • Status: Completed Fall 2003
Supervising MS projects at UIC:
  • Title: Generalizations and Applications of Secretary Problem
    • Name of student: Pavan K Maguluri
    • Status: Completed Summer 2008
  • Title: Random Variables, Strategies, and Hiring Problems
    • Name of student: Vamseedheeras Kanagala
    • Status: Completed Spring 2008
  • Title: A Study on Scheduling Problems
    • Name of student: Prasanth K. Goriparthi
    • Status: Completed Spring 2008
  • Title: The Complexity of Simplex Algorithm for Linear Programming -- A survey
    • Name of student: Kunduru Charanjithm
    • Status: Completed Spring 2008
  • Title: Search Algorithms with Local Sensory Information
    • Name of student: Vindhya Vunnam
    • Status: Completed Fall 2006
  • Title: String Barcoding Problem -- Analysis
    • Name of student: Sharad Choudhury
    • Status: Completed Fall 2006
  • Title: Phylogenetic Networks
    • Name of student: Nisha Raj Paryani
    • Status: Completed Fall 2006
  • Title: A survey on Algorithms for Imprefect Phylogeny Haplotyping (IPPH)
    • Name of student: Manoj Tulala
    • Status: Completed Fall 2006
  • Title: Online Algorithms for Scheduling Packets in Wavelength-Division Multiplexed Optical Networks
    • Name of student: Vinay Kumar Venkatachalapathy
    • Status: Completed Summer 2003
  • Title: Transmission Scheduling in Wavelength Division Multiplexed Optical Networks
    • Name of student: Balaji Gandhi
    • Status: Completed Spring 2003
  • Title: Scheduling Jobs Using the Two Phase Algorithm to Obtain Maximum Throughput
    • Name of student: Vandana Gummuluru
    • Status: Completed Spring 2003
  • Title: Implementation of a Two Phase Algorithm to Improve the Throughput of Off-line Scheduling Problem
    • Name of student: Gowri Venkatesh
    • Status: Completed Spring 2003
  • Title: Finding recurrent sources in sequences
    • Name of student: Reem Jaglith (Baridi)
    • Status: Completed Fall 2004
  • Title: Distributed Algorithm for Connected Sensor Cover Problems
    • Name of student: Sushma Dokku
    • Status: Completed Spring 2006
Co-supervising MS projects at UIC:
  • Title: Online Real-Time Preemptive Scheduling of Jobs With Deadlines on Multiple Machines
    • Name of student: Ravikumar Subramanian (ECE Graduate student, Primary adviser: Prof. Roland Priemar)
    • Status: Completed Spring 2003
  

Services to the department or university at UIC (selected few):
  • Member of the undergraduate committee.
  • Served as a member in the PhD thesis defense committee of a student (Andrei Turinsky) in the computer science department in 2002 (thesis title: Balancing cost and accuracy in distributed data mining, thesis adviser: Prof. Robert Grossman).
  • Served as a member in the PhD thesis defense committee of a student (Yaron Turpaz) in the bioengineering department in 2004 (thesis title: A novel method for discovery of gene function from protein surface patterns without known structures, thesis adviser: Prof. Jie Liang).
  • Served as a member in the PhD thesis defense committee of a student (Andrew Binkowski) in the bioengineering department in 2004 (thesis title: Inferring Structural and Functional Similarity in Proteins, thesis adviser: Prof. Jie Liang).
  • Served as a member in the PhD thesis defense committee of a student (Ying Cai) in the ECE department in 2005 (thesis title: Orthogonal Array-based Optimization Methods with Applications to Wireless Systems and Power Systems, thesis adviser: Prof. Derong Liu).

  
Undergraduate Independent Study projects at Rutgers-Camden:
  
   Name of student:
   Curtis Saal
   Sem/Year:
   Summer 2000 and Fall 2000.
   Nature of project:
   Implementing algorithms related to binary space partitioning of geometric objects.
  
  
   Name of student:
   Joseph P. Russell
   Sem/Year:
   Summer 1999 and Fall 1999.
   Financial support:
   Supported by my current NSF grant.
   Nature of project:
   Investigating properties of neural networks.
  
  
   Name of students:
   Valentino Lopez and Mingwei Wang.
   Sem/Year:
   Fall 1998 and Spring 1999.
   Financial support:
   Supported by a current NSF grant.
   Nature of project:
   Implementing (in C) an algorithm for State Equivalence in Hybrid PL Systems.
  
   Name of student:
   Antony Donlon
   Sem/Year:
   Spring 1998.
   Nature of project:
   Independent study on Java.
  

Services to the department or university at Rutgers-Camden:
 
  • Served as an external member in the PhD thesis defense committee of a student (Pirkko Kuusela) in the Mathematics department of Rutgers University (New Brunswick campus) in 1999 (thesis title: Learning Theory Techniques in Control Theory, thesis adviser: Prof. Daniel Ocone).
     
  • Participation in the operation of the Scholastic learning committee as a member.
     
  • Participation in the operation of faculty senate as a member.
     
  • Participation in the revision of the undergraduate curriculum and in the development of the anticipated Master's program in the department.
     
  • Acedemic advising and senior review of students.
     

(Selected) Invited Research Presentations:
 
``On Approximating Four Covering and Packing Problems with applications to Bioinformatics'', in Department of Computer Science, University of Toronto, Canada, July 21, 2008.

``On Approximating Four Covering and Packing Problems with applications to Bioinformatics'', in Department of Computer Science, University of Waterloo, Waterloo, Canada, July 18, 2008.

``Reverse Engineering of Networks Via the Modular Response Analysis Method'', in Networks: Biological, Social and Internet Workshop, 2008 SIAM Annual Meeting, San Diego, CA, July 11, 2008.

``Randomized approximations for offline and online set-multicover problems'', in Department of Computer Science, Universität Bonn, Bonn, Germany, January 2008.

``Signal Transduction Network Inference from Indirect Experimental Evidence'', in Department of Computer Science, Illinois Institute of Technology, Chicago, October, 2007.

``Signal Transduction Network Inference from Indirect Experimental Evidence'', in Department of Computer Science, Pennsylvania State University, University Park, PA 16802, July 27, 2007.

``A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence'', in 1st Bertinoro Systems Biology Meeting, Bertinoro, Italy, May 20-25, 2007.

``A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence'', DIMACS Workshop on Discrete Mathematical Problems in Computational Biomedicine New Brunswick, NJ, April 20, 2007.

``Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks'', minisymposium on Identifiability and Inference in Biochemical Pathways, 2006 SIAM Conference on Life Sciences, Raleigh, NC, August 3, 2006.

``Grouped String Barcoding and related problems'', DIMACS Workshop on Combinatorial Group Testing, DIMACS Center, Rutgers University, Piscataway, NJ, May 18, 2006.

``Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs'', Department of Computer Science, University of Connecticut, Storrs, CT, April 7 2006.

``Randomized Approximation Algorithms for Offline and Online Set Multicover Problems'' , Toyota Technological Institute at Chicago, University of Chicago, Chicago, IL March 3 2006.

``On Approximate Consistent Labeling of Biological Dynamical Systems'', in IEEE-EMBC 2005 Satellite Symposium on Bioinformatics and Computational Biology, Jiaotong University, Shanghai, China, August 30, 2005.

Invited tutorial on systems biology to selected undergraduate/graduate students in 5th International Summer School on Biocomplexity from System to Gene, Dartmouth College, Hanover, NH, June 28, 2005.

``Several Geometric Tiling and Packing Problems With Applications'', in Department of Computer Science, University of Massachusetts, Amherst, MA, November 22, 2004.

``Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks'',      in Symposium on Computational Science of Biomolecules: Applications in Medicine and Therapeutics, University of Illinois at Chicago, October 8, 2004.

``Several Geometric Tiling and Packing Problems With Applications'', in Department of Computer Science, University of Wisconsin at Milwaukee, Milwaukee, WI, September 26, 2003.

``Several Geometric Tiling and Packing Problems With Applications'', in Department of Computer Science, Pennsylvania State University, University Park, PA 16802, February 27, 2003.

``Several Geometric Tiling and Packing Problem With Applications To Nonoverlapping local alignments, DNA microarray designs and Homology Searches'', in Department of Computer Science, Illinois Institute of Technology, Chicago, November 4, 2002.

``Algorithmic Problems Related to Sequences and Phylogentic Trees'', in UIC-UIUC Symposium on Bioinformatics in Medicine and Biology, April 13, 2002.

``Throughput Maximization Problems in Real-time Scheduling'', in Department of Mathematics/Computer Science, University of Osnabrück, Germany, September 8, 2000.

``On Approximate Learning by Multi-layered Feedforward Circuits'', in the NeuroCOLT Workshop New Perspectives in the Theory of Neural Nets (organized by Prof. Wolfgang Maass), Schloß St. Martin, Graz, Austria, May 5, 2000.

``Improvements in Throughput Maximization for Real-Time Scheduling'', Department of Computer Science, Yale University, New Haven, CT 06511, January 31, 2000.

``On Computing Distances Between Evolutionary Trees'', in DIMACS Workshop on Discrete Mathematical Problems and Medical Applications, DIMACS Center, Rutgers University, Piscataway, NJ, December 8 - 10, 1999.

``Provably Good Algorithms for Transmission Scheduling in WDM Optical Networks'', in Department of Computer Science, University of Waterloo, Waterloo, CANADA; July 1999.

``On distances between phylogenetic trees'', in DIMACS Workshop on Computational Biology as part of the 50th Anniversary for ENIAC, Princeton University, May 17 - 19, 1996.

``Complexity of Algorithms (in Segmented-Channel Routing)'', in CALCE Electronic Packaging Research Center, University of Maryland, College Park, USA; September 19, 1995.

``Analog versus Discrete Neural Networks'', in Department of Computer Science, McMaster University, Hamilton, CANADA; June 1995.

``Analog versus Discrete Neural Networks'', in Department of Computer Science & Engineering, IIT Kharagpur, India; April 1995.

``Approximation by Neural Networks'', in Workshop in Advances in Neural Information Processing Systems 4, Vail, Colorado; December 1991.

``Approximation and Learning by Neural Networks with Continuous Activation Functions'', in Workshop in Advances in Neural Information Processing Systems 6, Vail, Colorado; December 1993.

``Segmented-Channel Routing Problems'', in Department of Electrical Engineering, Purdue University; July 1993.

Honors/Affiliations etc.:

NSF CAREER grant

Selection of biographical profile for inclusion in the 56th edition of Who's Who in America 2002 published by Marquis Who's Who.

Senior Member of IEEE

Member of ACM, SIGACT (special interest group on Algorithms and Complexity Theory in ACM)

Past member of SIAM

Professional Reviews for Conferences/Journals/Book chapters/ Grants (selected few, not updated anymore):

Conferences:
7th International Conference on Information Technology (CIT) 2004; 2004 American Control Conference (2004 ACC); Second International Conference on Machine Learning and Cybernetics, 2003 (China); Sympoisum on Theoretical Computer Science (STACS) 2002; 33rd ACM Symposium on Theory of Computing (STOC) 2001; 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) 2000; European Symposium on Algorithms (ESA) 2000; 38th IEEE Conference on Decision and Control 1999; 1999 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'99); 11th International Parallel Processing Symposium, 1997; International Conference on High Performance Computing, 1996; 8th IEEE Symposium on Parallel & Distributed Processing, 1996; Internationl Conference on High Performance Computing, 1995; 7th IEEE Symposium on Parallel & Distributed Processing, 1995; 6th Annual ACM Conference on Computational Learning Theory, 1993.

Journals:
Journal of Computational Biology; Theoretical Computer Science; Information and Computation; IEEE Transactions on Parallel and Distributed Systems; International Journal of Mathematics and Mathematical Sciences; IEE Proceedings - Computers and Digital Techniques; International Journal of Foundations for Computer Science; Journal of Supercomputing; Mathematics of Control, Signal and Systems; Algorithmica; Neural Computation; IEEE Transactions on Parallel and Distributed Systems; Journal of Parallel and Distributed Computing; Journal of Intelligent Systems; IEEE Transactions on Neural Networks; IEEE Transactions on Computers; IEEE Transactions on Information Theory.

Books:
Applied Algebra: Codes, Ciphers and Discrete Algorithms, Darel W. Hardy and Carol L. Walker, Prentice Hall (an honararium was paid for this work)

Chapters in edited books:
A chapter in Current Topics in Computational Biology, Tao Jiang, Ying Xu, and Michael Q. Zhang (eds.), MIT Press.

Grant proposals:
Panelist in several NSF/NIH panels in 2003 through 2007; Research Grants Council (RGC) in Hong Kong, 1999; Research Grants Council (RGC) in Hong Kong, 2001.
Other Professional Activities: