I am an assistant professor in Department of Industrial and Manufacturing Systems Engineering (IMSE) at the University of Michigan-Dearborn. Prior to joining UM-Dearborn, I was a research assistant professor and postdoctoral research scholar at Vanderbilt University. My research areas of interest are uncertainty quantification, Bayesian data analytics, big data analytics, machine learning, optimization under uncertainty, and applications of data analytics and machine learning in aerospace, mechanical and manufacturing systems, and material science. The goal of my research is to develop novel computational methods to design sustainable and reliable engineering systems by leveraging the rich information contained in the high-fidelity computational simulation models, experimental data, and big operational data and historical data.

Dr. Jin Lu is an Assistant Professor of Computer and Information Science at the University of Michigan, Dearborn.

His major research interests include machine learning, data mining, optimization, matrix analysis, biomedical informatics, and health informatics. Two main directions are being pursued:

(1) Large-scale machine learning problems with data heterogeneity. Data heterogeneity is common across many high-impact application domains, ranging from recommendation system to Computer Vision, Bioinformatics and Health-informatics. Such heterogeneity can be present in a variety of forms, including (a) sample heterogeneity, where multiple resources of data samples are available as side information; (b) task heterogeneity, where multiple related learning tasks can be jointly learned to improve the overall performance; (c) view heterogeneity, where complementary information is available from various sources. My research interests focus on building efficient machine learning methods from such data heterogeneity, aiming to improve the learning model by making the best use of all data resources.

(2) Machine learning methods with provable guarantees. Machine learning has been substantially developed and has demonstrated great success in various domains. Despite its practical success, many of the applications involve solving NP-hard problems based on heuristics. It is challenging to analyze whether a heuristic scheme has any theoretical guarantee. My research interest is to employ granular data structure, e.g. sample clusters or features describing an aspect of the sample, to design new theoretically-sound models and algorithms for machine learning problems.

Mingyan Liu, PhD, is Professor of Electrical Engineering and Computer Science, College of Engineering, at the University of Michigan, Ann Arbor.

Prof. Liu’s research interest lies in optimal resource allocation, sequential decision theory, online and machine learning, performance modeling, analysis, and design of large-scale, decentralized, stochastic and networked systems, using tools including stochastic control, optimization, game theory and mechanism design. Her most recent research activities involve sequential learning, modeling and mining of large scale Internet measurement data concerning cyber security, and incentive mechanisms for inter-dependent security games. Within this context, her research group is actively working on the following directions.

1. Cyber security incident forecast. The goal is to predict an organizationās likelihood of having a cyber security incident in the near future using a variety of externally collected Internet measurement data, some of which capture active maliciousness (e.g., spam and phishing/malware activities) while others capture more latent factors (e.g., misconfiguration and mismanagement). While machine learning techniques have been extensively used for detection in the cyber security literature, using them for prediction has rarely been done. This is the first study on the prediction of broad categories of security incidents on an organizational level. Our work to date shows that with the right choice of feature set, highly accurate predictions can be achieved with a forecasting window of 6-12 months. Given the increasing amount of high profile security incidents (Target, Home Depot, JP Morgan Chase, and Anthem, just to name a few) and the amount of social and economic cost they inflict, this work will have a major impact on cyber security risk management.

2. Detect propagation in temporal data and its application to identifying phishing activities. Phishing activities propagate from one network to another in a highly regular fashion, a phenomenon known as fast-flux, though how the destination networks are chosen by the malicious campaign remains unknown. An interesting challenge arises as to whether one can use community detection methods to automatically extract those networks involved in a single phishing campaign; the ability to do so would be critical to forensic analysis. While there have been many results on detecting communities defined as subsets of relatively strongly connected entities, the phishing activity exhibits a unique propagating property that is better captured using an epidemic model. By using a combination of epidemic modeling and regression we can identify this type of propagating community with reasonable accuracy; we are working on alternative methods as well.

3. Data-driven modeling of organizational and end-user security posture. We are working to build models that accurately capture the cyber security postures of end-users as well as organizations, using large quantities of Internet measurement data. One domain is on how software vendors disclose security vulnerabilities in their products, how they deploy software upgrades and patches, and in turn, how end users install these patches; all these elements combined lead to a better understanding of the overall state of vulnerability of a given machine and how that relates to user behaviors. Another domain concerns the interconnectedness of today’s Internet which implies that what we see from one network is inevitably related to others. We use this connection to gain better insight into the conditions of not just a single network viewed in isolation, but multiple networks viewed together.

Jeffrey C. Lagarias is theĀ Harold Mead Stark Collegiate Professor of Mathematics in the College of Literature, Science, and the Arts at the University of Michigan, Ann Arbor.

Prof. Lagarias’ research interests are diverse. His initial training was in analytic and algebraic number theory. After receiving his PhD in 1974, he worked at Bell Laboratories and AT &T Labs until 2003, on problems in many pure and applied fields. Besides number theory, Prof. Lagarias has made contributions in harmonic analysis (wavelets and fractals), mathematical optimization (interior point methods), discrete geometry (tilings and quasicrystals), ergodic theory, low-dimensional topology (complexity of unknotting), and theoretical computer science.

At Michigan Prof. Lagarias has been active in the number theory group over the last few years, with additional work in other fields. His last 25 postings on the arXiv were in: Number Theory (16), Dynamical Systems (3), Classical Analysis and ODE?s (3), Metric Geometry (1), Optimization and Control (1), Spectral Theory (1). His doctoral students typically work on their own topics. Some have worked in topics in number theory: integer factorial ratios, character sum estimates, Diophantine equations with two separated variables; Others have worked in topics in discrete geometry: packings of regular tetrahedra, rigidity of circle configurations.