Difference between revisions of "Connections II"
(→Agenda) 

(44 intermediate revisions by 3 users not shown)  
Line 1:  Line 1:  
<table align=center>  <table align=center width=100%>  
<tr><td align=center><font size="+2" color=blue>Connections II:</font>  <tr>  
<tr><td align=center><font size="+2" color = blue> Fundamentals of Network Science</font>  <td rowspan=3 align=center>[[Image:citlogo.png75px]]</td>  
<tr><td align=center><font size="+1" color=blue>1418 August 2006 <br> Pasadena, CA</font>  <td align=center><font size="+2" color=blue>Connections II:</font></td>  
<td rowspan=3 align=center>[[Image:afosrlogo.png85px]]</td>  
<tr><td align=center><font size="+2" color = blue> Fundamentals of Network Science</font></td>  
<tr><td align=center><font size="+1" color=blue>1418 August 2006 <br> Pasadena, CA</font></td>  
</table>  </table>  
Line 8:  Line 11:  
{ width=100% border = 1  { width=100% border = 1  
    
 width=20% align=center  [[#   width=20% align=center  [[#AgendaAgenda]]  
 width=20% align=center  [http://www.cds.caltech.edu/~murray/connections/register.html Register]   width=20% align=center  [http://www.cds.caltech.edu/~murray/connections/register.html Register]  
 width=20% align=center  Participants   width=20% align=center  Participants  
 width=20% align=center  Travel Info   width=20% align=center  [[Connections_II_travelTravel Info]]  
 width=20% align=center  [http://www.cds.caltech.edu CDS Home]   width=20% align=center  [http://www.cds.caltech.edu CDS Home]  
} __NOTOC__  } __NOTOC__  
<br>  
<center><font size="+1">The workshop will take place in Dabney Hall ([http://www.caltech.edu/map/Caltechmap20060210.pdf campus map]).</font></center>  
== Description ==  == Description ==  
Line 44:  Line 50:  
* ''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 BodeShannon 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.  * ''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 BodeShannon 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.  
* ''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  * ''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.  
* ''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.  * ''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.  
* ''Architecture''  a crosscutting theme in the background throughout the workshop will be the challenge of a theory of  * ''Architecture''  a crosscutting 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.  
== Invited speakers (confirmed) ==  
* Samuel Buss, UC, San Diego  
*  * Mung Chiang, Princeton  
* Keith Glover, Cambridge  * Ali Jadbabaie, Penn  
*  * Neil Gershenfeld, MIT  
*  * Keith Glover, Cambridge  
* Pablo Parrilo,  * Bill Helton, UC, San Diego  
*  * Mustafa Khammash, UC, Santa Barbara  
*  * Sanjay Lall, Stanford  
* Nuno Martins, U. Maryland  
* Antonis Papachristodoulou, Oxford  
* Pablo Parrilo, MIT  
* Mihai Putinar, UC, Santa Barbara  
* Lawrence Saul, UC, San Diego  
* Christina Smolke, Caltech  
* Lin Xiao, Microsoft Research  * Lin Xiao, Microsoft Research  
== Caltech organizers and speakers ==  
* JeanCharles Delvenne, John Doyle, Maryam Fazel, Richard Murray, Ben Recht, Henrik Sandberg  
== Agenda ==  
{ width=100% border=1  { width=100% border=1  
    
    
'''  '''Mon(Tutorial), TueThur (workshop), Fri(Student talks)'''  
  
  
'''MonThur (workshop)'''  Daily schedule  
{{agenda begin}}  
{{agenda item08:00Breakfast (buffet)}}  
{{agenda item08:30Early morning talks}}  
{{agenda item10:15Morning break}}  
{{agenda item10:45Late morning talks}}  
{{agenda item12:15Lunch (buffet)}}  
{{agenda item13:00Early afternoon talks}}  
{{agenda item14:30Afternoon break}}  
{{agenda item14:45Late afternoon talks}}  
{{agenda item16:00Afternoon break until dinner}}  
{{agenda item18:00Dinner (buffet, TueWed only)}}  
{{agenda item18:30Dinner talk (TueWed only)}}  
{{agenda item19:30Dessert, wine, and...}}  
{{agenda end}}  
  
  
  
  
'''Monday'''  Tutorial speaker list  
* Schedule TBD: Pablo Parrilo, John Doyle, Maryam Fazel, Xin Liu, Nuno Martins, Ben Recht, Lijun Chen  
* [[Media:doyle_tutintro14aug06.pdfIntroduction]], John Doyle  
* [[Media:chen_wctut14aug06.pdfThe capacity of wireless networks]], Lijun Chen  
* [[Media:martins_infotheory14aug06.pdfBasic results and definitions of information theory]], Nuno Martins  
* [[Media:delvenne_thermo14aug06.pdfNotions of Energy and Entropy]], JeanCharles Delvenne and Henrik Sandberg  
* [[Media:fazel_percolation14aug06.pdfComplexity and fragility in the lattice percolation problem]], Maryam Fazel  
    
    
'''Tuesday'''  Hard Limits  '''Tuesday'''  Hard Limits  
{{agenda begin}}  {{agenda begin}}  
{{agenda item  {{agenda item08:30John Doyle, [[Media:doyle_overview15aug06.pdfWorkshop Overview]]}}  
{{agenda item Henrik Sandberg/JeanCharles Delvenne: [[Media:sandberg_statmech15aug06.pdfControl, information, and statistical mechanics]]}}  
{{agenda item  {{agenda item Nuno Martins: [[Media:martins_commctrl15aug06.pdfCommunications and control]]}}  
{{agenda item  {{agenda item Pablo Parrilo: [[Media:parrilo_introcomp15aug06.pdfIntro to computational complexity]]}}  
{{agenda item  {{agenda item13:00Pablo Parrilo: Computational complexity and formal methods}}  
{{agenda item  {{agenda item Mustafa Khammash: [[Media:khammash_master15aug06.pdfComplexity of the chemical master equation]]}}  
{{agenda item  {{agenda item Maryam Fazel, [[Media:fazel_lp15aug06.pdfComplexity and Fragility in Linear Programming]]}}  
{{agenda item  {{agenda item Dennice Gayme, [[Media:gayme_mandelbrot15aug06.pdfComplexity implies fragility]]}}  
{{agenda item  {{agenda item Pablo Parrilo/John Doyle: Recap and wrapup}}  
{{agenda item  {{agenda item18:30Christina Smolke: Regulatory mechanisms in natural and synthetic biology}}  
{{agenda item  
{{agenda end}}  {{agenda end}}  
Line 90:  Line 131:  
'''Wednesday'''  Short Proofs  '''Wednesday'''  Short Proofs  
{{agenda begin}}  {{agenda begin}}  
{{agenda item  {{agenda item08:30Pablo Parrilo, Day Overview}}  
{{agenda item  {{agenda item Mihai Putinar: [[Media:putinar_ppfs16aug06.pdfPolynomial proofs and operator theory]]}}  
{{agenda item  {{agenda item Samuel Buss: [[Media:buss_pfsys16aug06.pdfProof systems]]}}  
{{agenda item  {{agenda item Bill Helton: [[Media:helton_sipfs16aug06.pdfScaleindependent proofs in systems and control]]}}  
{{agenda item  {{agenda item13:00Carla Gomes: [[Media:gomes_sat16aug06.pdfSAT Solvers and state of the art]] ([http://www.cs.cornell.edu/gomes/TMP/Gomesconnections2.zip zipped movies])]}}  
{{agenda item John Doyle: Layering architectures, examples}}  
{{agenda item  {{agenda item Mung Chiang: [[Media:chiang_layering16aug06.pdfLayering, optimization, and duality]]}}  
{{agenda item  {{agenda item Parrilo: Recap and wrapup}}  
{{agenda item  {{agenda item18:30Neil Gershenfeld: Math as computer programming}}  
{{agenda item  
{{agenda end}}  {{agenda end}}  
Line 106:  Line 146:  
'''Thursday'''  Small Models  '''Thursday'''  Small Models  
{{agenda begin}}  {{agenda begin}}  
{{agenda item  {{agenda item08:30Ali J/ Sanj L/Antonis P: Networks and decentralized control}}  
{{agenda item  {{agenda item Ali Jadbabaie, [[Media:jadbabaie_consensus17aug06.pdfFlocking and consensus algorithms]]}}  
{{agenda item Sanjay Lall, [[Media:lall_decentralized17aug06.pdfDecentralized control]]}}  
{{agenda item  {{agenda item13:00Lawrence Saul, Spectral methods in machine learning}}  
{{agenda item Ben Recht, [[Media:recht_warping17aug06.pdfDiffeomorphic Warping]]}}  
{{agenda item  {{agenda item Lin Xiao, [[Media:xiao_spectral17aug06.pdfA Duality View of Spectral Methods for Dimensionality Reduction]]}}  
{{agenda item  {{agenda item Parrilo: Recap and wrapup}}  
{{agenda item  {{agenda item16:00Adjourn, dinner on own}}  
{{agenda item  
{{agenda item  
{{agenda end}}  {{agenda end}}  
Line 121:  Line 159:  
    
'''Friday'''  Student talks  '''Friday'''  Student talks  
*  {{agenda begin}}  
{{agenda item09:00Breakfast (buffet)}}  
{{agenda item09:30Morning talks and break  
* Tamas Keviczky, [[Media:keviczky_drhc18aug06.pdfDistributed LQR and Predictive Control]]  
}}  
{{agenda item12:00Lunch (buffet)}}  
{{agenda item13:00Afternoon talks and break}}  
{{agenda item16:00End}}  
{{agenda end}}  
}  }  
== Additional Information ==  == Additional Information ==  
The main workshop will be held on  The main workshop will be held on 1517 August 2006 in Pasadena, CA, with additional sessions on Monday and Friday for interested participants:  
* Monday: tutorial sessions  * Monday: tutorial sessions  
Line 136:  Line 181:  
* [http://www.cds.caltech.edu/~murray/connections/register.html Register to attend]<br>  * [http://www.cds.caltech.edu/~murray/connections/register.html Register to attend]<br>  
* [[Connections II ParticipantsParticipants (restricted page)]]  * [[Connections II ParticipantsParticipants (restricted page)]]  
The Connections workshop is sponsored by Caltech and the Air Force Office of Scientific Research. 
Latest revision as of 05:13, 25 August 2006
Connections II:  
Fundamentals of Network Science  
1418 August 2006 Pasadena, CA 
Agenda  Register  Participants  Travel Info  CDS Home 
Description
The Connections workshop series pulls together researchers in mathematics, science and engineering who bring together novel ideas and tools from outside their traditional training to influence problems in areas as diverse as networking protocols, systems biology, ecology, geophysics, finance, fluid mechanics, and multiscale physics. An underlying theme of this workshop is to look forward to ways in which future scientists can be educated in mathematical, computational, and quantitative methods, to prepare them to interact broadly from the time they are students and throughout their academic careers.
The first Connections workshop, held at Caltech in July 2004, brought together over 200 researchers in the fields of mathematics, biology, physics, engineering and other disciplines to participate in a 3 day conference exploring the connections between diverse applications and common underlying mathematics, particularly with regard to the role of uncertainty and robustness in complex systems. For the second Connections workshop, we plan to focus on the connections within the mathematics that would form the foundation of a theoretical framework for network science, still motivated by the diverse applications in science and technology that were focus of Connections I.
We are organizing the activities around three main themes (roughly one each day) of Hard Limits, Short Proofs, and Small Models, together with the crosscutting theme of Architecture:
 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 BodeShannon 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.
 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.
 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.
 Architecture  a crosscutting 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.
Invited speakers (confirmed)
 Samuel Buss, UC, San Diego
 Mung Chiang, Princeton
 Ali Jadbabaie, Penn
 Neil Gershenfeld, MIT
 Keith Glover, Cambridge
 Bill Helton, UC, San Diego
 Mustafa Khammash, UC, Santa Barbara
 Sanjay Lall, Stanford
 Nuno Martins, U. Maryland
 Antonis Papachristodoulou, Oxford
 Pablo Parrilo, MIT
 Mihai Putinar, UC, Santa Barbara
 Lawrence Saul, UC, San Diego
 Christina Smolke, Caltech
 Lin Xiao, Microsoft Research
Caltech organizers and speakers
 JeanCharles Delvenne, John Doyle, Maryam Fazel, Richard Murray, Ben Recht, Henrik Sandberg
Agenda
Mon(Tutorial), TueThur (workshop), Fri(Student talks)  
MonThur (workshop)  Daily schedule
 
Monday  Tutorial speaker list
 
Tuesday  Hard Limits
 
Wednesday  Short Proofs
 
Thursday  Small Models
 
Friday  Student talks

Additional Information
The main workshop will be held on 1517 August 2006 in Pasadena, CA, with additional sessions on Monday and Friday for interested participants:
 Monday: tutorial sessions
 Tuesday: Hard Limits
 Wednesday: Short Proofs
 Thursday: Small Models
 Friday: student presentations
 Register to attend
 Participants (restricted page)
The Connections workshop is sponsored by Caltech and the Air Force Office of Scientific Research.