Actions

CSSS 2007 Beijing-Readings-Week-Two: Difference between revisions

From Santa Fe Institute Events Wiki

 
(41 intermediate revisions by 5 users not shown)
Line 6: Line 6:


===Lecture Notes===
===Lecture Notes===
These are from the 2006 CSSS Beijing, and will have some revisions for this year:
These are new 2007 revisions of the 2006 CSSS Beijing lectures:
<ul>
<LI>
<LI>
[http://www.santafe.edu/~altenber/CSSS_BEIJING/2006/Altenberg_Lecture_1.2up.pdf Lecture 1: Introduction to Evolutionary Computation]
New!  [http://www.santafe.edu/~altenber/CSSS_BEIJING/2007/Lecture_1.4up.pdf Lecture 1: Introduction to Evolutionary Computation] (6.2MB)
<LI>
<LI>
[http://www.santafe.edu/~altenber/CSSS_BEIJING/2006/Altenberg_Lecture_2.2up.pdf Lecture 2: Analysis of Evolutionary Dynamics]
New!  [http://www.santafe.edu/~altenber/CSSS_BEIJING/2007/Analysis_2007_new.2up.pdf Lecture 2: Mathematical Analysis of Evolutionary Algorithms] (1 MB)
<LI>
<LI>
[http://www.santafe.edu/~altenber/CSSS_BEIJING/2006/Altenberg_Lecture_3.2up.pdf Lecture 3: Higher Order Evolutionary Phenomena]
New! [http://www.santafe.edu/~altenber/CSSS_BEIJING/2007/Lecture_3.4up.pdf Lecture 3: Higher Order Evolutionary Phenomena] (9MB)
</ul>


===Additional Reading===
===Additional Reading===
Line 19: Line 21:
*Altenberg, L. , 1994. [http://dynamics.org/Altenberg/PAPERS/STPT/ The Schema Theorem and Price's Theorem] delves into the claims about schema processing as the source of power in genetic algorithms, and recasts the Schema Theorem (Holland 1975) by using Price's Theorem (1970).  It is shown that the Schema Theorem says nothing about a GA's power, but a modification with a different measurement function produces a theorem about evolvability that is a local measure of GA power.  The concept of rugged landscapes is also deconstructed in terms of operator-defined distance.
*Altenberg, L. , 1994. [http://dynamics.org/Altenberg/PAPERS/STPT/ The Schema Theorem and Price's Theorem] delves into the claims about schema processing as the source of power in genetic algorithms, and recasts the Schema Theorem (Holland 1975) by using Price's Theorem (1970).  It is shown that the Schema Theorem says nothing about a GA's power, but a modification with a different measurement function produces a theorem about evolvability that is a local measure of GA power.  The concept of rugged landscapes is also deconstructed in terms of operator-defined distance.


*Erik van Nimwegen, James P. Crutchfield, and Martijn Huynen [http://www.santafe.edu/~evca/Papers/nemr.pdf Neutral Evolution of Mutational Robustness.] Proceedings of the National Academy of Science U.S.A. 96:9716-9720 (1999).
*Erik van Nimwegen, James P. Crutchfield, and Martijn Huynen. [http://www.santafe.edu/~evca/Papers/nemr.pdf Neutral Evolution of Mutational Robustness.] Proceedings of the National Academy of Science U.S.A. 96:9716-9720 (1999).


*Altenberg, L. , 2004. [http://dynamics.org/Altenberg/PAPERS/MESLLQ/ Modularity in Evolution: Some Low Level Questions] deconstructs the concept of modularity in terms of spaces of variation, and discusses properties needed for modularity to enhance evolvability.
*Altenberg, L. , 2004. [http://dynamics.org/Altenberg/PAPERS/MESLLQ/ Modularity in Evolution: Some Low Level Questions] deconstructs the concept of modularity in terms of spaces of variation, and discusses properties needed for modularity to enhance evolvability.


*Erik van Nimwegen and James P. Crutchfield.  [http://www.santafe.edu/~evca/Papers/med.pdf Metastable Evolutionary Dynamics: Crossing Fitness Barriers or Escaping via Neutral Paths?]  Bulletin of Mathematical Biology 62:5:799-848 (Sep 2000)
*Erik van Nimwegen and James P. Crutchfield.  [http://www.santafe.edu/~evca/Papers/med.pdf Metastable Evolutionary Dynamics: Crossing Fitness Barriers or Escaping via Neutral Paths?]  Bulletin of Mathematical Biology 62:5:799-848 (Sep 2000)
* Lauren Ancel Meyers, Fredric D. Ancel, Michael Lachmann.  2005.  [http://http://dx.doi.org/10.1371/journal.pcbi.0010032 Evolution of Genetic Potential].  PLoS Computational Biology  1(3): e32.


* Evolutionary Art at [http://electricsheep.org/ Electric Sheep]
* Evolutionary Art at [http://electricsheep.org/ Electric Sheep]
Line 30: Line 34:


===Lecture Notes===
===Lecture Notes===
*[[Media:Burkhead1.pdf|Introduction to Discrete Dynamical Systems]]
*[[Media:Burkhead_slides_2_4per.pdf| Symbolic Dynamics]]
*[[Media:Burkhead_slides_3_4per.pdf |A Symbolics Dynamics View of Cellular Automata]]
===Additional Reading===
===Additional Reading===


Line 35: Line 43:


===Lecture Notes===
===Lecture Notes===
1. [[Media:Hao4CS07a.ppt|Coarse-graining, symbolic description, and complexity]], updated after the lecture on 16 July
2. [[Media:Hao4CS07b.ppt|Factorizable language: examples from biology]], for lecture on 18 July 2007
===Additional Reading===
===Additional Reading===
1. Bailin Hao, [[Media:crossSFI.pdf|Complexity, Coarse-Graining and Symbolic Description]] A SFI Working Paper
2. Bailin Hao and Huimin Xie, [[Media:HaoXieChap.pdf|Factorizable Language: from Dynamics to Biology]] A chapter written for Annual Reviews in Nonlinear Science and Complexity, ed. by Heinz G. Schuster, to be published by Wiley-VCH, page numbers tentative.
3. Junjie Shen, Shuyu Zhang, Hoong-Chien Lee, Bailin Hao, [[Media:SeeDNA_GPB.pdf|SeeDNA: a visualization tool for K-string content of lone DNA sequences and their randomized counterparts]]. SeeDNA runs on LINUX system with GTK support. Since .tar.gz file type is not supported on SFI wiki, please download the source code from Hao's webpage: http://www.itp.ac.cn/~hao/SeeDNA.tar.gz
4. Bailin Hao, [[Media:physa282.pdf|Fractals from genomes: Exact solutions of a biology-inspired problem]] Goulden-Jackson cluster method and facorizable language method in action.


5. Xiaoli Shi, Huimin Xie, Shuyu Zhang, Bailin Hao, [[Media:jkps07.pdf|Decomposition and reconstruction of protein sequences: the problem of uniqueness and factorizable language]]


==Dan Hruschka==
==Dan Hruschka==


===Lecture Notes===
===Lecture Notes===
*[[Media:Hruschka_Lecture1.pdf|Models of Cultural Diversity]]
*[[Media:Hruschka_Lecture2.pdf |Simple Models of Social Learning]]
===Additional Reading===
===Additional Reading===
 
*[[Media:Henrich_20McElreathCultural_20Evo.pdf|The Evolution of Cultural Evolution]]
*[[Media:SoltisBoydRichersonCA95.pdf |Can Group-functional Behaviors Evolve by Cultural Group Selection?]]
*[[Media:Hruschka_Lecture3.pdf| Cultural Evolution at the Group Level]]


==Van Savage==
==Van Savage==


===Lecture Notes===
===Lecture Notes===
*[[Media:Csss_lecture1.pdf| Scaling and Power Laws with a Case Study in Biological Allometry]]
*[[Media:Csss_lecture2.pdf| Biological Scaling Theory and Effects on Populations]]
*[[Media:Csss_lecture3.pdf| Scaling Tumor Growth and Sleep Times]]
===Additional Reading===
===Additional Reading===


==Weixia(Bonnie) Huang==  
==Weixia(Bonnie) Huang==  
Line 54: Line 82:


===Lecture Notes===
===Lecture Notes===
* [[Media:Bonnie_NWB_Beijing.pdf|Network Workbench - A Tool For Large Scale Network Analysis, Modeling and Visualization]]
===Additional Reading===
===Additional Reading===
* Herr, Bruce W., Huang, Weixia, Penumarthy, Shashikant, & Börner, Katy. (2007). [http://ella.slis.indiana.edu/~katy/paper/06-cishell.pdf Designing Highly Flexible and Usable Cyberinfrastructures for Convergence] In William S. Bainbridge and Mihail C. Roco (Eds.) Progress in Convergence – Technologies for Human Wellbeing. Annals of the New York Academy of Sciences, Boston, MA, Volume 1093, pp. 161-179.
* Börner, Katy, Sanyal, Soma and Vespignani, Alessandro. (2007). [http://nwb.slis.indiana.edu/papers/borner-2006-netsci.pdf Network Science: A Theoretical and Practical Framework] In Blaise Cronin (Ed.), Annual Review of Information Science & Technology, Volume 41, Medford, NJ: Information Today, Inc./American Society for Information Science and Technology, chapter 12, pp. 537-607.
* Börner, Katy, Penumarthy, Shashikant, Meiss, Mark and Ke, Weimao. (2006). [http://nwb.slis.indiana.edu/papers/borner-2006-mapdifinfo.pdf Mapping the Diffusion of Scholarly Knowledge Among Major U.S. Research Institutions] Scientometrics. 68(3), pp. 415-426.
* Börner, Katy, Chen, Chaomei, and Boyack, Kevin. (2003). [http://ella.slis.indiana.edu/~katy/paper/arist02.pdf Visualizing Knowledge Domains] In Blaise Cronin (Ed.), Annual Review of Information Science & Technology,Volume 37, Medford, NJ: Information Today. Inc./American Society for Information Science and Technology, chapter 5, pp. 179-255
* Ketan Mane and Katy Börner. (2004) [http://ella.slis.indiana.edu/~katy/paper/04-pnas-mane.pdf Mapping Topics and Topic Bursts in PNAS] PNAS, 101(Suppl. 1):5287-5290. Also available as cond-mat/0402380.
* Kevin W. Boyack, Richard Klavans , W. Bradford Paley , Katy Börner [http://ivl.slis.indiana.edu/km/pub/2007-boyack-siggraph.pdf Mapping, Illuminating, and Interacting with Science] one of the 96 accepted (out of 500 submitted) Siggraph 07 sketches.
* Holloway, Todd, Bozicevic, Miran, and Börner, Katy. (2007) [http://nwb.slis.indiana.edu/papers/holloway-0000-analvizwikipedia.pdf Analyzing and Visualizing the Semantic Coverage of Wikipedia and Its Authors] Complexity, Special issue on Understanding Complex Systems. 12(3), pp. 30-40. Also available as cs.IR/0512085.

Latest revision as of 01:39, 20 July 2007

CSSS 2007 Beijing


Lee Altenberg

Lecture Notes

These are new 2007 revisions of the 2006 CSSS Beijing lectures:

Additional Reading

  • Altenberg, L. , 1994. The Schema Theorem and Price's Theorem delves into the claims about schema processing as the source of power in genetic algorithms, and recasts the Schema Theorem (Holland 1975) by using Price's Theorem (1970). It is shown that the Schema Theorem says nothing about a GA's power, but a modification with a different measurement function produces a theorem about evolvability that is a local measure of GA power. The concept of rugged landscapes is also deconstructed in terms of operator-defined distance.

Emily Burkhead

Lecture Notes

Additional Reading

Hao Bai-lin

Lecture Notes

1. Coarse-graining, symbolic description, and complexity, updated after the lecture on 16 July

2. Factorizable language: examples from biology, for lecture on 18 July 2007

Additional Reading

1. Bailin Hao, Complexity, Coarse-Graining and Symbolic Description A SFI Working Paper

2. Bailin Hao and Huimin Xie, Factorizable Language: from Dynamics to Biology A chapter written for Annual Reviews in Nonlinear Science and Complexity, ed. by Heinz G. Schuster, to be published by Wiley-VCH, page numbers tentative.

3. Junjie Shen, Shuyu Zhang, Hoong-Chien Lee, Bailin Hao, SeeDNA: a visualization tool for K-string content of lone DNA sequences and their randomized counterparts. SeeDNA runs on LINUX system with GTK support. Since .tar.gz file type is not supported on SFI wiki, please download the source code from Hao's webpage: http://www.itp.ac.cn/~hao/SeeDNA.tar.gz

4. Bailin Hao, Fractals from genomes: Exact solutions of a biology-inspired problem Goulden-Jackson cluster method and facorizable language method in action.

5. Xiaoli Shi, Huimin Xie, Shuyu Zhang, Bailin Hao, Decomposition and reconstruction of protein sequences: the problem of uniqueness and factorizable language

Dan Hruschka

Lecture Notes

Additional Reading

Van Savage

Lecture Notes

Additional Reading

Weixia(Bonnie) Huang

Lecture Notes

Additional Reading