NME 130

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

Participants:

Discussion sessions

Date	Topics	Discussion leaders	Unavailable
15 May (Fri) @ 3 pm, 110 Steele	Optimization Linear programming/duality Optimization and lower bounds, with applications in control Computational complexity? Convex analysis	John, Ben	Nader, Michelle, Tracy, Pablo, Ufuk
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, Javad	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, Ufuk, Nader
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
19 Jun (Fri) @ 11 am	Graphical models	Andreas	John (phone?)
24 Jun (Wed) @ 4 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
26 Jun (Fri) @ 11 am	Course planning	Richard

2009-10 course plan

Track	Fall	Winter	Spring
Stochastic systems	ACM/EE 116 (Owhadi) Introduction to Stochastic Processes and Modeling	ACM 216 (Owhadi?) Markov Chains, Discrete Stochastic Processes and Applications	NME 130 Discrete systems Graphs and optimization (shortest distance, max cut, etc) Temporal logic, automata, SAT Algorithm complexity (build on CS/EE/Ma 129) Dynamics and stability Nonlinear discrete time systems, hybrid systems Stability and stability certificates (Lyapunov, SOS) Feedback systems, small gain theorems Uncertainty and robustness Representation of uncertainty Operator bounds; links to small gain Robust performance: discrete time, NL? Need to say all of this in a non-control specific way Fundamental limits: Bode, Shannon, Bode/Shannon Case studies Internet: layering as optimization One more (not the cell)
Optimization and algorithms	Note: ACM 104/CDS 201 is a possibility for students who need more linear algebra and applied analysis Perhaps rename this row "Linear algebra and optimization"	ACM 113 (Tropp?) Convex analysis Linear programming/duality
Information systems	CS/EE/Ma 129a (Winfree) Information and complexity Information theory and coding Finite state automata, Turing machines, computability Data compression Note: EE 126 is an alternative to this course for people who have already seen automata, computability, etc	CS/EE/Ma 129b (Winfree) Information and complexity Channel coding, capacity and rate theorem Time complexity of algorithms; P vs NP Formal logic and provability
Data-driven modeling	CS/CNS/EE 156 (Abu-Mostafa) Learning systems CS 155 (Krause) Graphical models Will eventually move to second term
ACM	ACM 104/CDS 201 (Beck) - Linear Algebra and Applied Operator Theory ACM 118 (Tropp) - Methods in Applied Statistics and Data Analysis	ACM 105 (???) - Applied Real and Functional Analysis	ACM 217 (???) - Advanced Topics in Stochastic Analysis
CS	CS/EE 143 - Communication Networks (Low)	CS/EE 146 - Advanced Networking (Low) CS/EE 144 -- The ideas behind the web (Wierman) the structure of the web/internet/social network web search, sponsored search, data center design spam & bot protection, network economics, and content aggregation	CS/EE 145 - Projects in Networking CS/EE 147 -- Network performance analysis (Wierman) some stochastic processes & Markov chains queueing, heavy-tailed distributions, large deviations, and scheduling
CDS	CDS 210a - Control theory (MacMynowski) State space models, Lyapunov stability Reachability, observability, state space design Frequency domain techniques Fundamental limits and robustness	CDS 110b - Optimization-based control (MacMynowski) Optimal control theory Trajectory generation, receding horizon control Kalman filtering CDS 212- Modern control theory (Doyle) Robust control of nonlinear systems Fundamental limits of performance	CDS 104 - Introduction to Dynamical Systems CDS 142 (Beck) - Stochastic System Analysis and Bayesian Updating
EE	EE 126a - Information Theory (Effros)	EE 126b - Information Theory (Effros) EE 163a - Communications Theory (Quirk?)	EE 163b - Communications Theory (Quirk?) EE 164 - Stochastic and Adaptive Signal Processing