Carlos Gershenson

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Cgershen (talk | contribs) at 14:20, 9 August 2016 (Removed opinionated anonymous interpretations (don't meet Wikipedia standards).). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Carlos Gershenson
Born (1978-09-29) 29 September 1978 (age 45)
NationalityMexican
Known forResearch on Self-Organization, Complexity Digest
AwardsTeam Mexico City, Audi Urban Future Award 2014[1], Google Research Award for Latin America 2015[2]
Scientific career
FieldsComplex systems, Computer science, Artificial life
InstitutionsUniversidad Nacional Autónoma de México, Massachusetts Institute of Technology
Doctoral advisorFrancis Heylighen, Diederik Aerts, Bart D'Hooghe
Other academic advisorsJosé Negrete Martínez, Inman Harvey, Yaneer Bar-Yam
Websitehttp://turing.iimas.unam.mx/~cgg/

Carlos Gershenson (born September 29, 1978) is a Mexican researcher at the Universidad Nacional Autónoma de México and a research affiliate at the Massachusetts Institute of Technology. His academic interests include self-organizing systems, complexity, and artificial life.

Biography

Gershenson was born September 29, 1978 in Mexico City. He studied a BEng in Computer Engineering at the Arturo Rosenblueth Foundation in Mexico City in 2001 and a MSc in Evolutionary and Adaptive Systems at the University of Sussex. He received his PhD in Sciences at the Centrum Leo Apostel of the Vrije Universiteit Brussel, Belgium in 2007, on "Design and Control of Self-organizing Systems", under the supervision of Francis Heylighen. He was a postdoc of Yaneer Bar-Yam at the New England Complex Systems Institute.

He is a tenured researcher (investigador) at the Computer Science Department of the Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas at the Universidad Nacional Autónoma de México. He is associated researcher of the Centro de Ciencias de la Complejidad at the same university. He was the head of the Computer Science Department (2012-2015). He was a Visiting Professor at the Massachusetts Institute of Technology and at Northeastern University.

He has also been editor-in-chief of Complexity Digest since 2009 [3]

Work

The academic contributions of Carlos Gershenson have been related to the understanding and popularization of topics of complex systems, in particular, related to Boolean networks, self-organization, and traffic control.

Self-organizing Systems

During his PhD, Gershenson proposed a general methodology to design and control self-organizing systems.[4] He noticed that self-organization cannot be judged independently of a context, i.e., it is not so relevant to decide whether a system is or not self-organizing, but when is it useful to do so.[5] The usefulness of self-organization lies in the fact that it can provide robust adaptation to changes in a system. His approach is similar to other models of traffic introduced in the 1990s that are never cited in Gershenson works. As particular cases, he studied the problems of traffic light coordination,[6] organization efficiency,[7] and communication protocols.[8]

In recent years, he has extended his work on the study of self-organizing traffic lights[9] and also applied self-organization to public transport regulation[10][11] and other urban systems.[12]

Random Boolean Networks

During his MSc studies, Gershenson proposed a classification of random Boolean networks depending on their updating scheme.[13]

He has also studied the effect of redundancy[14] and modularity[15] on random Boolean networks.

ALife 2016

He was co-organizer of ALife XV: Fifteenth International Conference on the Simulation and Synthesis of Living Systems[16], held in Cancun, Mexico in July, 2016[17].

References

  1. ^ http://audi-urban-future-initiative.com/blog/data-collectors-from-mexico-city-win-audi-urban-future-award-2014
  2. ^ http://www.gaceta.unam.mx/20151001/galardon-a-dos-universitarios/
  3. ^ http://comdig.unam.mx
  4. ^ Gershenson, C. (2007). Design and Control of Self-organizing Systems. CopIt Arxives, Mexico. http://scifunam.fisica.unam.mx/mir/copit/TS0002EN/TS0002EN.html
  5. ^ Gershenson, C. and Heylighen, F. (2003). When can we call a system self- organizing? In Banzhaf, W., Christaller, T., Dittrich, P., Kim, J. T., and Ziegler, J., editors, Advances in Artificial Life, 7th European Conference, ECAL 2003 LNAI 2801, pages 606–614, Berlin. Springer. http://arxiv.org/abs/nlin.AO/0303020
  6. ^ Gershenson, C (2005). "Self-organizing traffic lights" (PDF). Complex Systems. 16 (1): 29–53.
  7. ^ Gershenson, C (2008). "Towards self-organizing bureaucracies". International Journal of Public Information Systems. 2008 (1): 1–24.
  8. ^ Gershenson, C. and Heylighen, F. (2011). Protocol requirements for self- organizing artifacts: Towards an ambient intelligence. In Minai, A., Braha, D., and Bar-Yam, Y., editors, Unifying Themes in Complex Systems, volume V, pages 136–143. Springer, Berlin Heidelberg. http://arxiv.org/abs/nlin.AO/0404004
  9. ^ Gershenson, C.; Rosenblueth, D. A. (2012). "Self-organizing traffic lights at multiple-street intersections". Complexity. 17 (4): 23–39. doi:10.1002/cplx.20392.
  10. ^ Gershenson, C.; Pineda, L. A. (2009). "Why does public transport not arrive on time? The pervasiveness of equal headway instability". PLoS ONE. 4 (10): e7292. doi:10.1371/journal.pone.0007292.{{cite journal}}: CS1 maint: unflagged free DOI (link)
  11. ^ Gershenson, C (2011). "Self-organization leads to supraoptimal performance in public transportation systems". PLoS ONE. 6 (6): e21469. doi:10.1371/journal.pone.0021469.{{cite journal}}: CS1 maint: unflagged free DOI (link)
  12. ^ Gershenson, C (2013). "Living in living cities". Artificial Life. 19 (3–4): 401–420. doi:10.1162/ARTL_a_00112.
  13. ^ Classification of random Boolean networks. In Standish, R. K., Bedau, M. A., and Abbass, H. A., editors, Artificial Life VIII: Proceedings of the Eight International Conference on Artificial Life, pages 1–8, Cambridge, MA, USA. MIT Press. http://arxiv.org/abs/cs/0208001
  14. ^ Gershenson, C., Kauffman, S. A., and Shmulevich, I. (2006). The role of redundancy in the robustness of random Boolean networks. In Rocha, L. M., Yaeger, L. S., Bedau, M. A., Floreano, D., Goldstone, R. L., and Vespignani, A., editors, Artificial Life X, Proceedings of the Tenth International Conference on the Simulation and Synthesis of Living Systems., pages 35–42. MIT Press. http://arxiv.org/abs/nlin.AO/0511018
  15. ^ Poblanno-Balp, R.; Gershenson, C. (2011). "Modular random Boolean networks". Artificial Life. 17 (4): 331–351. arXiv:1101.1893. doi:10.1162/artl_a_00042.
  16. ^ Gershenson, C., Froese, T., Siqueiros, J. M., Aguilar, W., Izquierdo, E. J., and Sayama, H., editors (2016). Proceedings of the Artificial Life Conference 2016. MIT Press, Cambridge, MA, USA. https://mitpress.mit.edu/books/proceedings-artificial-life-conference-2016
  17. ^ http://xva.life

External links