Co-director of the Connecticut Cybersecurity Center, which conducts research on all aspects of cybersecurity, including the emerging fields of mobile technology security and web-based services and applications, in addition to longer-established concerns with hardware and software vulnerabilities, voting technology, and cyber industry partnerships
Areas of Expertise (3)
Voting Technology & Security
Brown University: Ph.D., Computer Science 1999
Brown University: M.Sc., Computer Science 1997
Universtaires Notre-Dame de la Paix: B.S., Computer Science
- Connecticut Academy of Science and Engineering
- Director, Synchrony Financial Center of Excellence in Cybersecurity
- Past-president, International Association for Constraint Programming
- Founding Member, Connecticut Voting Technology Research Center
Synchrony Financial Chair in Cybersecurity (professional)
Established by a generous donation from Synchrony Financial in 2016, this position is aimed at supporting a leader focused on the advancement of education and research in cybersecurity. Michel’s appointment was approved by the UConn Board of Trustees during their meeting on December 11, 2019.
Media Appearances (1)
Black Hats, Cyber Bots, Zombies, and You
Cybersecurity specialists, led by John Chandy, an electrical and computer engineering professor, and Laurent Michel, an associate professor of computer science and engineering, is working to protect our information. UConn’s Comcast Center of Excellence for Security Innovation is advancing research to strengthen the nation’s electronic information networks and training a new generation of hardware, software, and network security engineers to protect the integrity of everything from small consumer electronics to the complex computer systems running our major industrial, financial, and transportation systems.
Secured behind passcode-protected entry doors, the Comcast lab is embedded deep inside one of UConn’s main academic buildings. Getting there can be an adventure.
Short-term load forecasting at the distribution level predicts the load of substations, feeders, transformers, and possibly customers from half an hour to one week ahead. Effective forecasting is important for the planning and operation of distribution systems. The problem, however, is difficult in view of complicated load features, the large number of distribution-level nodes, and possible switching operations.
Robust search procedures are a central component in the design of black-box constraint-programming solvers. This paper proposes activity-based search which uses the activity of variables during propagation to guide the search. Activity-based search was compared experimentally to impact-based search and the wdeg heuristics but not to solution counting heuristics.
Following a line outage, the fast corrective operations of transmission line switching might be used to regain N-1 security of the system without generation re-dispatch or load shedding. The problem to find feasible switching operations can be formulated as a constraint satisfaction problem (CSP). Feasibility checking, however, is difficult since changes in load flows caused by line switching operations are discontinuous, and many contingency cases need to be examined.
In deregulated electricity markets, short-term load forecasting is important for reliable power system operation, and also significantly affects markets and their participants. Effective forecasting, however, is difficult in view of the complicated effects on load by a variety of factors. This paper presents a similar day-based wavelet neural network method to forecast tomorrow's load.
The ubiquity of combinatorial optimization problems in our society is illustrated by the novel application areas for optimization technology, which range from supply chain management to sports tournament scheduling. Over the last two decades, constraint programming has emerged as a fundamental methodology to solve a variety of combinatorial problems, and rich constraint programming languages have been developed for expressing and combining constraints and specifying search procedures at a high level of abstraction.