Fifth Annual Kelley Institute Lecture

Article published in the Michigan State Law Review

Interview with Carl Levin by Brien Williams

Biographical NoteCarl Milton Levin was born June 28, 1934, in Detroit, Michigan. He was graduated from Swarthmore College in 1956 and Harvard Law School in 1959. He practiced law in Detroit and was state assistant police officer and general counsel for the Michigan Civil Rights Commission from 1964-1967. He has been in the U.S. Senate as a Democrat representing Michigan since 1978 and has served on the Armed Services Committee, the Committee on Homeland Security and Government Affairs, the Committee on Intelligence, and the Committee on Small Business and Entrepreneurship. SummaryInterview includes discussion of: Levin’s interactions with Mitchell; comparison of Mitchell and Byrd as majority leaders; Mitchell’s traits as a leader; Mitchell’s public persona versus one-on-one; NAFTA; Mitchell on the Cold War; Tower Commission; how the Senate has changed during Levin’s career; changes in the Senate in 1994; and Edward “Ted” Kennedy’s legacy

Clustering driver’s destinations - using internal evaluation to adaptively set parameters

With advanced navigation systems becoming ubiquitous in modern cars, the availability of detailed GPS data opens up new research areas in the fields of pattern analysis and data mining. By capturing the end-of-trip GPS points of each trip made by a driver, that driver’s meaningful destinations could be identified. The knowledge of these destinations can be used for route prediction, which in turn can be used for optimizing the motor control to decrease emissions. It can also be used for developing functions for autonomous vehicles. In this thesis a way of extracting these meaningful destinations from GPS data using clustering algorithms has been developed and evaluated. The result is a clustering procedure consisting of 2 steps of clustering. First a pre-clustering to divide the data into subsets corresponding to smaller spatial areas. Then, a refining clustering step for which the parameter of the algorithm is adapted to each subset. Adaptively setting the parameter for each subset is done by testing a set of parameters and evaluating the results internally, with the Silhouette coefficient, and choosing the parameter giving the best evaluation score. The best performing configuration of our procedure, according to our external evaluation method, is in par with the performance of DBSCAN with a supervised choice of parameter setting. Further evaluation of data sets from different areas of the world are needed to draw strong conclusions of the developed procedures performance