Jeffrey Vitter

Last updated

Jeffrey S. Vitter
Jeffrey S. Vitter (cropped).jpg
17th Chancellor of the University of Mississippi
In office
January 1, 2016 –January 3, 2019

From 1980 to 1992, Vitter progressed through the faculty ranks in the Department of Computer Science at Brown University in Providence, Rhode Island. He was awarded tenure in 1985 at the age of 29.

At Duke University in Durham, North Carolina from 1993 to 2002, Vitter held a distinguished professorship as the Gilbert, Louis, and Edward Lehrman Professor. He chaired the Department of Computer Science for eight and a half years, increased external research funding to 250%, and led the department to a top-20 national ranking.

From 2002 to 2008, Vitter was the Frederick Hovde Dean of the College of Science at Purdue University in West Lafayette, Indiana, where he led the development of two strategic plans, establishing a dual focus of excellence in core departments and in multidisciplinary collaborations. He oversaw net growth by roughly 60 faculty members and launched the collaborative design of an innovative outcomes-based college curriculum.

Vitter served at Texas A&M University in College Station, Texas as provost and executive vice president for academics from 2008 to 2009, leading the 48,000-student university in the development of the institution's academic master plan and launching initiatives advancing faculty start-up allocations, multidisciplinary priorities and diversity. He also oversaw A&M's campus in Doha, Qatar.

From 2010 to 2015, Vitter was provost and executive vice chancellor and Roy A. Roberts Distinguished Professor at the University of Kansas in Lawrence, Kansas. As provost, Vitter was the chief academic and operations officer for the Lawrence and Edwards campuses. He co-chaired the development of the KU strategic plan Bold Aspirations [3] and oversaw the creation of the first-ever university-wide KU Core curriculum, expansion of the Schools of Engineering and Business, boosting multidisciplinary research and funding around four strategic initiatives, major growth of technology commercialization and corporate partnerships, and administrative reorganization and efficiency.

Vitter spent sabbatical leaves at the Mathematical Sciences Research Institute in Berkeley, CA; INRIA in Rocquencourt, France; Ecole Normale Supérieure in Paris; Bell Laboratories in Murray Hill, New Jersey; Aarhus University in Aarhus, Denmark, and INRIA in Sophia Antipolis, France.

On October 29, 2015, Vitter was unanimously named as the 17th chancellor of the University of Mississippi by the Mississippi Board of Trustees of State Institutions of Higher Learning (IHL). He began duties as chancellor and Distinguished Professor of Computer & Information Science on January 1, 2016.

He introduced a strategic plan named Flagship Forward, [4] with initiatives including a $1 billion building program, multidisciplinary research networks of faculty called Flagship Constellations, annual Technology Summits, major community partnerships through the M Partner program, establishment of the state's first Department of Biomedical Engineering, and extended capacity and reach of the University of Mississippi Medical Center. The university began to look at Confederate symbols on campus [5] and established an Office of Diversity and Community Engagement. He unified fundraising across the campuses and led the university to its strongest three-year period of fundraising. In December 2018, the university's status as a Carnegie R1 research university, initially attained in January 2016, was reaffirmed.

In November 2018, Vitter announced that he would step down as chancellor to become a regular faculty member on January 4, 2019. [6] Since July 2020 he is Distinguished Professor Emeritus and spends his time on consulting, working with a startup, and serving as adjunct professor at Tulane University.

Academic interests

Vitter is a computer scientist with over 350 books, journals, and conference publications, primarily on the design and mathematical analysis of algorithms dealing with big data and data science. His Google Scholar h-index is in the 70s, and he is an ISI highly cited researcher. He helped establish the field of I/O algorithms (a.k.a. "external memory algorithms") as a rigorous area of active investigation. [7] He has made fundamental contributions in databases; [8] compressed data structures and indexing; [9] [10] [11] [12] data compression, including adaptive Huffman coding, [13] arithmetic coding, [14] image compression, [15] and video compression; [16] hashing and search data structures; [17] randomized algorithms; [18] sampling and random variate generation; [19] [20] [21] prediction and machine learning; [22] [23] and average-case complexity. [24]

Personal

Vitter and his wife Sharon Weaver Vitter have three children: Jillian, J. Scott Jr. and Audrey. He is a brother of former U.S. Senator David Vitter of Louisiana. He and Sharon established the Vitter-Weaver family genealogy site at Vitter.org. [25]

Related Research Articles

Lossless compression is a class of data compression that allows the original data to be perfectly reconstructed from the compressed data with no loss of information. Lossless compression is possible because most real-world data exhibits statistical redundancy. By contrast, lossy compression permits reconstruction only of an approximation of the original data, though usually with greatly improved compression rates.

<span class="mw-page-title-main">Fractal compression</span> Compression method for digital images

Fractal compression is a lossy compression method for digital images, based on fractals. The method is best suited for textures and natural images, relying on the fact that parts of an image often resemble other parts of the same image. Fractal algorithms convert these parts into mathematical data called "fractal codes" which are used to recreate the encoded image.

Theoretical computer science is a subfield of computer science and mathematics that focuses on the abstract and mathematical foundations of computation, such as the theory of computation, formal language theory, the lambda calculus and type theory.

<span class="mw-page-title-main">Suffix tree</span> Tree containing all suffixes of a given text

In computer science, a suffix tree is a compressed trie containing all the suffixes of the given text as their keys and positions in the text as their values. Suffix trees allow particularly fast implementations of many important string operations.

A bitmap index is a special kind of database index that uses bitmaps.

<span class="mw-page-title-main">David Eppstein</span> American computer scientist and mathematician

David Arthur Eppstein is an American computer scientist and mathematician. He is a distinguished professor of computer science at the University of California, Irvine. He is known for his work in computational geometry, graph algorithms, and recreational mathematics. In 2011, he was named an ACM Fellow.

Paul Alexander Desmond de Maine was a leading figure in the early development of computer-based automatic indexing and information retrieval and one of the founders of academic computer science in the 1960s.

Nearest neighbor search (NNS), as a form of proximity search, is the optimization problem of finding the point in a given set that is closest to a given point. Closeness is typically expressed in terms of a dissimilarity function: the less similar the objects, the larger the function values.

John H. Reif is an American academic, and Professor of Computer Science at Duke University, who has made contributions to large number of fields in computer science: ranging from algorithms and computational complexity theory to robotics. He has also published in many other scientific fields including chemistry, optics, and mathematics (in particular graph theory and game theory.

Richard Jay Lipton is an American computer scientist who is Associate Dean of Research, Professor, and the Frederick G. Storey Chair in Computing in the College of Computing at the Georgia Institute of Technology. He has worked in computer science theory, cryptography, and DNA computing.

<span class="mw-page-title-main">Fingerprint (computing)</span> Digital identifier derived from the data by an algorithm

In computer science, a fingerprinting algorithm is a procedure that maps an arbitrarily large data item to a much shorter bit string, its fingerprint, that uniquely identifies the original data for all practical purposes just as human fingerprints uniquely identify people for practical purposes. This fingerprint may be used for data deduplication purposes. This is also referred to as file fingerprinting, data fingerprinting, or structured data fingerprinting.

Michael Jay Franklin is an American software entrepreneur and computer scientist specializing in distributed and streaming database technology. He is Liew Family Chair of Computer Science and chairman for the Department of Computer Science at the University of Chicago.

The term compressed data structure arises in the computer science subfields of algorithms, data structures, and theoretical computer science. It refers to a data structure whose operations are roughly as fast as those of a conventional data structure for the problem, but whose size can be substantially smaller. The size of the compressed data structure is typically highly dependent upon the information entropy of the data being represented.

In computer science, a compressed suffix array is a compressed data structure for pattern matching. Compressed suffix arrays are a general class of data structure that improve on the suffix array. These data structures enable quick search for an arbitrary string with a comparatively small index.

Patrick Eugene O'Neil was an American computer scientist, an expert on databases, and a professor of computer science at the University of Massachusetts Boston.

<span class="mw-page-title-main">Ian Witten</span> English computer scientist in New Zealand (born 1947)

Ian Hugh Witten was a computer scientist at the University of Waikato, New Zealand. He was a Chartered Engineer with the Institute of Electrical Engineers.

<span class="mw-page-title-main">Michael J. Carey (computer scientist)</span> American computer scientist

Michael James Carey is an American computer scientist. He is currently a Distinguished Professor (Emeritus) of Computer Science in the Donald Bren School at the University of California, Irvine and a Consulting Architect at Couchbase, Inc..

Zehra Meral Özsoyoglu is a Turkish-American computer scientist specializing in databases, including research on query languages, database model, and indexes, and applications of databases in science, bioinformatics, and medical informatics. She is the Andrew R. Jennings Professor Emeritus of Computer Science at Case Western Reserve University.

Gonzalo Navarro Badino is a full professor of computer science at the University of Chile and ACM Distinguished Member, whose interests include algorithms and data structures, data compression and text searching. He also participates in the Center for Biotechnology and Bioengineering and the Millennium Institute for Foundational Research on Data .. He obtained his PhD at the University of Chile in 1998 under the supervision of Ricardo Baeza-Yates with the thesis Approximate Text Searching, then worked as a post-doctoral researcher with Esko Ukkonen and Maxime Crochemore.

References

  1. ↑ "Jeffrey Vitter Named UM Chancellor". News.OleMiss.edu. October 29, 2015. Retrieved November 14, 2015.
  2. ↑ "Investiture of Chancellor Jeffrey S. Vitter".
  3. ↑ Bold Aspirations: The Strategic Plan for the University of Kansas, 2012–2017, http://www.provost.ku.edu/planning/
  4. ↑ Flagship Forward: The University of Mississippi Strategic Plan, http://flagshipforward.olemiss.edu
  5. ↑ Ryback, Timothy (September 19, 2017). "What Ole Miss Can Teach Universities About Grappling With Their Pasts". The Atlantic .
  6. ↑ IHL Press Release (November 9, 2018). "IHL: Chancellor Vitter Announces Plan to Return to Faculty; Board Thanks Chancellor for His Service".
  7. ↑ J. S. Vitter, Algorithms and Data Structures for External Memory, Series on Foundations and Trends in Theoretical Computer Science, now Publishers, Hanover, MA, 2008, ISBN   978-1-60198-106-6.
  8. ↑ J. S. Vitter and M. Wang, Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets, Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data (SIGMOD), June 1999, 193-204. Selected for the 2009 SIGMOD Test of Time Award.
  9. ↑ R. Grossi and J. S. Vitter, Compressed Suffix Arrays and Suffix Trees, with Applications to Text Indexing and String Matching, SIAM Journal on Computing, 35(2), 2005, 378-407; extended abstract in STOC 2000, 397-406.
  10. ↑ W.-K. Hon, R. Shah, and J. S. Vitter, Space-Efficient Frameworks for Top-k String Retrieval, Journal of the ACM, 35(2), April 2014, 9.1-9.36; extended abstract in FOCS 2009, 713-722.
  11. ↑ H. Huo, C. Hong, and J. S. Vitter, Practical High-order Entropy-compressed Text Indexing Schemes with Applications to Self-indexing, IEEE Transactions on Knowledge and Data Engineering, 2021; source code in Code Ocean.
  12. ↑ H. Huo, P. Liu, C. Wang, H. Jiang and J. S. Vitter, CIndex: Compressed Indexes for Fast Retrieval of FASTQ Files, Bioinformatics, September 15, 2021, 9 pages.
  13. ↑ J. S. Vitter, Design and Analysis of Dynamic Huffman Codes, Journal of the ACM, 34(4), October 1987, 825-845; extended abstract in FOCS 1985, 293-302.
  14. ↑ P. G. Howard and J. S. Vitter, Arithmetic Coding for Data Compression, Proceedings of the IEEE, 82(6), June 1994, 857-865.
  15. ↑ P. G. Howard and J. S. Vitter, Fast and Efficient Lossless Image Compression, IEEE Data Compression Conference (DCC), April 1993, 351-360.
  16. ↑ D. T. Hoang and J. S. Vitter, Efficient Algorithms for MPEG Video Compression, Wiley Series in Telecommunications and Signal Processing, John Wiley & Sons, New York, 2002, ISBN   0-471-37942-5.
  17. ↑ J. S. Vitter and W.-C. Chen, Design and Analysis of Coalesced Hashing, Oxford University Press, New York, 1987, ISBN   0-19-504182-8.
  18. ↑ J.-H. Lin and J. S. Vitter, Epsilon-Approximations with Small Packing Constraint Violation, ACM Symposium on Theory of Computing (STOC), May 1992, 771-782.
  19. ↑ J. S. Vitter, Random Sampling with a Reservoir, ACM Transactions on Mathematical Software, 11(1), March 1985, 37-57.
  20. ↑ J. S. Vitter, An Efficient Algorithm for Sequential Random Sampling, ACM Transactions on Mathematical Software, 13(1), March 1987, 58-67.
  21. ↑ Y. Matias, J. S. Vitter, and W.-C. Ni, Dynamic Generation of Discrete Random Variates, Theory of Computing Systems, 36(4), 2003, 329-358.
  22. ↑ J. S. Vitter and P. Krishnan, Optimal Prefetching via Data Compression, Journal of the ACM, 43(5), September 1996, 771-793.
  23. ↑ P. Krishnan and J. S. Vitter, Optimal Prediction for Prefetching in the Worst Case, SIAM Journal on Computing, 27(6), December 1998, 1617-1636.
  24. ↑ J. S. Vitter and P. Flajolet, Average-case Analysis of Algorithms and Data Structures, Chapter 9 in Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, edited by Jan van Leeuwen, Elsevier and MIT Press, 1990, 431-524.
  25. ↑ "Welcome to Vitter.org". Vitter.org.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.