Timothy L. Highley, Jr.

2629 Commonwealth Dr.

Charlottesville, VA  22901

Office: (434) 982-2294

tjhighley (a t) cs DOT virginia DOT edu

 

Education:

University of Virginia  (Charlottesville, VA)

Ph.D. in Computer Science (Graduation: January 2005)

M.C.S., May 2000, Cumulative GPA 3.9 / 4.0

 

University of Dayton  (Dayton, OH)

B.S., May 1998, Cumulative GPA 4.0 / 4.0

Double Major: Mathematics and Computer Science

 

Teaching Experience:

University of Virginia, Department of Computer Science

Charlottesville, VA (various semesters, Jan 1999 - Present)

Teaching Assistant

  • Served as TA for Algorithms, Discrete Mathematics, Real-Time Computing, Data Structures, Programming Languages, Software Development Methods.
  • Lectured on occasion in three courses and co-taught Discrete Mathematics.
  • Maintained lab for Real-Time Computing.
  • Supervised undergraduate TAs for Software Development Methods lab.
  • Designed a website and assisted with course design for undergraduate Programming Languages.

 

University of Dayton

Dayton, OH (various semesters, Sep 1994 – May 1998)

Teaching Assistant and Tutor

  • Served as TA for Calculus II including grading, recitations and office hours.
  • Tutored one-on-one and held drop-in hours for various math courses.

 

Research Experience:

University of Virginia, Department of Computer Science

Charlottesville, VA (Jan 1999 - Present)

Research Assistant

  • Investigating file prefetching for delivery on demand.
  • Explored simulation, including the problem of multi-resolution modeling.
  • Implemented a prototype for a method of concurrency control that does not rely on locks or barriers.
  • Concurrently debugged prototype hardware and developed accompanying software.
  • Course-related research projects in programming languages, security, architecture and algorithms.

 

Work Experience:

Motorola Cellular Infrastructure Group

Arlington Heights, IL (May 1997 - Aug 1997)

Summer Intern

  • Worked on optimizing program sizes on a cellular switch.
  • Designed, coded, tested, and documented the merge of existing assembly modules.
  • Converted code from assembly to C while working on a large software system.

 

CACI, Inc.

Dayton, OH (May 1996 - Aug 1996)

Computer Programmer (Summer job)

  • Developed GUIs and used proprietary version of embedded SQL.

 

I-NET, Inc.

Dayton, OH (Sep 1993 - Sep 1995)

Jr. Engineering Aide

  • Created process for conversion of documents to HTML.
  • Established a World Wide Web site for the office.

 

Century Technologies, Inc.

Dayton, OH (Nov 1992 - Aug 1993)

Technical Assistant

  • Maintained a bulletin board system.

 

Accomplishments:

ARCS Foundation Scholarship, 2002-2004 (Booz Allen Hamilton

Named Scholar, 2003-2004)

Ballard Fellowship, University of Virginia, 2001-2002

Dean's Fellowship, University of Virginia, 1998-2001

NSF Graduate Research Fellowship - Honorable Mention, 1999

Alumni Award, University of Dayton Computer Science Dept., 1998

            (top student in graduating class)

World Finals of ACM Programming Contest, Honorable Mention, 1998

Member, University of Dayton computer programming team, 1996-98

Member, University of Virginia computer programming team, 1998
            (placed 8th of 138 teams)

Pi Mu Epsilon Mathematics Honor Society

Six undergraduate academic scholarships from:

University of Dayton (2), State of Ohio (2),
            Kittyhawk Men's Association, City of Dayton

 

Refereed Papers:

  • Timothy Highley and Paul F. Reynolds.  Prefetching over Heterogeneous Channels of Communication.  In preparation for submission to Journal of Parallel and Distributed Computing, Special Issue on Algorithms for Wireless and Ad-hoc Networks.
  • Paul F. Reynolds, Christopher Milner and Timothy Highley.  Personalized Learning.  Proceedings of Frontiers in Education 2004, Savannah, GA, October 2004.
  • Timothy Highley and Paul F. Reynolds. Marginal Cost-Benefit Analysis for Predictive File Prefetching. Proceedings of the 41st Annual ACM Southeast Conference (ACMSE 2003), Savannah, GA, March 2003.
  • Geoff Stoker, Brian S. White, Ellen Stackpole, Timothy Highley and Marty Humphrey. Toward Realizable Restricted Delegation in Computational Grids. International Conference on High Performance Computing and Networking Europe (HPCN Europe 2001), Amsterdam, Netherlands, June 2001.

Other Papers:

  • Timothy Highley, Paul F. Reynolds and Vivekanand Vellanki. Absolute Cost-Benefit Analysis for Predictive File Prefetching. University of Virginia, Department of Computer Science, Technical Report CS-2002-11, April 2002.
  • Timothy Highley, Paul Reynolds and Craig Williams. Testing the Functional Requirements of the Switch Interface Unit. University of Virginia, Department of Computer Science, Technical Report CS-2000-22, August 2000.
  • Timothy Highley, Michael Lack and Perry Myers. Aspect-Oriented Programming: A Critical Analysis of a New Programming Paradigm. University of Virginia, Department of Computer Science, Technical Report CS-99-29, May 1999.

 

References:

 

Paul F. Reynolds, Jr.

Professor of Computer Science

Department of Computer Science

School of Engineering, University of Virginia

151 Engineer’s Way, P.O. Box 400740

Charlottesville, VA 22904-4740

434-924-1039

Gabriel Robins

Professor of Computer Science
Department of Computer Science
School of Engineering, University of Virginia
151 Engineer’s Way, P.O. Box 400740
Charlottesville, VA 22904-4740
434-982-2207
 

John A. Stankovic

Professor of Computer Science

Department of Computer Science

School of Engineering, University of Virginia

151 Engineer’s Way, P.O. Box 400740

Charlottesville, VA 22904-4740

434-982-2275

 

David Brogan

Assistant Professor of Computer Science

Department of Computer Science

School of Engineering, University of Virginia

151 Engineer’s Way, P.O. Box 400740

Charlottesville, VA 22904-4740

434-982-2211

 

Kevin Skadron

Assistant Professor of Computer Science

Department of Computer Science

School of Engineering, University of Virginia

151 Engineer’s Way, P.O. Box 400740

Charlottesville, VA 22904-4740

434-982-2042