684 REFERENCES

[1623] C. Hedrick from the Rutgers University. Routing Information Protocol. Request forComments (RFC) 1058, Internet Engineering Task Force (IETF), Internet Society(ISOC), Network Working Group, June 1988. Online available at http://tools.

ietf.org/html/rfc1058 and http://www.faqs.org/rfcs/rfc1058.html [accessed

2008-06-27].[1624] John Moy from the Proteon, Inc., 2 Technology Drive, Westborough, MA 01581-5008.

The OSPF Specification. Request for Comments (RFC) 1131, Internet EngineeringTask Force (IETF), Internet Society (ISOC), October 1989. Online available athttp://www.packetizer.com/rfc/rfc1131/pdf [accessed 2008-06-27].

[1625] Masaharu Munetomo, Yoshiaki Takai, and Yoshiharu Sato. An Adaptive NetworkRouting Algorithm Employing Path Genetic Operators. In Proceedings of the SeventhInternational Conference on Genetic Algorithms, pages 643–649, 1997. In proceedings[735].

[1626] Masaharu Munetomo, Yoshiaki Takai, and Yoshiharu Sato. An adaptive routing al-gorithm with load balancing by a genetic algorithm. Transactions of the InformationProcessing Society of Japan (IPSJ), 39(2):219–227, 1998. in Japanese.

[1627] Masaharu Munetomo, Yoshiaki Takai, and Yoshiharu Sato. A Migration Scheme forthe Genetic Adaptive Routing Algorithm. In Proceedings of the 1998 IEEE Confer-ence on Systems, Man, and Cybernetics, volume 3, pages 2774–2779. IEEE Press,October 11–14, 1998, San Diego, U.S.A. doi:10.1109/ICSMC.1998.725081.

[1628] Masaharu Munetomo from the Graduate School of Engineering, Hokkaido Uni-versity, North 13, West 8, Sapporo 060-8628, Jappan. Designing genetic algo-rithms for adaptive routing algorithms in the internet. In Evolutionary Telecom-munications: Past, Present, and Future, pages 215–216, 1999. Online availableat http://citeseer.ist.psu.edu/198441.html and http://uk.geocities.com/

markcsinclair/ps/etppf_mun.ps.gz [accessed 2008-06-25]. Presentation online avail-able at http://uk.geocities.com/markcsinclair/ps/etppf_mun_slides.ps.gz

and http://assam.cims.hokudai.ac.jp/~munetomo/documents/gecco99-ws.ppt

[accessed 2008-06-25].[1629] Ruud Schoonderwoerd, Owen Holland, and Janet Bruten. Ant-like agents for load

balancing in telecommunications networks. In Jorg Mller, editor, AGENTS’97: Pro-ceedings of the first international conference on Autonomous agents, pages 209–216,February 5–8 1997, Marina del Rey, California, United States. ACM, New York,NY, USA. ISBN 0-89791-877-0. doi:10.1145/267658.267718. Online available athttp://staff.washington.edu/paymana/swarm/schoon97-icaa.pdf and http://

doi.acm.org/10.1145/267658.267718 [accessed 2008-07-26]. Slides online available at[accessed 2008-07-26]. See also http://sigart.acm.org/proceedings/agents97/ [accessed

2008-07-26].[1630] Ralf Klasing, Burkhard Monien, R. Peine, and Elena Stohr. Broadcasting in butterfly

and de Bruijn networks. In Alain Finkel and Matthias Jantzen, editors, Proceedingsof 9th Annual Symposium on Theoretical Aspects of Computer Science (STACS’92),volume 577 of Lecture Notes in Computer Science (LNCS), pages 351–362, Febru-ary 13–15, 1992, Cachan, France. Springer, Berlin, Heidelberg, New York. ISBN978-3-540-55210-9.

[1631] Jiri Jaros and Vaclav Dvorak from the Brno University of Technology, Bozetechova 2,612 66, Brno, CZ. An Evolutionary Design Technique for Collective Communicationson Optimal Diameter-Degree Networks. In Genetic and Evolutionary ComputationConference (GECCO), 2008. In proceedings [539].

[1632] Information Sciences Institute, University of Southern California, 4676 AdmiraltyWay, Marina del Rey, California 90291, USA. Internet Protocol, Darpa Internet Pro-gram Protocol Specification. RFC 791, Defense Advanced Research Projects Agency,Information Processing Techniques Office, 1400 Wilson Boulevard, Arlington, Vir-

REFERENCES 685

ginia 22209, USA, September 1981. Online available at http://tools.ietf.org/

html/rfc791 [accessed 2008-06-13].[1633] Vinton Cerf, Yogen Dalal, and Carl Sunshine. Specification of Internet Transmis-

sion Control Program (December 1974 Version). Request for Comments (RFC) 675,Network Working Group, December 1974. Online available at http://tools.ietf.org/html/rfc675 [accessed 2008-06-13].

[1634] Hirozumi Yamaguchi, Kozo Okano, Teruo Higashino, and Kenichi Taniguchifrom the Department of Information and Computer Sciences, Osaka University,Machikaneyama 1-3, Toyonaka, Osaka 560, Japan. Synthesis of Protocol Entities’Specifications from Service Specifications in a Petri Net Model with Registers. InICDCS’95: Proceedings of the 15th International Conference on Distributed Com-puting Systems, pages 510–517, May 30–June 2, 1995, Vancouver, British Columbia,Canada. IEEE Computer Society, Washington, DC, USA. ISBN 0-8186-7025-8. On-line available at http://citeseer.ist.psu.edu/yamaguchi95synthesis.html [ac-

cessed 2008-06-15].[1635] Sergio Granato de Araujo, Aloysio de Castro Pinto Pedroza, and Antonio Carneiro de

Mesquita Filho from the Electrical Engineering Deptartment, Universidade Federaldo Rio de Janeiro (UFRJ), Caixa Postal 68504, CEP 21945-970, Rio de Janeiro,RJ, Brazil. Uma Metodologia de Projeto de Protocolos de Comunicacao Baseadaem Tecnicas Evolutivas. In XX Simposio Brasileiro de Telecomunicacoes (SBT’03),October 5–8, 2003, Rio de Janeiro, Brasil. Online available at http://www.gta.

ufrj.br/ftp/gta/TechReports/AMP03e.pdf [accessed 2008-06-21]. See also [1636] and theEnglish version [848].

[1636] Sergio Granato de Araujo, Antonio Carneiro de Mesquita Filho, and Aloysio de CastroPinto Pedroza from the Electrical Engineering Deptartment, Universidade Federaldo Rio de Janeiro (UFRJ), Caixa Postal 68504, CEP 21945-970, Rio de Janeiro,RJ, Brazil. Sıntese de Circuitos Digitais Otimizados via Programacao Genetica. InXXX Seminario Integrado de Software e Hardware (SEMISH’03) in Proceedings ofXXIII Congresso da Sociedade Brasileira de Computacao, volume III, pages 273–285, August 4–5, 2003, Campinas, SP, Brasil. Online available at http://www.gta.

ufrj.br/ftp/gta/TechReports/AMP03d.pdf [accessed 2008-06-21]. See also [1635] and theEnglish version [848].

[1637] Nicholas Peter Sharples. Evolutionary Approaches to Adaptive Protocol Design. InDarren Pearce, editor, CSRP 512: The 12th White House Papers Graduate Researchin Cognitive and Computing Sciences at Sussex, Cognitive Science Research Papers,pages 60–62. University of Sussex at Brighton, November 1999. Online available atftp://ftp.informatics.sussex.ac.uk/pub/reports/csrp/csrp512.ps.Z [accessed

2008-06-23].[1638] Christian F. Tschudin and Lidia A. R. Yamamoto. A Metabolic Ap-

proach to Protocol Resilience. In Autonomic Communication – Revised Se-lected Papers from the First International IFIP Workshop, WAC 2004, vol-ume 3457/2005 of Lecture Notes in Computer Science (LNCS), pages 191–206.Springer Berlin / Heidelberg, October 18–19, 2004, Berlin, Germany. ISBN978-3-540-27417-9. doi:10.1007/11520184 15. Online available at http://cn.

cs.unibas.ch/pub/doc/2004-wac-lncs.pdf [accessed 2008-06-20], presentation onlineavailable at http://www.autonomic-communication.org/wac/wac2004/program/

presentations/wac2004-tschudin-yamamoto-slides.pdf [accessed 2008-06-20].[1639] Lidia A. R. Yamamoto and Christian F. Tschudin from the Computer Science De-

partment, University of Basel, Bernoullistrasse 16, CH-4056 Basel, Switzerland. Ex-periments on the Automatic Evolution of Protocols Using Genetic Programming. InAutonomic Communication – Revised Selected Papers from the Second InternationalIFIP Workshop, WAC 2005, volume 3854/2006 of Lecture Notes in Computer Science(LNCS), pages 13–28. Springer Berlin / Heidelberg, October 2–5 2005, Vouliagmeni,

686 REFERENCES

Athens, Greece. ISBN 978-3-540-32992-3. doi:10.1007/11687818 2. Online avail-able at http://cn.cs.unibas.ch/people/ly/doc/wac2005-lyct.pdf [accessed 2008-06-

20]. See also [1640].[1640] Lidia A. R. Yamamoto and Christian F. Tschudin from the Computer Science De-

partment, University of Basel, Bernoullistrasse 16, CH-4056 Basel, Switzerland. Ex-periments on the Automatic Evolution of Protocols Using Genetic Programming.Technical Report CS-2005-002, University of Basel, April 21, 2005. Online avail-able at http://cn.cs.unibas.ch/people/ly/doc/wac2005tr-lyct.pdf [accessed 2008-

06-20]. See also [1639].[1641] Daniele Miorandi, Paolo Dini, Eitan Altman, and Hisao Kameda. WP 2.2 – Paradigm

Applications and Mapping, D2.2.2 Framework for Distributed On-line Evolution ofProtocols and Services. BIOlogically inspired NETwork and Services (BIONETS) andFuture and Emerging Technologies (FET) project of the EU, 2nd edition, June 14,2007. BIONETS/CN/wp2.2/v2.1. Editor: Lidia A. R. Yamamoto. Verification DavidLinner and Fran coise Baude. Status: Final, Public. Online available at http://www.bionets.eu/docs/BIONETS_D2_2_2.pdf and 2008-06-23 [accessed .]

[1642] Richard Heady, George Luger, Arthur Maccabe, and Mark Servilla. The architectureof a network level intrusion detection system. Technical Report CS90-20, Departmentof Computer Science, University of New Mexico, USA, August 1990.

[1643] Gianluigi Folino, Clara Pizzuti, and Giandomenico Spezzano from the ICAR-CNR,Via P.Bucci 41/C, Univ. della Calabria, 87036 Rende (CS), Italy. GP Ensemble forDistributed Intrusion Detection Systems. In Pattern Recognition and Data Mining,Proceedings of the Third International Conference on Advances in Pattern Recogni-tion, ICAPR 2005, volume 3686/2005 of Lecture Notes in Computer Science (LNCS),pages 54–62. Springer Berlin / Heidelberg, August 22–25, 2005, Bath, UK. ISBN 978-3-540-28757-5. doi:10.1007/11551188 6. Online available at http://dns2.icar.cnr.it/pizzuti/icapr05.pdf [accessed 2008-06-23].

[1644] Srinivas Mukkamala, Andrew H. Sung, and Ajith Abraham. Modeling intrusion de-tection systems using linear genetic programming approach. In Robert Orchard,Chunsheng Yang, and Moonis Ali, editors, Proceedings of the 17th InternationalConference on Industrial and Engineering Applications of Artificial Intelligence andExpert Systems, IEA/AIE 2004, volume 3029/2004 of Lecture Notes in ComputerScience (LNCS), pages 633–642. Springer Springer Verlag Inc, May 17–20, 2004, Ot-tawa, Canada. ISBN 3-540-22007-0, 978-3-540-22007-7. doi:10.1007/b97304. Onlineavailable at http://www.rmltech.com/LGP%20Based%20IDS.pdf [accessed 2008-06-17].

[1645] James V. Hansen, Paul Benjamin Lowry, Rayman Meservy, and Dan McDonald.Genetic programming for prevention of cyberterrorism through previous dynamicand evolving intrusion detection. Decision Support Systems, 43(4):1362–1374, Au-gust 2007. doi:10.1016/j.dss.2006.04.004. Special Issue Clusters. Online avail-able at http://dx.doi.org/10.1016/j.dss.2006.04.004 and http://ssrn.com/

abstract=877981 [accessed 2008-06-17].[1646] Dawn Xiaodong Song from the Computer Science Department, Carnegie Mellon Uni-

versity, 5000 Forbes Avenue, Pittsburgh, PA 15213, USA. Athena: an AutomaticChecker for Security Protocol Analysis. In Proceedings of 12th IEEE Computer Se-curity Foundation Workshop. IEEE press, June 1999. Online available at http://

www.ece.cmu.edu/~dawnsong/papers/Athena.pdf and http://www.ece.cmu.edu/

~dawnsong/papers/Athena.ps [accessed 2008-06-23].[1647] ISO. Information technology – Security techniques – Entity authentication – Part

3: Mechanisms using digital signature techniques. ISO/IEC 9798-3, InternationalStandards Organization (ISO), 1993. JTC 1 Information technology. TC/SC: JTC1/SC 27. Status: withdrawn.

[1648] Tadashi Nakano and Tatsuya Suda. Applying biological principles to designs ofnetwork services. Applied Soft Computing, 7(3):870–878, June 2007. ISSN 1568-4946.

REFERENCES 687

doi:10.1016/j.asoc.2006.04.006.[1649] Paul Grace. Genetic Programming and Protocol Configuration. Master’s thesis,

Computing Department, Lancaster University, September 2000. Supervisor: Profes-sor Gordon Blair. Online available at http://www.lancs.ac.uk/postgrad/gracep/msc.pdf [accessed 2008-06-23].

[1650] JavaGroups – A Reliable Multicast Communication Toolkit for Java, CornellUniversity and SourceForge, 1999–2008. See http://www.cs.cornell.edu/

Info/Projects/JavaGroupsNew/ [accessed 2008-06-23] and http://sourceforge.net/

projects/javagroups [accessed 2008-06-23].[1651] Werner Van Belle, Tom Mens, and Theo DHondt from the Programming Technology

Lab, Vrije Universiteit Brussel, Pleinlaan 2, 1050 Brussel, Belgium. Using GeneticProgramming to Generate Protocol Adaptors for Interprocess Communication. InAndy M. Tyrrell, Pauline C. Haddow, and Jim Torresen, editors, Proceedings of the5th International Conference on Evolvable Systems: From Biology to Hardware. ICES2003, volume 2606/2003 of Lecture Notes in Computer Science (LNCS), pages 67–73. Springer Berlin / Heidelberg, March 17–20, 2003, Trondheim, Norway. ISBN978-3-540-00730-2. Online available at http://werner.yellowcouch.org/Papers/

genadap03/ICES-online.pdf and http://prog.vub.ac.be/Publications/2003/

vub-prog-tr-03-33.pdf [accessed 2008-06-23].[1652] Werner Van Belle from the Programming Technology Lab (PROG), Department

Informatica (DINF), Vrije Universiteit Brussel (VUB), Pleinlaan 2, 1050 Brussels,Belgium. Automatic Generation of Concurrency Adaptors by Means of LearningAlgorithms. PhD thesis, Vrije Universiteit Brussel, Faculteit van de Wetenschappen,Departement Informatica, August 2001. Promotor: Theo D’Hondt, co-Promotor: TomTourwe. Online available at http://borg.rave.org/adaptors/Thesis6.pdf [accessed

2008-06-23].[1653] Theodore S. Rappaport. Wireless Communications: Principles and Practice. Prentice

Hall PTR, 2001, (2nd ed: January 2002). ISBN 978-0130422323, 0130422320. Partlyonline available at http://books.google.com/books?id=8ZXdHQAACAAJ [accessed 2008-

07-27].[1654] Andrea Goldsmith from the Stanford University, California. Wireless Communi-

cations. Cambridge University Press, The Edinburgh Building, Shaftesbury Road,Cambridge, CB2 8RU, UK, August 2005. Partly online available at http://books.google.com/books?id=mF7X_8D7_BIC [accessed 2008-07-27].

[1655] Andreas F. Molisch. Wireless Communications. John Wiley & Sons / IEEE Press,November 18, 2005. ISBN 978-0470848876, 0470848871. Partly online available athttp://books.google.com/books?id=2NNCHgAACAAJ [accessed 2008-07-27].

[1656] Mohammad Ilyas and Imad Mahgoub, editors. Handbook of Sensor Networks: Com-pact Wireless and Wired Sensing Systems. CRC, July 16, 2004. ISBN 978-0849319686.

[1657] Edgar H. Callaway, Jr. Wireless Sensor Networks: Architectures and Protocols.AUERBACH, August 26, 2003. ISBN 978-0849318238.

[1658] Richard Harper, editor. Inside the smart home. Springer, 2003. ISBN 1852336889,978-1-85233-688-2. Partly online available at http://books.google.com/books?

id=SvcHvHuv86gC [accessed 2008-07-27].[1659] Werner Harke. Smart Home – Vernetzung von Haustechnik und Kommunikationssys-

temen im Wohnungsbau. Huthig Verlag / C. F. Muller, December 31, 2003. ISBN978-3-7880-7713-6, 3788077131.

[1660] Adam Greenfield. Everyware: The Dawning Age of Ubiquitous Computing. NewRiders Publishing, March 20, 2006. ISBN 0321384016, 978-0321384010.

[1661] John Krumm, Gregory D. Abowd, Aruna Seneviratne, and Thomas Strang, edi-tors. UbiComp 2007: Ubiquitous Computing. Proceedings of the 9th InternationalConference, volume 4717 of Lecture Notes in Computer Science, September 16–19,

688 REFERENCES

2007, Innsbruck, Austria. Springer Berlin / Heidelberg. ISBN 978-3-540-74852-6.doi:10.1007/978-3-540-74853-3.

[1662] Workshop on Amorphous Computing, September 13–14, 1999, DARPA ITO, MIT Ar-tificial Intelligence Laboratory, Cambridge, MA, USA. MIT AI Lab. Online availableat http://www-swiss.ai.mit.edu/projects/amorphous/workshop-sept-99/ [ac-

cessed 2008-07-27].[1663] William J. Butera. Programming a Paintable Computer. PhD thesis, MIT

Media Lab, Massachusetts Institute of Technology, MA, USA, February 2002.Online available at http://www-swiss.ai.mit.edu/projects/amorphous/papers/butera-phd.pdf [accessed 2008-07-27].

[1664] Craig W. Reynolds. Flocks, herds and schools: A distributed behavioralmodel. SIGGRAPH Computer Graphics, 4(10):25–34, July 1987. ISSN0097-8930. Online available at http://graphics.ucmerced.edu/~mkallmann/

courses/papers/Reynolds1987-flocks.pdf and http://www.cs.toronto.edu/

~dt/siggraph97-course/cwr87/ [accessed 2008-07-27]. See also [1945].[1665] Leonid Libkin and Limsoon Wong. Query Languages for Bags and Aggregate Func-

tions. Journal of Computer and System Sciences, 55(2):241–272, October 1997. On-line available at http://citeseer.ist.psu.edu/libkin97query.html and http://

www.cs.toronto.edu/~libkin/papers/jcss97.ps.gz [accessed 2007-09-12].[1666] Gultekin Ozsoyoglu, Z. Meral Ozsoyoglu, and Victor Matos. Extending Relational Al-

gebra and Relational Calculus with Set-Valued Attributes and Aggregate Functions.ACM Transactions on Database Systems, 12(4):566–592, 1987. Online available athttp://doi.acm.org/10.1145/32204.32219 [accessed 2007-09-12].

[1667] Anthony C. Klug. Equivalence of Relational Algebra and Relational Calculus QueryLanguages Having Aggregate Functions. Journal of the ACM (JACM), 29(3):699–717, July 1982. ISSN 0004-5411. Online available at http://doi.acm.org/10.1145/322326.322332 [accessed 2007-07-28].

[1668] Ines Fernando Vega Lopez, Richard T. Snodgrass, and Bongki Moon. Spa-tiotemporal Aggregate Computation: A Survey. IEEE Transactions on Knowl-edge and Data Engineering, 17(2):271–286, February 2005. ISSN 1041-4347. Online available at http://citeseer.ist.psu.edu/634034.html [accessed

http://www.cs.arizona.edu/ bkmoon/papers/tkde-stagg.pdf]2007-09-12.[1669] Arbee L. P. Chen, Jui-Shang Chiu, and Frank S.C. Tseng. Evaluat-

ing Aggregate Operations Over Imprecise Data. IEEE Transactions onKnowledge and Data Engineering, 8(2):273–284, April 1996. ISSN 1041-4347. Online available at http://make.cs.nthu.edu.tw/alp/alp_paper/

Evaluating%20aggregate%20operations%20over%20imprecise%20data.pdf

[accessed 2007-09-12].[1670] Tina Dell’Armi, Wolfgang Faber, Giuseppe Ielpa, Nicola Leone, and Gerald Pfeifer.

Aggregate Functions in Disjunctive Logic Programming Semantics, Complexity, andImplementation in DLV. In Proceedings of the 18th International Joint Conferenceon Artificial Intelligence (IJCAI) 2003, pages 847–852, 2003. Online available athttp://citeseer.ist.psu.edu/643941.html and http://www.icons.rodan.pl/

publications/%5BDellArmi2003%5D.pdf [accessed 2007-09-12]. In proceedings [1946].[1671] John Miles Smith and Diane C. P. Smith. Database abstractions: Aggregation

and Generalization. ACM Transaction on Database Systems, 2(2):105–133, June1977. ISSN 0362-5915. Online available at http://portal.acm.org/citation.cfm?doid=320544.320546 and http://libra.msra.cn/paperDetail.aspx?id=794625&

[accessed 2007-08-11].[1672] Robbert van Renesse. The Importance of Aggregation. In A. Schiper, A. A. Shvarts-

man, H. Weatherspoon, and B. Y. Zhao, editors, Future Directions in DistributedComputing, volume 2584/2003 of Lecture Notes in Computer Science (LNCS), pages87–92. Springer Berlin/Heidelberg, 2003.

REFERENCES 689

[1673] Mark Jelasity, Alberto Montresor, and Ozalp Babaoglu. Gossip-based aggregation inlarge dynamic networks. ACM Trans. Comput. Syst., 23(3):219–252, 2005. ISSN0734-2071. Online available at http://www.cs.unibo.it/bison/publications/

aggregation-tocs.pdf and http://portal.acm.org/citation.cfm?id=1082470

[accessed 2007-08-01].[1674] David Kempe, Alin Dobra, and Johannes Gehrke. Gossip-Based Computation of Ag-

gregate Information. In Proceedings of 44th Symposium on Foundations of ComputerScience (FOCS 2003), pages 482–491, October 11–14, 2003, Cambridge, MA, USA.IEEE Computer Society, Los Alamitos, CA, USA. ISBN 0-7695-2040-5. Online avail-able at http://www.cs.cornell.edu/johannes/papers/2003/focs2003-gossip.

pdf and http://citeseer.ist.psu.edu/kempe03gossipbased.html [accessed 2007-09-

15].[1675] Thomas Weise, Michael Zapf, and Kurt Geihs from the University of Kassel, FB-

16, Distributed Systems Group, Wilhelmshoher Allee 73, 34121 Kassel, Germany.Evolving Proactive Aggregation Protocols. In Genetic Programming – Proceedings ofthe 11th European Conference on Genetic Programming, EuroGP 2008, pages 254–265, 2008. doi:10.1007/978-3-540-78671-9 22. In proceedings [890]. Online availableat http://www.it-weise.de/documents/index.html#WZG2008DGPFa and http://

dx.doi.org/10.1007/978-3-540-78671-9_22 [accessed 2008-08-09].[1676] Mark Jelasity and Alberto Montresor. Epidemic-Style Proactive Aggregation in

Large Overlay Networks. In Proceedings of the 24th International Conference onDistributed Computing Systems (ICDCS’04), pages 102–109, March 2004. IEEEComputer Society, Tokyo, Japan. Online available at http://citeseer.ist.psu.

edu/jelasity04epidemicstyle.html and http://en.scientificcommons.org/

9048443 [accessed 2007-08-13].[1677] Wendi Rabiner Heinzelman, Joanna Kulik, and Hari Balakrishnan. Adaptive Pro-

tocols for Information Dissemination in Wireless Sensor Networks. In MobiCom’99:Proceedings of the 5th annual ACM/IEEE international conference on Mobile com-puting and networking, pages 174–185, 1999, Seattle, Washington, United States.ACM Press, New York, NY, USA. ISBN 1-58113-142-9. Online available athttp://citeseer.ist.psu.edu/kulik99adaptive.html and http://www.comet.

columbia.edu/~campbell/e6906/papers/heinzelman99.pdf [accessed 2007-08-13].[1678] Matthew Wall. GALib: A C++ Library of Genetic Algorithm Components. Ver-

sion 2.4, Documentation Revision B. Technical Report, Mechanical Engineering De-partment, Massachusetts Institute of Technology, August 1996. Online available athttp://lancet.mit.edu/ga/dist/galibdoc.pdf [accessed 2007-08-22].

[1679] Maarten Keijzer, J. J. Merelo, G. Romero, and Marc Schoenauer. Evolving Objects:A General Purpose Evolutionary Computation Library. In Proceedings of 5th Inter-national Conference on Artificial Evolution, Evolution Artificielle, EA 2001, pages829–888, 2001. In proceedings [503]. Online available at http://www.lri.fr/~marc/EO/EO-EA01.ps.gz and http://citeseer.ist.psu.edu/keijzer01evolving.html

[accessed 2007-08-24]. See also http://eodev.sourceforge.net/ [accessed 2007-08-24].[1680] Evelyne Lutton, Pierre Collet, and Jean Louchet. EASEA Comparisons on Test Func-

tions: GALib versus EO. In Proceedings of the Fifth Conference on Artificial Evolu-tion, Evolution Artificielle (EA-2001), pages 219–230, 2001. In proceedings [503]. On-line available at http://fractales.inria.fr/evo-lab/EASEAComparisonFinal.

ps.gz [accessed 2007-08-24].[1681] James Gosling and Henry McGilton. The Java Language Environment – A White

Paper. Technical Report, Sun Microsystems, Inc., May 1996. Online available athttp://java.sun.com/docs/white/langenv/ [accessed 2007-07-03].

[1682] James Gosling, Bill Joy, Guy Steele, and Gilad Bracha. Java(TM) Language Spec-ification. The Java Series. Prentice Hall PTR, 3rd edition, June 2005. ISBN 978-

690 REFERENCES

0321246783. Online available at http://java.sun.com/docs/books/jls/ [accessed

2007-09-14].[1683] Jon Byous. Java Technology: The Early Years. Technical Report, Sun Microsys-

tems, Inc., ca. 1998. Online available at http://java.sun.com/features/1998/05/birthday.html [accessed 2007-07-03].

[1684] Guido Kruger. Handbuch der Java-Programmierung. Addison-Wesley, 4. aktualisierteedition, 2006. ISBN 3-8273-2361-4 and 3-8273-2447-5. Online available at http://

www.javabuch.de/ [accessed 2007-07-03].[1685] Bruce Eckel. Thinking in Java. Prentice Hall PTR, 4th edition, February 2006. ISBN

978-0131872486. 3rd edition online available at http://www.mindview.net/Books/

TIJ/ [accessed 2007-07-03].[1686] David Flanagan. Java In A Nutshell. O’Reilly Media, Inc., 5th edition, March 2005.

ISBN 978-0596007737.[1687] David Flanagan. Java Examples in a Nutshell. O’Reilly Media, Inc., 3rd, illustrated

edition, January 2004. ISBN 978-0596006204.[1688] Pat Niemeyer and Jonathan Knudsen. Learning Java. O’Reilly Media, Inc, third

edition, June 2005. ISBN 978-0-596-00873-4.[1689] Christian Ullenboom. Java ist auch eine Insel – Programmieren mit der Java Stan-

dard Edition Version 6. Galileo Computing, Galileo Press, 6. aktualisierte underweiterte edition, 2007. ISBN 3-89842-838-9. Online available at http://www.

galileocomputing.de/openbook/javainsel6/ [accessed 2007-07-03].[1690] Yiping Ding, Ethan D. Bolker, and Arjun Kumar. Performance Implications of Hyper-

Threading. In Proceedings of 29th International Computer Measurement Group Con-ference, pages 21–29. Computer Measurement Group, December 7–12, 2003, Dallas,Texas, USA.

[1691] Marcel Dekker. Introduction to Set Theory. CRC, revised, and expanded, thirdedition, June 22, 1999. ISBN 0-8247-7915-0.

[1692] Paul R. Halmos. Naive Set Theory. Undergraduate Texts in Mathematics. Springer-Press New York Inc., first edition, June 2001. ISBN 0-3879-0092-6. New EditionJanuary 1998, ISBN: 978-0387900926.

[1693] Robert R. Stoll. Set Theory and Logic. Dover Publications, reprint edition, October 1,1979. ISBN 0-4866-3829-4, 978-0486638294.

[1694] Donald Ervin Knuth. Sorting and Searching, volume 3 of The Art of ComputerProgramming (TAOCP). Addison-Wesley, Reading, Massachusetts, second edition,1998. ISBN 0-201-89685-0.

[1695] Robert Sedgewick. Algorithms in Java, Parts 1-4. Addison Wesley, third edition,September 2002. ISBN 0-2013-6120-5.

[1696] Steven R. Finch. Transitive Relations, Topologies and Partial Orders, June 5, 2003.Online available at http://citeseer.ist.psu.edu/finch03transitive.html andhttp://algo.inria.fr/csolve/posets.pdf [accessed 2007-07-28]. See also [1947].

[1697] Bas C. van Fraassen. Laws and Symmetry. Clarendon Paperbacks. Oxford UniversityPress, USA, January 1990. ISBN 978-0198248606.

[1698] David A. R. Wallace. Groups, Rings and Fields. Springer Undergraduate Mathe-matics Series. Springer, February 2004. ISBN 978-3540761778. Online available athttp://books.google.de/books?id=EmO9ejuMHNUC [accessed 2007-07-28].

[1699] Alfred Renyi. Probability Theory. Dover Publications, May 2007. ISBN 978-0486458670.

[1700] Gregory F. Lawler. Introduction to Stochastic Processes. Chapman & Hall/CRC,second edition, May 2006. ISBN 978-1584886518.

[1701] Edwin Thompson Jaynes. Probability Theory: The Logic of Science. WashingtonUniversity, preprint edition, 1996. See also printed version [1702]. G. Larry Bretthorsted. Online available at http://bayes.wustl.edu/etj/prob/book.pdf [accessed 2007-08-

08].

REFERENCES 691

[1702] Edwin Thompson Jaynes. Probability Theory: The Logic of Science. CambridgeUniversity Press, June 2003. ISBN 978-0521592710. See also [1701]. Larry Bretthorsted. Online available at http://bayes.wustl.edu/etj/prob/book.pdf [accessed 2007-08-

08].[1703] Olav Kallenberg. Foundations of modern probability. Probability and Its Applications.

Springer, New York, second edition, January 8, 2002. ISBN 978-0387953137,0-3872-5115-4. OCLC: 60740995.

[1704] Olav Kallenberg. Probabilistic symmetries and invariance principles. Probabilityand its Applications. Springer, New York, July 27, 2005. ISBN 978-0-387-25115-8,0-3879-4957-7, 0-3879-5313-2. OCLC: 46937587.

[1705] Pierre-Simon Marquis de Laplace. Theorie Analytique des Probabilites (AnalyticalTheory of Probability). Courcier, Imprimeur-Libraire pour les Mathematiques, quaides Augustins, no. 57, 1812. Premiere Partie. Online available at http://books.

google.de/books?id=nQwAAAAAMAAJ [accessed 2007-08-27].[1706] Richard von Mises. Probability, Statistics, and Truth. Dover Publications, second

english, reproduced 1981 dover edition, 1957. ISBN 0486242145, 978-0486242149.[1707] Richard von Mises and Hilda Geiringer. Mathematical Theory of Probability and

Statistics. Academic Press Inc., New York, February 1965. ISBN 0127273565, 978-0127273563.

[1708] Andrei Nikolajevich Kolmogorov. Foundations of the Theory of Probability. ChelsaPublishing Company New York, second edition, 1956, June 1960. ISBN 978-0828400237. monograph “Grundbegriffe der Wahrscheinlichkeitsrechnung” 1933,book 1950, Online available at http://www.mathematik.com/Kolmogorov/ [accessed

2007-09-15].[1709] Paul T. von Hippel. Mean, Median, and Skew: Correcting a Textbook Rule. Journal

of Statistics Education, 13(2), 2005. Online available at http://www.amstat.org/

publications/jse/v13n2/vonhippel.html [accessed 2007-09-15].[1710] Henry Bottomley. Relationship between the mean, median, mode, and standard

deviation in a unimodal distribution, September 2006. Online available at http://

www.btinternet.com/~se16/hgb/median.htm [accessed 2007-09-15].[1711] Claude Elwood Shannon. A Mathematical Theory of Communication. Bell Sys-

tem Technical Journal, 27:379–423/623–656, July/October 1948. Online available athttp://plan9.bell-labs.com/cm/ms/what/shannonday/paper.html [accessed 2007-09-

15]. Also published in D. Slepian, editor, Key Papers in the Development of Informa-tion Theory, New York: IEEE Press, 1974; N. J. A. Sloane and A. D. Wyner, editors,Claude Elwood Shannon: Collected Papers, New York: IEEE Press, 1993; W. Weaverand Claude Elwood Shannon, The Mathematical Theory of Communication, Urbana,Illinois: University of Illinois Press, 1949, republished in paperback 1963.

[1712] A. C. G. Verdugo Lazo and P. N. Rathie. On the entropy of continuous probabilitydistributions. IEEE Transactions on Information Theory, 24(1):120–122, 1978.

[1713] J. H. Ahrens and U. Dieter. Computer methods for sampling from gamma,beta, poisson and bionomial distributions. Computing, 12(3):223–246, Septem-ber 10, 1974. ISSN 0010-485X (Print) 1436-5057 (Online). doi:10.1007/BF02293108.Online available at http://www.springerlink.com/content/712tn58716485674/

fulltext.pdf [accessed 2007-09-15].[1714] Donald L. Snyder and Michael I. Miller. Random Point Processes in Time and Space.

Springer, second edition, June 19, 1991. ISBN 978-0387975771.[1715] Marvin Zelen and Norman C. Severo. Probability Functions. In Milton Abramowitz

and Irene A. Stegun, editors, Handbook of Mathematical Functions with Formulas,Graphs, and Mathematical Tables, chapter 26. Dover Publications / National Bureauof Standards, first. (new ed june 1, 1965) edition, 1964. ISBN 978-0486612720.

[1716] Ming Tan, Hong-Bin Fang, Guo-Liang Tian, and Gang Wei. Testing multivariatenormality in incomplete data of small sample size. Journal of Multivariate Analysis,

692 REFERENCES

93(1):164–179, 2005. ISSN 0047-259X. Online available at http://dx.doi.org/10.1016/j.jmva.2004.02.014 [accessed 2007-09-15].

[1717] N. J. H. Small. Miscellanea: Marginal Skewness and Kurtosis in Testing MultivariateNormality. Applied Statistics, 29(1):85–87, 1980. ISSN 0035-9254.

[1718] J. P. Royston. Some Techniques for Assessing Multivariate Normality Based on theShapiro-Wilk W . Applied Statistics, 32(2):121–133, 1983. ISSN 0035-9254.

[1719] Luc Devroye from the School of Computer Science, McGill University. Non-UniformRandom Variate Generation. Springer-Verlag, New York, 1986. ISBN 0-387-96305-7, 3-540-96305-7. Online available at http://cg.scs.carleton.ca/~luc/

rnbookindex.html [accessed 2007-07-05].[1720] William Sealy Gosset. The probable error of a mean. Biometrika, 6(1):1–25,

March 1908. Because the author was not allowed to publish this article, he usedthe pseudonym Student. Online available at http://www.york.ac.uk/depts/maths/histstat/student.pdf [accessed 2007-09-30]. Reprinted in [1721].

[1721] William Sealy Gosset. The probable error of a mean. In E. S. Pearson and JohnWishart, editors, “Student’s” Collected Papers, pages 11–34. Cambridge UniversityPress for the Biometrika Trustees, 1942. With a Foreword by Launce McMullen.Reprint of [1720].

[1722] Sir Ronald Aylmer Fisher. Applications of “Student’s” distribution. Metron, 5:90–104, 1925. Online available at http://digital.library.adelaide.edu.au/coll/

special/fisher/43.pdf [accessed 2007-09-30].[1723] John A. Rice. Mathematical Statistics and Data Analysis. Statistics. Duxbury Press,

third edition, April 2006. ISBN 978-0534399429, 978-0534209346 (2nd ed.).[1724] Steven M. Kay. Fundamentals of Statistical Signal Processing, Volume I: Estimation

Theory, volume 1. Prentice Hall PTR, us es edition, March 26, 1993. ISBN 978-0133457117.

[1725] H. Vincent Poor. An Introduction to Signal Detection and Estimation. Springer,second edition, June 2005. ISBN 978-0387941738.

[1726] Harry L. Van Trees. Detection, Estimation, and Modulation Theory, Part I. Wiley-Interscience, reprint edition, February 2007. ISBN 978-0471095170.

[1727] Dan Simon. Optimal State Estimation: Kalman, H Infinity, and Nonlinear Ap-proaches. Wiley-Interscience, June 2006. ISBN 978-0471708582.

[1728] John Aldrich. R.A. Fisher and the making of maximum likelihood 1912-1922.Statistical Science, 3(12):162–176, January 1995. Online available at http://

projecteuclid.org/euclid.ss/1030037906 [accessed 2007-09-15].[1729] R. L. Plackett. Some theorems in least squares. Biometrika, 37(12):149–157,

1950. Online available at http://biomet.oxfordjournals.org/cgi/reprint/37/

1-2/149 [accessed 2007-09-15].[1730] Sir Ronald Aylmer Fisher. Statistical methods and scientific inference. New York,

Hafner Press/Macmillan Pub Co, revised (june 1973) edition, 1956. ISBN 0028447409.[1731] George Casella and Roger L. Berger. Statistical Inference. Duxbury Thomson Learn-

ing, Pacific Grove, CA, USA, second edition, 2002. ISBN 0-534-24312-6.[1732] M.C. Jones Bernard. W. Silverman. Fix, E. and Hodges, J. L. (1951): An impor-

tant contribution to nonparametric discriminant analysis and density estimation:Commentary on Fix and Hodges (1951). International Statistical Review / RevueInternationale de Statistique, 57(3):233–247, April 1989.

[1733] David W. Scott. Multivariate Density Estimation: Theory, Practice, and Visualiza-tion. Wiley Series in Probability and Statistics. Wiley-Interscience, John Wiley &Sons, August 1992. ISBN 0-4715-4770-0.

[1734] Bernard. W. Silverman. Density Estimation for Statistics and Data Analysis. Chap-man & Hall/CRC, Bristol, England, April 1986. ISBN 0-4122-4620-1.

[1735] Kalyanmoy Deb, Samir Agrawal, Amrit Pratab, and T. Meyarivan. A Fast Eli-tist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization:

REFERENCES 693

NSGA-II. In Proceedings of the Parallel Problem Solving from Nature VI Conference,pages 849–858, 2000. In proceedings [576]. Online available at http://citeseer.

ist.psu.edu/deb00fast.html [accessed 2007-07-28].[1736] Emanuel Parzen from the Stanford University California, Applied Mathematics and

Statistics Lab. On estimation of a probability density function and mode. Annalsof Mathematical Statistics, 33:1065–1076, August 1962. Online available at http://citeseer.ist.psu.edu/parzen62estimation.html [accessed 2007-08-11].

[1737] Milos Drutarovsky, Viktor Fischer, Martin Simka, and Frederic Celle. A Simple PLL-based True Random Number Generator for Embedded Digital Systems. Computingand Informatics, 23(5):501–515, 2004.

[1738] Martin Simka, Milos Drutarovsky, and Viktor Fischer. Embedded True RandomNumber Generator in Actel FPGAs. In Workshop on Cryptographic Advances in Se-cure Hardware – CRASH 2005, pages 6–7, September 2005. Leuven, Belgium. Onlineavailable at http://www.best.tuke.sk/simka/pub.html [accessed 2007-09-15].

[1739] Viktor Fischer, Milos Drutarovsky, Martin Simka, and Nathalie Bochard. High Per-formance True Random Number Generator in Altera Stratix FPLDs. In JurgenBecker, Marco Platzner, and Serge Vernalde, editors, Field-Programmable Logic andApplications – FPL 2004, volume 3203 of Lecture Notes in Computer Science (LNCS),pages 555–564, August 2004. Springer-Verlag, Lueven, Belgium. Online available athttp://www.best.tuke.sk/simka/pub.html [accessed 2007-09-15].

[1740] Berk Sunar, William J. Martin, and Douglas R. Stinson. A Provably Se-cure True Random Number Generator with Built-In Tolerance to Active At-tacks. IEEE Transactions on Computers, 56(1):109–119, 2007. ISSN 0018-9340.doi:10.1109/TC.2007.4. Online available at http://www.cacr.math.uwaterloo.ca/

~dstinson/papers/rng-IEEE.pdf [accessed 2007-09-15].[1741] Martin Simka. Testing True Random Number Generators Used in Cryptography. In

Proceedings of the IV. PhD students conference, pages 95–96. Technical University ofKosice, Slovakia, May 2004. Online available at http://www.best.tuke.sk/simka/pub.html [accessed 2007-09-15].

[1742] Ueli Maurer. Fast Generation of Prime Numbers and Secure Public-Key Crypto-graphic Parameters. Journal of Cryptology, 8(3):123–155, September 1995. ISSN0933-2790 (Print) 1432-1378 (Online). doi:10.1007/BF00202269. Online avail-able at http://www.springerlink.com/content/u3710818146qq153/fulltext.

pdf and http://citeseer.ist.psu.edu/186041.html [accessed 2007-09-15].[1743] Ilpo Vattulainen, T. Ala-Nissila, and K. Kankaala. Physical tests for random numbers

in simulations. Physical Review Letters, 73(7):2513–2516, 1994. Online available athttp://citeseer.ist.psu.edu/vattulainen94physical.html [accessed 2007-07-28].

[1744] Walter Selke, L.N. Shchur, and A.L. Talapov. Cluster–flipping Monte Carlo algorithmand correlations in “good” random number generators. JETP Letters, 58(8):684–686,1993.

[1745] Alan M. Ferrenberg, D. P. Landau, and Y. Joanna Wong. Monte Carlo simulations:Hidden errors from “good” random number generators. Physical Review Letters, 69(23):3382–3384, December 1992. Online available at http://prola.aps.org/pdf/

PRL/v69/i23/p3382_1 [accessed 2007-08-18].[1746] Hui-Chin Tang. Combined random number generator via the generalized Chinese

remainder theorem. Journal of Computational and Applied Mathematics, 142(2):377–388, May 15, 2002. ISSN 0377-0427. doi:10.1016/S0377-0427(01)00424-1. Onlineavailable at http://dx.doi.org/10.1016/S0377-0427(01)00424-1 [accessed 2007-09-16].

[1747] Abhishek Parakh from the Lousiana State University. A d-Sequence based RecursiveRandom Number Generator, 2006. Online available at http://arxiv.org/abs/cs.CR/0603029 [accessed 2007-09-16].

694 REFERENCES

[1748] Lenore Blum, Manuel Blum, and Michael Shub. A simple unpredictable pseudo-random number generator. SIAM Journal on Computing, 15:364–383, May 1986.ISSN 0097–5397.

[1749] E. F. Carter. The Generation and Application of Random Numbers. Forth Dimen-sions, XVI(1 and 2), 1994, Oakland California.

[1750] Michael Hennecke from the Rechenzentrum, Universitat Karlsruhe, D-76128Karlsruhe, Germany. RANEXP: experimental random number generatorpackage. Computer Physics Communications, 79(2):261–267, April 1994.doi:10.1016/0010-4655(94)90072-8. Online available at http://dx.doi.org/10.

1016/0010-4655(94)90072-8 [accessed 2007-08-19].[1751] Claude Overstreet, Jr. and Richard E. Nance. A random number generator for small

word-length computers. In ACM’73: Proceedings of the annual conference, pages219–223, 1973, Atlanta, Georgia, United States. ACM Press/CSC-ER, New York,NY, USA. doi:10.1145/800192.805707. Online available at http://doi.acm.org/

10.1145/800192.805707 [accessed 2007-09-15].[1752] P. D. Coddington and A. J. Newell. JAPARA – A Java Parallel Random Number

Generator Library for High-Performance Computing. In Proceedings of the 6th In-ternational Workshop on Java for Parallel and Distributed Computing IPDPS 2004,page 156a. IEEE Computer Society, Los Alamitos, CA, USA, April 26, 2004, SantaFe, New Mexico. ISBN 076-9521-320. doi:10.1109/IPDPS.2004.1303143.

[1753] John R. Koza from the Computer Science Department, Stanford University, Stan-ford, CA 94305 USA. Evolving a computer program to generate random numbersusing the genetic programming paradigm. In Proceedings of the Fourth Interna-tional Conference on Genetic Algorithms, pages 37–44, 1991. In proceedings [738].Online available at http://citeseer.ist.psu.edu/112986.html and http://www.

genetic-programming.com/jkpdf/icga1991.pdf [accessed 2008-05-29].[1754] Derrick Henry Lehmer. Mathematical methods in large-scale computing units. In

Proceedings of the 2nd Symposium on Large-Scale Digital Calculating Machinery,1949, pages 141–146. Harvard University Press, 1951, Cambridge, MA, USA.

[1755] Derrick Henry Lehmer. Mathematical methods in large-scale computing units. Math.Rev., 13(1):495, 1952.

[1756] Karl Entacher. Bad subsequences of well-known linear congruential pseudoran-dom number generators. ACM Transactions on Modeling and Computer Simulation(TOMACS), 8(1):61–70, 1998. ISSN 1049-3301. doi:10.1145/272991.273009. Onlineavailable at http://doi.acm.org/10.1145/272991.273009 [accessed 2007-09-15].

[1757] Donald Ervin Knuth. The Art of Computer Programming: Seminumerical Algorithms,volume 2. Addison-Wesley, third edition, 1997. ISBN 020-1896-842, 978-0201038026.

[1758] George Edward Pelham Box and Mervin Edgar Muller. A note on the generation ofrandom normal deviates. Annals Math. Stat, 29(5):610–611, 1958. Online availableat http://projecteuclid.org/euclid.aoms/1177706645 [accessed 2007-09-15].

[1759] Classification, Clustering, and Data Mining Applications: Proceedings of the Meetingof the International Federation of Classification Societies (IFCS), ... Data Analysis,and Knowledge Organization), 2004. Springer-Verlag New York, Inc., Secaucus, NJ,USA. ISBN 3540220143.

[1760] Margaret H. Dunham. Data Mining: Introductory and Advanced Topics. PrenticeHall PTR, Upper Saddle River, NJ, USA, August 2002. ISBN 0130888923.

[1761] Boris Mirkin. Clustering for Data Mining: A Data Recovery Approach. Computer Sci-ence and Data Analysis. Chapman & Hall/CRC, April 2005. ISBN 978-1584885344.

[1762] Pavel Berkhin. Survey Of Clustering Data Mining Techniques. Technical Report,Accrue Software, San Jose, CA, 2002. Online available at http://www.ee.ucr.

edu/~barth/EE242/clustering_survey.pdf and http://citeseer.ist.psu.edu/

berkhin02survey.html [accessed 2007-08-27].

REFERENCES 695

[1763] Michael W. Berry, editor. Survey of Text Mining: Clustering, Classification, andRetrieval. Springer, September 2003. ISBN 978-0387955636.

[1764] Mieczyslaw A. K lopotek, Slawomir T. Wierzchon, and Krzysztof Trojanowski, editors.Intelligent Information Processing and Web Mining: Proceedings of the InternationalIIS: IIPWMA05, Advances in Soft Computing, June 2005, Gdansk, Poland. Springer,Berlin, Heidelberg, New York. ISBN 978-3-540-25055-2.

[1765] Mingfang Wu, Michael Fuller, and Ross Wilkinson. Using clustering and classifica-tion approaches in interactive retrieval. Inf. Process. Manage., 37(3):459–484, 2001.Online available at http://citeseer.ist.psu.edu/wu01using.html and http://

de.scientificcommons.org/313591 [accessed 2007-08-11].[1766] Dmitri Roussinov and Hsinchun Chen. Information navigation on the web by

clustering and summarizing query results. Information Processing & Manage-ment, 37(6):789–816, 2001. Online available at http://dx.doi.org/10.1016/

S0306-4573(00)00062-5 [accessed 2007-08-11].[1767] James C. Bezdek, James Keller, Raghu Krisnapuram, and Nikhil R. Pal. Fuzzy Models

and Algorithms for Pattern Recognition and Image Processing. The Handbooks ofFuzzy Sets. Springer, March 2005. ISBN 978-0387245157.

[1768] C. S. Warnekar and G. Krishna. A heuristic clustering algorithm using union ofoverlapping pattern-cells. Pattern Recognition, 11(2):85–93, 1979. Online availableat http://dx.doi.org/10.1016/0031-3203(79)90054-2 [accessed 2007-08-11]. (Link notviable on 2007-08-27).

[1769] Sanjeev Jagannatha Koppal and Srinivasa G Narasimhan. Clustering Appearance forScene Analysis. In IEEE Conference on Computer Vision and Pattern Recognition,volume 2, pages 1323–1330, June 2006. Online available at http://www.ri.cmu.

edu/pubs/pub_5376.html [accessed 2007-08-11].[1770] Bruce J. Schachter, Larry S. Davis, and Azriel Rosenfeld. Some experiments in image

segmentation by clustering of local feature values. Pattern Recognition, 11(1):19–28,1979.

[1771] Jung Eun Shim and Won Suk Lee. A landmark extraction method for protein 2DEgel images based on multi-dimensional clustering. Artificial Intelligence in Medicine,35(1-2):157–170, 2005. Online available at http://linkinghub.elsevier.com/

retrieve/pii/S093336570500076X and http://dx.doi.org/10.1016/j.artmed.

2005.07.002 [accessed 2007-08-11].[1772] F. A. da Veiga. Structure discovery in medical databases: a conceptual clustering

approach. Artificial Intelligence in Medicine, 8(5):473–491, 1996. Online available athttp://dx.doi.org/10.1016/S0933-3657(96)00353-3 [accessed 2007-08-11].

[1773] Song Zhang and David H. Laidlaw. DTI Fiber Clustering and Cross-subject ClusterAnalysis. In Proceedings International Society for Magnetic Resonance in Medicine(ISMRM), May 2005. Miami, FL. Online available at http://www.cs.brown.edu/

research/vis/docs/pdf/Zhang-2005-DFC.pdf [accessed 2007-08-11].[1774] Anil K. Jain, M. N. Murty, and P. J. Flynn. Data Clustering: A Review.

ACM Computing Surveys, 31(3):264–323, September 1999. Online available athttp://citeseer.ist.psu.edu/jain99data.html and http://www.cs.rutgers.

edu/~mlittman/courses/lightai03/jain99data.pdf [accessed 2007-08-11].[1775] Uzay Kaymak and Magne Setnes. Extended Fuzzy Clustering Algorithms. Research

Paper ERS; ERS-2000-51-LIS, Erasmus Research Institute of Management (ERIM),RSM Erasmus University, November 2000. Online available at https://ep.eur.nl/handle/1765/57 and http://ideas.repec.org/p/dgr/eureri/200050.html [ac-

cessed 2007-08-11].[1776] R. Krishnapuram, A. Joshi, and L. Yi O. Nasraoui. Low-Complexity Fuzzy Relational

Clustering Algorithms for Web Mining. IEEE-FS, 9:595–607, August 2001. Onlineavailable at http://citeseer.ist.psu.edu/krishnapuram01lowcomplexity.htmland http://de.scientificcommons.org/583343 [accessed 2007-08-11].

696 REFERENCES

[1777] Steffen Bleul. Ahnlichkeitsmaße und Clustering (Text-based Similarity Measuresand Clustering), 2002. Online available at http://www.vs.uni-kassel.de/~bleul/[accessed 2007-08-11].

[1778] Herve Abdi. Centroıd, Center of Gravity, Center of Mass, Barycenter. InNeil J. Salkind, editor, Encyclopedia of Measurement and Statistics, volume 1,page 128 ff. Thousand Oaks (California): Sage Publications, Inc, October 2006.ISBN 978-1412916110. Online available at http://www.utdallas.edu/~herve/

Abdi-Centroid2007-pretty.pdf [accessed 2007-08-11].[1779] Anil K. Jain and Richard C. Dubes. Algorithms for Clustering Data. Prentice-Hall

Advanced Reference Series. Prentice-Hall, Upper Saddle River, NJ, USA, 1988. ISBN0-13-022278-X.

[1780] J. B. MacQueen. Some Methods for Classification and Analysis of Multivariate Ob-servations. In Proceedings of 5-th Berkeley Symposium on Mathematical Statisticsand Probability, volume 1, pages 281–297. Berkeley, University of California Press,1967.

[1781] Sergei Vassilvitskii. How Slow is the k-Means Method? Discrete and ComputationalGeometry, (Special Issue: Proceedings of 22nd Annual ACM Symposium on Compu-tational Geometry), June 2006, Sedona, Arizona. Online available at http://www.

stanford.edu/~sergeiv/papers/kMeans-socg.pdf and http://portal.acm.org/

citation.cfm?id=1137880 [accessed 2007-08-11].[1782] Eric W. Weisstein. K-Means Clustering Algorithm, 1999–2006. From MathWorld–

A Wolfram Web Resource. Online available at http://mathworld.wolfram.com/

K-MeansClusteringAlgorithm.html [accessed 2007-08-11].[1783] Eckart Zitzler and Lothar Thiele. An Evolutionary Algorithm for Multiobjective

Optimization: The Strength Pareto Approach. Technical Report 43, Computer En-gineering and Networks Laboratory (TIK), Swiss Federal Institute of TechnologyZurich (ETH), Gloriastrasse 35, CH-8092 Zurich, Switzerland, May 1998. Onlineavailable at http://www.tik.ee.ethz.ch/sop/publicationListFiles/zt1998a.

pdf and http://citeseer.ist.psu.edu/225338.html [accessed 2007-07-29].[1784] S. Asharafa and M. Narasimha Murtyb. An adaptive rough fuzzy single pass algo-

rithm for clustering large data sets. Pattern recognition (Pattern recogn.), 36(12):3015–3018, 2003. ISSN 0031-3203.

[1785] Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysisof Computer Algorithms. Addison Wesley, international ed edition, January 1974.ISBN 978-0201000290.

[1786] Mikhail J. Atallah and Susan Fox, editors. Algorithms and Theory of ComputationHandbook. CRC Press, Inc., Boca Raton, FL, USA, first edition, November 1998.ISBN 978-0849326493. Produced By Suzanne Lassandro.

[1787] Sara Baase and Allen Van Gelder. Computer Algorithms: Introduction to Design andAnalysis. Addison Wesley, third edition, November 1999. ISBN 978-0201612448.

[1788] Dexter C. Kozen. The Design and Analysis of Algorithms (Texts & Monographs inComputer Science). Springer New York, January 1992. ISBN 978-0387976877.

[1789] Arthur W. Burks. From ENIAC to the Stored-Program Computer: Two Revolutionsin Computers. In N. Metropolis, J. Howlett, and Gian-Carlo Rota, editors, A Historyof Computing in the Twentieth Century: A Collection of Essays with IntroductoryEssay and Indexes, pages 311–344. Academic Press, New York, November 1980. ISBN978-0124916500. Papers from the Los Alamos International Research Conference onthe History of Computing, 1976.

[1790] David A. Patterson and John L. Hennessy. Computer Organization and Design:The Hardware/Software Interface. The Morgan Kaufmann Series in Computer Ar-chitecture and Design. Morgan Kaufmann, third edition, August 2004. ISBN 978-1558606043.

REFERENCES 697

[1791] David Salomon. Assemblers and loaders. Ellis Horwood Series in Computers andTheir Applications. Ellis Horwood, Upper Saddle River, NJ, USA, February 1993.ISBN 978-0130525642, 0-13-052564-2.

[1792] Masud Ahmad Malik from the Department of Computer Science & Information Sys-tems, Philadelphia University, P.O. Box 1101, Sweileh. Amman, Jordan. Evolutionof the high level programming languages: a critical perspective. ACM SIGPLANNotices, 33(12):72–80, December 1998. ISSN 0362-1340. Online available at http://doi.acm.org/10.1145/307824.307882 [accessed 2007-09-14].

[1793] Donald Ervin Knuth. Fundamental Algorithms, volume 1 of The Art of ComputerProgramming (TAOCP). Addison-Wesley, Reading, Massachusetts, third edition,1997. ISBN 0-201-89683-4.

[1794] Ingo Wegener and Randall Pruim (Translator). Complexity Theory: Exploring theLimits of Efficient Algorithms. Springer-Verlag, Berlin Heidelberg, 2005. ISBN 978-3540210450. Translated from the German “Komplexitatstheorie – Grenzen der Ef-fizienz von Algorithmen”, (Springer-Verlag 2003, ISBN: 3-540-00161-1).

[1795] Herbert S. Wilf. Algorithms and Complexity. AK Peters, Ltd., second edition, De-cember 2002. ISBN 978-1568811789.

[1796] Donald E. Knuth. Big Omicron and big Omega and big Theta. SIGACT News,8(2):18–24, 1976. ISSN 0163-5700. Online available at http://portal.acm.org/

citation.cfm?id=1008328.1008329 [accessed 2007-08-11].[1797] Sir Charles Antony Richard (Tony) Hoare. Quicksort. Computer Journal, 5(1):10–15,

1962.[1798] Paul Gustav Heinrich Bachmann. Die Analytische Zahlentheorie / Dargestellt von

Paul Bachmann, volume Zweiter Theil of Zahlentheorie : Versuch einer Gesamt-darstellung dieser Wissenschaft in ihren Haupttheilen. B. G. Teubner, Leipzig, Ger-many, 1894. Online available at http://gallica.bnf.fr/ark:/12148/bpt6k994750[accessed 2008-05-20]. Republished by Scholarly Publishing Office, University of MichiganLibrary, ISBN 141818540X, 978-1418185404, 2006.

[1799] Edmung Landau. Handbuch der Lehre von der Verteilung der Primzahlen. B. G.Teubner, Leipzig, Germany, 1909. Reprinted by Chelsea, New York, 1953.

[1800] Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. CambridgeInternational Series on Parallel Computation. Cambridge University Press, August1995. ISBN 978-0521474658.

[1801] Juraj Hromkovic. Algorithmics for Hard Computing Problems. Springer, first edition,June 2001. ISBN 978-3540668602.

[1802] Michael Mitzenmacher and Eli Upfal. Probability and Computing : Randomized Algo-rithms and Probabilistic Analysis. Cambridge University Press, January 2005. ISBN0521835402.

[1803] J. Hromkovic and I. Zamecnikova. Design and Analysis of Randomized Algorithms:Introduction to Design Paradigms. Texts in Theoretical Computer Science, an EATCSseries. Springer, first edition, July 2005. ISBN 978-3540239499.

[1804] Rajeev Motwani and Prabhakar Raghavan. Randomized algorithms. ACM Comput.Surv., 28(1):33–37, 1996. ISSN 0360-0300.

[1805] Harvey Gould and Jan Tobochnik. An Introduction to Computer Simulation Methods:Part 2, Applications to Physical Systems. Addison-Wesley Longman Publishing Co.,Inc., Boston, MA, USA, 1995. ISBN 0201506041, 978-0201165036. Edited by JuliaBerrisford.

[1806] P. K. Mackeown. Stochastic Simulation in Physics. Springer-Verlag New York, Inc.,Secaucus, NJ, USA, 2001. ISBN 9813083263.

[1807] Christian P. Robert and George Casella. Monte Carlo Statistical Methods (SpringerTexts in Statistics). Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2005. ISBN0387212396.

698 REFERENCES

[1808] Jun S. Liu. Monte Carlo Strategies in Scientific Computing. Springer, October 2002.ISBN 0387952306.

[1809] Gero Muhl from the Kommunikations- und Betriebsysteme, Fakultat fur Elektrotech-nik und Informatik, Technische Universitat Berlin. Lecture Notes “Verteilte Sys-teme”, Lesson “Einfuhrung und Motivation, 2006. Online available at http://kbs.

cs.tu-berlin.de/teaching/sose2006/vs/folien/02.pdf [accessed 2008-02-09].[1810] Friedemann Mattern. Verteilte Basisalgorithmen. Springer-Verlag GmbH, 1989. ISBN

978-3540518358.[1811] David G. Andersen, Hari Balakrishnan, Frans Kaashoek, and Robert Morris. Resilient

Overlay Networks. In 18th ACM SOSP, October 2001. Banff, Canada. Online avail-able at http://nms.csail.mit.edu/ron/ and http://nms.lcs.mit.edu/papers/

ron-sosp2001.pdf [accessed 2007-08-13].[1812] Wanlei Zhou and Andrzej Goscinski. An Analysis of the Web-Based Client-Server

Computing Models. In Proceedings of the Asia-Pacific Web Conference (APWeb’98),pages 343–348, September 1998, Beijing. Online available at http://citeseer.ist.psu.edu/296101.html [accessed 2007-08-13].

[1813] G. Degli Antoni, D. Cabianca, M. Vaccari, M. Benini, and F. Casablanca. Linear-ity of Client/Server Systems. Bulletin of the European Association for TheoreticalComputer Science, 57:201–214, April 1995. Online available at http://citeseer.

ist.psu.edu/antoni95linearity.html and http://en.scientificcommons.org/

130995 [accessed 2007-08-13].[1814] George F. Coulouris, Jean Dollimore, and Tim Kindberg. Distributed Systems:

Concepts and Design. Addison Wesley, fourth rev. edition, June 2005. ISBN 978-0321263544.

[1815] Andrew S. Tanenbaum and Maarten van Steen. Distributed Systems. Principles andParadigms. Prentice Hall International, international ed edition, March 2003. ISBN978-0131217867. Some information available at http://www.cs.vu.nl/~ast/books/ds1/ [accessed 2007-08-13].

[1816] Ralf Steinmetz and Klaus Wehrle. Peer-to-Peer-Networking & -Computing – Ak-tuelles Schlagwort. Informatik Spektrum, 27(1):51–54, 2004. Online availableat http://www.springerlink.com/content/up3vdx3cnu1a4wb3/fulltext.pdf [ac-

cessed 2007-08-13].[1817] Luc Onana Alima, Sameh El-Ansary, Per Brand, and Seif Haridi. DKS(N , k, f):

A Family of Low Communication, Scalable and Fault-Tolerant Infrastructures forP2P Applications. In 3rd IEEE International Symposium on Cluster Computing andthe Grid (CCGrid 2003), pages 344–350. IEEE Computer Society, 2003. ISBN 0-7695-1919-9. Online available at http://dks.sics.se/pub/ccgrid-dks.pdf [accessed

2007-08-13].[1818] Stephanos Androutsellis-Theotokis and Diomidis Spinellis. A survey of peer-

to-peer content distribution technologies. ACM Comput. Surv., 36(4):335–371,2004. ISSN 0360-0300. Online available at http://www.spinellis.gr/pubs/

jrnl/2004-ACMCS-p2p/html/AS04.pdf and http://portal.acm.org/citation.

cfm?id=1041681 [accessed 2007-08-13].[1819] Stefan Saroiu, P. Krishna Gummadi, and Steven Gribble. A Measurement Study

of Peer-to-Peer File Sharing Systems. In SPIE Multimedia Computing and Net-working (MMCN2002), January 2002, San Jose, CA, USA. Online available athttp://www.cs.washington.edu/homes/gribble/papers/mmcn.pdf and http://

citeseer.ist.psu.edu/saroiu02measurement.html [accessed 2007-08-13].[1820] Ivan Stojmenovic, editor. Handbook of Sensor Networks: Algorithms and Architec-

tures. Wiley-Interscience, October 5, 2005. ISBN 978-0-471-68472-5.[1821] David Culler, Deborah Estrin, and Mani Srivastava. Guest Editors’ Introduc-

tion: Overview of Sensor Networks. Computer, 37(8):41–49, August 2004. ISSN

REFERENCES 699

0018-9162. Online available at http://www.archrock.com/downloads/resources/

IEEE-overview-2004.pdf [accessed 2007-09-15].[1822] S. Sitharama Iyengar and Richard R. Brooks, editors. Distributed Sensor Networks.

Chapman & Hall/CRC, December 29, 2004. ISBN 978-1584883838.[1823] Cauligi S. Raghavendra, Krishna M. Sivalingam, and Taieb Znati, editors. Wireless

Sensor Networks (ERCOFTAC). Springer Netherlands, second edition, June 1, 2004.ISBN 978-1402078835.

[1824] Feng Zhao and Leonidas Guibas. Wireless Sensor Networks: An Information Pro-cessing Approach. Morgan Kaufmann, July 6, 2004. ISBN 978-1558609143.

[1825] Holger Karl and Andreas Willig. Protocols and Architectures for Wireless SensorNetworks. Wiley & Sons, first edition, June 24, 2005. ISBN 978-0470095102.

[1826] Rajeev Shorey, A. Ananda, Mun Choon Chan, and Wei Tsang Ooi. Mobile, Wireless,and Sensor Networks: Technology, Applications, and Future Directions. Wiley-IEEEPress, March 23, 2006. ISBN 978-0471718161.

[1827] Fred M. Discenzo, Dukki Chung, and Kenneth A. Loparo. Power Scavenging EnablesMaintenance-Free Wireless Sensor Nodes. In Proceedings of NECSI InternationalConference on Complex Systems, June 25–30, 2006, New England Complex SystemsInstitute, Marriott Boston Quincy, Boston, MA, USA. Online available at http://

necsi.org/events/iccs6/viewpaper.php?id=188 [accessed 2007-08-01].[1828] Shad Roundy, Dan Steingart, Luc Frechette, Paul Wright, and Jan Rabaey. Power

Sources for Wireless Sensor Networks. In EWSN 2004: European workshop on wire-less sensor networks No1, volume 2920/2004 of Lecture Notes in Computer Science(LNCS), pages 1–17. Springer Berlin / Heidelberg, 2004, Berlin, Germany. ISBN 978-3-540-20825-9. Online available at http://www.eureka.gme.usherb.ca/memslab/

docs/PowerReview-2.pdf [accessed 2007-08-01].[1829] Joseph A. Paradiso and Thad Starner. Energy Scavenging for Mobile and Wire-

less Electronics. IEEE Pervasive Computing, 04(1):18–27, 2005. ISSN 1536-1268. doi:10.1109/MPRV.2005.9. Online available at http://www.media.mit.

edu/resenv/papers.html and http://whitepapers.silicon.com/0,39024759,

60295509p,00.htm [accessed 2007-08-01].[1830] Mohammad Rahimi, Hardik Shah, Gaurav Sukhatme, John Heidemann, and Deborah

Estrin. Studying the Feasibility of Energy Harvesting in a Mobile Sensor Network.In Proceedings of the IEEE International Conference on Robotics and Automation,pages 19–24, May 2003. IEEE, Taipai, Taiwan. Online available at http://www.

isi.edu/~johnh/PAPERS/Rahimi03a.pdf and http://www.citeulike.org/user/

cri06/article/935917 [accessed 2007-08-01].[1831] Farhan Simjee and Pai H. Chou. Everlast: long-life, supercapacitor-operated wireless

sensor node. In ISLPED’06: Proceedings of the 2006 international symposium on Lowpower electronics and design, pages 197–202, October 4–6, 2006, Tegernsee, Bavaria,Germany. ACM Press, New York, NY, USA. ISBN 1-59593-462-6. Online availableat http://portal.acm.org/citation.cfm?id=1098918.1098980 [accessed 2007-08-01].

[1832] Jaein Jeong, Xiaofan Fred Jiang, and David E. Culler. Design and Analysisof Micro-Solar Power Systems for Wireless Sensor Networks. Technical ReportUCB/EECS-2007-24, EECS Department, University of California, Berkeley, February2007. Online available at http://www.eecs.berkeley.edu/Pubs/TechRpts/2007/

EECS-2007-24.html [accessed 2007-08-01].[1833] Dusit Niyato, Ekram Hossain, and Afshin Fallahi. Sleep and Wakeup Strategies in

Solar-Powered Wireless Sensor/Mesh Networks: Performance Analysis and Optimiza-tion. IEEE Transactions on Mobile Computing, 6(2):221–236, 2007. ISSN 1536-1233.

[1834] Francis R. Szabo and Paul E. Kladitis. Design, Modeling and Testing of PolysiliconOptothermal Actuators for Power Scavenging Wireless Microrobots. In Proceedingsof the 2004 International Conference on MEMS, NANO and Smart Systems, 2004.

700 REFERENCES

ICMENS 2004, pages 446–452, August 25–27, 2004. IEEE Computer Society, LosAlamitos, CA, USA. ISBN 0-7695-2189-4.

[1835] Lei Wang and F. G. Yuan. Energy harvesting by magnetostrictive material (MsM)for powering wireless sensors in SHM. In SPIE Smart Structures and Materi-als & NDE and Health Monitoring, 14th International Symposium (SSN07), 2007SPIE/ASME Best Student Paper Presentation Contest, March 18–22, 2007. Onlineavailable at http://www.mae.ncsu.edu/research/SSML/paper.html and http://

adsabs.harvard.edu/abs/2007SPIE.6529E.121W [accessed 2007-08-01].[1836] Joseph A. Paradiso. Systems for human-powered mobile computing. In

DAC’06: Proceedings of the 43rd annual conference on Design automation, pages645–650, 2006, San Francisco, CA, USA. ACM Press, New York, NY, USA.ISBN 1-59593-381-6. Online available at http://www.media.mit.edu/resenv/

pubs/papers/2006-07-DAC-Paper.pdf and http://portal.acm.org/citation.

cfm?id=1147074 [accessed 2007-08-01].[1837] John Kymissis, Clyde Kendall, Joseph Paradiso, and Neil Gershenfeld. Para-

sitic Power Harvesting in Shoes. In ISWC’98: Proceedings of the 2nd IEEEInternational Symposium on Wearable Computers, page 132, 1998. IEEE Com-puter Society, Washington, DC, USA. ISBN 0-8186-9074-7. Online availableat http://www.media.mit.edu/resenv/papers.html and http://citeseer.ist.

psu.edu/kymissis98parasitic.html [accessed 2007-08-01].[1838] Katja Schwieger, Heinrich Nuszkowski, and Gerhard Fettweis. Analysis of Node

Energy Consumption in Sensor Networks. In Holger Karl, Andreas Willig, and AdamWolisz, editors, Proceedings of Wireless Sensor Networks, First European Workshop(EWSN), volume 2920 of Lecture Notes in Computer Science (LNCS), pages 94–105. Springer, January 19–21, 2004, Berlin, Germany. ISBN 3-540-20825-9. Onlineavailable at http://citeseer.ist.psu.edu/634903.html [accessed 2007-08-01].

[1839] Eric Fleury, Jean-Loup Guillaume, Celine Robardet, and Antoine Scherrer. Anal-ysis of Dynamic Sensor Networks: Power Law Then What? In Second Interna-tional Conference on COMmunication Systems softWAre and middlewaRE (COM-SWARE 2007). IEEE, January 7–12, 2007, Bangalore, India. ISBN 1-4244-0614-5. doi:10.1109/COMSWA.2007.382427. Online available at http://jlguillaume.

free.fr/www/publis/Guillaume07analysis.pdf [accessed 2007-08-01].[1840] Guillaume Chelius, Eric Fleury, and Thierry Mignon. Lower and Upper Bounds for

Minimum Energy Broadcast and Sensing Problems in Sensor Networks. InternationalJournal of Parallel, Emergent and Distributed Systems, to be published, 2005. Also:technical report, January 2004: Rapport de recherche de l’INRIA - Rhone-Alpes,Equipe: ARES. Online available at http://www.inria.fr/rrrt/rr-5072.html [ac-

cessed 2007-08-01]. See also [1948].[1841] Q. Gao, K. J. Blow, D. J. Holding, and I. Marshall. Analysis of Energy

Conservation in Sensor Networks. Wireless Networks, 11(6):787–794, November2005. ISSN 1022-0038 (Print) 1572-8196 (Online). Online available at http://

www.cs.kent.ac.uk/pubs/2005/2193/content.pdf and http://portal.acm.org/

citation.cfm?id=1160416 [accessed 2007-08-01].[1842] Chee-Yee Chong and S.P. Kumar. Sensor networks: evolution, opportuni-

ties, and challenges. Proceedings of the IEEE, 91(8):1247–1256, August 2003.doi:10.1109/JPROC.2003.814918.

[1843] H. Durrant-Whyte. Data Fusion in Sensor Networks. In Proceedings of IEEEInternational Conference on Video and Signal Based Surveillance AVSS’06, pages39–39, November 2006, Sydney, Australia. ISBN 0-7803-9202-7. Online availableat http://www.ee.ucla.edu/~mbs/ipsn05/keynote_abstracts/hdurrantwhyte.

pdf and http://portal.acm.org/citation.cfm?id=1147687 [accessed 2007-08-01].[1844] Ramesh Govindan, Joseph M. Hellerstein, Wei Hong, Samuel Madden, Michael

Franklin, and Scott Shenker. The Sensor Network as a Database. Technical Report

REFERENCES 701

02-771, University of South California, Computer Science Department, September2002. Online available at ftp://ftp.usc.edu/pub/csinfo/tech-reports/papers/02-771.pdf and http://citeseer.ist.psu.edu/601935.html [accessed 2007-08-01].

[1845] Jane Tateson, Christopher Roadknight, Antonio Gonzalez, Taimur Khan, SteveFitz, Ian Henning, Nathan Boyd, Chris Vincent, and Ian Marshall. Real WorldIssues in Deploying a Wireless Sensor Network for Oceanography. In Workshopon Real-World Wireless Sensor Networks REALWSN’05, June 20–21, 2005. Stock-holm, Sweden. Online available at http://www.cs.kent.ac.uk/pubs/2005/2209/

content.pdf and http://www.sics.se/realwsn05/papers/tateson05realworld.

pdf [accessed 2007-09-15].[1846] Bryan Horling, Roger Mailler, Mark Sims, and Victor Lesser. Using and Maintain-

ing Organization in a Large-Scale Distributed Sensor Network. Proceedings of theWorkshop on Autonomy, Delegation, and Control (AAMAS03), July 2003. On-line available at ftp://mas.cs.umass.edu/pub/bhorling/03-organization.ps.

gz and http://mas.cs.umass.edu/paper/247 [accessed 2007-08-01].[1847] Chun-Hsin Wu. Peer-to-peer Systems: Macro-computing with Micro-computers,

July 2003. Presented at 3rd International Conference on Open Source inTaipei, Taiwan. Presentation available at http://www.csie.nuk.edu.tw/~wuch/

publications/2003-icos-p2p-wuch.pdf [accessed 2007-08-13].[1848] David Culler and Dr. David Tennenhouse. Largest Tiny Network Yet – Large-Scale

Demonstration of Self-Organizing Wireless Sensor Networks, August 2001, San Jose,California, USA. See http://webs.cs.berkeley.edu/800demo/ [accessed 2007-07-03].

[1849] Robert Szewczyk, Joe Polastre, Alan Mainwaring, John Anderson, and David Culler.An Analysis of a Large Scale Habitat Monitoring Application. In Proceedingsof The Second ACM Conference on Embedded Networked Sensor Systems Sen-Sys 2004, pages 214–226, November 3–5, 2004, Baltimore, MD. Online avail-able at http://www.eecs.harvard.edu/~mdw/course/cs263/papers/ and http://

portal.acm.org/citation.cfm?doid=1031495.1031521 [accessed 2007-08-01].[1850] Vinod Subramanian, Rajkumar Arumugam, and Ali A. Minai. Self-Organization

of Connectivity and Geographical Routing in Large-Scale Sensor Networks. In AliMinai, Dan Braha, Helen Harte, Larry Rudolph, Temple Smith, Gunter Wagner,and Yaneer Bar-Yam, editors, Proceedings of the Fourth International Conference onComplex Systems, June 9–14, 2002, Nashua, NH. Online available at http://necsi.org/events/iccs/2002/NAp07_subramanian_iccs4-1.pdf [accessed 2007-08-01].

[1851] Tommaso Melodia, Dario Pompili, and Ian F. Akyildiz. On the interdependenceof Distributed Topology Control and Geographical Routing in Ad Hoc and SensorNetworks. Journal of Selected Areas in Communications, 23(3):520–532, March 2005.doi:10.1109/JSAC.2004.842557.

[1852] Jian Chen, Yong Guan, and Udo Pooch. Customizing a Geographical Routing Pro-tocol for Wireless Sensor Networks. In ITCC’05: Proceedings of the InternationalConference on Information Technology: Coding and Computing (ITCC’05) - VolumeII, volume 2, pages 586–591, April 4–6, 2005. IEEE Computer Society, Washington,DC, USA. ISBN 0-7695-2315-3. doi:10.1109/ITCC.2005.118.

[1853] M. Brian Blake. Coordinating multiple agents for workflow-oriented pro-cess orchestration. Information Systems and E-Business Management, 1(4):387–404, November 2003. ISSN 1617-9846 (Print) 1617-9854 (Online).doi:10.1007/s10257-003-0023-1. Online available at http://www.springerlink.com/content/tk7jdgbraq0pywcr/fulltext.pdf and http://wotan.liu.edu/docis/

dbl/isebbm/2003_1_4_387_CMAFWP.htm [accessed 2007-08-13].[1854] Jesper M. Johansson, Salvatore T. March, and J. David Naumann. Modeling Network

Latency and Parallel Processing in Distributed Database Design. Decision Sciences,34(4):677–706, November 2003. Online available at http://findarticles.com/p/

articles/mi_qa3713/is_200310/ai_n9253628 [accessed 2007-08-13].

702 REFERENCES

[1855] Robert Beverly, Karen Sollins, and Arthur Berger. SVM Learning of IP AddressStructure for Latency Prediction. In MineNet’06: Proceedings of the 2006 SIGCOMMworkshop on Mining network data, pages 299–304, September 2006, Pisa, Italy.ACM Press, New York, NY, USA. Online available at http://www.sigcomm.org/

sigcomm2006/papers/minenet-04.pdf and http://portal.acm.org/citation.

cfm?id=1162678.1162682 [accessed 2007-08-13].[1856] James Z. Wang and Matti Vanninen. Self-Configuration Protocols for Small-Scale

P2P Networks. In Proceedings of 10th Network Operations and Management Sym-posium, NOMS 2006, pages 1–4. IEEE/IFIP, April 2006, Vancouver, Cannada.ISBN 1-4244-0142-9. Online available at http://www.cs.clemson.edu/~jzwang/

pub/nomshort.pdf [accessed 2007-08-19].[1857] Marshall Pease, Robert Shostak, and Leslie Lamport. Reaching Agreement in

the Presence of Faults. Journal of the ACM, 27(2):228–234, 1980. ISSN0004-5411. Online available at http://research.microsoft.com/users/lamport/

pubs/reaching.pdf and http://research.microsoft.com/users/lamport/pubs/

reaching.pdf [accessed 2007-08-13].[1858] Leslie Lamport, Robert Shostak, and Marshall Pease. The Byzantine Generals Prob-

lem. ACM Trans. Program. Lang. Syst., 4(3):382–401, 1982. ISSN 0164-0925. Onlineavailable at http://research.microsoft.com/users/lamport/pubs/byz.pdf andhttp://portal.acm.org/citation.cfm?id=357176 [accessed 2007-08-13].

[1859] Leslie Lamport. The Weak Byzantine Generals Problem. Journal of the ACM, 30(3):668–676, 1983. ISSN 0004-5411. Online available at http://doi.acm.org/10.

1145/2402.322398 and http://research.microsoft.com/users/lamport/pubs/

weak-byz.pdf [accessed 2007-08-13].[1860] Miguel Castro and Barbara Liskov. Practical byzantine fault tolerance and proactive

recovery. ACM Trans. Comput. Syst., 20(4):398–461, 2002. ISSN 0734-2071. Onlineavailable at http://research.microsoft.com/users/mcastro/publications.htmand http://portal.acm.org/citation.cfm?id=571640 [accessed 2007-08-13].

[1861] Jean-Philippe Martin, Lorenzo Alvisi, and Michael Dahlin. Minimal Byzantine Stor-age. In Distributed Computing, 16th international Conference, DISC 2002, pages 311–325, October 2002. ISBN 3-540-00073-9. Online available at http://www.cs.utexas.edu/users/jpmartin/papers/MinByz-TR.ps and http://www.springerlink.com/

content/5ylhktru1bh994fv/fulltext.pdf [accessed 2007-08-13].[1862] Jean-Philippe Martin, Lorenzo Alvisi, and Michael Dahlin. Small Byzantine Quorum

Systems. In Proceedings of the International Conference on Dependable Systems andNetworks, pages 374–383, June 2002. Online available at http://www.cs.utexas.

edu/users/lorenzo/papers/smallByz_DSN.pdf and http://citeseer.ist.psu.

edu/593329.html [accessed 2007-08-13].[1863] Jian Yin, Jean-Philippe Martin, Arun Venkataramani, Lorenzo Alvisi, and Mike

Dahlin. Separating agreement from execution for byzantine fault tolerant services.In Proceedings of the nineteenth ACM symposium on Operating systems princi-ples, pages 253–267. ACM Press, 2003, Bolton Landing, NY, USA. ISBN 1-58113-757-5. Online available at http://portal.acm.org/citation.cfm?id=1165389.

945470 and http://www.cs.utexas.edu/users/lasr/papers/Yin03Separating.

pdf [accessed 2007-08-13].[1864] J-P. Martin and L. Alvisi. A Framework for Dynamic Byzantine Storage. In

Proceedings of the International Conference on Dependable Systems and Networks,June 2004. Online available at http://www.cs.utexas.edu/users/lasr/papers/

Martin05Fast.pdf [accessed 2007-08-13].[1865] J-P. Martin and L. Alvisi. Fast Byzantine Consensus. In Proceedings of the In-

ternational Conference on Dependable Systems and Networks, pages 402–411, June2005.

REFERENCES 703

[1866] Harry C. Li, Allen Clement, Edmund L. Wong, Jeff Napper, Indrajit Roy, LorenzoAlvisi, and Michael Dahlin. BAR Gossip. In Proceedings of the 2006 USENIX Oper-ating Systems Design and Implementation (OSDI), November 2006. Online availableat http://www.cs.utexas.edu/users/dahlin/papers.html [accessed 2007-08-13].

[1867] Amitanand S. Aiyer, Lorenzo Alvisi, Allen Clement, Michael Dahlin, Jean-PhilippeMartin, and Carl Porth. BAR Fault Tolerance for Cooperative Services. In 20thACM Symposium on Operating Systems Principles, October 2005. Online availableat http://www.cs.utexas.edu/users/lorenzo/papers/sosp05.pdf and http://

doi.acm.org/10.1145/1095809.1095816 [accessed 2007-08-13].[1868] Artem V. Chebotko from the Wayne State University (WSU), Detroit, USA. Pro-

gramming Languages (Course Material CSC3200). Wayne State University (WSU),Detroit, USA, 2006. Online available at http://www.cs.wayne.edu/~artem/ [accessed

2007-07-03].[1869] Peter Kochel from the TU Chemnitz, Fakultat fur Informatik, Professur Modellierung

und Simulation, Straße der Nationen 62, 09107 Chemnitz, Germany. Algorithmen undProgrammierung (Course Material). TU Chemnitz, Fakultat fur Informatik, Profes-sur Modellierung und Simulation, Straße der Nationen 62, 09107 Chemnitz, Germany,2007. Online available at http://www.tu-chemnitz.de/informatik/ModSim/ [ac-

cessed 2007-07-03].[1870] Noam Chomsky. Syntactic structures. ’s-Gravenhage: Mouton & Co., 1957. Online

available at http://books.google.de/books?id=a6a_b-CXYAkC and http://

web.uni-marburg.de/dsa//Direktor/Rabanus/pdf/Syntactic_Structures.pdf

[accessed 2007-09-14].[1871] Dick Grune and Ceriel J. H. Jacobs. Parsing techniques a practical guide. Ellis

Horwood Limited, Chichester, England, August 1991. ISBN 978-0136514312. Onlineavailable at http://citeseer.ist.psu.edu/grune90parsing.html [accessed 2007-09-14].

[1872] Noam Chomsky. Three models for the description of language. IEEE Transactionson Information Theory, 2(3):113–124, September 1956. Online available at http://www.chomsky.info/articles/195609--.pdf [accessed 2007-09-14].

[1873] Noam Chomsky and Marcel P. Schutzenberger. The algebraic theory of context-freelanguages. In P. Braffort and D. Hirschberg, editors, Computer Programming andFormal Systems, pages 118–161. North-Holland, Amsterdam, 1963.

[1874] Andras Kornai. Natural languages and the Chomsky hierarchy. In Proceedings ofthe second conference on European chapter of the Association for ComputationalLinguistics, pages 1–7, 1985, Geneva, Switzerland. Association for ComputationalLinguistics, Morristown, NJ, USA. doi:10.3115/976931.976932. Online availableat http://portal.acm.org/citation.cfm?doid=976931.976932 and http://www.

aclweb.org/anthology-new/E/E85/E85-1001.pdf [accessed 2007-09-14].[1875] J. W. Backus, J. H. Wegstein, A. van Wijngaarden, M. Woodger, F. L. Bauer,

J. Green, C. Katz, J. McCarthy, A. J. Perlis, H. Rutishauser, K. Samelson, andB. Vauquois. Report on the Algorithmic Language ALGOL 60. Communications ofthe ACM, 3(5):299–314, May 1960. ISSN 0001-0782. See also http://www.masswerk.

at/algol60/ [accessed 2007-09-15] and [1949].[1876] Donald E. Knuth. Backus Normal Form vs. Backus Naur Form. Communications of

the ACM, 7(12):735–736, 1964. ISSN 0001-0782. doi:10.1145/355588.365140. Onlineavailable at http://doi.acm.org/10.1145/355588.365140 [accessed 2007-09-15].

[1877] International Organization for Standardization (ISO). ISO/IEC 14977:1996: Infor-mation technology – Syntactic metalanguage – Extended BNF. International Orga-nization for Standardization (ISO), 1, ch. de la Voie-Creuse, Case postale 56, CH-1211 Geneva 20, Switzerland, 1996. Online available at http://www.cl.cam.ac.uk/

~mgk25/iso-14977.pdf [accessed 2007-09-15].[1878] Richard E. Pattis. EBNF: A Notation to Describe Syntax, the late 1980s. Online

available at http://www.cs.cmu.edu/~pattis/misc/ebnf.pdf [accessed 2007-07-03].

704 REFERENCES

[1879] Donald E. Knuth. Semantics of Context-Free Languages. Theory of Comput-ing Systems/Mathematical Systems Theory, 2(2):127–145, 1968. ISSN 1432-4350(Print) 1433-0490 (Online). doi:10.1007/BF01692511. See [1880]. Online availableat http://www.springerlink.com/content/m2501m07m4666813/fulltext.pdf [ac-

cessed 2007-09-15].[1880] Donald E. Knuth. Correction: Semantics of Context-Free Languages. Theory of Com-

puting Systems/Mathematical Systems Theory, 5(1):95–96, 1971. ISSN 1432-4350(Print) 1433-0490 (Online). doi:10.1007/BF01702865. See [1879]. Online availableat http://www.springerlink.com/content/rj10u682v25g6506/fulltext.pdf [ac-

cessed 2007-09-15].[1881] Donald E. Knuth. The genesis of attribute grammars. In WAGA: Proceedings of the

international conference on Attribute grammars and their applications, pages 1–12,1990, Paris, France. Springer-Verlag New York, Inc., New York, NY, USA. ISBN 0-387-53101-7. Online available at http://www.dcs.warwick.ac.uk/~sk/cs325/gag.pdf [accessed 2007-09-15].

[1882] Jukka Paakki. Attribute grammar paradigms – a high-level methodology in languageimplementation. ACM Computing Surveys (CSUR), 27(2):196–255, 1995. ISSN0360-0300. doi:10.1145/210376.197409. Online available at http://doi.acm.org/

10.1145/210376.197409 [accessed 2007-09-15].[1883] Alex Aiken from the UC Berkely, Electrical Engineering and Computer Science,

College of Engineering, Computer Science Division. Lecture Notes CS 264, Spring1995. Online available at http://www.cs.berkeley.edu/~aiken/cs264/lectures/attribute-grammars [accessed 2007-07-03].

[1884] Nelson Correa. An extension of earley’s algorithm for S-attributed grammars. InProceedings of the fifth conference on European chapter of the Association for Com-putational Linguistics, pages 299–302, 1991, Berlin, Germany. Association for Com-putational Linguistics, Morristown, NJ, USA. doi:10.3115/977180.977232. On-line available at http://dx.doi.org/10.3115/977180.977232 and http://www.

aclweb.org/anthology-new/E/E91/E91-1052.pdf [accessed 2007-09-115].[1885] David A. Watt. An extended attribute grammar for Pascal. ACM SIGPLAN Notices,

14(2):60–74, 1979. ISSN 0362-1340. doi:10.1145/954063.954071. Online available athttp://doi.acm.org/10.1145/954063.954071 [accessed 2007-09-15].

[1886] Ole Lehrmann Madsen. On defining semantics by means of extended attribute gram-mars. In Semantics-Directed Compiler Generation, Proceedings of a Workshop, vol-ume 94 of Lecture Notes In Computer Science (LNCS), pages 259–299, January 14–18,1980, Aarhus, Denmark. Springer-Verlag, London, UK. ISBN 3-540-10250-7.

[1887] Henning Christiansen. Programming as language development. Technical Report 15,Department of Computer Science, Roskilde University, 1988. Ph.D. thesis (summary).

[1888] Henning Christiansen. The syntax and semantics of extensible languages. TechnicalReport 14, Department of Computer Science, Roskilde University, 1988.

[1889] Henning Christiansen. Parsing and compilation of generative languages. TechnicalReport 3, Department of Computer Science, Roskilde University, 1986. abridgedversion: [1890].

[1890] Henning Christiansen. Recognition of generative languages. In Proceedings of Pro-grams as Data Objects Workshop, volume 217 of Lecture Notes in Computer Science(LNCS), pages 63–81. Springer-Verlag, October 1985, Copenhagen, Denmark. ISBN0-387-16446-4. Abridged version of [1889].

[1891] Aravind K. Joshi. How Much Context-Sensitivity is Necessary for CharacterizingStructural Descriptions – Tree Adjoining Grammars. In D. Dowty, L. Karttunen,and A. Zwicky, editors, Natural Language Processing – Theoretical, Computationaland Psychological Perspective, pages 206–250. Cambridge University Press, New York,NY, 1985. Originally presented in 1983.

REFERENCES 705

[1892] Owen Rambow and Aravind K. Joshi. A Formal Look at Dependency Grammars andPhrase-Structure Grammars, with Special Consideration of Word-Order Phenomena.Meaning-Text Theory, 1997. Online available at http://arxiv.org/abs/cmp-lg/

9410007v1 [accessed 2007-09-15].[1893] Aravind K. Joshi and Owen Rambow. A Formalism for Dependency Grammar Based

on Tree Adjoining Grammar. In Proceedings of the Conference on Meaning-TextTheory, MTT 2003, June 16–18, 2003, Paris, France. Online available at http://

www1.cs.columbia.edu/~rambow/papers/joshi-rambow-2003.pdf [accessed 2007-09-15].[1894] John L. McCarthy. Recursive Functions of Symbolic Expressions and Their Compu-

tation by Machine, Part I. Communications of the ACM, 3(4):184–195, April 1960.ISSN 0001-0782. Online available at http://doi.acm.org/10.1145/367177.367199and http://citeseer.ist.psu.edu/mccarthy60recursive.html [accessed 2007-09-15].

[1895] John L. McCarthy, Paul W. Abrahams, Daniel J. Edwards, Timothy P. Hari, andMichael L. Levin. LISP 1.5 Programmer’s Manual. The MIT Press, August 1962.ISBN 978-0262130110, 0-262-13011-4. Second Edition, 15th Printing, Online avail-able at http://www.softwarepreservation.org/projects/LISP/book/LISP%201.5%20Programmers%20Manual.pdf [accessed 2007-09-15]. See also [1895].

[1896] John L. McCarthy. History of LISP. In Richard L. Wexelblat, editor, History of Pro-gramming Languages: Proceedings of the ACM SIGPLAN Conference, pages 173–197.Academic Press, June 1978. Online available at http://citeseer.ist.psu.edu/

mccarthy78history.html [accessed 2007-09-15]. See also http://www-formal.stanford.

edu/jmc/history/lisp/lisp.html [accessed 2007-09-15].[1897] R. Kent Dybvig. The SCHEME programming language. Prentice-Hall, Inc., Upper

Saddle River, NJ, USA, 1987. ISBN 0-13-791864-X, 978-0-262-54148-0. With Il-lustrations by Jean-Pierre Hebert. Third edition (October 2003) Online available athttp://www.scheme.com/tspl3/ [accessed 2007-09-15].

[1898] Ron Rivest. S-Expressions, May 4, 1997. draft-rivest-sexp-00.txt. Online available athttp://people.csail.mit.edu/rivest/Sexp.txt [accessed 2007-07-03]. Network Work-ing Group, Internet Draft, Expires November 4, 1997.

[1899] Thomas Weise, Michael Zapf, Mohammad Ullah Khan, and Kurt Geihs fromthe University of Kassel, FB-16, Distributed Systems Group, WilhelmshoherAllee 73, 34121 Kassel, Germany. Genetic Programming meets Model-DrivenDevelopment. Kasseler Informatikschriften (KIS) 2007, 2, University of Kas-sel, July 2, 2007. Persistent Identifier: urn:nbn:de:hebis:34-2007070218786.Online available at http://www.it-weise.de/documents/files/WZKG2007DGPFd.

pdf and http://kobra.bibliothek.uni-kassel.de/handle/urn:nbn:de:hebis:

34-2007070218786 [accessed 2007-09-17].[1900] Michael Zapf and Thomas Weise from the University of Kassel, FB-16, Distributed

Systems Group, Wilhelmshoher Allee 73, 34121 Kassel, Germany. Offline EmergenceEngineering For Agent Societies. In Proceedings of the Fifth European Workshopon Multi-Agent Systems EUMAS’07, December 14, 2007, Elmouradi Hotel, Ham-mamet, Tunesia. Online available at http://www.it-weise.de/documents/files/ZW2007EUMASTR.pdf [accessed 2008-08-09], see also [1950].

[1901] Branko Soucek and The IRIS Group, editors. Dynamic, Genetic, and ChaoticProgramming: The Sixth-Generation. Sixth Generation Computer Technolo-gies. John Wiley Interscience, New York, April 1992. ISBN 047155717X, 978-0471557173. Partly online available at http://www.amazon.com/gp/reader/

047155717X/ref=sib_dp_pt/002-6076954-4198445#reader-link [accessed 2008-05-29].[1902] Dario Floreano, Jean-Daniel Nicoud, and Francesco Mondada, editors. Advances in

Artificial Life, Proceedings of the 5th European Conference, ECAL’99, volume 1674of Lecture Notes in Computer Science (LNCS), September 13–17, 1999, Lausanne,Switzerland. Springer. ISBN 3-540-66452-1.

706 REFERENCES

[1903] Christoph Adami, Richard K. Belew, Hiroaki Kitano, and Charles E. Taylor, edi-tors. Artificial Life VI: Proceedings of the sixth international conference on Artificiallife, volume 6 of Complex Adaptive Systems, June 1998, Madison, Wisconsin, UnitedStates. MIT Press, Cambridge, MA, USA. ISBN 0-262-51099-5, 978-0262510998.

[1904] Federico Moran, Alvaro Moreno, Juan J. Merelo Guervos, and Pablo Chacon, edi-tors. Advances in Artificial Life, Proceedings of the Third European Conference onArtificial Life, volume 929 of Lecture Notes in Computer Science (LNCS), June 4–6,1995, Granada, Spain. Springer. ISBN 3-540-59496-5.

[1905] George C. Williams. Pleiotropy, Natural Selection, and the Evolution of Senescence.SAGE KE, Science of Aging Knowledge Environment, 2001(1), October 3, 2001. cp13.See also [175].

[1906] Michael J. Kearns, Yishay Mansour, Andrew Y. Ng, and Dana Ron. An Experimentaland Theoretical Comparison of Model Selection Methods. Machine Learning, 27(1):7–50, 1997. See also [192].

[1907] Hans-Georg Beyer. Towards a Theory of ‘Evolution Strategies’: Some AsymptoticalResults from the (1,+λ)-Theory. Technical Report SYS–5/92, Fachbereich Infor-matik, Universitat Dortmund, P.O. Box 500500, 44227 Dortmund, Germany, Decem-ber 1 1992. See also [206].

[1908] Xin Yao, editor. Progress in Evolutionary Computation, Selected Papers of the AI’93and AI’94 Workshops on Evolutionary Computation Melbourne, Victoria, Australia,November 16, 1993 and Armidale, NSW, Australia, November 21-22, 1994, volume956/1995 of Lecture Notes in Artificial Intelligence, subseries of Lecture Notes inComputer Science (LNCS), May 1995. Springer, Berlin/Heidelberg, Germany. ISBN3-540-60154-6, 978-3-540-60154-8. doi:10.1007/3-540-60154-6.

[1909] L. Darell Whitley from the Computer Science Department, Colorado State University,Fort Collins. A Genetic Algorithm Tutorial. Technical Report CS-93-103, ComputerScience Department, Colorado State University, Fort Collins, March 10, 1993. Onlineavailable at http://citeseer.ist.psu.edu/177719.html [accessed 2007-11-29]. See also[634].

[1910] Mathieu S. Capcarrere, Alex Alves Freitas, Peter J. Bentley, Colin G. Johnson, andJon Timmis, editors. Advances in Artificial Life, Proceedings of the 8th EuropeanConference, ECAL 2005, volume 3630 of Lecture Notes in Computer Science (LNCS)subseries Lecture Notes in Artificial Intelligence (LNAI), September 5–9, 2005, Uni-versity of Kent, Canterbury, Kent (UK). Springer Verlag. ISBN 3-540-28848-1.

[1911] Francisco J. Varela and Paul Bourgine, editors. Toward a Practice of AutonomousSystems: Proceedings of the First European Conference on Artificial Life, Decem-ber 11–13, 1991, Paris, France. A Bradford book, The MIT Press. ISBN 0-262-72019-1. Published in 1992.

[1912] N. S. Sridharan, editor. Proceedings of the 11th International Joint Conference onArtificial Intelligence, volume 1, August 1989, Detroit, MI, USA. Morgan Kaufmann,San Francisco, CA, USA. ISBN 1-55860-094-9. Online available at http://dli.

iiit.ac.in/ijcai/IJCAI-89-VOL1/CONTENT/content.htm [accessed 2008-04-01]. See also[1951].

[1913] Christopher G. Langton, C.E. Taylor, D.J. Farmer, and S. Rasmussen, editors. Ar-tificial Life II: Proceedings of the Workshop on Artificial Life, volume X of SantaFe Institute Studies in the Science of Complexity, February 1990, Santa Fe, NewMexico, USA. Addison-Wesley. ISBN 0201525712, 978-0201525717. Published 1992,republished by Westview Press (March 28, 2003).

[1914] Jean-Arcady Meyer and Stewart W. Wilson, editors. From Animals to Animats: Pro-ceedings of the First International Conference on Simulation of Adaptive Behavior,September 24–28, 1990, Paris, France. The MIT Press, Cambridge, MA, USA. ISBN0-262-63138-5. Published in 1991.

REFERENCES 707

[1915] Francisco Fernandez de Vega. Modelos de Programacion Genetica Paralela yDistribuida con aplicaciones a la Sintesis Logica en FPGAs. PhD thesis, Uni-versity of Extremadura, 2001. Version espanol. For english version see [804].Online available at http://cum.unex.es/profes/profes/fcofdez/escritorio/

investigacion/pgp/thesis/phd.html [accessed 2007-09-09].[1916] J. L. Denenbourg, S. Goss, G. Nicolis, H. Bersini, and R. Dagonnier, editors. ECAL-

93 Self organisation and life: from simple rules to global complexity, Proceedings of theSecond European Conference on Artificial Life, May 24–26, 1993, Bruxelles, Belgium.Free University of Brussels.

[1917] Proceedings of the Fifteenth International Joint Conference on Artificial Intelli-gence, IJCAI 97, volume 1, August 23–29, 1997, Nagoya, Japan. Morgan Kauf-mann, San Francisco, CA, USA. Online available at http://dli.iiit.ac.in/

ijcai/IJCAI-97-VOL1/CONTENT/content.htm [accessed 2008-04-01]. See also [1918, 1952].[1918] Proceedings of the Fifteenth International Joint Conference on Artificial Intelli-

gence, IJCAI 97, volume 2, August 23–29, 1997, Nagoya, Japan. Morgan Kauf-mann, San Francisco, CA, USA. Online available at http://dli.iiit.ac.in/

ijcai/IJCAI-97-VOL2/CONTENT/content.htm [accessed 2008-04-01]. See also [1917, 1952].[1919] Thomas D. Haynes, Roger L. Wainwright, and Sandip Sen from the Department of

Mathematical & Computer Sciences, The University of Tulsa. Evolving CooperatingStrategies. In Victor Lesser, editor, Proceedings of the first International Conferenceon Multiple Agent Systems, page 450. AAAI Press/MIT Press, June 12-14, 1995, SanFrancisco, USA. ISBN 0-262-62102-9. 1 page poster, see also [868].

[1920] Proceedings of the Fourteenth International Joint Conference on Artificial Intelli-gence, volume 1, August 20–25, 1995, Montreal, Quebec, Canada. Morgan Kaufmann,San Francisco, CA, USA. ISBN 1-55860-363-8. Online available at http://dli.iiit.ac.in/ijcai/IJCAI-95-VOLt.htm [accessed 2008-04-01]. See also [1953, 1954, 1955].

[1921] Christopher G. Langton, editor. Artificial Life III: Proceedings of the Workshop onArtificial Life, volume XVII of Santa Fe Institute Studies in the Sciences of Com-plexity, June 15–19, 1992, Santa Fe, New Mexico, USA. Addison Wesley Longman.ISBN 020162494X, 978-0201624946. Published in August 1993.

[1922] Justinian P. Rosca. Proceedings of the Workshop on Genetic Programming: FromTheory to Real-World Applications. Technical Report 95.2, University of Rochester,National Resource Laboratory for the Study of Brain and Behavior, Morgan Kauf-mann, San Mateo, California, Rochseter, New York, USA, July 9, 1995, Tahoe City,California, USA. Held in conjunction with the twelfth International Conference onMachine Learning.

[1923] J. David Schaffer and Darell Whitley, editors. Proceedings of COGANN-92. In-ternational Workshop on Combinations of GeneticAlgorithms and Neural Networks,June 6, 1992, Baltimore, Maryland, USA. IEEE Computer Society Press. ISBN0-8186-2787-5, 978-0818627873. doi:10.1109/COGANN.1992.273951. INSPEC Ac-cession Number: 4487943, Cat. No.92TH0435-8.

[1924] Proceedings of BIONETICS 2007, 2nd International Conference on Bio-InspiredModels of Network, Information, and Computing Systems, December 10, 2007,Radisson SAS Beke Hotel, 43. Terez krt., Budapest H-1067, Hungary. Institute forComputer Sciences, Social-Informatics and Telecommunications Engineering (ICST),IEEE, ACM. ISBN 978-963-9799-05-9.

[1925] Wolfgang Banzhaf, Thomas Christaller, Peter Dittrich, Jan T. Kim, and Jens Ziegler,editors. Advances in Artificial Life, Proceedings of the 7th European Conference,ECAL 2003, volume 2801 of Lecture Notes in Computer Science (LNCS), Septem-ber 14–17, 2003, Dortmund, Germany. Springer. ISBN 3-540-20057-6.

[1926] Hai H. Dam, Hussein A. Abbass, and Chris Lokan. DXCS: an XCS system for dis-tributed data mining. Technical Report TR-ALAR-200504002, The Artificial Life andAdaptive Robotics Laboratory, School of Information Technology and Electrical Engi-

708 REFERENCES

neering, University of New South Wales, Northcott Drive, Campbell, Canberra, ACT2600 Australia, 2005. ALAR Technical Report Series. Online available at http://

www.itee.adfa.edu.au/~alar/techreps/200504002.pdf [accessed 2007-09-12]. See also[1190].

[1927] John Henry Holland. Escaping brittleness: the possibilities of general-purpose learn-ing algorithms applied to parallel rule-based systems. Computation & Intelligence:Collected Readings, pages 275–304, 1995. See also [1223].

[1928] John Mylopoulos and Raymond Reiter, editors. Proceedings of the 12thInternational Joint Conference on Artificial Intelligence, volume 2, Au-gust 24–30, 1991, Sydney, Australia. Morgan Kaufmann, San Fran-cisco, CA, USA. ISBN 1-55860-160-0. Online available at http://dli.

iiit.ac.in/ijcai/IJCAI-91-VOL2/CONTENT/content.htm [accessed 2008-04-

01]seeAlsoPROC1991IJCAIV1,PROC1991IJCAITNGOIS,PROC1991IJCAIFLAFC.[1929] Xavier Llora and Kumara Sastry. Fast rule matching for learning classifier systems

via vector instructions. Technical Report 2006001, IlliGAL, Illinois Genetic Algo-rithms Laboratory, University of Illinois at Urbana-Champaign, January 2006. On-line available at http://www.illigal.uiuc.edu/pub/papers/IlliGALs/2006001.

pdf [accessed 2007-09-12]. See also [1255].[1930] Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wilson, and David E. Goldberg.

Generalization in the XCSF Classifier System: Analysis, Improvement, and Ex-tension. Technical Report 2005012, IlliGAL, Illinois Genetic Algorithms Labora-tory, University of Illinois at Urbana-Champaign, March 2005. Online available athttp://www.illigal.uiuc.edu/pub/papers/IlliGALs/2005012.pdf [accessed 2007-09-

12]. See also [1263].[1931] Chii-Ruey Hwang. Simulated annealing: Theory and applications. Acta Applican-

dae Mathematicae: An International Survey Journal on Applying Mathematics andMathematical Applications, 12(1):108–111, May 1988. ISSN 0167-8019 (Print) 1572-9036 (Online). doi:10.1007/BF00047572. Academia Sinica. This is a review of [1293].Online available at http://www.springerlink.com/content/t1n71m85j33556m4/

[accessed 2007-08-25].[1932] Lester Ingber. Simulated Annealing: Practice versus Theory. Technical Report,

Lester Ingber Research, P.O.B. 857, McLean, VA 22101, 1993. Online availableat http://ideas.repec.org/p/lei/ingber/93sa.html and http://www.ingber.

com/asa93_sapvt.pdf [accessed 2007-08-18]. See also [1299].[1933] Marco Dorigo, Gianni Di Caro, and L. Gambardella. Ant Algorithms for Discrete

Optimization. Artificial Life, 5(2):137–172, 1999. Online available at http://www.

idsia.ch/~luca/ij_23-alife99.pdf [accessed 2007-09-15]. See [1382].[1934] Edward Osborne Wilson. Sociobiology: The New Synthesis. Belknap Press, twenty-

fifth anniversary edition edition, March 2000. ISBN 0674002350, 978-0674002357.See also [1387].

[1935] De-Shuang Huang, Laurent Heutte, and Marco Loog, editors. Advanced Intel-ligent Computing Theories and Applications. With Aspects of Contemporary In-telligent Computing Techniques – Proceedings of the Third International Confer-ence on Intelligent Computing, ICIC 2007, volume 2 of Communications in Com-puter and Information Science, August 21–24, 2007, Qingdao, China. SpringerBerlin/Heidelberg. ISBN 978-3-540-74281-4 (Print) 978-3-540-74282-1 (Online).doi:10.1007/978-3-540-74282-1. Online available at http://www.springerlink.com/content/k74022/ [accessed 2008-03-28].

[1936] Jonathan E. Fieldsend, Richard M. Everson, and Sameer Singh. Extensions to thestrength pareto evolutionary algorithm. IEEE Transactions on Evolutionary Com-putation, 2001. submitted, superseded by [1489]. Online available at http://www.

dcs.ex.ac.uk/people/reverson/pubs/espea.ps.gz and http://citeseer.ist.

psu.edu/fieldsend01extensions.html [accessed 2007-08-25].

REFERENCES 709

[1937] P. N. Suganthan, N. Hansen, J. J. Liang, Kalyanmoy Deb, Y. P. Chen, Anne Auger,and S. Tiwari. Problem Definitions and Evaluation Criteria for the CEC 2005 SpecialSession on Real-Parameter Optimization. Technical Report, Nanyang Technologi-cal University, Singapore, May 2005. Online available at http://www.ntu.edu.sg/

home/epnsugan/index_files/CEC-05/Tech-Report-May-30-05.pdf [accessed 2007-10-

07]. See also [1500, 486].[1938] Terry Jones. A Description of Holland’s Royal Road Function. Working Papers

94-11-059, Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, NM 87501, USA,November 1994. See also [1521].

[1939] Pedro Lima, editor. Robotic Soccer. I-Tech Education and Publishing, Vienna,Austria, December 2007. ISBN 978-3-902613-21-9. Online available at http://s.

i-techonline.com/Book/Robotic-Soccer/ISBN978-3-902613-21-9.html [accessed

2008-04-23].[1940] Bernhard Nebel, editor. Proceedings of the Seventeenth International Joint Confer-

ence on Artificial Intelligence, IJCAI 2001, volume 1 and 2, August 4–10, 2001, Seat-tle, Washington, USA. Morgan Kaufmann, San Francisco, CA, USA. ISBN 1-55860-777-3. Online available at http://dli.iiit.ac.in/ijcai/IJCAI-2001/content/

content.htm [accessed 2008-04-01]. See also [1956].[1941] Yoav Freund and Robert E. Schapire from the AT&T Labs, 180 Park Av-

enue, Florham Park, New Jersey 07932, USA. A decision-theoretic gener-alization of on-line learning and an application to boosting. Journal ofComputer and System Sciences, 55:119–139, 1997. Article no. SS971504.Online available at http://www.face-rec.org/algorithms/Boosting-Ensemble/

decision-theoretic_generalization.pdf [accessed 2007-09-15]. See also [1571].[1942] Peter Bartlett, Yoav Freund, Wee Sun Lee, and Robert E. Schapire. Boosting the

margin: a new explanation for the effectiveness of voting methods. Annals of Statis-tics, 26(5):1651–1686, 1998. Online available at http://cs.nyu.edu/~cil217/ML/

BoostingMargin.pdf and http://dx.doi.org/10.1214/aos/1024691352 [accessed

2007-09-15]. See also [1574].[1943] Proceedings of 2006 IEEE Joint Conference on E-Commerce Technology (CEC’06)

and Enterprise Computing, E-Commerce and E-Services (EEE’06), June 26–29, 2006,The Westin San Francisco Airport, 1 Old Bayshore Highway, Millbrae, United States.IEEE Computer Society, Los Alamitos, California, Washington, Tokyo. ISBN 978-0-7695-2511-2.

[1944] Proceedings of IEEE Joint Conference (CEC/EEE 2007) on E-Commerce Technology(9th CEC’07) and Enterprise Computing, E-Commerce and E-Services (4th EEE’07),July 23–26, 2007, National Center of Sciences, Tokyo, Japan. IEEE Computer Society,IEEE Computer Society. ISBN 978-0-7695-2913-4.

[1945] Craig W. Reynolds. Flocks, herds and schools: A distributed behavioral model. InSIGGRAPH’87, Proceedings of the 14th annual conference on Computer graphics andinteractive techniques, pages 25–34, July 27–31, 1987, Anaheim, California, USA. As-sociation for Computing Machinery (ACM), New York, NY, USA. ISBN 0-89791-227-6. doi:10.1145/37401.37406. Online available at http://citeseer.ist.psu.

edu/reynolds-flocks.html and http://doi.acm.org/10.1145/37401.37406 [ac-

cessed 2008-07-27]. See also [1664].[1946] Georg Gottlob and Toby Walsh, editors. IJCAI-03, Proceedings of the Eighteenth In-

ternational Joint Conference on Artificial Intelligence, August 9–15, 2003, Acapulco,Mexico. Morgan Kaufmann, San Francisco, CA, USA. ISBN 0-127-05661-0. On-line available at http://dli.iiit.ac.in/ijcai/IJCAI-2003/content.htm [accessed

2008-04-01]. See also [1957].[1947] Steven R. Finch. Mathematical Constants (Encyclopedia of Mathematics and its

Applications). Cambridge University Press, August 18, 2003. ISBN 978-0521818056.See http://algo.inria.fr/bsolve/ [accessed 2007-09-15].

710 REFERENCES

[1948] Guillaume Chelius, Eric Fleury, and Thierry Mignon. Lower and Upper Boundsfor Minimum Energy Broadcast and Sensing Problems in Sensor Networks. In IC-PADS’05: Proceedings of the 11th International Conference on Parallel and Dis-tributed Systems - Workshops (ICPADS’05), pages 88–92, 2005. IEEE ComputerSociety, Washington, DC, USA. ISBN 0-7695-2281-5. doi:10.1109/ICPADS.2005.181.See also [1840].

[1949] J. W. Backus, F. L. Bauer, J. Green, C. Katz, J. McCarthy, A. J. Perlis,H. Rutishauser, K. Samelson, B. Vauquois, J. H. Wegstein, A. van Wijngaarden, andM. Woodger. Revised report on the algorithm language ALGOL 60. Communica-tions of the ACM, 6(1):1–17, 1963. ISSN 0001-0782. doi:10.1145/366193.366201. On-line available at http://doi.acm.org/10.1145/366193.366201 and http://www.

masswerk.at/algol60/report.htm [accessed 2007-09-15]. See also [1875].[1950] Michael Zapf and Thomas Weise from the University of Kassel, FB-16, Dis-

tributed Systems Group, Wilhelmshoher Allee 73, 34121 Kassel, Germany. Of-fline Emergence Engineering For Agent Societies. Kasseler Informatikschriften(KIS) 2007, 8, University of Kassel, FB16, Distributed Systems Group, Wil-helmshoher Allee 73, 34121 Kassel, Germany, December 7, 2007. PersistentIdentifier: urn:nbn:de:hebis:34-2007120719844. Online available at https://kobra.

bibliothek.uni-kassel.de/handle/urn:nbn:de:hebis:34-2007120719844 andhttp://www.it-weise.de/documents/files/ZW2007EUMASTR.pdf [accessed 2007-11-20],see also [1900].

[1951] N. S. Sridharan, editor. Proceedings of the 11th International Joint Conference onArtificial Intelligence, volume 2, August 1989, Detroit, MI, USA. Morgan Kaufmann,San Francisco, CA, USA. ISBN 1-55860-094-9. Online available at http://dli.

iiit.ac.in/ijcai/IJCAI-89-VOL2/CONTENT/content.htm [accessed 2008-04-01]. See also[1912].

[1952] Anca L. Ralescu and James G. Shanahan, editors. Fuzzy Logic in Artificial Intelli-gence, IJCAI’97 Selected and Invited Workshop Papers, volume 1566 of Lecture Notesin Computer Science (LNCS), 1999, Nagoya, Japan. Springer. ISBN 3-540-66374-6.See also [1917, 1918].

[1953] Proceedings of the Fourteenth International Joint Conference on Artificial Intelli-gence, volume 2, August 20–25, 1995, Montreal, Quebec, Canada. Morgan Kaufmann,San Francisco, CA, USA. ISBN 1-55860-363-8. Online available at http://dli.

iiit.ac.in/ijcai/IJCAI-95-VOL2/CONTENT/content.htm [accessed 2008-04-01]. See also[1920, 1954, 1955].

[1954] Gerhard Weiß and Sandip Sen, editors. Adaption and Learning in Multi-Agent Sys-tems, IJCAI’95 Workshop Proceedings, volume 1042 of Lecture Notes in ComputerScience (LNCS), 1996, Montreal, Quebec, Canada. Springer. ISBN 3-540-60923-7.See also [1920, 1953, 1955].

[1955] Trevor P. Martin and Anca L. Ralescu, editors. Fuzzy Logic in Artificial Intelligence,Towards Intelligent Systems, IJCAI’95 Selected Papers from Workshop, volume 1188of Lecture Notes in Computer Science (LNCS), 1997, Montreal, Quebec, Canada.Springer. ISBN 3-540-62474-0. See also [1920, 1953, 1954].

[1956] Alexander Maedche, Steffen Staab, Claire Nedellec, and Eduard H. Hovy, edi-tors. IJCAI’2001 Workshop on Ontology Learning, Proceedings of the SecondWorkshop on Ontology Learning OL’2001, volume 38 of CEUR Workshop Proceed-ings, August 4, 2001, Seattle, Washington, USA. CEUR-WS.org. Online avail-able at http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/

Vol-47/ [accessed 2008-04-01]. See also [1940]. Held in conjunction with the 17th Inter-national Conference on Artificial Intelligence IJCAI’2001.

[1957] Subbarao Kambhampati and Craig A. Knoblock, editors. Proceedings of IJCAI-03 Workshop on Information Integration on the Web (IIWeb-03), August 9–10,

REFERENCES 711

2003, Acapulco, Mexico. Online available at http://www.isi.edu/info-agents/

workshops/ijcai03/proceedings.htm [accessed 2008-04-01]. See also [1946].

Index

(1 + 1)− ES, 190(GE)2, 150(µ′, λ′(µ, λ)γ)-ES, 191(µ+ 1)-ES, 190(µ+ λ), 193(µ+ λ)-ES, 190(µ, λ)-ES, 191(µ/ρ+ λ)-ES, 191(µ/ρ, λ)-ES, 191χ2 Distribution, 43915 -rule, 191(µ+ λ), 74(µ, λ), 74σ-algebra, 417Γ , 464Θ notation, 481802.11, 361

A⋆ Search, 250AAAI, 60AAB, 357AAS, 357Abstraction, 479ACO, 231Action, 200AdaBoost, 325, 361Adapter, 363Adaptive Grammar, 506Adaptive Walk, 250

fitter dynamics, 251greedy dynamics, 251one-mutant, 250

ADDO, 335

Adenine, 24ADF, 133, 134, 160, 361ADG, 163Adjacency, 25, 26adjacent neighbors, 280Adjunction, 508, 509ADL, 162ADM, 134Admissible, 250AG, 503, 504AGA, 264Agent, 362

ant, 354genetic, 355

Agents, 77, 126, 193, 208Aggregate, 365Aggregate Function, 365Aggregation, 364, 365

gossip-based, 365proactive, 365reactive, 365

Aggregation Protocols, 364, 365AI, 315AL, 176Algorithm, 477

abstraction, 479anytime, 183complexity, 480determined, 480determinism, 480deterministic, 482discrete, 479distributed, 483

712

INDEX 713

euclidean, 291evaluate, 182evolutionary, 67evolve, 182finite, 480generational, 73Las Vegas, 482Monte Carlo, 482optimization, 29probabilistic, 4, 482randomized, 482termination, 480

Algorithmic Chemistry, 167ALife, 176All-Or-Nothing, 184, 359Allele, 24Alphabet, 500ANN, 161, 316Ant

artificial, 9forward, 354

Ant Colony Optimization, 231Antisymmetrie, 413AntNet, 354, 355Anytime Algorithm, 183appleJuice, 488Application Server, 487Applications, 269Architecture

service oriented, 325Artificial Ant, 9, 288Artificial Chemistry, 176Artificial Embryogeny, 119Artificial Life, 176Asexual Reproduction, 115Assignment

soft, 176Asymmetrie, 413Athena, 362Attribute, 503

inherited, 503synthesized, 503

Attribute Grammar, 503extended, 505, 506L-attributed, 504reflective, 151S-attributed, 505

Autoconstructive Evolution, 178Autocorrelation, 43Automatically Defined Functions, 133, 160Automatically Defined Groups, 163Automatically Defined Link, 162Automaton

cellular, 126, 193Auxiliary Tree, 508Average, 366

Backus-Naur Form, 502extended, 503

Battery, 489Bayes Classifier

naıve, 316BBH, 122BDP, 258Bee, 197Bernoulli

distribution, 432experiment, 432trial, 432

Best-First Search, 249BFS, 245BGP, 138Bias, 448Bibtex, 541Big-O notation, 480Big-Ω notation, 481Bijective, 411Bijectivity, 411BinInt, 38, 287, 288Binomial Distribution, 432Biochemistry, 60, 126, 193, 222, 228, 240Biology, 60, 76, 213BIOMA, 77, 232BIONETS, 360Bird, 197BitCount, 287Bittorrent, 488Bloat, 45Block

building, 122BLUE, 452Bluetooth, 489BNF, 502Boosting, 325Bottleneck, 484Box-Muller, 460

polar, 461BPEL, 337BPEL4WS, 336Breadth-First Search, 245Broadcast, 496Broadcast-Distributed Parallel Evolutionary

Algorithm, 258BTNodes, 490Bucket Brigade, 202Building Block, 122Building Block Hypothesis, 122, 284

714 INDEX

Bus, 486Byzantine Fault, 499

Candidatesolution, 23

Cartesian Genetic Programming, 46, 163,165

embedded, 165Catastrophe

complexity, 281Causality, 40, 58, 304CC, 357CDF, 419

continous, 420discrete, 420

CEC, 77, 232Cellular Automaton, 126, 193Cellular Encoding, 141Central Point Of Failure, 484Centroid, 467CFG, 501, 502CGE, 152CGP, 46, 163–165

embedded, 165Change

non-synonymous, 45synonymous, 45

Character String, 500Chemical Engineering, 60, 76, 112, 189, 192,

193, 217, 222, 237Chemistry, 60, 76, 112, 189, 192, 193, 217,

222, 237algorithmic, 167artificial, 176

Chi-square Distribution, 439Chomsky Hierarchy, 501Christiansen

grammar, 152, 507Christiansen Grammar, 152

evolution, 152Christiansen Grammars, 507Chromosome, 115Chromosomes

stringfixed-length, 116variable-length, 118

tree, 128CI, 80, 452Class

equivalence, 414Classifier, 200Classifier Systems, 195, 196, 320, 395

learning, 195, 202, 316non-learning, 201

Client, 486Client-Server, 255, 486Closure, 144, 186Clustering, 465k-means, 470nth nearest neighbor, 470algorithm, 466hierarchical, 465leader, 473linkage, 471partitional, 466, 469partitions, 466square error, 469

Code Bloat, 341Codons, 138Coefficient

negative slope, 42Coefficient of Variation, 423Combination, 416Combinatorics, 416Communication, 60, 77, 112, 126, 208, 217,

228, 232, 240, 245collective, 357inter-process, 363

Completeness, 25, 244weak, 25

Complexity Catastrophe, 281Compress, 165Computational Embryogeny, 119Computational Intelligence, 80Computer

sciencetheoretical, 477

Computingamorphous, 363high-performance, 357ubiquitous, 363

Concatenation, 500Condition, 198Confidence

coefficient, 453interval, 452

Configuration, 362Connection Register, 168Content Sharing, 488Contest, 315Continuous Distributions, 433Contravariance, 328Convergence, 37

domino, 38, 288premature, 37prevention, 106

Correlation