Information and Decision Systems: Difference between revisions

From Murray Wiki
Jump to navigationJump to search
No edit summary
 
Line 13: Line 13:
'''IDS 110'''
'''IDS 110'''
|  
|  
* Note: ACM 104/CDS 201 is a possibility for students who need more linear algebra and applied analysis
===== ACM 104/CDS 201 (Beck, Murray, Owhadi)
* Perhaps rename this row "Linear algebra and optimization"
* Perhaps rename this row "Linear algebra and optimization"
* [http://www.eecs.mit.edu/cgi-bin/catalog.cgi?page=2008/data/11.dat Similar course at MIT]
* [http://www.eecs.mit.edu/cgi-bin/catalog.cgi?page=2008/data/11.dat Similar course at MIT]
Line 20: Line 20:
* Convex analysis
* Convex analysis
* Linear programming/duality
* Linear programming/duality
* Note: create CDS 203 as alternative to CDS 202?
| rowspan=4 valign=middle |
| rowspan=4 valign=middle |
 
==== Decision making ====
===== IDS 150 (Doyle, Low, Murray) =====
===== IDS 150 (Doyle, Low, Murray) =====
* 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
* Dynamics and stability
** Nonlinear discrete time systems, hybrid systems
** Nonlinear discrete time systems, hybrid systems
Line 42: Line 37:
** One more (''not'' the cell)
** One more (''not'' the cell)
|- valign=top
|- valign=top
|  
|
 
==== [[Stochastic systems courses|Stochastic systems]] ====
==== [[Stochastic systems courses|Stochastic systems]] ====
'''IDS 120'''
'''IDS 120'''

Revision as of 07:06, 4 February 2010

Core Courses

Track Fall Winter Spring

Optimization and linear algebra

IDS 110

===== ACM 104/CDS 201 (Beck, Murray, Owhadi)

ACM 113/CDS 203 (Doyle, Owhadi, Tropp)
  • Convex analysis
  • Linear programming/duality

Decision making

IDS 150 (Doyle, Low, Murray)
  • 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)

Stochastic systems

IDS 120

ACM/EE 116 (Hassibi, Owhadi, Tropp)

Introduction to Stochastic Processes and Modeling

ACM 216 (Owhadi, Tropp)

Markov Chains, Discrete Stochastic Processes and Applications

Information systems

IDS 130

CS/EE/Ma 129a (Abu-Mostafa, 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 (Abu-Mostafa, Winfree)

Information and complexity

  • Channel coding, capacity and rate theorem
  • Time complexity of algorithms; P vs NP
  • Formal logic and provability

Data-driven modeling

IDS 140

CS/CNS/EE 156 (Abu-Mostafa, Krause)
  • Learning systems
CS 155 (Krause)
  • Graphical models
  • Will eventually move to second term