Jeffrey S. Vitter | |
---|---|
17th Chancellor of the University of Mississippi | |
In office January 1, 2016 –January 3, 2019 | |
Preceded by | Daniel Jones |
Succeeded by | Glenn Boyce |
Provost &Executive Vice Chancellor of the University of Kansas | |
In office July 1,2010 –December 31,2015 | |
Preceded by | Richard W. Lariviere |
Succeeded by | Neeli Bendapudi |
Personal details | |
Born | 1955 (age 68–69) New Orleans,Louisiana,US |
Spouse | Sharon |
Children | 3 |
Residence | New Orleans,Louisiana |
Education | University of Notre Dame (BS) Duke University (MBA) Stanford University (PhD) |
Profession | Educator,computer scientist,consultant,genealogist |
Website | csci.cs.olemiss.edu/faculty/vitter/ |
Jeffrey Scott Vitter is a U.S. computer scientist and academic administrator. Born in 1955 in New Orleans,Vitter has served in several senior higher education administration posts. He is a former chancellor of the University of Mississippi (Ole Miss). [1] He assumed the chancellor position on January 1,2016. His formal investiture to the chancellorship took place on November 10,2016,at the University of Mississippi's Oxford Campus. [2]
Vitter was born and raised in New Orleans,Louisiana. He earned a Bachelor of Science in mathematics with highest honors from the University of Notre Dame in 1977,a Ph.D. in computer science from Stanford University under the supervision of Donald Knuth in 1980 and a master of business administration from Duke University in 2002.
This section contains content that is written like an advertisement .(December 2023) |
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.
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.
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]
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 and brother-in-law of United States District Court judge Wendy Vitter. He and Sharon established the Vitter-Weaver family genealogy site at Vitter.org. [25]
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.
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.
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.
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.
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.He is of Irish descent.
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.
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.