Actions

CSSS 2008 Beijing-Readings-Week-Three: Difference between revisions

From Santa Fe Institute Events Wiki

No edit summary
No edit summary
Line 3: Line 3:
<!-- add content below here -->
<!-- add content below here -->


== (Samuel) Qing-Shan Jia==
=== Lecture Notes ===
* [[media:Jia.OO.ppt | Ordinal Optimization: Soft Optimization for Hard Problems]]
* [[media:ResourceNetwork.ppt | How does Spare Capacity and Topology Affect the Security of Resource Networks?]]
=== Additional Reading ===
* [[media: Soft_computing_for_hard_problems.pdf | An Explanation of Ordinal Optimization]].  Ho.  <i>Information Sciences</i>  113,  169-192 (1999).
* [[media: UAP97.pdf | Universal Alignment Probabilities and Subset Selection for Ordinal Optimization]].  Lau and Ho.  <i>Journal of Optimization Theory and Applications</i> 93:3. 455-489 (1997).
* [[media: UBS.pdf | How Topology Affects Security: An Upper Bound of Electric Power Network Security]].  Jia and Zhao.
* [[media: How Much Spare Capacity.pdf | How Much Spare Capacity is Necessary for the Security of Resource Networks?]]  Zhao, Jian and Cao.  <i>Physica A</i> 373, 861-873 (2007).


==Lee Altenberg==
==Lee Altenberg==
Line 45: Line 33:


* Evolutionary Art at [http://electricsheep.org/ Electric Sheep]
* Evolutionary Art at [http://electricsheep.org/ Electric Sheep]
== (Samuel) Qing-Shan Jia==
=== Lecture Notes ===
* [[media:Jia.OO.ppt | Ordinal Optimization: Soft Optimization for Hard Problems]]
* [[media:ResourceNetwork.ppt | How does Spare Capacity and Topology Affect the Security of Resource Networks?]]
=== Additional Reading ===
* [[media: Soft_computing_for_hard_problems.pdf | An Explanation of Ordinal Optimization]].  Ho.  <i>Information Sciences</i>  113,  169-192 (1999).
* [[media: UAP97.pdf | Universal Alignment Probabilities and Subset Selection for Ordinal Optimization]].  Lau and Ho.  <i>Journal of Optimization Theory and Applications</i> 93:3. 455-489 (1997).
* [[media: UBS.pdf | How Topology Affects Security: An Upper Bound of Electric Power Network Security]].  Jia and Zhao.
* [[media: How Much Spare Capacity.pdf | How Much Spare Capacity is Necessary for the Security of Resource Networks?]]  Zhao, Jian and Cao.  <i>Physica A</i> 373, 861-873 (2007).





Revision as of 13:57, 13 July 2008

CSSS 2008 Beijing


Lee Altenberg

Lecture Notes

Pending uploading of my 2008 lecture notes, here are the lectures from the 2007 CSSS Beijing:

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.


(Samuel) Qing-Shan Jia

Lecture Notes

Additional Reading


Susanna Still

Chris Wiggins

Lecture Notes

  • Bayes
    • History
    • What he said
    • What he didn't say
  • Bayes rule in Dynamics
    • Random walks
      • Pollen grains
      • Wall street
    • Chemical kinetics
    • Polymer Physics
  • Bayes rule in Statistics
    • Why we fit
    • Regularization
    • Latent variables / Mixture modeling
    • Model selection the Bayesian way
    • Bayesian density estimation / unsupervised learning
  • Alternatives to Bayes
    • Cross validation
    • pvalueology
    • Information theoretic methods