NME 130: Difference between revisions

From Murray Wiki
Jump to navigationJump to search
Line 18: Line 18:
* Computational complexity?
* Computational complexity?
* Convex analysis
* Convex analysis
| John, ...
| John, Ben?
| Nader, Michelle, Tracy, Pablo
| Nader, Michelle, Tracy, Pablo
|-
|-

Revision as of 04:28, 30 April 2009

NME 130 is a new class on "information systems" that we are planning.

Participants:

Discussion sessions

Date Topics Discussion leaders Unavailable
12 May (Tue) @ 3 pm Optimization
  • Linear programming/duality
  • Optimization and lower bounds, with applications in control
  • Computational complexity?
  • Convex analysis
John, Ben? Nader, Michelle, Tracy, Pablo
20 May (Wed) @ 12 pm Distributed/networked systems
  • Graph theory
  • Distributed optimization and computation (large scale)
  • Network algorithms (optimization; exploit networked structure)
  • Graphical models
Steven, ... Richard (phone), Nader
28 May (Thu) @ 12 pm Information theory
  • Method of types, large numbers, AEP
  • Source/channel coding theorem
  • Coding/network coding
Tracey, Michelle, ... Richard
3 Jun (Wed) @ 12 pm Uncertainty
  • Robustness and uncertainty (controls-ish)
  • Bayesian theory, belief propogation
  • Hypothesis testing, inference, decision making
Ufuk, Nader Richard
16 Jun (Tue) @ 3 pm Dynamical systems
  • Stability (including Lyapunov and Nyquist)
  • Specifications (control versus CS)
  • Equivalence and abstraction (simulation, bisimulation, model reduction?)
  • Hybrid systems, automata theory
  • Time delay, time-varying systems
Nader, Andy Michelle, John, Tracey
23 Jun (Tue) @ 3 pm Synthesis theory
  • Synthesis theory and hardbounds (Bode, Shannon, Carnot, Turing)
  • Bayesian theory, belief propogation
  • Hypothesis testing, inference, decision making
  • Computational complexity
  • Estimation and detection
  • Coding/network coding
TBD Richard, Michelle, Tracey