Joy D. Lind, Ph.D.
Vice President for Academic Affairs
Dr. Joy Lind graduated from the University of Kentucky in 1998 with a Ph.D. in Mathematics and M.S. in Operations Research. She is currently an Assistant Professor of Mathematics at the University of Sioux Falls in Sioux Falls, S.D. Prior to joining the USF faculty in 2008, Dr. Lind was employed at the companies Avaya and Level 3 Communications as an Operations Research Analyst, Senior IT Project Manager, Process Manager, Business Partner, and Service Level Manager. Dr. Lind is certified as a Project Management Professional (P.M.P.). In June 2011, she was awarded a grant from the National Science Foundation, for the project entitled STEM Real World Applications of Mathematics. The partner schools on the grant are the University of Sioux Falls, Rochester Institute of Technology, University of South Carolina, University of California - San Diego, Brigham Young University, and State University of New York at Brockport. Dr. Lind has presented at various regional and national mathematics conferences and is published in several well-respected mathematical journals including Discrete Applied Mathematics and Mathematical Programming.
- Ph.D., Mathematics, University of Kentucky, 1998
- M.S., Operations Research, University of Kentucky, 1995
- B.A., Mathematics, Transylvania University, 1993
- MAT310 - Calculus III
- MAT304 - Linear Algebra
- MAT204 - Calculus I
- MAT201 - Calculus for Applications
- MAT221 -
- MAT151 -
- MAT112 -
- COM310 - Information Systems Analysis
- COM104 - Computer Solutions
- BUS335 - Operations Management
Mathematical Association of America
From the MAA Mission Statement: The Mathematical Association of America is the largest professional society that focuses on mathematics accessible at the undergraduate level. Our members include university, college, and high school teachers; graduate and undergraduate students; pure and applied mathematicians; computer scientists; statisticians; and many others in academia, government, business, and industry. We welcome all who are interested in the mathematical sciences.
The mission of the MAA is "to advance the mathematical sciences, especially at the collegiate level."
Research Assistant, Department of Mathematics, University of Kentucky, 1996-97
- Developed a branch-and-bound algorithm for solving the Constrained Maximum-Entropy Sampling Problem, then implemented the algorithm on the University of Kentucky 32-processor Exemplar Supercomputer.
- Developed and proposed a policy and implementation for the improved performance of the University of Kentucky bus system. The University implemented this, and has had very good results.
Scholarships and Creative Work
- Kurt M. Anstreicher, Marcia Fampa, Jon Lee and Joy Williams. Maximum-entropy remote sampling. Discrete Applied Mathematics, 108:211-226, 2001.
- Kurt M. Anstreicher, Marcia Fampa, Jon Lee, and Joy Williams. Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems. Mathematical Programming, Series A, 85:221-240, 1999.
- Alan Hoffman, Jon Lee and Joy Williams. New upper bounds for maximum-entropy sampling. In: A.C. Atkinson, P. Hackl and W. G. Müller, editors, "MODA 6 - Advances in Model-Oriented Design and Analysis", Contributions to Statistics, Springer, Berlin, 143-153, 2001.
- Jon Lee and Joy Williams. A linear integer programming bound for maximum-entropy sampling. Mathematical Programming, Series B, 94:247-256, 2003.
- Jon Lee and Joy Williams. Generalized maximum-entropy sampling. University of Kentucky, Department of Mathematics, Technical report No. 99-10, July 1999.
- J. Lind and D. A. Narayan. Real world graph connectivity. Teaching Mathematics and its Applications (Oxford Journals); 28: 159-161, August 2009.
- J. Lind and D. A. Narayan. Maximum flow in fiber-optic networks. Bulletin of the Institute of Combinatorics and Its Applications, 60: 91-96, 2010.
- J. Lind, D.A. Narayan, and A. Lee. Optimally routing data in fiber-optic networks with existing flow. Bulletin of the Institute of Combinatorics and Its Applications, 63: 111-119, 2011.
- J. Lind and D. A. Narayan. Strategies for routing data in ring-connected networks. Bulletin of the Institute of Combinatorics and Its Applications, in press.
- J. Lind and D. A. Narayan. Spanning trees in hierarchical and fiber-optic networks. Bulletin of the Institute of Combinatorics and Its Applications, in press.
- J. Lind and D. A. Narayan. Page Ranking by Internet Search Engines. Bulletin of the Institute of Combinatorics and Its Applications, in press.
- J. Lind and D. A. Narayan, Optimal Matching of Approvers to Access Requests. Bulletin of the Institute of Combinatorics and Its Applications, in press.
- J. Lind and D. A. Narayan, Untangling the Tuition Exchange Program Network. Bulletin of the Institute of Combinatorics and Its Applications, in press.
- J. Lind and D. A. Narayan, Optimal Monitoring of Networks. Congressus Numerantium, in press.
- B. Ek, C. VerSchneider, J. Lind, and D.A. Narayan, Real World Graph Efficiency. Bulletin of the Institute of Combinatorics and Its Applications, in press.
- Kurt M. Anstreicher, Marcia Fampa, Jon Lee, and Joy Williams. Continuous relaxations for constrained maximum-entropy sampling. In: "Integer Programming and Combinatorial Optimization (Vancouver, B.C., 1996)", volume 1084 of Lecture Notes in Computer Science, pages 234-248. Springer, Berlin, 1996.
Faculty Sponsor: Pazaz Worship Dance Team
Serve as faculty sponsor for USF's Worship Dance Team, Pazaz.