Jeremy R. Johnson

Department of Mathematics and Computer Science

Drexel University

Philadelphia, PA, 19104 USA

e-mail: jjohnson@mcs.drexel.edu

http://www.cs.drexel.edu/~jjohnson

 

EDUCATION

Ph.D.  Computer and Information Science, The Ohio State University, 1991. Thesis: Algorithms for  

            Polynomial Real Root Isolation. Advisor: Prof. George E. Collins

 

M.S.   Computer Science, University of Delaware, 1988. Thesis: Some Issues in Designing

           Algebraic Algorithms for the CRAY X-MP. Advisor: Prof. B. F. Caviness.

 

B.A.   Mathematics, University of Wisconsin-Madison, 1985 (with honors). Honor's Thesis:  

           Computer Graphical Representation of Symmetry Groups.

 

PROFESSIONAL EXPERIENCE

2002-present Professor and Interim Department Head of Computer Science

2001Graduate Advisor and Program Director for Computer Science, Dept. of Mathematics and Computer Science, Drexel University.

2001-2002 Associate Professor of Electrical and Computer Engineering (joint appointment)

1997-2002  Associate Professor of Mathematics and Computer Science, Drexel University.

1998-1999  Visiting Associate Professor of Electrical and Computer Engineering and Computer Science, Carnegie Mellon University.

1991-1997  Assistant Professor of Mathematics and Computer Science, Drexel University.

 

RESEARCH

Computer Algebra, Design and Analysis of Algorithms, Programming Languages and Compilers, Algorithms for DSP, Parallel Processing, and Scientific Computing.

 

Selected Grants:

Principal Investigator (2002-2005) on DARPA Grant, “Molecular Observation, Spectroscopy, and Imaging using Cantilevers (MOSAIC)”. Total amount $302,201.

 

Principal Investigator (1998-2002) on DARPA Grant, “Automatic Implementation of Signal Processing Algorithms”. Total amount $576,670.

 

Principal Investigator (1996-1999) on DARPA Grant,  “The Very High Dimensionality Automatic Programming Feasibility Study.”  Total amount $397,356.

 

Patents:

Dimensionless Fast Fourier Transform Method and Apparatus (with L. Auslander and R. W. Johnson), Patent number US6003056, granted April, 1999.

 

Selected Publications: Total of one book, 39 refereed conference papers, and ten journal publications.

Quantifier Elimination and Cylindrical Algebraic Decomposition, Ed. B. F. Caviness and J. R. Johnson, in Texts and Monographs in Symbolic Computation, Springer-Verlag, 1997.

 

Automatic Derivation and Implementation of Fast Convolution Algorithms, (with A. Breitzman), Journal of Symbolic Computation, accepted for publication, 2002.

 

Interval Arithmetic in CAD Computation, (with G. E. Collins and W. Krandick), Journal of Symbolic Computation, accepted for publication, 2002.

 

A Prototypical Self-Optimizing Package for Parallel Implementation of Fast Signal Transforms, (with K. Chen), International Parallel and Distributed Processing Symposium, IPDPS 2002.

 

SPL: A Language and Compiler for DSP Algorithms, (with J. Xiong, D. Padua, and R. W. Johnson), Proc. of the SIGPLAN '01 Conference of Programming Language Design and Implementation (PLDI), June 20-22, 2001, pp. 298-308.

 

Design, Optimization, and Implementation of a Universal FFT Processor, (with P. Kumhom and P. Nagvajara), Proc. 13th IEEE International ASIC/SOC Conference, Washington, DC, Sept. 2000.

 

A methodology for designing, modifying, and implementing Fourier Transform Algorithms on various architectures, (with R. W. Johnson, D. Rodriguez, and R. Tolimieri), Circuits, Systems, and Signal Processing, Vol. 9, No. 4, 1990, pp. 449-500.

 

TEACHING

Undergraduate Courses:

Computer Programming, Computer Architecture, Data Structures, Advanced Data Structures, Theory of Algorithms, Programming Language Concepts, Artificial Intelligence, Numerical Analysis.

 

Graduate Courses:

Data Structures and Algorithms I & II, Computer Algebra I & II, Programming Languages, Artificial Intelligence, Machine Organization, Numerical Analysis, Parallel Processing, Parallel Algorithms.

 

Thesis advisor:

Mike Balog (M.S.) “A Flexible Framework for Implementing FFT Processors”, (co-advisor), 2002.

Kang Chen (M.S.) “A Prototypical Self-Optimizing Package for Parallel Implementation of Fast Signal Transforms”, 2002.

Hung-Jen Huang (M.S.) “Performance Analysis of an Adaptive Algorithm for the Walsh-Hadamard Transform”, 2002.

Pete Becker (M.S.) “High Speed VLSI Architecture for Discrete Haar Wavelet Transform”

Jianxin Xiong (Ph.D.)  Automatic Optimization of DSP Algorith”, (co-advisor) 2001.

Pinit Kumhom (Ph.D.)  “Design and Optimization of a Universal FFT Processor”, (co-advisor) 2001

Rich Pedersen (M.S.) “A Simple Model for the Runtime Performance of Finite Fourier Transform Algorithms” 1996.

 

 

Professional:

Guest editor for the special issue of the Journal of Symbolic Computation devoted to Computer Algebra and Signal Processing, to appear 2002.

 

Co-organizer (with Markus Püschel) for a session on “Applications of Computer Algebra to Signal Processing” at the IMACS, Applied Computer Algebra Conference (ACA-01) June 2001.

 

Co-organizer (with B. Char and Y. Lakshman) of East Coast Computer Algebra Day (ECCAD-1994).

 

Co-organizer (with B. F. Caviness and B. Buchberger) of  Symposium on Quantifier Elimination and Cylindrical Algebraic Decomposition, held October 1993 in Linz, Austria.

 

Program Committee Member:  International Symposium on Symbolic and Algebraic Computation (ISSAC '97). International Symposium on Symbolic and Algebraic Computation (ISSAC '96) -- poster session, International Conference on Interval and Computer-Algebraic Methods in Science and Engineering (Interval-94) International Symposium on Parallel Symbolic Computation (PASCO-94).