Caltech V

	Connections II:
	Fundamentals of Network Science
	14-18 August 2006 Pasadena, CA

Agenda

Register

Participants

Travel Info

CDS Home

The workshop will take place in Dabney Hall (campus map).

Invited speakers (confirmed)

• Samuel Buss, UC, San Diego
• Mung Chiang, Princeton
• Ali Jadbabaie, Penn
• Neil Gershenfeld, MIT
• Keith Glover, Cambridge
• Bill Helton, UC, San Diego
• Mustafa Khammash, UC, Santa Barbara
• Sanjay Lall, Stanford
• Nuno Martins, U. Maryland
• Antonis Papachristodoulou, Oxford
• Pablo Parrilo, MIT
• Mihai Putinar, UC, Santa Barbara
• Lawrence Saul, UC, San Diego
• Christina Smolke, Caltech
• Lin Xiao, Microsoft Research

Caltech organizers and speakers

• Jean-Charles Delvenne, John Doyle, Maryam Fazel, Richard Murray, Ben Recht, Henrik Sandberg

Agenda

Mon(Tutorial), Tue-Thur (workshop), Fri(Student talks)

Mon-Thur (workshop) - Daily schedule 08:00   Breakfast (buffet) 08:30   Early morning talks 10:15   Morning break 10:45   Late morning talks 12:15   Lunch (buffet) 13:00   Early afternoon talks 14:30   Afternoon break 14:45   Late afternoon talks 16:00   Afternoon break until dinner 18:00   Dinner (buffet, Tue-Wed only) 18:30   Dinner talk (Tue-Wed only) 19:30   Dessert, wine, and...

Monday - Tutorial speaker list Schedule TBD: Pablo Parrilo, John Doyle, Maryam Fazel, Xin Liu, Nuno Martins, Ben Recht, Lijun Chen Introduction, John Doyle The capacity of wireless networks, Lijun Chen Basic results and definitions of information theory, Nuno Martins Notions of Energy and Entropy, Jean-Charles Delvenne and Henrik Sandberg Complexity and fragility in the lattice percolation problem, Maryam Fazel

Tuesday - Hard Limits 08:30   John Doyle, Workshop Overview   Henrik Sandberg/Jean-Charles Delvenne: Control, information, and statistical mechanics   Nuno Martins: Communications and control   Pablo Parrilo: Intro to computational complexity 13:00   Pablo Parrilo: Computational complexity and formal methods   Mustafa Khammash: Complexity of the chemical master equation   Maryam Fazel, Complexity and Fragility in Linear Programming   Dennice Gayme, Complexity implies fragility   Pablo Parrilo/John Doyle: Recap and wrapup 18:30   Christina Smolke: Regulatory mechanisms in natural and synthetic biology

Wednesday - Short Proofs 08:30   Pablo Parrilo, Day Overview   Mihai Putinar: Polynomial proofs and operator theory   Samuel Buss: Proof systems   Bill Helton: Scale-independent proofs in systems and control 13:00   Carla Gomes: SAT Solvers and state of the art (zipped movies)]   John Doyle: Layering architectures, examples   Mung Chiang: Layering, optimization, and duality   Parrilo: Recap and wrapup 18:30   Neil Gershenfeld: Math as computer programming

Thursday - Small Models 08:30   Ali J/ Sanj L/Antonis P: Networks and decentralized control   Ali Jadbabaie, Flocking and consensus algorithms   Sanjay Lall, Decentralized control 13:00   Lawrence Saul, Spectral methods in machine learning   Ben Recht, Diffeomorphic Warping   Lin Xiao, A Duality View of Spectral Methods for Dimensionality Reduction   Parrilo: Recap and wrapup 16:00   Adjourn, dinner on own

Friday - Student talks 09:00   Breakfast (buffet) 09:30   Morning talks and break Tamas Keviczky, Distributed LQR and Predictive Control 12:00   Lunch (buffet) 13:00   Afternoon talks and break 16:00   End

Additional Information

The main workshop will be held on 15-17 August 2006 in Pasadena, CA, with additional sessions on Monday and Friday for interested participants:

• Monday: tutorial sessions
• Tuesday: Hard Limits
• Wednesday: Short Proofs
• Thursday: Small Models
• Friday: student presentations
  
• Register to attend
  
• Participants (restricted page)

The Connections workshop is sponsored by Caltech and the Air Force Office of Scientific Research.