[FOM] [CiE] Newsletter No.21, October 07, 2009

CiE cie at maths.leeds.ac.uk
Wed Oct 7 20:32:44 EDT 2009

CiE Newsletter No.21, October 07, 2009


1. ACKERMANN AWARD 2010 - Call for Nominations

2. Universal Machines and Computations (MCU'2010) - Call for Papers

3. Computability and probability - Postdoctoral 
fellowship at University of Hawaii

4. Last Call for Papers - Nature Inspired 
Cooperative Strategies for Optimization - NICSO 2010

5. Second International Workshop on Computational 
Models for Cell Processes - Call for participation

6. The Ackermann Award 2009 - report of winner

1. (from Johann Makowsky) ACKERMANN AWARD 2010 - Call for Nominations:



* Eligible for the 2010 Ackermann Award are PhD dissertations in topics
    specified by the EACSL and LICS conferences, which were formally
    accepted as PhD theses at a university or equivalent institution
    between 1.1.2008 and 31.12. 2009.
* Submission details are available at
* The deadline for submission is
		March 15, 2010
   Nominations can be submitted from  January 1, 2010 on and should be sent
   to the chairman of the Jury by e-mail:
  		janos at cs.technion.ac.il
* The award consists of
      - a diploma,
      - an invitation to present the thesis at the CSL conference,
      - the publication of the abstract of the thesis and the laudation
        in the CSL proceedings,
      - travel support to attend the conference.
* The 2010 Ackermann Award will be presented to the recipients at the
   annual conference of the EACSL (CSL'10) in Brno (Czech Republic)
   to be held 23-27 August 2010,
* The jury consists of 10 members:
      - The member of the board of EACSL as chairman of the Jury,
        J. Makowsky (Haifa)
      - The president of EACSL, D. Niwinski (Warsaw)
      - The vice-president of EACSL, A. Dawar (Cambridge)
      - One member of the LICS organizing committee, G. Plotkin (Edinburgh)
      - R. Alur (Philadelphia)
      - A. Atserias (Barcelona)
      - T. Coquand (Goeteborg)
      - P.-L. Curien (Paris)
      - A. Durand (Paris)
      - J. van Benthem (Amsterdam and Stanford)

* The jury is entitled to give more than one award per year.

* The previous Ackermann Award recipients were:
   2005: Mikolaj Bojanczyk, Konstantin Korovin, Nathan Segerlind;
   2006: Stefan Milius and Balder ten Cate;
   2007: Dietmar Berwanger, Stephane Lengrand and Ting Zhang.
   2008: Krishnendu Chatterjee
   2009: Jakob Nordstrom

* For the three years 2010-2012,
   the Award is sponsored by the Kurt Goedel Society

2. (from Maurice Margenstern) Universal Machines and Computations
(MCU'2010) - Call for Papers:


                        International Conference



      M     M    CCC   U     U  I   22222    00000     1     00000
      MM   MM   C   C  U     U  I  2     2  0     0   11    0     0
      M M M M  C       U     U     2     2  0     0  1 1    0     0
      M  M  M  C       U     U         22   0     0    1    0     0
      M     M  C       U     U        2     0     0    1    0     0
      M     M   C   C   U   U       22      0     0    1    0     0
      M     M    CCC     UUU       2222222   00000    1111   00000


                        PITTSBURGH, PA, USA

                     Carnegie Mellon University
                   Department of Computer Science

                           SEPTEMBER 21-25


Organizing institutions :

          Carnegie Mellon University, Department of Computer Science
          Université d'Orléans, LIFO
          Université Pau Verlaine - Metz, LITA




          Digital Computations:
             Turing machines, register machines, cellular automata,
             other automata, tiling of the plane, polyominoes, snakes,
             neural networks, molecular computations, word processing
             (goups and monoids), other machines
          Analog and Hybrid Computations:
             BSS machines, infinte cellular automata, real machines,
             quantum computing
          In both cases:
          frontiers between a decidable halting problem and an
          undecidable one in the various computational settings
          minimal universal codes:
             size of such a code, namely, for Turing machines, register
             machines, cellular automatas, tilings, neural nets,
             Post systems, ...
          computation complexity of machines with a decidable halting
             problem as well as universal machines
          self-reproduction and other tasks
          universality and decidability in the real field


          Erzsébet CSUHAJ-VARJÚ, Hungarian Academy of Sciences, Hungary
          Jérôme DURAND-LOSE, University of Orléans, France, co-chair
          Vladik KREINOVICH, the University of Texas at El Paso
          Maurice MARGENSTERN, LITA, University of Metz, France, co-chair
          Cris MOORE, Santa Fe, USA
          Gheorghe PAUN, Romanian Academy, Bucharest, Romania
          Igor POTAPOV, University of Liverpool, UK
          Yurii ROGOZHIN, Institute of Mathematics, Chisinau, Moldov
          Klaus SUTNER, Carnegie Mellon University, Pittsburgh, USA, co-chair
          Jirí WIEDERMANN, Academy of Science, Czech Republic
          Damien WOODS, University College, Cork, Ireland


          Klaus SUTNER, Carnegie Mellon University, Pittsburgh, USA, co-chair
          Jérôme DURAND-LOSE, Université 
d'Orléans, Orléans, France, co-chair
          Maurice MARGENSTERN, Université Paul 
Verlaine - Metz, Metz, France, co-chair


          Andrew ADAMATZKY, University of Bristol, UK
          Olivier BOURNEZ, LORIA, INRIA-Lorraine, France
          Mark BURGIN, University of Califonia at Los Angeles, USA
          Jarkko KARI, University of Turku, Finland
          Pascal KOIRAN, École Normale Supérieure de Lyon, France
          Kenichi MORITA, University of Hiroshima, Japan
          Kumbakonam Govindarajan SUBRAMANIAN, 
Christian College of Chennai, India
          Wilfried SIEG
          Stephen WOLFRAM, Wolfram Research

    MCU'95, MCU'98 and MCU'2001 gave rise to TCS 
special issues on "Machines, Computations and 
Universality": 168-2 (1996), 231-2 (2000) and 
296-2 (2002). MCU'2004 and MCU'2007 gave rise to Fundamenta Informaticae
special issues: 74(4) (2005), 91(1) and 91(2) 
(2008). The interest of computer scientists for 
the topics of the conference increased in the 
last years. New domains appeared, continuing them 
in a natural way. This explains
why a regular scientifing meeting on this topics must hold, each three years.
And so, three years after MCU'2007 the turn of MCU'2010 comes.


    The proceedings of MCU'2010 will published by Electronic Proceedings
in Theoretical Computer Science, which already published the proceedings
of CSP 2008 and DCFS 2009, and they will publish 
those of DCM 2009 (under ICALP 2009) and MeCBIC 
2009 for instance. The proceedings will be available at the conference as a CD.

    Please, keep in mind the following dates :

          Dead line for submission :                March, 15, 2010
          Notification of acceptance or rejection : June, 1, 2010
          Dead line for receiving corrected version of accepted papers :
                                                    July, 1, 2010


    A special issue of the International Journal of Foundations of
Computer Science devoted to "Universal Machines 
and Computations'VI" will be published on the 
topics of the conference. A call for paper will be launched
just after MCU'2010 on the topics of the conference. The submitted
papers will be refereed and accepted papers after this process will be
published in the special issue. It will be possible to submit an extended
version of a paper published in the EPTCS proceedings of MCU'2010, provided
that the extension is actually needed or, 
preferably, that it contains new substantial 
results. The selection process for the special 
issue will be strict on these criteria.


In order to attend the conference, send your registration form by surface
mail at the below indicated address, by FAX, by e-mail or using the web
site of the conference when the date of 
registration will be announced. Registration fees 
amount to 400 USD if paid before July 1st 2010 
and to 450 USD after that date. Further details 
for the payment of the registration fees will be 
available later on the web site of the conference.




Reception of participants will hold on Monday, September, 20 and on
Tuesday, September, 21, at times which will be later indicated.


e-mails :

     margens at univ-metz.fr
     jerome.durand-lose at univ-orleans.fr
     sutner at cs.cmu.edu

by surface mail :

Université Paul Verlaine - Metz,
Campus du Saulcy,
F - 57045 METZ CEDEX

Jérôme Durand-Lose
Université d'Orléans,
LIFO, Batiment IIIA,
Rue Léonard de Vinci
B.P. 6759
F - 45067 ORLEANS Cedex 2

FAX: +33387315309


    To be announced later

3. (from Bjoern Kjos-Hanssen) Computability and 
probability - Postdoctoral fellowship at University of Hawaii:

A position as Postdoctoral Fellow is available in the Department of
Mathematics at the University of Hawaii at Manoa for either Spring 2010 or
the academic year 2010-2011. Hire will be made for one of these periods only.

This is a research position with no teaching, funded under the NSF project
"Computability and probability" (DMS-0901020).

Details may be found in the Work at UH advertisement at the following address.


Application review begins October 15. Applications received well beyond that
date may also receive full consideration, especially in the case of a
2010-2011 appointment.

For further information please contact:

Bjoern Kjos-Hanssen
Assistant Professor
Department of Mathematics
University of Hawaii at Manoa
2565 McCarthy Mall
Honolulu, HI 96822

Office: Physical Science Building 306
Telephone: (808) 956-8595
Web: http://www.math.hawaii.edu/~bjoern/
Email: bjoern at math.hawaii.edu

4. (from German Terrazas) Last Call for Papers - 
Nature Inspired Cooperative Strategies for Optimization - NICSO 2010:

The IV International Workshop on Nature Inspired Cooperative Strategies for
Optimization - NICSO 2010
May 12th - 14th
Granada, Spain


Full paper submission: October 15, 2009
Acceptance notification: November 30, 2009
Final camera ready: December 15, 2009
NICSO: May 12 - 14, 2010

* Invited Speakers (more to confirm) *

'Computational Intelligence in Games' - Pier Luca Lanzi, Politecnico di
Milano, Italy.

Biological and natural processes have always been a source of inspiration
for computer science and information technology. It is well known that
biological entities, from single cell organisms -like bacteria- to humans,
often engage in a rich repertoire of social interaction that could range
from altruistic cooperation through open conflict. One specific kind of
social interaction is cooperative problem solving (CPS), where a group of
autonomous entities work together in order to achieve certain goal.

The NICSO 2010 aims at promoting cooperative problem solving strategies
bringing together international researchers and practitioners from different
disciplines in order to discuss the investigations and exchange ideas on the
current state of the art of the topic. The conference seeks contributions
that are inspired by Nature and that encompass a range of spatio-temporal
scales, for visionary conceptions of information processing and computation
as pertaining to cooperation mechanisms in the context of problem solving.

All submitted papers will be blind reviewed by at least two reviewers.
Selection criteria will be based on relevance, originality, significance,
impact, technical soundness and quality of the presentation. Contributions
are expected to provide original results, insights and experimental
innovations. Manuscripts must be in PDF, not exceeding 12 pages and
conforming to the guidelines specified in the workshop's website.
Contributions are welcome to submission through the system available at
http://www.easychair.org/conferences/?conf=nicso2010. The accepted papers
will be published in the book series on Studies in Computational
Intelligence (Springer). The authors of the best accepted papers will be
invited to revise and extend their contributions for publication in a
special issue in the Memetic Computing Journal (Springer).

Target topics (but not limited to):

Adaptive Behaviour
Ants Colonies
Amorphous Computing
Artificial Life
Artificial Immune
Bio-inspired architecture
Distributed Computing
Evolutionary Robotics
Evolvable Systems
Genetic Algorithms
Genetic Programming
Membrane Computing
Quantum Computing
Software Self-Assembly
Systems Coevolution
Swarm Intelligence

* Programme Committee *

Belen Melian, University of La Laguna, Spain
Carlos Coello Coello, CINVESTAV-IPN, Mexico
Cecilio Angulo, Technical University of Catalunya, Spain
Dario Landa-Silva, University of Nottingham, UK
Davide Anguita, University of Genova, Italy
Francisco Herrera, University of Granada, Spain
Gabriela Ochoa, University of Nottingham, UK
Gianluigi Folino, Istituto di Calcolo e Reti ad Alte Prestazioni, Italy
Giuseppe Scollo, University of Catania, Italy
Graham Kendall, University of Nottingham, UK
Ignacio J. Garcia del Amo, University of Granada, Spain
J. Marcos Moreno, University of La Laguna, Spain
James Smaldon, University of Nottingham, UK
Jaume Bacardit, University of Nottingham, UK
Jean-Louis Giavitto, Universite d'Evry, France
Jim Smith, University of the West of England, UK
Jon Timmis, University of York, UK
Jorge Casillas, University of Granada, Spain
Jose A. Moreno, University of La Laguna, Spain
Jose A. Castillo, Instituto Nacional de Investigaciones Nucleares, Mexico
Jose L. Verdegay, University of Granada, Spain
Jose M. Cadenas, University of Murcia, Spain
Juan J. Merelo, University of Granada, Spain
Marco Dorigo, Universite Libre de Bruxelles, Belgium
Marian Gheorghe, University of Sheffield, UK
Mario Pavone, University of Catania, Italy
Oliver Korb, Cambridge Crystallographic Data Centre, UK
Steven Gustafson, General Electric Global Research Center, US
Thomas Stibor, Technische Universitat Darmstad, Germany
Vincenzo Cutello, University of Catania, Italy
Vincenzo Manca, University of Verona, Italy
Vitorino Ramos, Technical University of Lisbon, Portugal
Vittorio Maniezzo, University of Bologna, Italy
Xiao-Zhi Gao, Helsinki University of Technology, Finland

* Organising Committee *

David A. Pelta
Natalio Krasnogor
German Terrazas
Carloz Cruz
Juan R. Gonzalez

5. (from Ion Petre) Second International Workshop 
on Computational Models for Cell Processes - Call for participation:

Second International Workshop on Computational Models for Cell Processes
                Eindhoven, the Netherlands, November 3, 2009
	In conjunction with Formal Methods 2009

===   Date: November 3, 2009 					===
===   Webpage: http://combio.abo.fi/compmod09/ 			===
===   Related event: Tutorial on Computational Systems Biology, Nov 2, 2009
===	http://combio.abo.fi/tcsb09/ 				===

Computational systems biology is an exciting new application area for
applied mathematics and computer science. This workshop of the 16th
International Symposium on Formal Methods fosters an excellent platform
gathering researchers in formal methods and related fields that are
interested in the wealth of opportunities and challenges in systems biology.

- Jasmin Fisher (Microsoft Research Cambridge)
- Hidde de Jong (INRIA Grenoble - Rhone-Alpes)
- Grzegorz Rozenberg (University of Leiden)

- Bogdan Aman and Gabriel Ciobanu. Mobile 
Membranes with Timers - Roberto Barbuti, Giulio 
Caravagna, Andrea Maggiolo Schettini and Paolo
Milazzo. On the Interpretation of Delays in Delay Stochastic Simulation of
Biological Systems - Jiri Barnat, Lubos Brim, 
Ivana Cerna, Sven Drazan, Jana Fabriková and
David Safranek. BioDiVinE: A Framework for Parallel Analysis of Biological
Models - Daniela Besozzi, Paolo Cazzaniga, Matteo 
Dugo, Dario Pescini and Giancarlo
Mauri. A study on the combined interplay between stochastic fluctuations and
the number of flagella in bacterial chemotaxis - 
Luca Bortolussi and Alberto Policriti. Hybrid Semantics of Stochastic
Programs with Dynamic Reconfiguration. - Mario 
Coppo, Ferruccio Damiani, Elena Grassi, Mike Guether and Angelo
Troina. Modelling an Ammonium Transporter with 
SCLS - Laurence Loewe, Stuart Moodie and Jane 
Hillston. Quantifying the implicit
process flow abstraction in SBGN-PD diagrams with 
Bio-PEPA - Heike Siebert. Dynamical and 
Structural Modularity of Discrete Regulatory

- Registration: http://www.win.tue.nl/fm2009/ - 
Registration deadline: October 19, 2009 - Late 
registration: after October 19, including on-site registration
- Workshop: November 2, 2009

- Ralph Back, Abo Akademi, Finland
- Lubos Brim, Masaryk University, Czech Republic
- Muffy Calder, University of Glasgow, UK
- Eugen Czeizler, Abo Akademi, Finland
- Vincent Danos, University of Edinburgh, UK
- Russ Harmer, University of Paris 7, France
- Monika Heiner, Brandenburg University of Technology Cottbus, Germany
- Jane Hillston, University of Edinburgh, UK
- Ina Koch, Max Planck Institute for Molecular Genetics, Germany
- Vincenzo Manca, University of Verona, Italy
- Giancarlo Mauri, University of Milan-Bicocca, Italy
- Satoru Miyano, University of Tokyo, Japan
- Andrei Paun, Louisiana Tech University, US
- Ion Petre, Abo Akademi, Finland
- Jaco van de Pol, University of Twente, the Netherlands
- Alberto Policriti, University of Udine, Italy
- Erik de Vink, Eindhoven University of Technology, the Netherlands

- Ion Petre, ipetre 'AT' abo.fi
- Erik de Vink, evink 'AT' win.tue.nl
- Ralph-Johan Back, backrj 'AT' abo.fi

VENUE: Technische Universiteit Eindhoven, the Netherlands

6. (from Johann Makowsky) The Ackermann Award 2009 - report of winner:

The fifth Ackermann Award, 2009 -------------------------------
The Ackermann Award 2009 was presented at CSL'09, 
held in Coimbra (Portugal) in September 2009.

Jury report
Eligible for the 2009  Ackermann Award were PhD dissertations
in topics specified by the EACSL and LICS conferences,
which were formally accepted as PhD theses at a
university or equivalent institution between 1.1. 2007 and 31.12. 2008.
The Jury received 12 nominations for the Ackermann Award 2009.
The candidates came from 10
different nationalities from Europe, North America and Asia
and received their PhDs
in 9 different
countries in Europe and North America.
The topics covered the full range of Logic and Computer Science
as represented by the LICS and CSL Conferences.
All the submissions were of very high standard and contained
outstanding results in their particular domain.
In the past the Jury reached a consensus to give more than one award.
This time, in spite of the extreme high quality of the nominated theses,
the Jury decided finally, to give for the year 2009 only one award.

The 2009 Ackermann Award laureate is
	Jakob Nordstrom
for his thesis
	Short Proofs May Be Spacious:
	Understanding Space in Resolution
issued by the Royal Institute of Technology, Stockholm, Sweden, May 2008,
supervised by Prof. Johan Hastad.

Jakob Nordstrom receives the 2009 Ackermann Award
of the European Association of Computer Science Logic (EACSL)
for his thesis "Short Proofs May Be Spacious: Understanding Space in
Resolution". The thesis greatly advances our 
understanding of space-related measures in proof 
complexity. It completely fills the last 
remaining gap in the picture of most basic relations between
space and other fundamental complexity measures 
like length or width for the system of 
propositional resolution. The result confirms 
that space is indeed an inherently independent 
measure by exhibiting natural contradictions 
possessing very short and narrow refutations but 
no low-space refutation. This solution of a 
well-known open problem complements and contrasts with
previously known simulations in the opposite direction.

Biographic Sketch
Karl Jakob Nordstrom was born April 11, 1972, in Sweden.
He currently is a postdoctoral fellow at the 
Massachusetts Institute of Technology (MIT). He 
received his Master of Science in Computer 
Science and Mathematics at Stockholm University in 2001, and his
PhD in Computer Science at the Royal Institute of Technology (KTH) in 2008,
while being a research assistant sponsored by the President of KTH.
In 2006 he received the best student paper award at
38th ACM Symposium on Theory of Computing (STOC'06).
1997-1998 he served as a military interpreter at 
the Swedish Armed Forces Language Institute, 
where he graduated as the best student of the 
1998 class. He still works as an interpreter and 
translator between Russian and Swedish/English, 
and was engaged as interpreter for among others 
His Majesty the King of Sweden, the Prime 
Minister of Sweden, the Speaker of the Swedish 
Parliament and the Supreme Commander of the Swedish Armed Forces.
2001-2002 he was the Secretary of the Swedish 
Association of Military Interpreters, and 2002-2005 served as its President.
In 1992 he received his Diploma in Choir 
Conducting with extended Music Theory from
Tallinn Music Upper Secondary School, Estonia, and in 1994 he founded
the vocal ensemble Collegium Vocale Stockholm, which he led till 1999.
Throughout the 90s, the ensemble gave a number of concerts presenting mainly
Renaissance and Baroque music.

Previous Ackermann Laureates
2005: Mikolaj Bojanczyk, Konstantin Korovin, Nathan Segerlind;
2006: Stefan Milius and Balder ten Cate;
2007: Dietmar Berwanger, Stephane Lengrand and Ting Zhang.
2008: Krishnendu Chatterjee

More information is available at the EACSL websites
	www.eacsl.org and www.eacsl.org/award.html
The Call for Nominations for the 2010 Ackermann award
can also be found there. The deadline is March, 15, 2010.

The 2009 Ackermann Award was sponsored by LOGITECH.

Items for the next CiE Newsletter should be sent to s.b.cooper at leeds.ac.uk
to arrive by October 23, 2009

   ASSOCIATION COMPUTABILITY IN EUROPE       http://www.computability.org.uk
   CiE Conference Series                          http://www.illc.uva.nl/CiE
   CiE 2010                                       http://www.cie2010.uac.pt/
   CiE Membership Application Form             http://www.cs.swan.ac.uk/acie

__________ Information from ESET NOD32 Antivirus, 
version of virus signature database 4488 (20091007) __________

The message was checked by ESET NOD32 Antivirus.


More information about the FOM mailing list