https://murray.cds.caltech.edu/api.php?action=feedcontributions&user=Doyle&feedformat=atomMurray Wiki - User contributions [en]2022-08-20T06:10:14ZUser contributionsMediaWiki 1.37.2https://murray.cds.caltech.edu/index.php?title=Mike_Biercuk,_7_Oct_2019&diff=23007Mike Biercuk, 7 Oct 20192019-10-07T21:02:47Z<p>Doyle: /* Schedule */</p>
<hr />
<div>Mike Biercuk, a Professor of Quantum Physics and Quantum Technology at the University of Sydney, will visit Caltech on 7 Oct 2019 (Mon). If you would like to meet with him, please sign up for a time below.<br />
<br />
=== Schedule ===<br />
* 10 am: arrive, meet with Richard<br />
* 11 am: Seminar, 121 Annenberg<br />
* 12 pm: Lunch with faculty (Richard, John Doyle, TBD)<br />
* 1:30 pm: Oskar Painter (Watson 266)<br />
* 2:15 pm: John Doyle (Annenberg 210)<br />
* 3:00 pm: Mandy Huo<br />
* 3:45 pm: Evert van Nieuwenburg. 222 ANB (John's studio)<br />
* 4:30 pm: Reza Ahmadi<br />
* 5:15 pm: Wrap up with Richard<br />
<br />
=== Seminar ===<br />
<br />
Bringing Control Engineering to the Quantum Domain<br />
<br />
Michael J. Biercuk<br><br />
Professor of Quantum Physics and Quantum Technology<br><br />
University of Sydney<br />
<br />
Quantum technology, which harnesses quantum physics as a resource, is likely to be as transformational in the 21st century as harnessing electricity was in the 19th. Like past technological revolutions - from the advent of flight to autonomous vehicles - control engineering will play a central role in the development of this technology. In this talk we provide an overview of the role of control in the quantum domain. We focus on the application of quantum computing and identify the task of stabilizing hardware against decoherence (loss of "quantumness") as a high-impact area of interest for quantum control engineering. We frame the problem of stabilizing qubits for quantum computing as bilinear control, and introduce several complementary strategies for hardware stabilization. This presentation will focus primarily on open-loop control strategies and will introduce the mechanisms by which these strategies improve hardware performance with relevance to larger architectures. We will include experimental demonstrations using trapped atomic ions to validate these concepts as well as novel quantum-control-theoretic constructs called filter functions which describe the decoherence susceptibility of an arbitrary Unitary control operation on one or more qubits. This experimental work will be contextualized in a broader class of control strategies and how they integrate into the emerging software stack for quantum computing.</div>Doylehttps://murray.cds.caltech.edu/index.php?title=Mike_Biercuk,_7_Oct_2019&diff=22974Mike Biercuk, 7 Oct 20192019-10-02T14:45:13Z<p>Doyle: /* Schedule */</p>
<hr />
<div>Mike Biercuk, a Professor of Quantum Physics and Quantum Technology at the University of Sydney, will visit Caltech on 7 Oct 2019 (Mon). If you would like to meet with him, please sign up for a time below.<br />
<br />
=== Schedule ===<br />
* 10 am: arrive, meet with Richard<br />
* 11 am: Seminar, room TBD<br />
* 12 pm: Lunch with faculty (Richard, John Doyle, TBD)<br />
* 1:30 pm: Oskar Painter (Watson 266)<br />
* 2:15 pm: John Doyle (ANN 210)<br />
* 3:00 pm: open<br />
* 3:45 pm: open<br />
* 4:30 pm: open<br />
* 5:15 pm: Wrap up with Richard<br />
<br />
=== Seminar ===<br />
<br />
Bringing Control Engineering to the Quantum Domain<br />
<br />
Michael J. Biercuk<br><br />
Professor of Quantum Physics and Quantum Technology<br><br />
University of Sydney<br />
<br />
Quantum technology, which harnesses quantum physics as a resource, is likely to be as transformational in the 21st century as harnessing electricity was in the 19th. Like past technological revolutions - from the advent of flight to autonomous vehicles - control engineering will play a central role in the development of this technology. In this talk we provide an overview of the role of control in the quantum domain. We focus on the application of quantum computing and identify the task of stabilizing hardware against decoherence (loss of "quantumness") as a high-impact area of interest for quantum control engineering. We frame the problem of stabilizing qubits for quantum computing as bilinear control, and introduce several complementary strategies for hardware stabilization. This presentation will focus primarily on open-loop control strategies and will introduce the mechanisms by which these strategies improve hardware performance with relevance to larger architectures. We will include experimental demonstrations using trapped atomic ions to validate these concepts as well as novel quantum-control-theoretic constructs called filter functions which describe the decoherence susceptibility of an arbitrary Unitary control operation on one or more qubits. This experimental work will be contextualized in a broader class of control strategies and how they integrate into the emerging software stack for quantum computing.</div>Doylehttps://murray.cds.caltech.edu/index.php?title=Art_Krener,_Feb_2016&diff=19276Art Krener, Feb 20162016-02-12T17:46:24Z<p>Doyle: /* Schedule */</p>
<hr />
<div>Art Krener will be visiting Caltech on 18 Feb (Thu). If you would like to meet with him, sign up below.<br />
<br />
=== Schedule ===<br />
* ~10:15 - Richard Murray, 109 Steele Lab<br />
* 10:45 - set up for seminar<br />
* 11:00 - Seminar, 115 Gates-Thomas<br />
* 12:00 - Lunch with Richard, Doug<br />
* 1:30 - open<br />
* 2:15 - open<br />
* 3:00 - Doyle<br />
* 3:45 - open (if needed)<br />
* 4:30 - done for the day<br />
<br />
=== Abstract ===<br />
<br />
Adaptive Horizon Model Predictive Control<br />
<br />
Arthur J. Krener, Naval Postgraduate School<br><br />
18 Feb (Thu) - 11:00am PST, 115 Gates-Thomas<br />
<br />
Abstract: Adaptive Horizon Model Predictive Control (AHMPC) is a scheme for varying the horizon length of Model Predictive Control (MPC) as needed. Its goal is to achieve stabilization with horizons as small as possible so that MPC can be used on faster or more complicated dynamic processes. Beside the standard requirements of MPC including a terminal cost that is a control Lyapunov function, AHMPC requires a terminal feedback that turns the control Lyapunov function into a standard Lyapunov function in some domain around the operating point. But this domain need not be known explicitly. MPC does not compute off-line the optimal cost and the optimal feedback over a large domain instead it computes these quantities on-line when and where they are needed. AHMPC does not compute off-line the domain on which the terminal cost is a control Lyapunov function instead it computes on-line when a state is in this domain.</div>Doylehttps://murray.cds.caltech.edu/index.php?title=Niklas_Karlsson,_9_Feb_2016&diff=19257Niklas Karlsson, 9 Feb 20162016-02-04T04:59:42Z<p>Doyle: /* Schedule */</p>
<hr />
<div>Niklas Karlsson will be visiting Caltech on 9 Feb 2016. Please sign up below if you would like to meet with him, listing your name and office number.<br />
<br />
=== Schedule ===<br />
<br />
9 Feb 2016 (Tue)<br />
* 9:00 am: open<br />
* 9:30 am: open<br />
* 10:00 am: Yisong Yue, 303 Annenberg<br />
* 10:30 am: Adam W, 215 Annenberg<br />
* 11:00 am: Venkat Chandrasekaran, 300 Annenberg<br />
* 11:45 am: seminar setup<br />
* 12:00 pm: seminar, 105 ANB<br />
* 1 pm: lunch with Yisong (Chandler)<br />
* 1:45 pm: Stephan<br />
* 2:30 pm: Yanan Sui, 340 ANB<br />
* 3:15 pm: John Doyle, 210 ANB<br />
* 4:00 pm: open<br />
* 4:45 pm: open<br />
* 5:30 pm: depart from Ath for BUR (Caltech car)<br />
<br />
=== Seminar: 9 Feb (Tue), 12-1 pm, 105 ANB ===<br />
<br />
<br />
TITLE:<br />
Modeling and Control of Online Advertising<br />
<br />
ABSTRACT:<br />
Internet advertising is a huge and growing industry with many interesting and challenging engineering problems. This talk first reviews the evolution of optimization paradigms adopted for online advertising from 1998 to 2015. Thereafter we discuss methods for how to describe online advertising as a high-dimensional dynamical system, and how on top of this to apply conventional engineering principles for control and optimization. We show how this on-the-surface non-standard engineering problem on a proper abstraction level can be represented in terms that engineers are familiar with. In the process of developing a model that describes the dynamics, we highlight unique aspects of the system, making it challenging as well as inviting for further research. The challenges involve non-linearities, time-variability, randomness, uncertainties, latency, and coupling effects. We finally sketch on a solution for advertising campaign optimization, where the objective is to deliver an advertising budget smoothly throughout a campaign flight at the smallest possible cost to the advertiser.</div>Doylehttps://murray.cds.caltech.edu/index.php?title=Gupta_Visit&diff=17331Gupta Visit2014-05-06T00:26:40Z<p>Doyle: </p>
<hr />
<div>Abhishek Gupta is a PhD candidate in Aerospace Engineering department at UIUC, where he works with Cedric Langbort and Tamer Basar on theoretical problems in Stochastic Control theory, Game Theory, Optimization and Information theory.<br />
<br />
He is going to be giving a talk on Thursday May 8th, at 10am in Annenberg 213 on the existence of optimal strategies for dynamic games and teams with asymmetric information.<br />
<br />
He will be around for most of Thursday, so please sign up below (name and location) if you would like to meet with him.<br />
<br />
Schedule:<br />
{| border=1<br />
|-<br />
|''' Time''' || '''Person'''<br />
|-<br />
| 8:30a || Arrive at Caltech<br />
|-<br />
| 9:00a || Open<br />
|-<br />
| 9:30a || Open<br />
|-<br />
| 10:00a || Seminar - 213 Annenberg<br />
|-<br />
| 10:30a || Seminar - 213 Annenberg<br />
|-<br />
| 11:00a || Richard, 109 Steele Lab (meeting in Annenberg after seminar)<br />
|-<br />
| 11:30a || Open<br />
|-<br />
| 12:00p || Lunch <br />
|-<br />
| 1:30p || Open<br />
|-<br />
| 2:00 p || Doyle 210 Annenberg<br />
|-<br />
| 2:30 p || Depart for LAX<br />
|}</div>Doylehttps://murray.cds.caltech.edu/index.php?title=User:Doyle&diff=9455User:Doyle2009-06-07T00:27:01Z<p>Doyle: </p>
<hr />
<div><table border=1 width=100%><br />
<tr><br />
<td align=center width=20%> [[Image:]]</td><br />
<td width=60% align=center><br />
<font face="Comic Sans MS" size=5><br />
<b>John Doyle</b><br><br></div>Doylehttps://murray.cds.caltech.edu/index.php?title=Connections_II&diff=4427Connections II2006-08-17T15:50:48Z<p>Doyle: /* Agenda */</p>
<hr />
<div><table align=center width=100%><br />
<tr><br />
<td rowspan=3 align=center>[[Image:citlogo.png|75px]]</td><br />
<td align=center><font size="+2" color=blue>Connections II:</font></td><br />
<td rowspan=3 align=center>[[Image:afosrlogo.png|85px]]</td><br />
<tr><td align=center><font size="+2" color = blue> Fundamentals of Network Science</font></td><br />
<tr><td align=center><font size="+1" color=blue>14-18 August 2006 <br> Pasadena, CA</font></td><br />
</table><br />
<br />
<!-- Table of Contents --><br />
{| width=100% border = 1<br />
|-<br />
| width=20% align=center | [[#Agenda|Agenda]] <br />
| width=20% align=center | [http://www.cds.caltech.edu/~murray/connections/register.html Register]<br />
| width=20% align=center | Participants<br />
| width=20% align=center | [[Connections_II_travel|Travel Info]]<br />
| width=20% align=center | [http://www.cds.caltech.edu CDS Home]<br />
|} __NOTOC__<br />
<br />
<br><br />
<center><font size="+1">The workshop will take place in Dabney Hall ([http://www.caltech.edu/map/Caltech-map-2006-02-10.pdf campus map]).</font></center><br />
<br />
== Description ==<br />
<br />
The ''Connections'' workshop series pulls together researchers in mathematics,<br />
science and engineering who bring together novel ideas and tools from<br />
outside their traditional training to influence problems in areas as diverse<br />
as networking protocols, systems biology, ecology, geophysics, finance,<br />
fluid mechanics, and multiscale physics. An underlying theme of this<br />
workshop is to look forward to ways in which future scientists can be<br />
educated in mathematical, computational, and quantitative methods, to<br />
prepare them to interact broadly from the time they are students and<br />
throughout their academic careers. <br />
<br />
The first Connections workshop, held at Caltech in July 2004, brought<br />
together over 200 researchers in the fields of mathematics, biology,<br />
physics, engineering and other disciplines to participate in a 3 day<br />
conference exploring the connections between diverse applications and common<br />
underlying mathematics, particularly with regard to the role of uncertainty<br />
and robustness in complex systems. For the second Connections workshop, we<br />
plan to focus on the connections within the mathematics that would form the<br />
foundation of a theoretical framework for network science, still motivated<br />
by the diverse applications in science and technology that were focus of<br />
Connections I. <br />
<br />
We are organizing the activities around three main themes (roughly one each<br />
day) of Hard Limits, Short Proofs, and Small Models, together with the<br />
crosscutting theme of Architecture:<br />
<br />
* ''Hard limits'' - a major challenge in network science is to understand the fundamental limits on networks due to their components and their interconnection. One challenge is unifying and extending the previously fragmented hard limit theories that arise in thermodynamics, control, communications, and computing, and are often associated with the names Carnot, Bode, Shannon, and Turing. There are encouraging pairwise connections, like the Bode-Shannon theory developed by Martins et al and others, and this theme will explore the progress and potential for further integration. Also encouraging is the opportunity for overcoming hard limits when new connections are made, such as the relationship between proof complexity and problem fragility.<br />
<br />
* ''Short proofs'' - in general, overcoming the apparent computational intractability of analysis and design of complex networks is a central challenge, from formal verification of programs and protocols to the robustness analysis of the dynamics of biological networks and advanced technologies. Here the apparent asymmetry between NP/coNP is as significant as that between P/NP, and moving from analysis to synthesis involves higher complexity classes in fundamental ways. Substantial progress has been made recently in creating frameworks to systematically search for short proofs, but the research communities involved and the results are again somewhat fragmented. Fortunately there is also encouraging progress in creating a more unified framework, motivated by new connections within mathematics, the pervasive role of duality, and the concept of "complexity implies fragility" from the first theme.<br />
<br />
* ''Small models'' - an important route to short proofs is finding small models of complex phenomena through model identification from data, and model reduction. Again, there has been substantial recent progress within relatively fragmented research communities, with encouraging results that suggest the potential for a richer and more unified framework.<br />
<br />
* ''Architecture'' - a cross-cutting theme in the background throughout the workshop will be the challenge of a theory of ''architecture,'' as in the claim that "the architecture of the cell and the Internet have enabled their robustness and evolvability." Despite its widespread usage, there is little formalization of the concept and essentially no theory. The existing hard limits theories all assume architectures a priori which are incompatible and incomparable, and thus offer little guidance in the tradeoffs associated with architecture design. Short proofs and small models also arise only in the context of a priori specified proof and modeling architectures. A diverse set of examples of successful and unsuccessful architectures in technology and biology are now available, and motivate the study of a theory. More unified theories of hard limits, short proofs, and small models appear to be essential first steps towards a theory of architecture.<br />
<br />
== Invited speakers (confirmed) ==<br />
<br />
* Samuel Buss, UC, San Diego<br />
* Mung Chiang, Princeton <br />
* Ali Jadbabaie, Penn<br />
* Neil Gershenfeld, MIT<br />
* Keith Glover, Cambridge <br />
* Bill Helton, UC, San Diego<br />
* Mustafa Khammash, UC, Santa Barbara<br />
* Sanjay Lall, Stanford<br />
* Nuno Martins, U. Maryland <br />
* Antonis Papachristodoulou, Oxford<br />
* Pablo Parrilo, MIT<br />
* Mihai Putinar, UC, Santa Barbara<br />
* Lawrence Saul, UC, San Diego<br />
* Christina Smolke, Caltech<br />
* Lin Xiao, Microsoft Research<br />
<br />
== Caltech organizers and speakers ==<br />
* Jean-Charles Delvenne, John Doyle, Maryam Fazel, Richard Murray, Ben Recht, Henrik Sandberg<br />
<br />
== Agenda ==<br />
{| width=100% border=1 <br />
|-<br />
|<br />
'''Mon(Tutorial), Tue-Thur (workshop), Fri(Student talks)''' <br />
|-<br />
|<br />
'''Mon-Thur (workshop)''' - Daily schedule<br />
{{agenda begin}}<br />
{{agenda item|08:00|Breakfast (buffet)}}<br />
{{agenda item|08:30|Early morning talks}}<br />
{{agenda item|10:15|Morning break}}<br />
{{agenda item|10:45|Late morning talks}}<br />
{{agenda item|12:15|Lunch (buffet)}}<br />
{{agenda item|13:00|Early afternoon talks}}<br />
{{agenda item|14:30|Afternoon break}}<br />
{{agenda item|14:45|Late afternoon talks}}<br />
{{agenda item|16:00|Afternoon break until dinner}}<br />
{{agenda item|18:00|Dinner (buffet, Tue-Wed only)}}<br />
{{agenda item|18:30|Dinner talk (Tue-Wed only)}}<br />
{{agenda item|19:30|Dessert, wine, and...}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
|-<br />
|<br />
'''Monday''' - Tutorial speaker list<br />
* Schedule TBD: Pablo Parrilo, John Doyle, Maryam Fazel, Xin Liu, Nuno Martins, Ben Recht, Lijun Chen<br />
* [[Media:doyle_tutintro-14aug06.pdf|Introduction]], John Doyle<br />
* [[Media:chen_wctut-14aug06.pdf|The capacity of wireless networks]], Lijun Chen<br />
* [[Media:martins_infotheory-14aug06.pdf|Basic results and definitions of information theory]], Nuno Martins<br />
* [[Media:delvenne_thermo-14aug06.pdf|Notions of Energy and Entropy]], Jean-Charles Delvenne and Henrik Sandberg<br />
* [[Media:fazel_percolation-14aug06.pdf|Complexity and fragility in the lattice percolation problem]], Maryam Fazel<br />
|-<br />
|<br />
'''Tuesday''' - Hard Limits<br />
{{agenda begin}}<br />
{{agenda item|08:30|John Doyle, [[Media:doyle_overview-15aug06.pdf|Workshop Overview]]}}<br />
{{agenda item| |Henrik Sandberg/Jean-Charles Delvenne: [[Media:sandberg_statmech-15aug06.pdf|Control, information, and statistical mechanics]]}}<br />
{{agenda item| |Nuno Martins: [[Media:martins_commctrl-15aug06.pdf|Communications and control]]}}<br />
{{agenda item| |Pablo Parrilo: [[Media:parrilo_introcomp-15aug06.pdf|Intro to computational complexity]]}}<br />
{{agenda item|13:00|Pablo Parrilo: Computational complexity and formal methods}}<br />
{{agenda item| |Mustafa Khammash: [[Media:khammash_master-15aug06.pdf|Complexity of the chemical master equation]]}}<br />
{{agenda item| |Maryam Fazel, Dennice Gayme, Antonis Papachristodoulou: Complexity implies fragility}}<br />
{{agenda item| |Pablo Parrilo/John Doyle: Recap and wrapup}}<br />
{{agenda item|18:30|Christina Smolke: Regulatory mechanisms in natural and synthetic biology}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Wednesday''' - Short Proofs<br />
{{agenda begin}}<br />
{{agenda item|08:30|Pablo Parrilo, Day Overview}}<br />
{{agenda item| |Mihai Putinar: [[Media:putinar_ppfs-16aug06.pdf|Polynomial proofs and operator theory]]}}<br />
{{agenda item| |Samuel Buss: [[Media:buss_pfsys-16aug06.pdf|Proof systems]]}}<br />
{{agenda item| |Bill Helton: Scale-independent proofs in systems and control}}<br />
{{agenda item|13:00|Carla Gomes/Bart Selman: SAT Solvers and state of the art}}<br />
{{agenda item| |John Doyle: Layering architectures, examples}}<br />
{{agenda item| |Mung Chiang: Layering, optimization, and duality}}<br />
{{agenda item| |Parrilo: Recap and wrapup}}<br />
{{agenda item|18:30|Neil Gershenfeld: Math as computer programming}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Thursday''' - Small Models<br />
{{agenda begin}}<br />
{{agenda item|08:30|Ali J/ Sanj L/Antonis P: Networks and decentralized control }}<br />
{{agenda item|13:00|Lawrence Saul, Spectral methods in machine learning}}<br />
{{agenda item| |Ben Recht, Lin Xiao: Convex optimization approaches and recap}}<br />
{{agenda item| |Parrilo: Recap and wrapup}}<br />
{{agenda item|16:00|Adjourn, dinner on own}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Friday''' - Student talks<br />
{{agenda begin}}<br />
{{agenda item|09:00|Breakfast (buffet)}}<br />
{{agenda item|09:30|Morning talks and break}}<br />
{{agenda item|12:00|Lunch (buffet)}}<br />
{{agenda item|13:00|Afternoon talks and break}}<br />
{{agenda item|16:00|End}}<br />
{{agenda end}}<br />
|}<br />
<br />
== Additional Information ==<br />
<br />
The main workshop will be held on 15-17 August 2006 in Pasadena, CA, with additional sessions on Monday and Friday for interested participants:<br />
<br />
* Monday: tutorial sessions<br />
* Tuesday: Hard Limits <br />
* Wednesday: Short Proofs <br />
* Thursday: Small Models<br />
* Friday: student presentations<br><br />
* [http://www.cds.caltech.edu/~murray/connections/register.html Register to attend]<br><br />
* [[Connections II Participants|Participants (restricted page)]]<br />
<br />
The Connections workshop is sponsored by Caltech and the Air Force Office of Scientific Research.</div>Doylehttps://murray.cds.caltech.edu/index.php?title=Connections_II&diff=4417Connections II2006-08-16T13:15:46Z<p>Doyle: /* Agenda */</p>
<hr />
<div><table align=center width=100%><br />
<tr><br />
<td rowspan=3 align=center>[[Image:citlogo.png|75px]]</td><br />
<td align=center><font size="+2" color=blue>Connections II:</font></td><br />
<td rowspan=3 align=center>[[Image:afosrlogo.png|85px]]</td><br />
<tr><td align=center><font size="+2" color = blue> Fundamentals of Network Science</font></td><br />
<tr><td align=center><font size="+1" color=blue>14-18 August 2006 <br> Pasadena, CA</font></td><br />
</table><br />
<br />
<!-- Table of Contents --><br />
{| width=100% border = 1<br />
|-<br />
| width=20% align=center | [[#Agenda|Agenda]] <br />
| width=20% align=center | [http://www.cds.caltech.edu/~murray/connections/register.html Register]<br />
| width=20% align=center | Participants<br />
| width=20% align=center | [[Connections_II_travel|Travel Info]]<br />
| width=20% align=center | [http://www.cds.caltech.edu CDS Home]<br />
|} __NOTOC__<br />
<br />
<br><br />
<center><font size="+1">The workshop will take place in Dabney Hall ([http://www.caltech.edu/map/Caltech-map-2006-02-10.pdf campus map]).</font></center><br />
<br />
== Description ==<br />
<br />
The ''Connections'' workshop series pulls together researchers in mathematics,<br />
science and engineering who bring together novel ideas and tools from<br />
outside their traditional training to influence problems in areas as diverse<br />
as networking protocols, systems biology, ecology, geophysics, finance,<br />
fluid mechanics, and multiscale physics. An underlying theme of this<br />
workshop is to look forward to ways in which future scientists can be<br />
educated in mathematical, computational, and quantitative methods, to<br />
prepare them to interact broadly from the time they are students and<br />
throughout their academic careers. <br />
<br />
The first Connections workshop, held at Caltech in July 2004, brought<br />
together over 200 researchers in the fields of mathematics, biology,<br />
physics, engineering and other disciplines to participate in a 3 day<br />
conference exploring the connections between diverse applications and common<br />
underlying mathematics, particularly with regard to the role of uncertainty<br />
and robustness in complex systems. For the second Connections workshop, we<br />
plan to focus on the connections within the mathematics that would form the<br />
foundation of a theoretical framework for network science, still motivated<br />
by the diverse applications in science and technology that were focus of<br />
Connections I. <br />
<br />
We are organizing the activities around three main themes (roughly one each<br />
day) of Hard Limits, Short Proofs, and Small Models, together with the<br />
crosscutting theme of Architecture:<br />
<br />
* ''Hard limits'' - a major challenge in network science is to understand the fundamental limits on networks due to their components and their interconnection. One challenge is unifying and extending the previously fragmented hard limit theories that arise in thermodynamics, control, communications, and computing, and are often associated with the names Carnot, Bode, Shannon, and Turing. There are encouraging pairwise connections, like the Bode-Shannon theory developed by Martins et al and others, and this theme will explore the progress and potential for further integration. Also encouraging is the opportunity for overcoming hard limits when new connections are made, such as the relationship between proof complexity and problem fragility.<br />
<br />
* ''Short proofs'' - in general, overcoming the apparent computational intractability of analysis and design of complex networks is a central challenge, from formal verification of programs and protocols to the robustness analysis of the dynamics of biological networks and advanced technologies. Here the apparent asymmetry between NP/coNP is as significant as that between P/NP, and moving from analysis to synthesis involves higher complexity classes in fundamental ways. Substantial progress has been made recently in creating frameworks to systematically search for short proofs, but the research communities involved and the results are again somewhat fragmented. Fortunately there is also encouraging progress in creating a more unified framework, motivated by new connections within mathematics, the pervasive role of duality, and the concept of "complexity implies fragility" from the first theme.<br />
<br />
* ''Small models'' - an important route to short proofs is finding small models of complex phenomena through model identification from data, and model reduction. Again, there has been substantial recent progress within relatively fragmented research communities, with encouraging results that suggest the potential for a richer and more unified framework.<br />
<br />
* ''Architecture'' - a cross-cutting theme in the background throughout the workshop will be the challenge of a theory of ''architecture,'' as in the claim that "the architecture of the cell and the Internet have enabled their robustness and evolvability." Despite its widespread usage, there is little formalization of the concept and essentially no theory. The existing hard limits theories all assume architectures a priori which are incompatible and incomparable, and thus offer little guidance in the tradeoffs associated with architecture design. Short proofs and small models also arise only in the context of a priori specified proof and modeling architectures. A diverse set of examples of successful and unsuccessful architectures in technology and biology are now available, and motivate the study of a theory. More unified theories of hard limits, short proofs, and small models appear to be essential first steps towards a theory of architecture.<br />
<br />
== Invited speakers (confirmed) ==<br />
<br />
* Samuel Buss, UC, San Diego<br />
* Mung Chiang, Princeton <br />
* Ali Jadbabaie, Penn<br />
* Neil Gershenfeld, MIT<br />
* Keith Glover, Cambridge <br />
* Bill Helton, UC, San Diego<br />
* Mustafa Khammash, UC, Santa Barbara<br />
* Sanjay Lall, Stanford<br />
* Nuno Martins, U. Maryland <br />
* Antonis Papachristodoulou, Oxford<br />
* Pablo Parrilo, MIT<br />
* Mihai Putinar, UC, Santa Barbara<br />
* Lawrence Saul, UC, San Diego<br />
* Christina Smolke, Caltech<br />
* Lin Xiao, Microsoft Research<br />
<br />
== Caltech organizers and speakers ==<br />
* Jean-Charles Delvenne, John Doyle, Maryam Fazel, Richard Murray, Ben Recht, Henrik Sandberg<br />
<br />
== Agenda ==<br />
{| width=100% border=1 <br />
|-<br />
|<br />
'''Mon(Tutorial), Tue-Thur (workshop), Fri(Student talks)''' <br />
|-<br />
|<br />
'''Mon-Thur (workshop)''' - Daily schedule<br />
{{agenda begin}}<br />
{{agenda item|08:00|Breakfast (buffet)}}<br />
{{agenda item|08:30|Early morning talks}}<br />
{{agenda item|10:15|Morning break}}<br />
{{agenda item|10:45|Late morning talks}}<br />
{{agenda item|12:15|Lunch (buffet)}}<br />
{{agenda item|13:00|Early afternoon talks}}<br />
{{agenda item|14:30|Afternoon break}}<br />
{{agenda item|14:45|Late afternoon talks}}<br />
{{agenda item|16:00|Afternoon break until dinner}}<br />
{{agenda item|18:00|Dinner (buffet, Tue-Wed only)}}<br />
{{agenda item|18:30|Dinner talk (Tue-Wed only)}}<br />
{{agenda item|19:30|Dessert, wine, and...}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
|-<br />
|<br />
'''Monday''' - Tutorial speaker list<br />
* Schedule TBD: Pablo Parrilo, John Doyle, Maryam Fazel, Xin Liu, Nuno Martins, Ben Recht, Lijun Chen<br />
* [[Media:doyle_tutintro-14aug06.pdf|Introduction]], John Doyle<br />
* [[Media:chen_wctut-14aug06.pdf|The capacity of wireless networks]], Lijun Chen<br />
* [[Media:martins_infotheory-14aug06.pdf|Basic results and definitions of information theory]], Nuno Martins<br />
* [[Media:delvenne_thermo-14aug06.pdf|Notions of Energy and Entropy]], Jean-Charles Delvenne and Henrik Sandberg<br />
|-<br />
|<br />
'''Tuesday''' - Hard Limits<br />
{{agenda begin}}<br />
{{agenda item|08:30|John Doyle, [[Media:doyle_overview-15aug06.pdf|Workshop Overview]]}}<br />
{{agenda item| |Henrik Sandberg/Jean-Charles Delvenne: [[Media:sandberg_statmech-15aug06.pdf|Control, information, and statistical mechanics]]}}<br />
{{agenda item| |Nuno Martins: [[Media:martins_commctrl-15aug06.pdf|Communications and control]]}}<br />
{{agenda item| |Pablo Parrilo: [[Media:parrilo_introcomp-15aug06.pdf|Intro to computational complexity]]}}<br />
{{agenda item|13:00|Pablo Parrilo: Computational complexity and formal methods}}<br />
{{agenda item| |Mustafa Khammash: Complexity of the chemical master equation}}<br />
{{agenda item| |Maryam Fazel, Dennice Gayme, Antonis Papachristodoulou: Complexity implies fragility}}<br />
{{agenda item| |Pablo Parrilo/John Doyle: Recap and wrapup}}<br />
{{agenda item|18:30|Christina Smolke: Regulatory mechanisms in natural and synthetic biology}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Wednesday''' - Short Proofs<br />
{{agenda begin}}<br />
{{agenda item|08:30|Pablo Parrilo, Day Overview}}<br />
{{agenda item| |Mihai Putinar: Polynomial proofs and operator theory}}<br />
{{agenda item| |Samuel Buss: Proof systems}}<br />
{{agenda item| |Bill Helton: Scale-independent proofs in systems and control}}<br />
{{agenda item|13:00|Carla Gomes/Bart Selman: SAT Solvers and state of the art}}<br />
{{agenda item| |John Doyle: Layering architectures, examples}}<br />
{{agenda item| |Mung Chiang: Layering, optimization, and duality}}<br />
{{agenda item| |Parrilo: Recap and wrapup}}<br />
{{agenda item|18:30|Neil Gershenfeld: Math as computer programming}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Thursday''' - Small Models<br />
{{agenda begin}}<br />
{{agenda item|08:30|Ben Recht, Lin Xiao: Day Overview}}<br />
{{agenda item| |Ali J/ Sanj L/Antonis P: Networks and decentralized control }}<br />
{{agenda item| |Keith Glover, Model reduction and system ID}}<br />
{{agenda item|13:00|Lawrence Saul, Spectral methods in machine learning}}<br />
{{agenda item| |Ben Recht, Lin Xiao: Convex optimization approaches and recap}}<br />
{{agenda item| |Parrilo: Recap and wrapup}}<br />
{{agenda item|16:00|Adjourn, dinner on own}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Friday''' - Student talks<br />
{{agenda begin}}<br />
{{agenda item|09:00|Breakfast (buffet)}}<br />
{{agenda item|09:30|Morning talks and break}}<br />
{{agenda item|12:00|Lunch (buffet)}}<br />
{{agenda item|13:00|Afternoon talks and break}}<br />
{{agenda item|16:00|End}}<br />
{{agenda end}}<br />
|}<br />
<br />
== Additional Information ==<br />
<br />
The main workshop will be held on 15-17 August 2006 in Pasadena, CA, with additional sessions on Monday and Friday for interested participants:<br />
<br />
* Monday: tutorial sessions<br />
* Tuesday: Hard Limits <br />
* Wednesday: Short Proofs <br />
* Thursday: Small Models<br />
* Friday: student presentations<br><br />
* [http://www.cds.caltech.edu/~murray/connections/register.html Register to attend]<br><br />
* [[Connections II Participants|Participants (restricted page)]]<br />
<br />
The Connections workshop is sponsored by Caltech and the Air Force Office of Scientific Research.</div>Doylehttps://murray.cds.caltech.edu/index.php?title=Connections_II&diff=4364Connections II2006-08-12T15:05:05Z<p>Doyle: /* Caltech organizers and speakers */</p>
<hr />
<div><table align=center width=100%><br />
<tr><br />
<td rowspan=3 align=center>[[Image:citlogo.png|75px]]</td><br />
<td align=center><font size="+2" color=blue>Connections II:</font></td><br />
<td rowspan=3 align=center>[[Image:afosrlogo.png|85px]]</td><br />
<tr><td align=center><font size="+2" color = blue> Fundamentals of Network Science</font></td><br />
<tr><td align=center><font size="+1" color=blue>14-18 August 2006 <br> Pasadena, CA</font></td><br />
</table><br />
<br />
<!-- Table of Contents --><br />
{| width=100% border = 1<br />
|-<br />
| width=20% align=center | [[#Agenda|Agenda]] <br />
| width=20% align=center | [http://www.cds.caltech.edu/~murray/connections/register.html Register]<br />
| width=20% align=center | Participants<br />
| width=20% align=center | [[Connections_II_travel|Travel Info]]<br />
| width=20% align=center | [http://www.cds.caltech.edu CDS Home]<br />
|} __NOTOC__<br />
<br />
== Description ==<br />
<br />
The ''Connections'' workshop series pulls together researchers in mathematics,<br />
science and engineering who bring together novel ideas and tools from<br />
outside their traditional training to influence problems in areas as diverse<br />
as networking protocols, systems biology, ecology, geophysics, finance,<br />
fluid mechanics, and multiscale physics. An underlying theme of this<br />
workshop is to look forward to ways in which future scientists can be<br />
educated in mathematical, computational, and quantitative methods, to<br />
prepare them to interact broadly from the time they are students and<br />
throughout their academic careers. <br />
<br />
The first Connections workshop, held at Caltech in July 2004, brought<br />
together over 200 researchers in the fields of mathematics, biology,<br />
physics, engineering and other disciplines to participate in a 3 day<br />
conference exploring the connections between diverse applications and common<br />
underlying mathematics, particularly with regard to the role of uncertainty<br />
and robustness in complex systems. For the second Connections workshop, we<br />
plan to focus on the connections within the mathematics that would form the<br />
foundation of a theoretical framework for network science, still motivated<br />
by the diverse applications in science and technology that were focus of<br />
Connections I. <br />
<br />
We are organizing the activities around three main themes (roughly one each<br />
day) of Hard Limits, Short Proofs, and Small Models, together with the<br />
crosscutting theme of Architecture:<br />
<br />
* ''Hard limits'' - a major challenge in network science is to understand the fundamental limits on networks due to their components and their interconnection. One challenge is unifying and extending the previously fragmented hard limit theories that arise in thermodynamics, control, communications, and computing, and are often associated with the names Carnot, Bode, Shannon, and Turing. There are encouraging pairwise connections, like the Bode-Shannon theory developed by Martins et al and others, and this theme will explore the progress and potential for further integration. Also encouraging is the opportunity for overcoming hard limits when new connections are made, such as the relationship between proof complexity and problem fragility.<br />
<br />
* ''Short proofs'' - in general, overcoming the apparent computational intractability of analysis and design of complex networks is a central challenge, from formal verification of programs and protocols to the robustness analysis of the dynamics of biological networks and advanced technologies. Here the apparent asymmetry between NP/coNP is as significant as that between P/NP, and moving from analysis to synthesis involves higher complexity classes in fundamental ways. Substantial progress has been made recently in creating frameworks to systematically search for short proofs, but the research communities involved and the results are again somewhat fragmented. Fortunately there is also encouraging progress in creating a more unified framework, motivated by new connections within mathematics, the pervasive role of duality, and the concept of "complexity implies fragility" from the first theme.<br />
<br />
* ''Small models'' - an important route to short proofs is finding small models of complex phenomena through model identification from data, and model reduction. Again, there has been substantial recent progress within relatively fragmented research communities, with encouraging results that suggest the potential for a richer and more unified framework.<br />
<br />
* ''Architecture'' - a cross-cutting theme in the background throughout the workshop will be the challenge of a theory of ''architecture,'' as in the claim that "the architecture of the cell and the Internet have enabled their robustness and evolvability." Despite its widespread usage, there is little formalization of the concept and essentially no theory. The existing hard limits theories all assume architectures a priori which are incompatible and incomparable, and thus offer little guidance in the tradeoffs associated with architecture design. Short proofs and small models also arise only in the context of a priori specified proof and modeling architectures. A diverse set of examples of successful and unsuccessful architectures in technology and biology are now available, and motivate the study of a theory. More unified theories of hard limits, short proofs, and small models appear to be essential first steps towards a theory of architecture.<br />
<br />
== Invited speakers (confirmed) ==<br />
<br />
* Samuel Buss, UC, San Diego<br />
* Mung Chiang, Princeton <br />
* Ali Jadbabaie, Penn<br />
* Neil Gershenfeld, MIT<br />
* Keith Glover, Cambridge <br />
* Bill Helton, UC, San Diego<br />
* Mustafa Khammash, UC, Santa Barbara<br />
* Sanjay Lall, Stanford<br />
* Nuno Martins, U. Maryland <br />
* Antonis Papachristodoulou, Oxford<br />
* Pablo Parrilo, MIT<br />
* Mihai Putinar, UC, Santa Barbara<br />
* Lawrence Saul, UC, San Diego<br />
* Christina Smolke, Caltech<br />
* Lin Xiao, Microsoft Research<br />
<br />
== Caltech organizers and speakers ==<br />
* Jean-Charles Delvenne, John Doyle, Maryam Fazel, Richard Murray, Ben Recht, Henrik Sandberg<br />
<br />
== Agenda ==<br />
{| width=100% border=1 <br />
|-<br />
|<br />
'''Mon(Tutorial), Tue-Thur (workshop), Fri(Student talks)''' <br />
|-<br />
|<br />
'''Mon-Thur (workshop)''' - Daily schedule<br />
{{agenda begin}}<br />
{{agenda item|08:00|Breakfast (buffet)}}<br />
{{agenda item|08:30|Early morning talks}}<br />
{{agenda item|10:15|Morning break}}<br />
{{agenda item|10:45|Late morning talks}}<br />
{{agenda item|12:15|Lunch (buffet)}}<br />
{{agenda item|13:00|Early afternoon talks}}<br />
{{agenda item|14:30|Afternoon break}}<br />
{{agenda item|14:45|Late afternoon talks}}<br />
{{agenda item|16:00|Afternoon break until dinner}}<br />
{{agenda item|18:00|Dinner (buffet, Tue-Wed only)}}<br />
{{agenda item|18:30|Dinner talk (Tue-Wed only)}}<br />
{{agenda item|19:30|Dessert, wine, and...}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
|-<br />
|<br />
'''Monday''' - Tutorial speaker list<br />
* Schedule TBD: Pablo Parrilo, John Doyle, Maryam Fazel, Xin Liu, Nuno Martins, Ben Recht, Lijun Chen<br />
|-<br />
|<br />
'''Tuesday''' - Hard Limits<br />
{{agenda begin}}<br />
{{agenda item|08:30|John Doyle, Workshop Overview}}<br />
{{agenda item| |Henrik Sandberg/Jean-Charles Delvenne: Control, information, and statistical mechanics}}<br />
{{agenda item| |Nuno Martins: Communications and control}}<br />
{{agenda item| |Pablo Parrilo: Intro to computational complexity}}<br />
{{agenda item|13:00|Pablo Parrilo: Computational complexity and formal methods}}<br />
{{agenda item| |Mustafa Khammash: Complexity of the chemical master equation}}<br />
{{agenda item| |Maryam Fazel, Dennice Gayme, Antonis Papachristodoulou: Complexity implies fragility}}<br />
{{agenda item| |Pablo Parrilo/John Doyle: Recap and wrapup}}<br />
{{agenda item|18:30|Christina Smolke: Regulatory mechanisms in natural and synthetic biology}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Wednesday''' - Short Proofs<br />
{{agenda begin}}<br />
{{agenda item|08:30|Pablo Parrilo, Day Overview}}<br />
{{agenda item| |Mihai Putinar: Polynomial proofs and operator theory}}<br />
{{agenda item| |Samuel Buss: Proof systems}}<br />
{{agenda item| |Bill Helton: Scale-independent proofs in systems and control}}<br />
{{agenda item|13:00|Carla Gomes/Bart Selman: SAT Solvers and state of the art}}<br />
{{agenda item| |John Doyle: Layering architectures, examples}}<br />
{{agenda item| |Mung Chiang: Layering, optimization, and duality}}<br />
{{agenda item| |Parrilo: Recap and wrapup}}<br />
{{agenda item|16:30|Neil Gershenfeld: Math as computer programming}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Thursday''' - Small Models<br />
{{agenda begin}}<br />
{{agenda item|08:30|Ben Recht, Lin Xiao: Day Overview}}<br />
{{agenda item| |Ali J/ Sanj L/Antonis P: Networks and decentralized control }}<br />
{{agenda item| |Keith Glover, Model reduction and system ID}}<br />
{{agenda item|13:00|Lawrence Saul, Spectral methods in machine learning}}<br />
{{agenda item| |Ben Recht, Lin Xiao: Convex optimization approaches and recap}}<br />
{{agenda item| |Parrilo: Recap and wrapup}}<br />
{{agenda item|16:00|Adjourn, dinner on own}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Friday''' - Student talks<br />
{{agenda begin}}<br />
{{agenda item|09:00|Breakfast (buffet)}}<br />
{{agenda item|09:30|Morning talks and break}}<br />
{{agenda item|12:00|Lunch (buffet)}}<br />
{{agenda item|13:00|Afternoon talks and break}}<br />
{{agenda item|16:00|End}}<br />
{{agenda end}}<br />
|}<br />
<br />
== Additional Information ==<br />
<br />
The main workshop will be held on 15-17 August 2006 in Pasadena, CA, with additional sessions on Monday and Friday for interested participants:<br />
<br />
* Monday: tutorial sessions<br />
* Tuesday: Hard Limits <br />
* Wednesday: Short Proofs <br />
* Thursday: Small Models<br />
* Friday: student presentations<br><br />
* [http://www.cds.caltech.edu/~murray/connections/register.html Register to attend]<br><br />
* [[Connections II Participants|Participants (restricted page)]]<br />
<br />
The Connections workshop is sponsored by Caltech and the Air Force Office of Scientific Research.</div>Doylehttps://murray.cds.caltech.edu/index.php?title=Connections_II&diff=4363Connections II2006-08-12T01:08:13Z<p>Doyle: /* Agenda */</p>
<hr />
<div><table align=center width=100%><br />
<tr><br />
<td rowspan=3 align=center>[[Image:citlogo.png|75px]]</td><br />
<td align=center><font size="+2" color=blue>Connections II:</font></td><br />
<td rowspan=3 align=center>[[Image:afosrlogo.png|85px]]</td><br />
<tr><td align=center><font size="+2" color = blue> Fundamentals of Network Science</font></td><br />
<tr><td align=center><font size="+1" color=blue>14-18 August 2006 <br> Pasadena, CA</font></td><br />
</table><br />
<br />
<!-- Table of Contents --><br />
{| width=100% border = 1<br />
|-<br />
| width=20% align=center | [[#Agenda|Agenda]] <br />
| width=20% align=center | [http://www.cds.caltech.edu/~murray/connections/register.html Register]<br />
| width=20% align=center | Participants<br />
| width=20% align=center | [[Connections_II_travel|Travel Info]]<br />
| width=20% align=center | [http://www.cds.caltech.edu CDS Home]<br />
|} __NOTOC__<br />
<br />
== Description ==<br />
<br />
The ''Connections'' workshop series pulls together researchers in mathematics,<br />
science and engineering who bring together novel ideas and tools from<br />
outside their traditional training to influence problems in areas as diverse<br />
as networking protocols, systems biology, ecology, geophysics, finance,<br />
fluid mechanics, and multiscale physics. An underlying theme of this<br />
workshop is to look forward to ways in which future scientists can be<br />
educated in mathematical, computational, and quantitative methods, to<br />
prepare them to interact broadly from the time they are students and<br />
throughout their academic careers. <br />
<br />
The first Connections workshop, held at Caltech in July 2004, brought<br />
together over 200 researchers in the fields of mathematics, biology,<br />
physics, engineering and other disciplines to participate in a 3 day<br />
conference exploring the connections between diverse applications and common<br />
underlying mathematics, particularly with regard to the role of uncertainty<br />
and robustness in complex systems. For the second Connections workshop, we<br />
plan to focus on the connections within the mathematics that would form the<br />
foundation of a theoretical framework for network science, still motivated<br />
by the diverse applications in science and technology that were focus of<br />
Connections I. <br />
<br />
We are organizing the activities around three main themes (roughly one each<br />
day) of Hard Limits, Short Proofs, and Small Models, together with the<br />
crosscutting theme of Architecture:<br />
<br />
* ''Hard limits'' - a major challenge in network science is to understand the fundamental limits on networks due to their components and their interconnection. One challenge is unifying and extending the previously fragmented hard limit theories that arise in thermodynamics, control, communications, and computing, and are often associated with the names Carnot, Bode, Shannon, and Turing. There are encouraging pairwise connections, like the Bode-Shannon theory developed by Martins et al and others, and this theme will explore the progress and potential for further integration. Also encouraging is the opportunity for overcoming hard limits when new connections are made, such as the relationship between proof complexity and problem fragility.<br />
<br />
* ''Short proofs'' - in general, overcoming the apparent computational intractability of analysis and design of complex networks is a central challenge, from formal verification of programs and protocols to the robustness analysis of the dynamics of biological networks and advanced technologies. Here the apparent asymmetry between NP/coNP is as significant as that between P/NP, and moving from analysis to synthesis involves higher complexity classes in fundamental ways. Substantial progress has been made recently in creating frameworks to systematically search for short proofs, but the research communities involved and the results are again somewhat fragmented. Fortunately there is also encouraging progress in creating a more unified framework, motivated by new connections within mathematics, the pervasive role of duality, and the concept of "complexity implies fragility" from the first theme.<br />
<br />
* ''Small models'' - an important route to short proofs is finding small models of complex phenomena through model identification from data, and model reduction. Again, there has been substantial recent progress within relatively fragmented research communities, with encouraging results that suggest the potential for a richer and more unified framework.<br />
<br />
* ''Architecture'' - a cross-cutting theme in the background throughout the workshop will be the challenge of a theory of ''architecture,'' as in the claim that "the architecture of the cell and the Internet have enabled their robustness and evolvability." Despite its widespread usage, there is little formalization of the concept and essentially no theory. The existing hard limits theories all assume architectures a priori which are incompatible and incomparable, and thus offer little guidance in the tradeoffs associated with architecture design. Short proofs and small models also arise only in the context of a priori specified proof and modeling architectures. A diverse set of examples of successful and unsuccessful architectures in technology and biology are now available, and motivate the study of a theory. More unified theories of hard limits, short proofs, and small models appear to be essential first steps towards a theory of architecture.<br />
<br />
== Invited speakers (confirmed) ==<br />
<br />
* Samuel Buss, UC, San Diego<br />
* Mung Chiang, Princeton <br />
* Ali Jadbabaie, Penn<br />
* Neil Gershenfeld, MIT<br />
* Keith Glover, Cambridge <br />
* Bill Helton, UC, San Diego<br />
* Mustafa Khammash, UC, Santa Barbara<br />
* Sanjay Lall, Stanford<br />
* Nuno Martins, U. Maryland <br />
* Antonis Papachristodoulou, Oxford<br />
* Pablo Parrilo, MIT<br />
* Mihai Putinar, UC, Santa Barbara<br />
* Lawrence Saul, UC, San Diego<br />
* Christina Smolke, Caltech<br />
* Lin Xiao, Microsoft Research<br />
<br />
== Caltech organizers and speakers ==<br />
* Jean-Charles Delvenne, John Doyle, Maryam Fazel, Sichard Murray, Ben Recht, Henrik Sandberg<br />
<br />
== Agenda ==<br />
{| width=100% border=1 <br />
|-<br />
|<br />
'''Mon(Tutorial), Tue-Thur (workshop), Fri(Student talks)''' <br />
|-<br />
|<br />
'''Mon-Thur (workshop)''' - Daily schedule<br />
{{agenda begin}}<br />
{{agenda item|08:00|Breakfast (buffet)}}<br />
{{agenda item|08:30|Early morning talks}}<br />
{{agenda item|10:15|Morning break}}<br />
{{agenda item|10:45|Late morning talks}}<br />
{{agenda item|12:15|Lunch (buffet)}}<br />
{{agenda item|13:00|Early afternoon talks}}<br />
{{agenda item|14:30|Afternoon break}}<br />
{{agenda item|14:45|Late afternoon talks}}<br />
{{agenda item|16:00|Afternoon break until dinner}}<br />
{{agenda item|18:00|Dinner (buffet, Tue-Wed only)}}<br />
{{agenda item|18:30|Dinner talk (Tue-Wed only)}}<br />
{{agenda item|19:30|Dessert, wine, and...}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
|-<br />
|<br />
'''Monday''' - Tutorial speaker list<br />
* Schedule TBD: Pablo Parrilo, John Doyle, Maryam Fazel, Xin Liu, Nuno Martins, Ben Recht, Lijun Chen<br />
|-<br />
|<br />
'''Tuesday''' - Hard Limits<br />
{{agenda begin}}<br />
{{agenda item|08:30|John Doyle, Workshop Overview}}<br />
{{agenda item| |Henrik Sandberg/Jean-Charles Delvenne: Control, information, and statistical mechanics}}<br />
{{agenda item| |Nuno Martins: Communications and control}}<br />
{{agenda item| |Pablo Parrilo: Intro to computational complexity}}<br />
{{agenda item|13:00|Pablo Parrilo: Computational complexity and formal methods}}<br />
{{agenda item| |Mustafa Khammash: Complexity of the chemical master equation}}<br />
{{agenda item| |Maryam Fazel, Dennice Gayme, Antonis Papachristodoulou: Complexity implies fragility}}<br />
{{agenda item| |Pablo Parrilo/John Doyle: Recap and wrapup}}<br />
{{agenda item|18:30|Christina Smolke: Regulatory mechanisms in natural and synthetic biology}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Wednesday''' - Short Proofs<br />
{{agenda begin}}<br />
{{agenda item|08:30|Pablo Parrilo, Day Overview}}<br />
{{agenda item| |Mihai Putinar: Polynomial proofs and operator theory}}<br />
{{agenda item| |Samuel Buss: Proof systems}}<br />
{{agenda item| |Bill Helton: Scale-independent proofs in systems and control}}<br />
{{agenda item|13:00|Carla Gomes/Bart Selman: SAT Solvers and state of the art}}<br />
{{agenda item| |John Doyle: Layering architectures, examples}}<br />
{{agenda item| |Mung Chiang: Layering, optimization, and duality}}<br />
{{agenda item| |Parrilo: Recap and wrapup}}<br />
{{agenda item|16:30|Neil Gershenfeld: Math as computer programming}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Thursday''' - Small Models<br />
{{agenda begin}}<br />
{{agenda item|08:30|Ben Recht, Lin Xiao: Day Overview}}<br />
{{agenda item| |Ali J/ Sanj L/Antonis P: Networks and decentralized control }}<br />
{{agenda item| |Keith Glover, Model reduction and system ID}}<br />
{{agenda item|13:00|Lawrence Saul, Spectral methods in machine learning}}<br />
{{agenda item| |Ben Recht, Lin Xiao: Convex optimization approaches and recap}}<br />
{{agenda item| |Parrilo: Recap and wrapup}}<br />
{{agenda item|16:00|Adjourn, dinner on own}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Friday''' - Student talks<br />
{{agenda begin}}<br />
{{agenda item|09:00|Breakfast (buffet)}}<br />
{{agenda item|09:30|Morning talks and break}}<br />
{{agenda item|12:00|Lunch (buffet)}}<br />
{{agenda item|13:00|Afternoon talks and break}}<br />
{{agenda item|16:00|End}}<br />
{{agenda end}}<br />
|}<br />
<br />
== Additional Information ==<br />
<br />
The main workshop will be held on 15-17 August 2006 in Pasadena, CA, with additional sessions on Monday and Friday for interested participants:<br />
<br />
* Monday: tutorial sessions<br />
* Tuesday: Hard Limits <br />
* Wednesday: Short Proofs <br />
* Thursday: Small Models<br />
* Friday: student presentations<br><br />
* [http://www.cds.caltech.edu/~murray/connections/register.html Register to attend]<br><br />
* [[Connections II Participants|Participants (restricted page)]]<br />
<br />
The Connections workshop is sponsored by Caltech and the Air Force Office of Scientific Research.</div>Doylehttps://murray.cds.caltech.edu/index.php?title=Connections_II&diff=4362Connections II2006-08-11T22:30:22Z<p>Doyle: /* Agenda */</p>
<hr />
<div><table align=center width=100%><br />
<tr><br />
<td rowspan=3 align=center>[[Image:citlogo.png|75px]]</td><br />
<td align=center><font size="+2" color=blue>Connections II:</font></td><br />
<td rowspan=3 align=center>[[Image:afosrlogo.png|85px]]</td><br />
<tr><td align=center><font size="+2" color = blue> Fundamentals of Network Science</font></td><br />
<tr><td align=center><font size="+1" color=blue>14-18 August 2006 <br> Pasadena, CA</font></td><br />
</table><br />
<br />
<!-- Table of Contents --><br />
{| width=100% border = 1<br />
|-<br />
| width=20% align=center | [[#Agenda|Agenda]] <br />
| width=20% align=center | [http://www.cds.caltech.edu/~murray/connections/register.html Register]<br />
| width=20% align=center | Participants<br />
| width=20% align=center | [[Connections_II_travel|Travel Info]]<br />
| width=20% align=center | [http://www.cds.caltech.edu CDS Home]<br />
|} __NOTOC__<br />
<br />
== Description ==<br />
<br />
The ''Connections'' workshop series pulls together researchers in mathematics,<br />
science and engineering who bring together novel ideas and tools from<br />
outside their traditional training to influence problems in areas as diverse<br />
as networking protocols, systems biology, ecology, geophysics, finance,<br />
fluid mechanics, and multiscale physics. An underlying theme of this<br />
workshop is to look forward to ways in which future scientists can be<br />
educated in mathematical, computational, and quantitative methods, to<br />
prepare them to interact broadly from the time they are students and<br />
throughout their academic careers. <br />
<br />
The first Connections workshop, held at Caltech in July 2004, brought<br />
together over 200 researchers in the fields of mathematics, biology,<br />
physics, engineering and other disciplines to participate in a 3 day<br />
conference exploring the connections between diverse applications and common<br />
underlying mathematics, particularly with regard to the role of uncertainty<br />
and robustness in complex systems. For the second Connections workshop, we<br />
plan to focus on the connections within the mathematics that would form the<br />
foundation of a theoretical framework for network science, still motivated<br />
by the diverse applications in science and technology that were focus of<br />
Connections I. <br />
<br />
We are organizing the activities around three main themes (roughly one each<br />
day) of Hard Limits, Short Proofs, and Small Models, together with the<br />
crosscutting theme of Architecture:<br />
<br />
* ''Hard limits'' - a major challenge in network science is to understand the fundamental limits on networks due to their components and their interconnection. One challenge is unifying and extending the previously fragmented hard limit theories that arise in thermodynamics, control, communications, and computing, and are often associated with the names Carnot, Bode, Shannon, and Turing. There are encouraging pairwise connections, like the Bode-Shannon theory developed by Martins et al and others, and this theme will explore the progress and potential for further integration. Also encouraging is the opportunity for overcoming hard limits when new connections are made, such as the relationship between proof complexity and problem fragility.<br />
<br />
* ''Short proofs'' - in general, overcoming the apparent computational intractability of analysis and design of complex networks is a central challenge, from formal verification of programs and protocols to the robustness analysis of the dynamics of biological networks and advanced technologies. Here the apparent asymmetry between NP/coNP is as significant as that between P/NP, and moving from analysis to synthesis involves higher complexity classes in fundamental ways. Substantial progress has been made recently in creating frameworks to systematically search for short proofs, but the research communities involved and the results are again somewhat fragmented. Fortunately there is also encouraging progress in creating a more unified framework, motivated by new connections within mathematics, the pervasive role of duality, and the concept of "complexity implies fragility" from the first theme.<br />
<br />
* ''Small models'' - an important route to short proofs is finding small models of complex phenomena through model identification from data, and model reduction. Again, there has been substantial recent progress within relatively fragmented research communities, with encouraging results that suggest the potential for a richer and more unified framework.<br />
<br />
* ''Architecture'' - a cross-cutting theme in the background throughout the workshop will be the challenge of a theory of ''architecture,'' as in the claim that "the architecture of the cell and the Internet have enabled their robustness and evolvability." Despite its widespread usage, there is little formalization of the concept and essentially no theory. The existing hard limits theories all assume architectures a priori which are incompatible and incomparable, and thus offer little guidance in the tradeoffs associated with architecture design. Short proofs and small models also arise only in the context of a priori specified proof and modeling architectures. A diverse set of examples of successful and unsuccessful architectures in technology and biology are now available, and motivate the study of a theory. More unified theories of hard limits, short proofs, and small models appear to be essential first steps towards a theory of architecture.<br />
<br />
== Invited speakers (confirmed) ==<br />
<br />
* Samuel Buss, UC, San Diego<br />
* Mung Chiang, Princeton <br />
* Ali Jadbabaie, Penn<br />
* Neil Gershenfeld, MIT<br />
* Keith Glover, Cambridge <br />
* Bill Helton, UC, San Diego<br />
* Mustafa Khammash, UC, Santa Barbara<br />
* Sanjay Lall, Stanford<br />
* Nuno Martins, U. Maryland <br />
* Antonis Papachristodoulou, Oxford<br />
* Pablo Parrilo, MIT<br />
* Mihai Putinar, UC, Santa Barbara<br />
* Lawrence Saul, UC, San Diego<br />
* Christina Smolke, Caltech<br />
* Lin Xiao, Microsoft Research<br />
<br />
== Caltech organizers and speakers ==<br />
* Jean-Charles Delvenne, John Doyle, Maryam Fazel, Sichard Murray, Ben Recht, Henrik Sandberg<br />
<br />
== Agenda ==<br />
{| width=100% border=1 <br />
|-<br />
|<br />
'''Mon(Tutorial), Tue-Thur (workshop), Fri(Student talks)''' <br />
|-<br />
|<br />
'''Mon-Thur (workshop)''' - Daily schedule<br />
{{agenda begin}}<br />
{{agenda item|08:00|Breakfast (buffet)}}<br />
{{agenda item|08:30|Early morning talks}}<br />
{{agenda item|10:15|Morning break}}<br />
{{agenda item|10:45|Late morning talks}}<br />
{{agenda item|12:15|Lunch (buffet)}}<br />
{{agenda item|13:00|Early afternoon talks}}<br />
{{agenda item|14:30|Afternoon break}}<br />
{{agenda item|14:45|Late afternoon talks}}<br />
{{agenda item|16:00|Afternoon break until dinner}}<br />
{{agenda item|18:00|Dinner (buffet, Tue-Wed only)}}<br />
{{agenda item|18:30|Dinner talk (Tue-Wed only)}}<br />
{{agenda item|19:30|Dessert, wine, and...}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
|-<br />
|<br />
'''Monday''' - Tutorial speaker list<br />
* Schedule TBD: Pablo Parrilo, John Doyle, Maryam Fazel, Xin Liu, Nuno Martins, Ben Recht, Lijun Chen<br />
|-<br />
|<br />
'''Tuesday''' - Hard Limits<br />
{{agenda begin}}<br />
{{agenda item|08:30|John Doyle, Workshop Overview}}<br />
{{agenda item| |Henrik Sandberg/Jean-Charles Delvenne: Control, information, and statistical mechanics}}<br />
{{agenda item| |Nuno Martins: Communications and control}}<br />
{{agenda item| |Pablo Parrilo: Intro to computational complexity}}<br />
{{agenda item|13:00|Pablo Parrilo: Computational complexity and formal methods}}<br />
{{agenda item| |Mustafa Khammash: Complexity of the chemical master equation}}<br />
{{agenda item| |Maryam Fazel, Dennice Gayme, Ben Recht: Complexity implies fragility}}<br />
{{agenda item| |Pablo Parrilo/John Doyle: Recap and wrapup}}<br />
{{agenda item|18:30|Christina Smolke: Regulatory mechanisms in natural and synthetic biology}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Wednesday''' - Short Proofs<br />
{{agenda begin}}<br />
{{agenda item|08:30|Pablo Parrilo, Day Overview}}<br />
{{agenda item| |Mihai Putinar: Polynomial proofs and operator theory}}<br />
{{agenda item| |Samuel Buss: Proof systems}}<br />
{{agenda item| |Bill Helton: Scale-independent proofs in systems and control}}<br />
{{agenda item|13:00|Carla Gomes/Bart Selman: SAT Solvers and state of the art}}<br />
{{agenda item| |John Doyle: Layering architectures, examples}}<br />
{{agenda item| |Mung Chiang: Layering, optimization, and duality}}<br />
{{agenda item| |Parrilo: Recap and wrapup}}<br />
{{agenda item|16:30|Neil Gershenfeld: Math as computer programming}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Thursday''' - Small Models<br />
{{agenda begin}}<br />
{{agenda item|08:30|Ben Recht, Lin Xiao: Day Overview}}<br />
{{agenda item| |Ali J/ Sanj L/Antonis P: Networks and decentralized control }}<br />
{{agenda item| |Keith Glover, Model reduction and system ID}}<br />
{{agenda item|13:00|Lawrence Saul, Spectral methods in machine learning}}<br />
{{agenda item| |Ben Recht, Lin Xiao: Convex optimization approaches and recap}}<br />
{{agenda item| |Parrilo: Recap and wrapup}}<br />
{{agenda item|16:00|Adjourn, dinner on own}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Friday''' - Student talks<br />
{{agenda begin}}<br />
{{agenda item|09:00|Breakfast (buffet)}}<br />
{{agenda item|09:30|Morning talks and break}}<br />
{{agenda item|12:00|Lunch (buffet)}}<br />
{{agenda item|13:00|Afternoon talks and break}}<br />
{{agenda item|16:00|End}}<br />
{{agenda end}}<br />
|}<br />
<br />
== Additional Information ==<br />
<br />
The main workshop will be held on 15-17 August 2006 in Pasadena, CA, with additional sessions on Monday and Friday for interested participants:<br />
<br />
* Monday: tutorial sessions<br />
* Tuesday: Hard Limits <br />
* Wednesday: Short Proofs <br />
* Thursday: Small Models<br />
* Friday: student presentations<br><br />
* [http://www.cds.caltech.edu/~murray/connections/register.html Register to attend]<br><br />
* [[Connections II Participants|Participants (restricted page)]]<br />
<br />
The Connections workshop is sponsored by Caltech and the Air Force Office of Scientific Research.</div>Doylehttps://murray.cds.caltech.edu/index.php?title=Connections_II&diff=4361Connections II2006-08-11T22:17:40Z<p>Doyle: /* Agenda */</p>
<hr />
<div><table align=center width=100%><br />
<tr><br />
<td rowspan=3 align=center>[[Image:citlogo.png|75px]]</td><br />
<td align=center><font size="+2" color=blue>Connections II:</font></td><br />
<td rowspan=3 align=center>[[Image:afosrlogo.png|85px]]</td><br />
<tr><td align=center><font size="+2" color = blue> Fundamentals of Network Science</font></td><br />
<tr><td align=center><font size="+1" color=blue>14-18 August 2006 <br> Pasadena, CA</font></td><br />
</table><br />
<br />
<!-- Table of Contents --><br />
{| width=100% border = 1<br />
|-<br />
| width=20% align=center | [[#Agenda|Agenda]] <br />
| width=20% align=center | [http://www.cds.caltech.edu/~murray/connections/register.html Register]<br />
| width=20% align=center | Participants<br />
| width=20% align=center | [[Connections_II_travel|Travel Info]]<br />
| width=20% align=center | [http://www.cds.caltech.edu CDS Home]<br />
|} __NOTOC__<br />
<br />
== Description ==<br />
<br />
The ''Connections'' workshop series pulls together researchers in mathematics,<br />
science and engineering who bring together novel ideas and tools from<br />
outside their traditional training to influence problems in areas as diverse<br />
as networking protocols, systems biology, ecology, geophysics, finance,<br />
fluid mechanics, and multiscale physics. An underlying theme of this<br />
workshop is to look forward to ways in which future scientists can be<br />
educated in mathematical, computational, and quantitative methods, to<br />
prepare them to interact broadly from the time they are students and<br />
throughout their academic careers. <br />
<br />
The first Connections workshop, held at Caltech in July 2004, brought<br />
together over 200 researchers in the fields of mathematics, biology,<br />
physics, engineering and other disciplines to participate in a 3 day<br />
conference exploring the connections between diverse applications and common<br />
underlying mathematics, particularly with regard to the role of uncertainty<br />
and robustness in complex systems. For the second Connections workshop, we<br />
plan to focus on the connections within the mathematics that would form the<br />
foundation of a theoretical framework for network science, still motivated<br />
by the diverse applications in science and technology that were focus of<br />
Connections I. <br />
<br />
We are organizing the activities around three main themes (roughly one each<br />
day) of Hard Limits, Short Proofs, and Small Models, together with the<br />
crosscutting theme of Architecture:<br />
<br />
* ''Hard limits'' - a major challenge in network science is to understand the fundamental limits on networks due to their components and their interconnection. One challenge is unifying and extending the previously fragmented hard limit theories that arise in thermodynamics, control, communications, and computing, and are often associated with the names Carnot, Bode, Shannon, and Turing. There are encouraging pairwise connections, like the Bode-Shannon theory developed by Martins et al and others, and this theme will explore the progress and potential for further integration. Also encouraging is the opportunity for overcoming hard limits when new connections are made, such as the relationship between proof complexity and problem fragility.<br />
<br />
* ''Short proofs'' - in general, overcoming the apparent computational intractability of analysis and design of complex networks is a central challenge, from formal verification of programs and protocols to the robustness analysis of the dynamics of biological networks and advanced technologies. Here the apparent asymmetry between NP/coNP is as significant as that between P/NP, and moving from analysis to synthesis involves higher complexity classes in fundamental ways. Substantial progress has been made recently in creating frameworks to systematically search for short proofs, but the research communities involved and the results are again somewhat fragmented. Fortunately there is also encouraging progress in creating a more unified framework, motivated by new connections within mathematics, the pervasive role of duality, and the concept of "complexity implies fragility" from the first theme.<br />
<br />
* ''Small models'' - an important route to short proofs is finding small models of complex phenomena through model identification from data, and model reduction. Again, there has been substantial recent progress within relatively fragmented research communities, with encouraging results that suggest the potential for a richer and more unified framework.<br />
<br />
* ''Architecture'' - a cross-cutting theme in the background throughout the workshop will be the challenge of a theory of ''architecture,'' as in the claim that "the architecture of the cell and the Internet have enabled their robustness and evolvability." Despite its widespread usage, there is little formalization of the concept and essentially no theory. The existing hard limits theories all assume architectures a priori which are incompatible and incomparable, and thus offer little guidance in the tradeoffs associated with architecture design. Short proofs and small models also arise only in the context of a priori specified proof and modeling architectures. A diverse set of examples of successful and unsuccessful architectures in technology and biology are now available, and motivate the study of a theory. More unified theories of hard limits, short proofs, and small models appear to be essential first steps towards a theory of architecture.<br />
<br />
== Invited speakers (confirmed) ==<br />
<br />
* Samuel Buss, UC, San Diego<br />
* Mung Chiang, Princeton <br />
* Ali Jadbabaie, Penn<br />
* Neil Gershenfeld, MIT<br />
* Keith Glover, Cambridge <br />
* Bill Helton, UC, San Diego<br />
* Mustafa Khammash, UC, Santa Barbara<br />
* Sanjay Lall, Stanford<br />
* Nuno Martins, U. Maryland <br />
* Antonis Papachristodoulou, Oxford<br />
* Pablo Parrilo, MIT<br />
* Mihai Putinar, UC, Santa Barbara<br />
* Lawrence Saul, UC, San Diego<br />
* Christina Smolke, Caltech<br />
* Lin Xiao, Microsoft Research<br />
<br />
== Caltech organizers and speakers ==<br />
* Jean-Charles Delvenne, John Doyle, Maryam Fazel, Sichard Murray, Ben Recht, Henrik Sandberg<br />
<br />
== Agenda ==<br />
{| width=100% border=1 <br />
|-<br />
|<br />
'''Mon(Tutorial), Tue-Thur (workshop), Fri(Student talks)''' <br />
|-<br />
|<br />
'''Mon-Thur (workshop)''' - Daily schedule<br />
{{agenda begin}}<br />
{{agenda item|08:00|Breakfast (buffet)}}<br />
{{agenda item|08:30|Early morning talks}}<br />
{{agenda item|10:15|Morning break}}<br />
{{agenda item|10:45|Late morning talks}}<br />
{{agenda item|12:15|Lunch (buffet)}}<br />
{{agenda item|13:00|Early afternoon talks}}<br />
{{agenda item|14:30|Afternoon break}}<br />
{{agenda item|14:45|Late afternoon talks}}<br />
{{agenda item|16:00|Afternoon break until dinner}}<br />
{{agenda item|18:00|Dinner (buffet)}}<br />
{{agenda item|18:30|Dinner talk (Tue-Wed only)}}<br />
{{agenda item|19:30|Dessert, wine, and...}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
|-<br />
|<br />
'''Monday''' - Tutorial speaker list<br />
* Schedule TBD: Pablo Parrilo, John Doyle, Maryam Fazel, Xin Liu, Nuno Martins, Ben Recht, Lijun Chen<br />
|-<br />
|<br />
'''Tuesday''' - Hard Limits<br />
{{agenda begin}}<br />
{{agenda item|08:30|John Doyle, Workshop Overview}}<br />
{{agenda item| |Henrik Sandberg/Jean-Charles Delvenne: Control, information, and statistical mechanics}}<br />
{{agenda item| |Nuno Martins: Communications and control}}<br />
{{agenda item| |Pablo Parrilo: Intro to computational complexity}}<br />
{{agenda item|13:00|Pablo Parrilo: Computational complexity and formal methods}}<br />
{{agenda item| |Mustafa Khammash: Complexity of the chemical master equation}}<br />
{{agenda item| |Maryam Fazel, Dennice Gayme, Ben Recht: Complexity implies fragility}}<br />
{{agenda item| |Pablo Parrilo/John Doyle: Recap and wrapup}}<br />
{{agenda item|18:30|Christina Smolke: Regulatory mechanisms in natural and synthetic biology}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Wednesday''' - Short Proofs<br />
{{agenda begin}}<br />
{{agenda item|08:30|Pablo Parrilo, Day Overview}}<br />
{{agenda item| |Mihai Putinar: Polynomial proofs and operator theory}}<br />
{{agenda item| |Samuel Buss: Proof systems}}<br />
{{agenda item| |Bill Helton: Scale-independent proofs in systems and control}}<br />
{{agenda item|13:00|Carla Gomes/Bart Selman: SAT Solvers and state of the art}}<br />
{{agenda item| |John Doyle: Layering architectures, examples}}<br />
{{agenda item| |Mung Chiang: Layering, optimization, and duality}}<br />
{{agenda item| |Parrilo: Recap and wrapup}}<br />
{{agenda item|16:30|Neil Gershenfeld: Math as computer programming}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Thursday''' - Small Models<br />
{{agenda begin}}<br />
{{agenda item|08:30|Ben Recht, Lin Xiao: Day Overview}}<br />
{{agenda item| |Ali J/ Sanj L/Antonis P: Networks and decentralized control }}<br />
{{agenda item| |Keith Glover, Model reduction and system ID}}<br />
{{agenda item|13:00|Lawrence Saul, Spectral methods in machine learning}}<br />
{{agenda item| |Ben Recht, Lin Xiao: Convex optimization approaches and recap}}<br />
{{agenda item| |Parrilo: Recap and wrapup}}<br />
{{agenda item|16:00|Adjourn, dinner on own}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Friday''' - Student talks<br />
{{agenda begin}}<br />
{{agenda item|09:00|Breakfast (buffet)}}<br />
{{agenda item|09:30|Morning talks and break}}<br />
{{agenda item|12:00|Lunch (buffet)}}<br />
{{agenda item|13:00|Afternoon talks and break}}<br />
{{agenda item|16:00|End}}<br />
{{agenda end}}<br />
|}<br />
<br />
== Additional Information ==<br />
<br />
The main workshop will be held on 15-17 August 2006 in Pasadena, CA, with additional sessions on Monday and Friday for interested participants:<br />
<br />
* Monday: tutorial sessions<br />
* Tuesday: Hard Limits <br />
* Wednesday: Short Proofs <br />
* Thursday: Small Models<br />
* Friday: student presentations<br><br />
* [http://www.cds.caltech.edu/~murray/connections/register.html Register to attend]<br><br />
* [[Connections II Participants|Participants (restricted page)]]<br />
<br />
The Connections workshop is sponsored by Caltech and the Air Force Office of Scientific Research.</div>Doylehttps://murray.cds.caltech.edu/index.php?title=Connections_II&diff=4360Connections II2006-08-11T22:16:36Z<p>Doyle: /* Agenda */</p>
<hr />
<div><table align=center width=100%><br />
<tr><br />
<td rowspan=3 align=center>[[Image:citlogo.png|75px]]</td><br />
<td align=center><font size="+2" color=blue>Connections II:</font></td><br />
<td rowspan=3 align=center>[[Image:afosrlogo.png|85px]]</td><br />
<tr><td align=center><font size="+2" color = blue> Fundamentals of Network Science</font></td><br />
<tr><td align=center><font size="+1" color=blue>14-18 August 2006 <br> Pasadena, CA</font></td><br />
</table><br />
<br />
<!-- Table of Contents --><br />
{| width=100% border = 1<br />
|-<br />
| width=20% align=center | [[#Agenda|Agenda]] <br />
| width=20% align=center | [http://www.cds.caltech.edu/~murray/connections/register.html Register]<br />
| width=20% align=center | Participants<br />
| width=20% align=center | [[Connections_II_travel|Travel Info]]<br />
| width=20% align=center | [http://www.cds.caltech.edu CDS Home]<br />
|} __NOTOC__<br />
<br />
== Description ==<br />
<br />
The ''Connections'' workshop series pulls together researchers in mathematics,<br />
science and engineering who bring together novel ideas and tools from<br />
outside their traditional training to influence problems in areas as diverse<br />
as networking protocols, systems biology, ecology, geophysics, finance,<br />
fluid mechanics, and multiscale physics. An underlying theme of this<br />
workshop is to look forward to ways in which future scientists can be<br />
educated in mathematical, computational, and quantitative methods, to<br />
prepare them to interact broadly from the time they are students and<br />
throughout their academic careers. <br />
<br />
The first Connections workshop, held at Caltech in July 2004, brought<br />
together over 200 researchers in the fields of mathematics, biology,<br />
physics, engineering and other disciplines to participate in a 3 day<br />
conference exploring the connections between diverse applications and common<br />
underlying mathematics, particularly with regard to the role of uncertainty<br />
and robustness in complex systems. For the second Connections workshop, we<br />
plan to focus on the connections within the mathematics that would form the<br />
foundation of a theoretical framework for network science, still motivated<br />
by the diverse applications in science and technology that were focus of<br />
Connections I. <br />
<br />
We are organizing the activities around three main themes (roughly one each<br />
day) of Hard Limits, Short Proofs, and Small Models, together with the<br />
crosscutting theme of Architecture:<br />
<br />
* ''Hard limits'' - a major challenge in network science is to understand the fundamental limits on networks due to their components and their interconnection. One challenge is unifying and extending the previously fragmented hard limit theories that arise in thermodynamics, control, communications, and computing, and are often associated with the names Carnot, Bode, Shannon, and Turing. There are encouraging pairwise connections, like the Bode-Shannon theory developed by Martins et al and others, and this theme will explore the progress and potential for further integration. Also encouraging is the opportunity for overcoming hard limits when new connections are made, such as the relationship between proof complexity and problem fragility.<br />
<br />
* ''Short proofs'' - in general, overcoming the apparent computational intractability of analysis and design of complex networks is a central challenge, from formal verification of programs and protocols to the robustness analysis of the dynamics of biological networks and advanced technologies. Here the apparent asymmetry between NP/coNP is as significant as that between P/NP, and moving from analysis to synthesis involves higher complexity classes in fundamental ways. Substantial progress has been made recently in creating frameworks to systematically search for short proofs, but the research communities involved and the results are again somewhat fragmented. Fortunately there is also encouraging progress in creating a more unified framework, motivated by new connections within mathematics, the pervasive role of duality, and the concept of "complexity implies fragility" from the first theme.<br />
<br />
* ''Small models'' - an important route to short proofs is finding small models of complex phenomena through model identification from data, and model reduction. Again, there has been substantial recent progress within relatively fragmented research communities, with encouraging results that suggest the potential for a richer and more unified framework.<br />
<br />
* ''Architecture'' - a cross-cutting theme in the background throughout the workshop will be the challenge of a theory of ''architecture,'' as in the claim that "the architecture of the cell and the Internet have enabled their robustness and evolvability." Despite its widespread usage, there is little formalization of the concept and essentially no theory. The existing hard limits theories all assume architectures a priori which are incompatible and incomparable, and thus offer little guidance in the tradeoffs associated with architecture design. Short proofs and small models also arise only in the context of a priori specified proof and modeling architectures. A diverse set of examples of successful and unsuccessful architectures in technology and biology are now available, and motivate the study of a theory. More unified theories of hard limits, short proofs, and small models appear to be essential first steps towards a theory of architecture.<br />
<br />
== Invited speakers (confirmed) ==<br />
<br />
* Samuel Buss, UC, San Diego<br />
* Mung Chiang, Princeton <br />
* Ali Jadbabaie, Penn<br />
* Neil Gershenfeld, MIT<br />
* Keith Glover, Cambridge <br />
* Bill Helton, UC, San Diego<br />
* Mustafa Khammash, UC, Santa Barbara<br />
* Sanjay Lall, Stanford<br />
* Nuno Martins, U. Maryland <br />
* Antonis Papachristodoulou, Oxford<br />
* Pablo Parrilo, MIT<br />
* Mihai Putinar, UC, Santa Barbara<br />
* Lawrence Saul, UC, San Diego<br />
* Christina Smolke, Caltech<br />
* Lin Xiao, Microsoft Research<br />
<br />
== Caltech organizers and speakers ==<br />
* Jean-Charles Delvenne, John Doyle, Maryam Fazel, Sichard Murray, Ben Recht, Henrik Sandberg<br />
<br />
== Agenda ==<br />
{| width=100% border=1 <br />
|-<br />
|<br />
'''Mon(Tutorial), Tue-Thur (workshop), Fri(Student talks)''' <br />
|-<br />
|<br />
'''Mon-Thur (workshop)''' - Daily schedule<br />
{{agenda begin}}<br />
{{agenda item|08:00|Breakfast (buffet)}}<br />
{{agenda item|08:30|Early morning talks}}<br />
{{agenda item|10:15|Morning break}}<br />
{{agenda item|10:45|Late morning talks}}<br />
{{agenda item|12:15|Lunch (buffet)}}<br />
{{agenda item|13:00|Early afternoon talks}}<br />
{{agenda item|14:30|Afternoon break}}<br />
{{agenda item|14:45|Late afternoon talks}}<br />
{{agenda item|16:00|Afternoon break until dinner}}<br />
{{agenda item|18:00|Dinner (buffet)}}<br />
{{agenda item|18:30|Dinner talk (Tue-Wed only)}}<br />
{{agenda item|19:30|Dessert, wine, and...}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
|-<br />
|<br />
'''Monday''' - Tutorial speaker list<br />
* Schedule TBD: Pablo Parrilo, John Doyle, Maryam Fazel, Xin Liu, Nuno Martins, Ben Recht, Lijun Chen<br />
|-<br />
|<br />
'''Tuesday''' - Hard Limits<br />
{{agenda begin}}<br />
{{agenda item|08:30|John Doyle, Workshop Overview}}<br />
{{agenda item| |Henrik Sandberg/Jean-Charles Delvenne: Control, information, and statistical mechanics}}<br />
{{agenda item| |Nuno Martins: Communications and control}}<br />
{{agenda item| |Pablo Parrilo: Intro to computational complexity}}<br />
{{agenda item|13:00|Pablo Parrilo: Computational complexity and formal methods}}<br />
{{agenda item| |Mustafa Khammash: Complexity of the chemical master equation}}<br />
{{agenda item| |Maryam Fazel, Dennice Gayme, Ben Recht: Complexity implies fragility}}<br />
{{agenda item| |Pablo Parrilo/John Doyle: Recap and wrapup}}<br />
{{agenda item|18:30|Dinner presentation: Christina Smolke: Regulatory mechanisms in natural and synthetic biology}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Wednesday''' - Short Proofs<br />
{{agenda begin}}<br />
{{agenda item|08:30|Pablo Parrilo, Day Overview}}<br />
{{agenda item| |Mihai Putinar: Polynomial proofs and operator theory}}<br />
{{agenda item| |Samuel Buss: Proof systems}}<br />
{{agenda item| |Bill Helton: Scale-independent proofs in systems and control}}<br />
{{agenda item|13:00|Carla Gomes/Bart Selman: SAT Solvers and state of the art}}<br />
{{agenda item| |John Doyle: Layering architectures, examples}}<br />
{{agenda item| |Mung Chiang: Layering, optimization, and duality}}<br />
{{agenda item| |Parrilo: Recap and wrapup}}<br />
{{agenda item|16:30|Neil Gershenfeld: Math as computer programming}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Thursday''' - Small Models<br />
{{agenda begin}}<br />
{{agenda item|08:30|Ben Recht, Lin Xiao: Day Overview}}<br />
{{agenda item| |Ali J/ Sanj L/Antonis P: Networks and decentralized control }}<br />
{{agenda item| |Keith Glover, Model reduction and system ID}}<br />
{{agenda item|13:00|Lawrence Saul, Spectral methods in machine learning}}<br />
{{agenda item| |Ben Recht, Lin Xiao: Convex optimization approaches and recap}}<br />
{{agenda item| |Parrilo: Recap and wrapup}}<br />
{{agenda item|16:00|Adjourn, dinner on own}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Friday''' - Student talks<br />
{{agenda begin}}<br />
{{agenda item|09:00|Breakfast (buffet)}}<br />
{{agenda item|09:30|Morning talks and break}}<br />
{{agenda item|12:00|Lunch (buffet)}}<br />
{{agenda item|13:00|Afternoon talks and break}}<br />
{{agenda item|16:00|End}}<br />
{{agenda end}}<br />
|}<br />
<br />
== Additional Information ==<br />
<br />
The main workshop will be held on 15-17 August 2006 in Pasadena, CA, with additional sessions on Monday and Friday for interested participants:<br />
<br />
* Monday: tutorial sessions<br />
* Tuesday: Hard Limits <br />
* Wednesday: Short Proofs <br />
* Thursday: Small Models<br />
* Friday: student presentations<br><br />
* [http://www.cds.caltech.edu/~murray/connections/register.html Register to attend]<br><br />
* [[Connections II Participants|Participants (restricted page)]]<br />
<br />
The Connections workshop is sponsored by Caltech and the Air Force Office of Scientific Research.</div>Doylehttps://murray.cds.caltech.edu/index.php?title=Connections_II&diff=4359Connections II2006-08-11T22:15:40Z<p>Doyle: /* Agenda */</p>
<hr />
<div><table align=center width=100%><br />
<tr><br />
<td rowspan=3 align=center>[[Image:citlogo.png|75px]]</td><br />
<td align=center><font size="+2" color=blue>Connections II:</font></td><br />
<td rowspan=3 align=center>[[Image:afosrlogo.png|85px]]</td><br />
<tr><td align=center><font size="+2" color = blue> Fundamentals of Network Science</font></td><br />
<tr><td align=center><font size="+1" color=blue>14-18 August 2006 <br> Pasadena, CA</font></td><br />
</table><br />
<br />
<!-- Table of Contents --><br />
{| width=100% border = 1<br />
|-<br />
| width=20% align=center | [[#Agenda|Agenda]] <br />
| width=20% align=center | [http://www.cds.caltech.edu/~murray/connections/register.html Register]<br />
| width=20% align=center | Participants<br />
| width=20% align=center | [[Connections_II_travel|Travel Info]]<br />
| width=20% align=center | [http://www.cds.caltech.edu CDS Home]<br />
|} __NOTOC__<br />
<br />
== Description ==<br />
<br />
The ''Connections'' workshop series pulls together researchers in mathematics,<br />
science and engineering who bring together novel ideas and tools from<br />
outside their traditional training to influence problems in areas as diverse<br />
as networking protocols, systems biology, ecology, geophysics, finance,<br />
fluid mechanics, and multiscale physics. An underlying theme of this<br />
workshop is to look forward to ways in which future scientists can be<br />
educated in mathematical, computational, and quantitative methods, to<br />
prepare them to interact broadly from the time they are students and<br />
throughout their academic careers. <br />
<br />
The first Connections workshop, held at Caltech in July 2004, brought<br />
together over 200 researchers in the fields of mathematics, biology,<br />
physics, engineering and other disciplines to participate in a 3 day<br />
conference exploring the connections between diverse applications and common<br />
underlying mathematics, particularly with regard to the role of uncertainty<br />
and robustness in complex systems. For the second Connections workshop, we<br />
plan to focus on the connections within the mathematics that would form the<br />
foundation of a theoretical framework for network science, still motivated<br />
by the diverse applications in science and technology that were focus of<br />
Connections I. <br />
<br />
We are organizing the activities around three main themes (roughly one each<br />
day) of Hard Limits, Short Proofs, and Small Models, together with the<br />
crosscutting theme of Architecture:<br />
<br />
* ''Hard limits'' - a major challenge in network science is to understand the fundamental limits on networks due to their components and their interconnection. One challenge is unifying and extending the previously fragmented hard limit theories that arise in thermodynamics, control, communications, and computing, and are often associated with the names Carnot, Bode, Shannon, and Turing. There are encouraging pairwise connections, like the Bode-Shannon theory developed by Martins et al and others, and this theme will explore the progress and potential for further integration. Also encouraging is the opportunity for overcoming hard limits when new connections are made, such as the relationship between proof complexity and problem fragility.<br />
<br />
* ''Short proofs'' - in general, overcoming the apparent computational intractability of analysis and design of complex networks is a central challenge, from formal verification of programs and protocols to the robustness analysis of the dynamics of biological networks and advanced technologies. Here the apparent asymmetry between NP/coNP is as significant as that between P/NP, and moving from analysis to synthesis involves higher complexity classes in fundamental ways. Substantial progress has been made recently in creating frameworks to systematically search for short proofs, but the research communities involved and the results are again somewhat fragmented. Fortunately there is also encouraging progress in creating a more unified framework, motivated by new connections within mathematics, the pervasive role of duality, and the concept of "complexity implies fragility" from the first theme.<br />
<br />
* ''Small models'' - an important route to short proofs is finding small models of complex phenomena through model identification from data, and model reduction. Again, there has been substantial recent progress within relatively fragmented research communities, with encouraging results that suggest the potential for a richer and more unified framework.<br />
<br />
* ''Architecture'' - a cross-cutting theme in the background throughout the workshop will be the challenge of a theory of ''architecture,'' as in the claim that "the architecture of the cell and the Internet have enabled their robustness and evolvability." Despite its widespread usage, there is little formalization of the concept and essentially no theory. The existing hard limits theories all assume architectures a priori which are incompatible and incomparable, and thus offer little guidance in the tradeoffs associated with architecture design. Short proofs and small models also arise only in the context of a priori specified proof and modeling architectures. A diverse set of examples of successful and unsuccessful architectures in technology and biology are now available, and motivate the study of a theory. More unified theories of hard limits, short proofs, and small models appear to be essential first steps towards a theory of architecture.<br />
<br />
== Invited speakers (confirmed) ==<br />
<br />
* Samuel Buss, UC, San Diego<br />
* Mung Chiang, Princeton <br />
* Ali Jadbabaie, Penn<br />
* Neil Gershenfeld, MIT<br />
* Keith Glover, Cambridge <br />
* Bill Helton, UC, San Diego<br />
* Mustafa Khammash, UC, Santa Barbara<br />
* Sanjay Lall, Stanford<br />
* Nuno Martins, U. Maryland <br />
* Antonis Papachristodoulou, Oxford<br />
* Pablo Parrilo, MIT<br />
* Mihai Putinar, UC, Santa Barbara<br />
* Lawrence Saul, UC, San Diego<br />
* Christina Smolke, Caltech<br />
* Lin Xiao, Microsoft Research<br />
<br />
== Caltech organizers and speakers ==<br />
* Jean-Charles Delvenne, John Doyle, Maryam Fazel, Sichard Murray, Ben Recht, Henrik Sandberg<br />
<br />
== Agenda ==<br />
{| width=100% border=1 <br />
|-<br />
|<br />
'''Mon(Tutorial), Tue-Thur (workshop), Fri(Student talks)''' <br />
|-<br />
|<br />
'''Mon-Thur (workshop)''' - Daily schedule<br />
{{agenda begin}}<br />
{{agenda item|08:00|Breakfast (buffet)}}<br />
{{agenda item|08:30|Early morning talks}}<br />
{{agenda item|10:15|Morning break}}<br />
{{agenda item|10:45|Late morning talks}}<br />
{{agenda item|12:15|Lunch (buffet)}}<br />
{{agenda item|13:00p|Early afternoon talks}}<br />
{{agenda item|14:30|Afternoon break}}<br />
{{agenda item|14:45|Late afternoon talks}}<br />
{{agenda item| |John Doyle: Recap and wrapup}}<br />
{{agenda item|16:00|Afternoon break}}<br />
{{agenda item|18:00|Dinner (buffet)}}<br />
{{agenda item|18:30|Dinner talk (Tue-Wed only)}}<br />
{{agenda item|19:30|Dessert, wine, and...}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
|-<br />
|<br />
'''Monday''' - Tutorial speaker list<br />
* Schedule TBD: Pablo Parrilo, John Doyle, Maryam Fazel, Xin Liu, Nuno Martins, Ben Recht, Lijun Chen<br />
|-<br />
|<br />
'''Tuesday''' - Hard Limits<br />
{{agenda begin}}<br />
{{agenda item|08:30|John Doyle, Workshop Overview}}<br />
{{agenda item| |Henrik Sandberg/Jean-Charles Delvenne: Control, information, and statistical mechanics}}<br />
{{agenda item| |Nuno Martins: Communications and control}}<br />
{{agenda item| |Pablo Parrilo: Intro to computational complexity}}<br />
{{agenda item|13:00|Pablo Parrilo: Computational complexity and formal methods}}<br />
{{agenda item| |Mustafa Khammash: Complexity of the chemical master equation}}<br />
{{agenda item| |Maryam Fazel, Dennice Gayme, Ben Recht: Complexity implies fragility}}<br />
{{agenda item| |Pablo Parrilo/John Doyle: Recap and wrapup}}<br />
{{agenda item|18:30|Dinner presentation: Christina Smolke: Regulatory mechanisms in natural and synthetic biology}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Wednesday''' - Short Proofs<br />
{{agenda begin}}<br />
{{agenda item|08:30|Pablo Parrilo, Day Overview}}<br />
{{agenda item| |Mihai Putinar: Polynomial proofs and operator theory}}<br />
{{agenda item| |Samuel Buss: Proof systems}}<br />
{{agenda item| |Bill Helton: Scale-independent proofs in systems and control}}<br />
{{agenda item|13:00|Carla Gomes/Bart Selman: SAT Solvers and state of the art}}<br />
{{agenda item| |John Doyle: Layering architectures, examples}}<br />
{{agenda item| |Mung Chiang: Layering, optimization, and duality}}<br />
{{agenda item| |Parrilo: Recap and wrapup}}<br />
{{agenda item|16:30|Neil Gershenfeld: Math as computer programming}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Thursday''' - Small Models<br />
{{agenda begin}}<br />
{{agenda item|08:30|Ben Recht, Lin Xiao: Day Overview}}<br />
{{agenda item| |Ali J/ Sanj L/Antonis P: Networks and decentralized control }}<br />
{{agenda item| |Keith Glover, Model reduction and system ID}}<br />
{{agenda item|13:00|Lawrence Saul, Spectral methods in machine learning}}<br />
{{agenda item| |Ben Recht, Lin Xiao: Convex optimization approaches and recap}}<br />
{{agenda item| |Parrilo: Recap and wrapup}}<br />
{{agenda item|16:00|Adjourn, dinner on own}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Friday''' - Student talks<br />
{{agenda begin}}<br />
{{agenda item|09:00|Breakfast (buffet)}}<br />
{{agenda item|09:30|Morning talks and break}}<br />
{{agenda item|12:00|Lunch (buffet)}}<br />
{{agenda item|13:00|Afternoon talks and break}}<br />
{{agenda item|16:00|End}}<br />
{{agenda end}}<br />
|}<br />
<br />
== Additional Information ==<br />
<br />
The main workshop will be held on 15-17 August 2006 in Pasadena, CA, with additional sessions on Monday and Friday for interested participants:<br />
<br />
* Monday: tutorial sessions<br />
* Tuesday: Hard Limits <br />
* Wednesday: Short Proofs <br />
* Thursday: Small Models<br />
* Friday: student presentations<br><br />
* [http://www.cds.caltech.edu/~murray/connections/register.html Register to attend]<br><br />
* [[Connections II Participants|Participants (restricted page)]]<br />
<br />
The Connections workshop is sponsored by Caltech and the Air Force Office of Scientific Research.</div>Doylehttps://murray.cds.caltech.edu/index.php?title=Connections_II&diff=4358Connections II2006-08-11T22:14:50Z<p>Doyle: /* Confirmed speakers */</p>
<hr />
<div><table align=center width=100%><br />
<tr><br />
<td rowspan=3 align=center>[[Image:citlogo.png|75px]]</td><br />
<td align=center><font size="+2" color=blue>Connections II:</font></td><br />
<td rowspan=3 align=center>[[Image:afosrlogo.png|85px]]</td><br />
<tr><td align=center><font size="+2" color = blue> Fundamentals of Network Science</font></td><br />
<tr><td align=center><font size="+1" color=blue>14-18 August 2006 <br> Pasadena, CA</font></td><br />
</table><br />
<br />
<!-- Table of Contents --><br />
{| width=100% border = 1<br />
|-<br />
| width=20% align=center | [[#Agenda|Agenda]] <br />
| width=20% align=center | [http://www.cds.caltech.edu/~murray/connections/register.html Register]<br />
| width=20% align=center | Participants<br />
| width=20% align=center | [[Connections_II_travel|Travel Info]]<br />
| width=20% align=center | [http://www.cds.caltech.edu CDS Home]<br />
|} __NOTOC__<br />
<br />
== Description ==<br />
<br />
The ''Connections'' workshop series pulls together researchers in mathematics,<br />
science and engineering who bring together novel ideas and tools from<br />
outside their traditional training to influence problems in areas as diverse<br />
as networking protocols, systems biology, ecology, geophysics, finance,<br />
fluid mechanics, and multiscale physics. An underlying theme of this<br />
workshop is to look forward to ways in which future scientists can be<br />
educated in mathematical, computational, and quantitative methods, to<br />
prepare them to interact broadly from the time they are students and<br />
throughout their academic careers. <br />
<br />
The first Connections workshop, held at Caltech in July 2004, brought<br />
together over 200 researchers in the fields of mathematics, biology,<br />
physics, engineering and other disciplines to participate in a 3 day<br />
conference exploring the connections between diverse applications and common<br />
underlying mathematics, particularly with regard to the role of uncertainty<br />
and robustness in complex systems. For the second Connections workshop, we<br />
plan to focus on the connections within the mathematics that would form the<br />
foundation of a theoretical framework for network science, still motivated<br />
by the diverse applications in science and technology that were focus of<br />
Connections I. <br />
<br />
We are organizing the activities around three main themes (roughly one each<br />
day) of Hard Limits, Short Proofs, and Small Models, together with the<br />
crosscutting theme of Architecture:<br />
<br />
* ''Hard limits'' - a major challenge in network science is to understand the fundamental limits on networks due to their components and their interconnection. One challenge is unifying and extending the previously fragmented hard limit theories that arise in thermodynamics, control, communications, and computing, and are often associated with the names Carnot, Bode, Shannon, and Turing. There are encouraging pairwise connections, like the Bode-Shannon theory developed by Martins et al and others, and this theme will explore the progress and potential for further integration. Also encouraging is the opportunity for overcoming hard limits when new connections are made, such as the relationship between proof complexity and problem fragility.<br />
<br />
* ''Short proofs'' - in general, overcoming the apparent computational intractability of analysis and design of complex networks is a central challenge, from formal verification of programs and protocols to the robustness analysis of the dynamics of biological networks and advanced technologies. Here the apparent asymmetry between NP/coNP is as significant as that between P/NP, and moving from analysis to synthesis involves higher complexity classes in fundamental ways. Substantial progress has been made recently in creating frameworks to systematically search for short proofs, but the research communities involved and the results are again somewhat fragmented. Fortunately there is also encouraging progress in creating a more unified framework, motivated by new connections within mathematics, the pervasive role of duality, and the concept of "complexity implies fragility" from the first theme.<br />
<br />
* ''Small models'' - an important route to short proofs is finding small models of complex phenomena through model identification from data, and model reduction. Again, there has been substantial recent progress within relatively fragmented research communities, with encouraging results that suggest the potential for a richer and more unified framework.<br />
<br />
* ''Architecture'' - a cross-cutting theme in the background throughout the workshop will be the challenge of a theory of ''architecture,'' as in the claim that "the architecture of the cell and the Internet have enabled their robustness and evolvability." Despite its widespread usage, there is little formalization of the concept and essentially no theory. The existing hard limits theories all assume architectures a priori which are incompatible and incomparable, and thus offer little guidance in the tradeoffs associated with architecture design. Short proofs and small models also arise only in the context of a priori specified proof and modeling architectures. A diverse set of examples of successful and unsuccessful architectures in technology and biology are now available, and motivate the study of a theory. More unified theories of hard limits, short proofs, and small models appear to be essential first steps towards a theory of architecture.<br />
<br />
== Invited speakers (confirmed) ==<br />
<br />
* Samuel Buss, UC, San Diego<br />
* Mung Chiang, Princeton <br />
* Ali Jadbabaie, Penn<br />
* Neil Gershenfeld, MIT<br />
* Keith Glover, Cambridge <br />
* Bill Helton, UC, San Diego<br />
* Mustafa Khammash, UC, Santa Barbara<br />
* Sanjay Lall, Stanford<br />
* Nuno Martins, U. Maryland <br />
* Antonis Papachristodoulou, Oxford<br />
* Pablo Parrilo, MIT<br />
* Mihai Putinar, UC, Santa Barbara<br />
* Lawrence Saul, UC, San Diego<br />
* Christina Smolke, Caltech<br />
* Lin Xiao, Microsoft Research<br />
<br />
== Caltech organizers and speakers ==<br />
* Jean-Charles Delvenne, John Doyle, Maryam Fazel, Sichard Murray, Ben Recht, Henrik Sandberg<br />
<br />
== Agenda ==<br />
{| width=100% border=1 <br />
|-<br />
|<br />
'''Mon(Tutorial), Tue-Thur (workshop), Fri(Student talks)''' <br />
|-<br />
|<br />
'''Mon-Thur (workshop)''' - Daily schedule<br />
{{agenda begin}}<br />
{{agenda item|08:00|Breakfast (buffet)}}<br />
{{agenda item|08:30|Early morning talks}}<br />
{{agenda item|10:15|Morning break}}<br />
{{agenda item|10:45|Late morning talks}}<br />
{{agenda item|12:15|Lunch (buffet)}}<br />
{{agenda item|13:00p|Early afternoon talks}}<br />
{{agenda item|14:30|Afternoon break}}<br />
{{agenda item|14:45|Late afternoon talks}}<br />
{{agenda item| |John Doyle: Recap and wrapup}}<br />
{{agenda item|16:00|Afternoon break}}<br />
{{agenda item|18:00|Dinner (buffet)}}<br />
{{agenda item|18:30|Dinner talk (Tue-Wed only)}}<br />
{{agenda item|19:30|Dessert, wine, and...}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
|-<br />
|<br />
'''Monday''' - Speaker list<br />
* Schedule TBD: Pablo Parrilo, John Doyle, Maryam Fazel, Xin Liu, Nuno Martins, Ben Recht, Lijun Chen<br />
|-<br />
|<br />
'''Tuesday''' - Hard Limits<br />
{{agenda begin}}<br />
{{agenda item|08:30|John Doyle, Workshop Overview}}<br />
{{agenda item| |Henrik Sandberg/Jean-Charles Delvenne: Control, information, and statistical mechanics}}<br />
{{agenda item| |Nuno Martins: Communications and control}}<br />
{{agenda item| |Pablo Parrilo: Intro to computational complexity}}<br />
{{agenda item|13:00|Pablo Parrilo: Computational complexity and formal methods}}<br />
{{agenda item| |Mustafa Khammash: Complexity of the chemical master equation}}<br />
{{agenda item| |Maryam Fazel, Dennice Gayme, Ben Recht: Complexity implies fragility}}<br />
{{agenda item| |Pablo Parrilo/John Doyle: Recap and wrapup}}<br />
{{agenda item|18:30|Dinner presentation: Christina Smolke: Regulatory mechanisms in natural and synthetic biology}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Wednesday''' - Short Proofs<br />
{{agenda begin}}<br />
{{agenda item|08:30|Pablo Parrilo, Day Overview}}<br />
{{agenda item| |Mihai Putinar: Polynomial proofs and operator theory}}<br />
{{agenda item| |Samuel Buss: Proof systems}}<br />
{{agenda item| |Bill Helton: Scale-independent proofs in systems and control}}<br />
{{agenda item|13:00|Carla Gomes/Bart Selman: SAT Solvers and state of the art}}<br />
{{agenda item| |John Doyle: Layering architectures, examples}}<br />
{{agenda item| |Mung Chiang: Layering, optimization, and duality}}<br />
{{agenda item| |Parrilo: Recap and wrapup}}<br />
{{agenda item|16:30|Neil Gershenfeld: Math as computer programming}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Thursday''' - Small Models<br />
{{agenda begin}}<br />
{{agenda item|08:30|Ben Recht, Lin Xiao: Day Overview}}<br />
{{agenda item| |Ali J/ Sanj L/Antonis P: Networks and decentralized control }}<br />
{{agenda item| |Keith Glover, Model reduction and system ID}}<br />
{{agenda item|13:00|Lawrence Saul, Spectral methods in machine learning}}<br />
{{agenda item| |Ben Recht, Lin Xiao: Convex optimization approaches and recap}}<br />
{{agenda item| |Parrilo: Recap and wrapup}}<br />
{{agenda item|16:00|Adjourn, dinner on own}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Friday''' - Student talks<br />
{{agenda begin}}<br />
{{agenda item|09:00|Breakfast (buffet)}}<br />
{{agenda item|09:30|Morning talks and break}}<br />
{{agenda item|12:00|Lunch (buffet)}}<br />
{{agenda item|13:00|Afternoon talks and break}}<br />
{{agenda item|16:00|End}}<br />
{{agenda end}}<br />
|}<br />
<br />
== Additional Information ==<br />
<br />
The main workshop will be held on 15-17 August 2006 in Pasadena, CA, with additional sessions on Monday and Friday for interested participants:<br />
<br />
* Monday: tutorial sessions<br />
* Tuesday: Hard Limits <br />
* Wednesday: Short Proofs <br />
* Thursday: Small Models<br />
* Friday: student presentations<br><br />
* [http://www.cds.caltech.edu/~murray/connections/register.html Register to attend]<br><br />
* [[Connections II Participants|Participants (restricted page)]]<br />
<br />
The Connections workshop is sponsored by Caltech and the Air Force Office of Scientific Research.</div>Doylehttps://murray.cds.caltech.edu/index.php?title=Connections_II&diff=4357Connections II2006-08-11T22:07:04Z<p>Doyle: /* Agenda */</p>
<hr />
<div><table align=center width=100%><br />
<tr><br />
<td rowspan=3 align=center>[[Image:citlogo.png|75px]]</td><br />
<td align=center><font size="+2" color=blue>Connections II:</font></td><br />
<td rowspan=3 align=center>[[Image:afosrlogo.png|85px]]</td><br />
<tr><td align=center><font size="+2" color = blue> Fundamentals of Network Science</font></td><br />
<tr><td align=center><font size="+1" color=blue>14-18 August 2006 <br> Pasadena, CA</font></td><br />
</table><br />
<br />
<!-- Table of Contents --><br />
{| width=100% border = 1<br />
|-<br />
| width=20% align=center | [[#Agenda|Agenda]] <br />
| width=20% align=center | [http://www.cds.caltech.edu/~murray/connections/register.html Register]<br />
| width=20% align=center | Participants<br />
| width=20% align=center | [[Connections_II_travel|Travel Info]]<br />
| width=20% align=center | [http://www.cds.caltech.edu CDS Home]<br />
|} __NOTOC__<br />
<br />
== Description ==<br />
<br />
The ''Connections'' workshop series pulls together researchers in mathematics,<br />
science and engineering who bring together novel ideas and tools from<br />
outside their traditional training to influence problems in areas as diverse<br />
as networking protocols, systems biology, ecology, geophysics, finance,<br />
fluid mechanics, and multiscale physics. An underlying theme of this<br />
workshop is to look forward to ways in which future scientists can be<br />
educated in mathematical, computational, and quantitative methods, to<br />
prepare them to interact broadly from the time they are students and<br />
throughout their academic careers. <br />
<br />
The first Connections workshop, held at Caltech in July 2004, brought<br />
together over 200 researchers in the fields of mathematics, biology,<br />
physics, engineering and other disciplines to participate in a 3 day<br />
conference exploring the connections between diverse applications and common<br />
underlying mathematics, particularly with regard to the role of uncertainty<br />
and robustness in complex systems. For the second Connections workshop, we<br />
plan to focus on the connections within the mathematics that would form the<br />
foundation of a theoretical framework for network science, still motivated<br />
by the diverse applications in science and technology that were focus of<br />
Connections I. <br />
<br />
We are organizing the activities around three main themes (roughly one each<br />
day) of Hard Limits, Short Proofs, and Small Models, together with the<br />
crosscutting theme of Architecture:<br />
<br />
* ''Hard limits'' - a major challenge in network science is to understand the fundamental limits on networks due to their components and their interconnection. One challenge is unifying and extending the previously fragmented hard limit theories that arise in thermodynamics, control, communications, and computing, and are often associated with the names Carnot, Bode, Shannon, and Turing. There are encouraging pairwise connections, like the Bode-Shannon theory developed by Martins et al and others, and this theme will explore the progress and potential for further integration. Also encouraging is the opportunity for overcoming hard limits when new connections are made, such as the relationship between proof complexity and problem fragility.<br />
<br />
* ''Short proofs'' - in general, overcoming the apparent computational intractability of analysis and design of complex networks is a central challenge, from formal verification of programs and protocols to the robustness analysis of the dynamics of biological networks and advanced technologies. Here the apparent asymmetry between NP/coNP is as significant as that between P/NP, and moving from analysis to synthesis involves higher complexity classes in fundamental ways. Substantial progress has been made recently in creating frameworks to systematically search for short proofs, but the research communities involved and the results are again somewhat fragmented. Fortunately there is also encouraging progress in creating a more unified framework, motivated by new connections within mathematics, the pervasive role of duality, and the concept of "complexity implies fragility" from the first theme.<br />
<br />
* ''Small models'' - an important route to short proofs is finding small models of complex phenomena through model identification from data, and model reduction. Again, there has been substantial recent progress within relatively fragmented research communities, with encouraging results that suggest the potential for a richer and more unified framework.<br />
<br />
* ''Architecture'' - a cross-cutting theme in the background throughout the workshop will be the challenge of a theory of ''architecture,'' as in the claim that "the architecture of the cell and the Internet have enabled their robustness and evolvability." Despite its widespread usage, there is little formalization of the concept and essentially no theory. The existing hard limits theories all assume architectures a priori which are incompatible and incomparable, and thus offer little guidance in the tradeoffs associated with architecture design. Short proofs and small models also arise only in the context of a priori specified proof and modeling architectures. A diverse set of examples of successful and unsuccessful architectures in technology and biology are now available, and motivate the study of a theory. More unified theories of hard limits, short proofs, and small models appear to be essential first steps towards a theory of architecture.<br />
<br />
== Confirmed speakers ==<br />
<br />
* Samuel Buss, University of California, San Diego<br />
* Mung Chiang, Princeton University<br />
* John Doyle, California Institute of Technology<br />
* Keith Glover, Cambridge University<br />
* Bill Helton, University of California at San Diego<br />
* Mustafa Khammash, Univeristy of California, Santa Barbara<br />
* Nuno Martins, U. Maryland <br />
* Pablo Parrilo, Massuchusetts Institute of Technology<br />
* Mihai Putinar, University of California, Santa Barbara<br />
* Ben Recht, California Institute of Technology<br />
* Lawrence Saul, University of California, San Diego<br />
* Lin Xiao, Microsoft Research<br />
<br />
<br />
<!-- * Christina Smolke (dinner) --><br />
<!-- * Stephen Smale? (dinner) --><br />
<br />
== Agenda ==<br />
{| width=100% border=1 <br />
|-<br />
|<br />
'''Mon(Tutorial), Tue-Thur (workshop), Fri(Student talks)''' <br />
|-<br />
|<br />
'''Mon-Thur (workshop)''' - Daily schedule<br />
{{agenda begin}}<br />
{{agenda item|08:00|Breakfast (buffet)}}<br />
{{agenda item|08:30|Early morning talks}}<br />
{{agenda item|10:15|Morning break}}<br />
{{agenda item|10:45|Late morning talks}}<br />
{{agenda item|12:15|Lunch (buffet)}}<br />
{{agenda item|13:00p|Early afternoon talks}}<br />
{{agenda item|14:30|Afternoon break}}<br />
{{agenda item|14:45|Late afternoon talks}}<br />
{{agenda item| |John Doyle: Recap and wrapup}}<br />
{{agenda item|16:00|Afternoon break}}<br />
{{agenda item|18:00|Dinner (buffet)}}<br />
{{agenda item|18:30|Dinner talk (Tue-Wed only)}}<br />
{{agenda item|19:30|Dessert, wine, and...}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
|-<br />
|<br />
'''Monday''' - Speaker list<br />
* Schedule TBD: Pablo Parrilo, John Doyle, Maryam Fazel, Xin Liu, Nuno Martins, Ben Recht, Lijun Chen<br />
|-<br />
|<br />
'''Tuesday''' - Hard Limits<br />
{{agenda begin}}<br />
{{agenda item|08:30|John Doyle, Workshop Overview}}<br />
{{agenda item| |Henrik Sandberg/Jean-Charles Delvenne: Control, information, and statistical mechanics}}<br />
{{agenda item| |Nuno Martins: Communications and control}}<br />
{{agenda item| |Pablo Parrilo: Intro to computational complexity}}<br />
{{agenda item|13:00|Pablo Parrilo: Computational complexity and formal methods}}<br />
{{agenda item| |Mustafa Khammash: Complexity of the chemical master equation}}<br />
{{agenda item| |Maryam Fazel, Dennice Gayme, Ben Recht: Complexity implies fragility}}<br />
{{agenda item| |Pablo Parrilo/John Doyle: Recap and wrapup}}<br />
{{agenda item|18:30|Dinner presentation: Christina Smolke: Regulatory mechanisms in natural and synthetic biology}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Wednesday''' - Short Proofs<br />
{{agenda begin}}<br />
{{agenda item|08:30|Pablo Parrilo, Day Overview}}<br />
{{agenda item| |Mihai Putinar: Polynomial proofs and operator theory}}<br />
{{agenda item| |Samuel Buss: Proof systems}}<br />
{{agenda item| |Bill Helton: Scale-independent proofs in systems and control}}<br />
{{agenda item|13:00|Carla Gomes/Bart Selman: SAT Solvers and state of the art}}<br />
{{agenda item| |John Doyle: Layering architectures, examples}}<br />
{{agenda item| |Mung Chiang: Layering, optimization, and duality}}<br />
{{agenda item| |Parrilo: Recap and wrapup}}<br />
{{agenda item|16:30|Neil Gershenfeld: Math as computer programming}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Thursday''' - Small Models<br />
{{agenda begin}}<br />
{{agenda item|08:30|Ben Recht, Lin Xiao: Day Overview}}<br />
{{agenda item| |Ali J/ Sanj L/Antonis P: Networks and decentralized control }}<br />
{{agenda item| |Keith Glover, Model reduction and system ID}}<br />
{{agenda item|13:00|Lawrence Saul, Spectral methods in machine learning}}<br />
{{agenda item| |Ben Recht, Lin Xiao: Convex optimization approaches and recap}}<br />
{{agenda item| |Parrilo: Recap and wrapup}}<br />
{{agenda item|16:00|Adjourn, dinner on own}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Friday''' - Student talks<br />
{{agenda begin}}<br />
{{agenda item|09:00|Breakfast (buffet)}}<br />
{{agenda item|09:30|Morning talks and break}}<br />
{{agenda item|12:00|Lunch (buffet)}}<br />
{{agenda item|13:00|Afternoon talks and break}}<br />
{{agenda item|16:00|End}}<br />
{{agenda end}}<br />
|}<br />
<br />
== Additional Information ==<br />
<br />
The main workshop will be held on 15-17 August 2006 in Pasadena, CA, with additional sessions on Monday and Friday for interested participants:<br />
<br />
* Monday: tutorial sessions<br />
* Tuesday: Hard Limits <br />
* Wednesday: Short Proofs <br />
* Thursday: Small Models<br />
* Friday: student presentations<br><br />
* [http://www.cds.caltech.edu/~murray/connections/register.html Register to attend]<br><br />
* [[Connections II Participants|Participants (restricted page)]]<br />
<br />
The Connections workshop is sponsored by Caltech and the Air Force Office of Scientific Research.</div>Doylehttps://murray.cds.caltech.edu/index.php?title=Connections_II&diff=4090Connections II2006-06-08T15:01:54Z<p>Doyle: /* Additional Information */</p>
<hr />
<div><table align=center><br />
<tr><td align=center><font size="+2" color=blue>Connections II:</font><br />
<tr><td align=center><font size="+2" color = blue> Fundamentals of Network Science</font><br />
<tr><td align=center><font size="+1" color=blue>14-18 August 2006 <br> Pasadena, CA</font><br />
</table><br />
<br />
<!-- Table of Contents --><br />
{| width=100% border = 1<br />
|-<br />
| width=20% align=center | [[#agenda|Agenda]] <br />
| width=20% align=center | [http://www.cds.caltech.edu/~murray/connections/register.html Register]<br />
| width=20% align=center | Participants<br />
| width=20% align=center | Travel Info<br />
| width=20% align=center | [http://www.cds.caltech.edu CDS Home]<br />
|} __NOTOC__<br />
<br />
== Description ==<br />
<br />
The ''Connections'' workshop series pulls together researchers in mathematics,<br />
science and engineering who bring together novel ideas and tools from<br />
outside their traditional training to influence problems in areas as diverse<br />
as networking protocols, systems biology, ecology, geophysics, finance,<br />
fluid mechanics, and multiscale physics. An underlying theme of this<br />
workshop is to look forward to ways in which future scientists can be<br />
educated in mathematical, computational, and quantitative methods, to<br />
prepare them to interact broadly from the time they are students and<br />
throughout their academic careers. <br />
<br />
The first Connections workshop, held at Caltech in July 2004, brought<br />
together over 200 researchers in the fields of mathematics, biology,<br />
physics, engineering and other disciplines to participate in a 3 day<br />
conference exploring the connections between diverse applications and common<br />
underlying mathematics, particularly with regard to the role of uncertainty<br />
and robustness in complex systems. For the second Connections workshop, we<br />
plan to focus on the connections within the mathematics that would form the<br />
foundation of a theoretical framework for network science, still motivated<br />
by the diverse applications in science and technology that were focus of<br />
Connections I. <br />
<br />
We are organizing the activities around three main themes (roughly one each<br />
day) of Hard Limits, Short Proofs, and Small Models, together with the<br />
crosscutting theme of Architecture:<br />
<br />
* ''Hard limits'' - a major challenge in network science is to understand the fundamental limits on networks due to their components and their interconnection. One challenge is unifying and extending the previously fragmented hard limit theories that arise in thermodynamics, control, communications, and computing, and are often associated with the names Carnot, Bode, Shannon, and Turing. There are encouraging pairwise connections, like the Bode-Shannon theory developed by Martins et al and others, and this theme will explore the progress and potential for further integration. Also encouraging is the opportunity for overcoming hard limits when new connections are made, such as the relationship between proof complexity and problem fragility.<br />
<br />
* ''Short proofs'' - in general, overcoming the apparent computational intractability of analysis and design of complex networks is a central challenge, from formal verification of programs and protocols to the robustness analysis of the dynamics of biological networks and advanced technologies. Here the apparent asymmetry between NP/coNP is as significant as that between P/NP, and moving from analysis to synthesis involves higher complexity classes in fundamental ways. Substantial progress has been made recently in creating frameworks to systematically search for short proofs, but the research communities involved and the results are again somewhat fragmented. Fortunately there is also encouraging progress in creating a more unified framework, motivated by new connections within mathematics, the pervasive role of duality, and the concept of "complexity implies fragility" from the first theme.<br />
<br />
* ''Small models'' - an important route to short proofs is finding small models of complex phenomena through model identification from data, and model reduction. Again, there has been substantial recent progress within relatively fragmented research communities, with encouraging results that suggest the potential for a richer and more unified framework.<br />
<br />
* ''Architecture'' - a cross-cutting theme in the background throughout the workshop will be the challenge of a theory of ''architecture,'' as in the claim that "the architecture of the cell and the Internet have enabled their robustness and evolvability." Despite its widespread usage, there is little formalization of the concept and essentially no theory. The existing hard limits theories all assume architectures a priori which are incompatible and incomparable, and thus offer little guidance in the tradeoffs associated with architecture design. Short proofs and small models also arise only in the context of a priori specified proof and modeling architectures. A diverse set of examples of successful and unsuccessful architectures in technology and biology are now available, and motivate the study of a theory. More unified theories of hard limits, short proofs, and small models appear to be essential first steps towards a theory of architecture.<br />
<br />
== Confirmed speakers ==<br />
* John Doyle, California Institute of Technology<br />
* Keith Glover, Cambridge University<br />
* Jean Carlson, Univeristy of California, Santa Barbara <!-- dinner --><br />
* Laurence Saul, U. Pennsylvania<br />
* Pablo Parrilo, Massuchusetts Insttute of Technology<br />
* Nuno Martins, U. Maryland<br />
* Ben Recht, California Institute of Technology<br />
* Lin Xiao, Microsoft Research<br />
<!-- * Christina Smolke (dinner) --><br />
<!-- * Stephen Smale? (dinner) --><br />
<!--<br />
{| width=100% border=1 <br />
|-<br />
|<br />
'''Monday''' - tutorial sessions<br />
* Schedule TBD<br />
<br />
|-<br />
|<br />
'''Tuesday''' - Hard Limits<br />
{{agenda begin}}<br />
{{agenda item|8:00a|Breakfast}}<br />
{{agenda item|8:15a|John Doyle, Workshop Overview}}<br />
{{agenda item|9:30a|}}<br />
{{agenda item|10:15a|Break}}<br />
{{agenda item|10:30a|}}<br />
{{agenda item|11:15a|}}<br />
{{agenda item|12:00p|Lunch}}<br />
{{agenda item|1:00p|}}<br />
{{agenda item|2:00p|}}<br />
{{agenda item|3:00p|Afternoon break}}<br />
{{agenda item|6:00p|Reception presentation}}<br />
{{agenda item|7:00p|Dinner}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Wednesday''' - Short Proofs<br />
{{agenda begin}}<br />
{{agenda item|9:00a|Pablo Parrilo, Semi-algebraic proofs}}<br />
{{agenda item|10:00a|}}<br />
{{agenda item|11:00a|Break}}<br />
{{agenda item|11:30a|}}<br />
{{agenda item|12:30p|Lunch}}<br />
{{agenda item|2:00p|}}<br />
{{agenda item|3:00p|}}<br />
{{agenda item|4:00p|Afternoon break}}<br />
{{agenda item|6:30p|Reception and cocktails}}<br />
{{agenda item|7:00p|Dinner presentation}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Thursday''' - Small Models<br />
{{agenda begin}}<br />
{{agenda item|9:00a|Laurence Saul, Machine Learning}}<br />
{{agenda item|10:00a|Keith Glover, Model reduction}}<br />
{{agenda item|11:00a|Break}}<br />
{{agenda item|11:30a|Jean Carlson, Eco/Geo systems}}<br />
{{agenda item|12:30p|Lunch}}<br />
{{agenda item|2:00p|}}<br />
{{agenda item|3:00p|}}<br />
{{agenda item|4:00p|Afternoon break}}<br />
{{agenda item|6:30p|Reception and cocktails}}<br />
{{agenda item|7:00p|Dinner presentation}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Friday''' - Student talks<br />
* Schedule TBD<br />
|}<br />
--><br />
<br />
== Additional Information ==<br />
<br />
The main workshop will be held on 15-17 August 2006 in Pasadena, CA, with additional sessions on Monday and Friday for interested participants:<br />
<br />
* Monday: tutorial sessions<br />
* Tuesday: Hard Limits <br />
* Wednesday: Short Proofs <br />
* Thursday: Small Models<br />
* Friday: student presentations<br><br />
* [http://www.cds.caltech.edu/~murray/connections/register.html Register to attend]<br><br />
* [[Connections II Participants|Participants (restricted page)]]</div>Doylehttps://murray.cds.caltech.edu/index.php?title=Connections_II&diff=4089Connections II2006-06-08T15:01:07Z<p>Doyle: /* Description */</p>
<hr />
<div><table align=center><br />
<tr><td align=center><font size="+2" color=blue>Connections II:</font><br />
<tr><td align=center><font size="+2" color = blue> Fundamentals of Network Science</font><br />
<tr><td align=center><font size="+1" color=blue>14-18 August 2006 <br> Pasadena, CA</font><br />
</table><br />
<br />
<!-- Table of Contents --><br />
{| width=100% border = 1<br />
|-<br />
| width=20% align=center | [[#agenda|Agenda]] <br />
| width=20% align=center | [http://www.cds.caltech.edu/~murray/connections/register.html Register]<br />
| width=20% align=center | Participants<br />
| width=20% align=center | Travel Info<br />
| width=20% align=center | [http://www.cds.caltech.edu CDS Home]<br />
|} __NOTOC__<br />
<br />
== Description ==<br />
<br />
The ''Connections'' workshop series pulls together researchers in mathematics,<br />
science and engineering who bring together novel ideas and tools from<br />
outside their traditional training to influence problems in areas as diverse<br />
as networking protocols, systems biology, ecology, geophysics, finance,<br />
fluid mechanics, and multiscale physics. An underlying theme of this<br />
workshop is to look forward to ways in which future scientists can be<br />
educated in mathematical, computational, and quantitative methods, to<br />
prepare them to interact broadly from the time they are students and<br />
throughout their academic careers. <br />
<br />
The first Connections workshop, held at Caltech in July 2004, brought<br />
together over 200 researchers in the fields of mathematics, biology,<br />
physics, engineering and other disciplines to participate in a 3 day<br />
conference exploring the connections between diverse applications and common<br />
underlying mathematics, particularly with regard to the role of uncertainty<br />
and robustness in complex systems. For the second Connections workshop, we<br />
plan to focus on the connections within the mathematics that would form the<br />
foundation of a theoretical framework for network science, still motivated<br />
by the diverse applications in science and technology that were focus of<br />
Connections I. <br />
<br />
We are organizing the activities around three main themes (roughly one each<br />
day) of Hard Limits, Short Proofs, and Small Models, together with the<br />
crosscutting theme of Architecture:<br />
<br />
* ''Hard limits'' - a major challenge in network science is to understand the fundamental limits on networks due to their components and their interconnection. One challenge is unifying and extending the previously fragmented hard limit theories that arise in thermodynamics, control, communications, and computing, and are often associated with the names Carnot, Bode, Shannon, and Turing. There are encouraging pairwise connections, like the Bode-Shannon theory developed by Martins et al and others, and this theme will explore the progress and potential for further integration. Also encouraging is the opportunity for overcoming hard limits when new connections are made, such as the relationship between proof complexity and problem fragility.<br />
<br />
* ''Short proofs'' - in general, overcoming the apparent computational intractability of analysis and design of complex networks is a central challenge, from formal verification of programs and protocols to the robustness analysis of the dynamics of biological networks and advanced technologies. Here the apparent asymmetry between NP/coNP is as significant as that between P/NP, and moving from analysis to synthesis involves higher complexity classes in fundamental ways. Substantial progress has been made recently in creating frameworks to systematically search for short proofs, but the research communities involved and the results are again somewhat fragmented. Fortunately there is also encouraging progress in creating a more unified framework, motivated by new connections within mathematics, the pervasive role of duality, and the concept of "complexity implies fragility" from the first theme.<br />
<br />
* ''Small models'' - an important route to short proofs is finding small models of complex phenomena through model identification from data, and model reduction. Again, there has been substantial recent progress within relatively fragmented research communities, with encouraging results that suggest the potential for a richer and more unified framework.<br />
<br />
* ''Architecture'' - a cross-cutting theme in the background throughout the workshop will be the challenge of a theory of ''architecture,'' as in the claim that "the architecture of the cell and the Internet have enabled their robustness and evolvability." Despite its widespread usage, there is little formalization of the concept and essentially no theory. The existing hard limits theories all assume architectures a priori which are incompatible and incomparable, and thus offer little guidance in the tradeoffs associated with architecture design. Short proofs and small models also arise only in the context of a priori specified proof and modeling architectures. A diverse set of examples of successful and unsuccessful architectures in technology and biology are now available, and motivate the study of a theory. More unified theories of hard limits, short proofs, and small models appear to be essential first steps towards a theory of architecture.<br />
<br />
== Confirmed speakers ==<br />
* John Doyle, California Institute of Technology<br />
* Keith Glover, Cambridge University<br />
* Jean Carlson, Univeristy of California, Santa Barbara <!-- dinner --><br />
* Laurence Saul, U. Pennsylvania<br />
* Pablo Parrilo, Massuchusetts Insttute of Technology<br />
* Nuno Martins, U. Maryland<br />
* Ben Recht, California Institute of Technology<br />
* Lin Xiao, Microsoft Research<br />
<!-- * Christina Smolke (dinner) --><br />
<!-- * Stephen Smale? (dinner) --><br />
<!--<br />
{| width=100% border=1 <br />
|-<br />
|<br />
'''Monday''' - tutorial sessions<br />
* Schedule TBD<br />
<br />
|-<br />
|<br />
'''Tuesday''' - Hard Limits<br />
{{agenda begin}}<br />
{{agenda item|8:00a|Breakfast}}<br />
{{agenda item|8:15a|John Doyle, Workshop Overview}}<br />
{{agenda item|9:30a|}}<br />
{{agenda item|10:15a|Break}}<br />
{{agenda item|10:30a|}}<br />
{{agenda item|11:15a|}}<br />
{{agenda item|12:00p|Lunch}}<br />
{{agenda item|1:00p|}}<br />
{{agenda item|2:00p|}}<br />
{{agenda item|3:00p|Afternoon break}}<br />
{{agenda item|6:00p|Reception presentation}}<br />
{{agenda item|7:00p|Dinner}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Wednesday''' - Short Proofs<br />
{{agenda begin}}<br />
{{agenda item|9:00a|Pablo Parrilo, Semi-algebraic proofs}}<br />
{{agenda item|10:00a|}}<br />
{{agenda item|11:00a|Break}}<br />
{{agenda item|11:30a|}}<br />
{{agenda item|12:30p|Lunch}}<br />
{{agenda item|2:00p|}}<br />
{{agenda item|3:00p|}}<br />
{{agenda item|4:00p|Afternoon break}}<br />
{{agenda item|6:30p|Reception and cocktails}}<br />
{{agenda item|7:00p|Dinner presentation}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Thursday''' - Small Models<br />
{{agenda begin}}<br />
{{agenda item|9:00a|Laurence Saul, Machine Learning}}<br />
{{agenda item|10:00a|Keith Glover, Model reduction}}<br />
{{agenda item|11:00a|Break}}<br />
{{agenda item|11:30a|Jean Carlson, Eco/Geo systems}}<br />
{{agenda item|12:30p|Lunch}}<br />
{{agenda item|2:00p|}}<br />
{{agenda item|3:00p|}}<br />
{{agenda item|4:00p|Afternoon break}}<br />
{{agenda item|6:30p|Reception and cocktails}}<br />
{{agenda item|7:00p|Dinner presentation}}<br />
{{agenda end}}<br />
<br />
|-<br />
|<br />
'''Friday''' - Student talks<br />
* Schedule TBD<br />
|}<br />
--><br />
<br />
== Additional Information ==<br />
<br />
The main workshop will be held on 13-15 August 2006 in Pasadena, CA, with additional sessions on Monday and Friday for interested participants:<br />
<br />
* Monday: tutorial sessions<br />
* Tuesday: Hard Limits <br />
* Wednesday: Short Proofs <br />
* Thursday: Small Models<br />
* Friday: student presentations<br><br />
* [http://www.cds.caltech.edu/~murray/connections/register.html Register to attend]<br><br />
* [[Connections II Participants|Participants (restricted page)]]</div>Doyle