Timothy Highley, Jr., Ph.D.

Timothy L. Highley, Jr. (T.J.) is an Associate Professor in the Department of Mathematics and Computer Science.  He joined the La Salle University faculty as an Assistant Professor in 2005, upon completion of his graduate studies at the University of Virginia.  Some of his primary teaching duties include courses in the programming sequence, discrete mathematics, and upper-level computer science courses such as Language Theory and Design, and Operating Systems.

He is the adviser for La Salle’s student chapter of the Association for Computing Machinery and La Salle’s computer programming team, and he regularly supervises student research projects. Dr. Highley has published papers in the areas of file prefetching, computer science education, case-based reasoning, prediction of sports statistics, and drafting strategies.

Areas of Expertise

• Computer science education
• Simulation technology
  • Multi-resolution modeling
  • Simulation adaptation
• Economic simulation
• Sports drafting
  • Performance prediction
  • Value estimation based on expected performance
  • Drafting algorithms
• File prefetching
• Case-based reasoning
• Algorithms
  • Game theory
  • Graph theory

Education

Ph.D. in Computer Science, January 2005

University of Virginia  (Charlottesville, VA)

M.C.S., May 2000

University of Virginia  (Charlottesville, VA)

B.S., May 1998

University of Dayton  (Dayton, OH)

Research

Refereed Papers

Justin Bourgeois, Chris Grontkowski, and Timothy Highley. On Sports Drafts: Validation of a
Stochastic Ruler Approach to a Competitive Knapsack Problem. Proceedings of Pennsylvania
Computer and Information Science Educators (PACISE) Conference 2011, April 2011. (Student
paper)

Timothy Highley, Ross Gore, and Cameron Snapp. Granularity of Weighted Averages and Use of Rate Statistics in AggPro. Proceedings of Winter Simulation Conference 2010, December 2010.

Ross J. Gore, Cameron T. Snapp, and Timothy Highley. AggPro: The Aggregate Projection
System. Baseball Research Journal. Volume 38, Number 2, Fall 2009.

Michael Redmond and Timothy Highley. Empirical Analysis of Case-Editing Approaches for
Numeric Prediction. International Joint Conference on Computer, Information and Systems
Sciences, and Engineering (CISSE), subconference International Conference on Systems,
Computing Sciences and Software Engineering (SCSS). University of Bridgeport, CT, December
2009.

Timothy Highley and Anne Edlin. Discrete Mathematics Assessment Using Learning Objectives
Based on Bloom’s Taxonomy. Proceedings of Frontiers in Education 2009, San Antonio, TX,
October 2009.

Timothy Highley and Paul F. Reynolds. Prefetching over Heterogeneous Channels of
Communication. Proceedings of the Fourth IASTED International Conference on
Communications, Internet, and Information Technology (CIIT), St Thomas, U.S. Virgin Islands,
November 2006.

Paul F. Reynolds, Christopher Milner and Timothy Highley. Scalable 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 Computingand Networking Europe (HPCN Europe 2001), Amsterdam, Netherlands, June 2001.

Teaching

• Undergraduate courses taught:
  • CSC 151: Introduction to Computing: Packages
  • CSC 152: Introduction to Computing: Math/Science Applications
  • CSC 230: Programming Concepts and GUIs
  • CSC 280: Object Programming
  • CSC 290: Introduction to Data Structures and Algorithms
  • CSC 354: Data Structures
  • CSC 366: Language Theory and Design
  • CSC 370: Computer Simulation
  • CSC 457: Operating Systems
  • CSIT 420: Applied Operating Systems and Distributed Systems
  • MTH 160/260: Discrete Mathematics I
  • MTH 161/261: Discrete Mathematics II
• Graduate courses taught:
  • CIS 636: Advanced Computing with Java
  • CIS 672: Operating Systems and Architecture
  • CIS 676: Data Structures Using Java

Presentations

Dec 2010: “Granularity of Weighted Averages and Use of Rate Statistics in AggPro.”
Winter Simulation Conference 2010, Baltimore, MD.

Oct 2010: “Beam Search, Simulated Annealing, and Sports Drafts.” Presented with
undergraduate students Justin Bourgeois and Chris Grontkowski at the
Mathematics and Computer Science Symposium, La Salle University,
Philadelphia, PA.

Mar 2010: “What Role Does Land Play in Economic Justice?” La Salle University’s
Explorer Café, Philadelphia, PA.

Dec 2009: “Empirical Analysis of Case-Editing Approaches for Numeric Prediction.”
International Joint Conference on Computer, Information, and Systems
Sciences, and Engineering (CISSE 2009), University of Bridgeport, CT. (on-line
conference)

Oct 2009: “Discrete Mathematics Assessment Using Learning Objectives Based on
Bloom’s Taxonomy,” presented as a brief “Lightning Talk.” Consortium for
Computing Sciences in Colleges Eastern Conference 2009 (CCSCE 2009),
Villanova University, Villanova, PA.

Oct 2009: “Discrete Mathematics Assessment Using Learning Objectives Based on
Bloom’s Taxonomy.” Frontiers in Education (FIE 2009), San Antonio, TX.

Dec 2007: “Exploring Simulation Coercion.” Presented with senior math/computer
science major John Sehi at Mathematics and Computer Science Symposium,
La Salle University, Philadelphia, PA.

Nov 2006: “Prefetching over Heterogeneous Channels of Communication.” Fourth
IASTED International Conference on Communications, Internet, and
Information Technology (CIIT 2006), St. Thomas, VI.

Oct 2006: “Huffman Coding.” Mathematics and Computer Science Symposium, La Salle
University, Philadelphia, PA.

Mar 2003: “Marginal Cost-Benefit Analysis for Predictive File Prefetching.” ACM
Southeast Conference (ACMSE 2003), Savannah, GA.