cie-logo   Association CiE



  • As a member of CIE association you have a free access to Journal Computability: please follow this personal link


  • CIE Newsletter - No. 74

    CiE Newsletter No. 74, November 18th, 2013


    Please send any items you would like included in next letter to Olivier Bournez (bournez@lix.polytechnique.fr)
    DEADLINE: December 10th, 2013.






    CONTENTS












    1 ) CiE 2014: Computability in Europe, Budapest (Hungary), 23-27 June 2014




    *******************************************************************
    FIRST CALL FOR PAPERS:

    CiE 2014: Language, Life, Limits

    Budapest, Hungary

    June 23 - 27, 2014

    http://cie2014.inf.elte.hu


    IMPORTANT DATES:

    Submission Deadline for LNCS: 10 January 2014
    Notification of authors: 3 March 2014
    Deadline for final revisions: 31 March 2014


    CiE 2014 is the tenth conference organized by CiE (Computability in
    Europe), a European association of mathematicians, logicians, computer
    scientists, philosophers, physicists and others interested in new
    developments in computability and their underlying significance for the
    real world. Previous meetings have taken place in Amsterdam (2005),
    Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponte
    Dalgada (2010), Sofia (2011), Cambridge (2012), and Milan (2013).

    The motto of CiE 2014 "Language, Life, Limits" intends to put a special
    focus on relations between computational linguistics, natural and
    biological computing, and more traditional fields of computability theory.

    This is to be understood in its broadest sense including computational
    aspects of problems in linguistics, studying models of computation and
    algorithms inspired by physical and biological approaches as well as
    exhibiting limits (and non-limits) of computability when considering
    different models of computation arising from such approaches.

    As with previous CiE conferences the allover glueing perspective is to
    strengthen the mutual benefits of analyzing traditional and new
    computational paradigms in their corresponding frameworks both with
    respect to practical applications and a deeper theoretical understanding.

    TUTORIAL SPEAKERS:

    Wolfgang Thomas (RWTH Aachen)
    Peter Gruenwald (CWI, Amsterdam)

    INVITED SPEAKERS:

    Lev Beklemishev (Steklov Mathematical Institute, Moscow)
    Alessandra Carbone (Universite Pierre et Marie Curie and CNRS Paris)
    Maribel Fernandez (King's College London)
    Przemyslaw Prusinkiewicz (University of Calgary)
    Eva Tardos (Cornell University)
    Albert Visser (Utrecht University)

    SPECIAL SESSIONS:

    History and Philosophy of Computing (organizers: Liesbeth de Mol,
    Giuseppe Primiero)
    Computational Linguistics (organizers: Maria Dolores
    Jimenez-Lopez, Gabor Proszeky)
    Computability Theory (organizers: Karen Lange, Barbara
    Csima)
    Bio-inspired Computation (organizers: Marian Gheorghe,
    Florin Manea)
    Online Algorithms (organizers: Joan Boyar, Csan??d Imreh)
    Complexity in Automata Theory (organizers: Markus Lohrey,
    Giovanni Pighizzini)


    CiE 2014 conference topics include, but not exclusively:

    * Admissible sets
    * Algebraic models of computation
    * Algorithms
    * Analog computation
    * Artificial intelligence
    * Automata theory
    * Bioinformatics and Bio-inspired computation
    * Bounded arithmetic
    * Classical computability and degree structures
    * Cognitive science and modelling
    * Complexity classes
    * Computability theoretic aspects of programs
    * Computable analysis and real computation
    * Computable structures and models
    * Computational and proof complexity
    * Computational biology
    * Computational creativity
    * Computational learning and complexity
    * Computational linguistics
    * Concurrency and distributed computation
    * Constructive mathematics
    * Cryptographic complexity
    * Decidability of theories
    * Derandomization
    * DNA computing
    * Domain theory and computability
    * Dynamical systems and computational models
    * Effective descriptive set theory
    * Emerging and non-standard models of computation
    * Finite model theory
    * Formal aspects of program analysis
    * Formal methods
    * Foundations of computer science
    * Games
    * Generalized recursion theory
    * History of computation
    * Hybrid systems
    * Higher type computability
    * Hypercomputational models
    * Infinite time Turing machines
    * Kolmogorov complexity
    * Lambda and combinatory calculi
    * L-systems and membrane computation
    * Machine learning
    * Mathematical models of emergence
    * Membrane computing
    * Molecular computation
    * Morphogenesis and developmental biology
    * Multi-agent systems
    * Natural computation
    * Neural nets and connectionist models
    * Philosophy of science and computation
    * Physics and computability
    * Probabilistic systems
    * Process algebras and concurrent systems
    * Programming language semantics
    * Proof mining and applications
    * Proof theory and computability
    * Proof complexity
    * Quantum computing and complexity
    * Randomness
    * Reducibilities and relative computation
    * Relativistic computation
    * Reverse mathematics
    * Semantics and logic of computation
    * Swarm intelligence and self-organisation
    * Type systems and type theory
    * Uncertain reasoning
    * Weak systems of arithmetic and applications


    We particularly welcome submissions in emergent areas, such as
    bioinformatics and natural computation, where they have a basic
    connection with computability.

    Contributed papers will be selected from submissions received by the
    PROGRAM COMMITTEE consisting of:


    * Gerard Alberts (Amsterdam) * Sandra Alves (Porto)
    * Hajnal Andreka (Budapest) * Luis Antunes (Porto)
    * Arnold Beckmann (Swansea) * Laurent Bienvenu (Paris)
    * Paola Bonizzoni (Milan) * Olivier Bournez (Palaiseau)
    * Vasco Brattka (Munich) * Bruno Codenotti (Pisa)
    * Barry Cooper (Leeds) * Erzsebet Csuhaj-Varju (Budapest, co-chair)
    * Michael J. Dinneen (Auckland) * Erich Gr??del (Aachen)
    * Marie Hicks (Chicago IL) * Natasha Jonoska (Tampa FL)
    * Jarkko Kari (Turku) * Elham Kashefi (Edinburgh)
    * Viv Kendon (Leeds) * Satoshi Kobayashi (Tokyo)
    * Andras Kornai (Budapest) * Marcus Kracht (Bielefeld)
    * Benedikt Loewe (Amsterdam & Hamburg)* Klaus Meer (Cottbus, co-chair)
    * Joseph R. Mileti (Grinnell IA) * Georg Moser (Innsbruck)
    * Benedek Nagy (Debrecen) * Sara Negri (Helsinki)
    * Thomas Schwentick (Dortmund) * Neil Thapen (Prague)
    * Peter van Emde Boas (Amsterdam) * Xizhong Zheng (Glenside PA)


    The PROGRAMME COMMITTEE cordially invites all researchers (European and
    non-European) in computability related areas to submit their papers (in
    PDF format, max 10 pages using the LNCS style) for presentation at CiE 2014.

    The submission site https://www.easychair.org/conferences/?conf=cie2014
    is open.

    For submission instructions consult
    http://cie2014.inf.elte.hu/?Submission_Instructions

    We particularly invite papers that build bridges between different parts
    of the research community.

    The CONFERENCE PROCEEDINGS will be published by LNCS, Springer Verlag.

    Contact: Erzsebet Csuhaj-Varju - csuhaj[at]inf.elte.hu
    Website: http://cie2014.inf.elte.hu/
    ************************************************************************







    2 ) TPNC 2013: call for participation



    -----------------------------------------------------------------------------------------------------------
    2nd INTERNATIONAL CONFERENCE ON THE THEORY AND PRACTICE OF NATURAL COMPUTING

    TPNC 2013

    Cáceres, Spain

    December 3-5, 2013

    http://grammars.grlmc.com/tpnc2013/
    ----------------------------------------------------------------------------------------------------------

    PROGRAMME

    Tuesday, December 3

    09:00 - 09:50 Registration

    09:50 - 10:00 Opening

    10:00 - 10:50

    Eugen Czeizler, Pekka Orponen: Yield optimization strategies for (DNA) staged Tile Assembly Systems

    Vinay Kumar Gautam, Pauline C. Haddow, Martin Kuiper: Reliable Self-assembly by Self-triggered Activation of Enveloped DNA Tiles

    10:50 - 11:20 Coffee Break

    11:20 - 13:00

    Miros?aw Kordos, Andrzej Rusiecki: Improving MLP Neural Network Performance by Noise Reduction

    Omar K. Shoukry, Magda B. Fayek: Evolutionary Scheduling for Mobile Content Pre-fetching

    Marius Nagy, Naya Nagy: General Quantum Encryption Scheme based on Quantum Memory

    Marius Nagy, Naya Nagy: Quantum Secret Communication without an Encryption Key

    13:00 - 14:45 Lunch

    14:45 - 15:35

    Oliver Rice, Robert Smith, Rickard Nyman: GPU Multi-Objective Genetic Algorithm: Asynchronously Parallel Distributed NSGA-II

    Anne Jeannin-Girardon, Pascal Ballet, Vincent Rodin: An Efficie nt Biomechanical Cell Model to Simulate Large Multi-cellular Tissue Morphogenesis: Application to Cell Sorting Simulation on GPU

    15:35 - 15:50 Break

    15:50 - 16:40 Risto Miikkulainen: Evolving Neural Networks: Approaches ? Invited Tutorial I

    Wednesday, December 4

    09:00 - 10:40

    Rim Hentech, Ilyes Jenhani, Zied Elouedi: Learning from Uncertain Data Using Possibilistic Artificial Immune Recognition Systems

    Massimiliano D?Angelo, Berend Weel, Agoston E. Eiben: Online Gait Learning for Modular Robots with Arbitrary Shapes and Sizes

    José M. Lanza-Gutiérrez, Juan A. Gómez-Pulido, Miguel Ángel Vega-Rodríguez: A Trajectory Algorithm to Solve the Relay Node Placement Problem in Wireless Sensor Networks

    Rafael Nogueras, Carlos Cotta, Carlos M. Fernandes, Juan Luis Jiménez Laredo, Juan Julián Merelo, Agostinho C. Rosa: An Analysis of a Selecto-Lamarck ian Model of Multimemetic Algorithms with Dynamic Self-Organized Topology

    10:40 - 11:10 Coffee Break

    11:10 - 12:00

    Poster session I

    Orlando Duran: A Hybrid Solution to the Multi-Echelon Inventory Problem of Repairable Spare Parts Using Discrete Swarm Intelligence and a Local Search Procedure

    Jesús Torrecilla-Pinero, Fernando Torrecilla-Pinero, Juan A. Gómez-Pulido, Carlos Urueña-Fernández: A Novel Way to Optimize Cantilever Walls by Means of Natural Computing and Multiobjective Optimization

    Hector Zenil: Complexity and Algorithmic Probability of Animal Behaviour from Cognition to Communication

    Ron Cottam, Willy Ranson, Roger Vounckx: A Framework for Computing like Nature

    Cristina Martínez-Ramírez, Alberto Besana: Models for the Distribution of Letters in Random Generated Words

    Raúl Domínguez, Tim Köhler, Christian Rauch, Elma r Berghöfer, Frank Kirchner: Autonomous Robot Long Distance Traversing by a Robust Nature-Inspired Behaviour Control Model Using Sensor Feedback Expectations

    12:00 - 12:15 Break

    12:15 - 13:05 Risto Miikkulainen: Evolving Neural Networks: Applications ? Invited Tutorial II

    13:05 - 14:50 Lunch

    14:50 - 15:50

    Poster session II

    Kazunari Ozasa, Jeesoo Lee, Simon Song, Masahiko Hara, Mizuo Maeda: Introduction of Artificial Pheromone Effects on Euglena Cells Toward Ant Colony Optimization Experiments

    Krist?ne C?pola, R?si?? Freivalds: Examples of Advantages for Ultrametric Automata

    Mikhail Peretyat?kin: Combinatorial Computation in First-Order Predicate Logic as a Formal Prototype of Natural Computing

    Alidra Abdelghani, Mohamed Tahar K imour: Biology Inspired Decision Making for Self-Healing Realtime Systems

    Krist?ne C?pola, K?rlis Cezi??, R?si?? Freivalds, Viesturs V?zis: Producing Learning Tools to Teach Quantum and Ultrametric Automata

    Antonio J. Tallón-Ballesteros, José C. Riquelme, César Hervás-Martínez, Roberto Ruiz: Enhancing the Performance of a Feature Selection Method Based Jointly on Feature Ranking and Feature Subset Selection in the Context of a Neural Network Classifier

    Ángela Villota, Jesús Aranda: Towards a General Approach to Model Biological Systems from Membrane Systems into a Concurrent Constraint Calculus

    15:55 Visit to the City

    Thursday, December 5

    09:00 ? 09:50 Xin Yao: Evolutionary Algorithm Portfolios for Numerical Optimisation - Invited Talk

    09:50 - 10:05 Break

    10:05 - 11:20

    Yara Khaluf, Mauro Birattari, Franz Rammig: Probabilistic Analysis of Long-term Swarm Performance under Spatial Interferences

    Víctor Berrocal-Plaza, Miguel Ángel Vega-Rodríguez, Juan M. Sánchez-Pérez: A New Version of the Multiobjective Artificial Bee Colony Algorithm for Optimizing the Location Areas Planning in a Realistic Network

    Takuya Nishida, Takaaki Mizuki, Hideaki Sone: Securely Computing the Three-Input Majority Function with Eight Cards

    11:20 - 11:50 Coffee Break

    11:50 - 13:05

    Yahya O. Mohamed Elhadj, Mansour Alghamdi, Mohamed Alkanhal: Approach for Recognizing Allophonic Sounds of the Classical Arabic Based on Quran Recitations

    Antonio Martí Campoy, Francisco Rodríguez-Ballester, Rafael Ors Carot: Using Dynamic, Full Cache Locking and Genetic Algorithms for Cache Size Minimization in Multitasking, Preemptive, Real-time Systems

    Lingling Jin, Ian McQuillan: Computational Modelling of the Interruptional Activities between Transposable Elements

    13:05 Closing



    3 ) DICE 2014: Fifth Workshop on Developments in Implicit Computational Complexity



    (From Ulrich Schöpp)


                           DICE 2014
    Fifth Workshop on Developments in Implicit Computational Complexity
    ====================================================================
                  http://dice14.tcs.ifi.lmu.de

                         Grenoble, France
      &nb sp;                  April 5-6, 2014
                 (a satellite event of ETAPS 2014)


    Invited Speakers
    -----------------

    * Akitoshi Kawamura (University of Tokyo)
    * Georg Moser (University of Innsbruck)


    Important Dates
    ----------------

    * Abstract Submission: January  5, 2014
    * Notification:        January 20, 2014
    * Final version:      February 10, 2014


    Scope
    ------

    The area of Implicit Computational Complexity (ICC) has grown from
    several proposals for using logic and formal methods to provide
    languages for complexity-bounded computation (e.g. PTIME, LOGSPACE
    computation). Its aim is to study computational complexity without
    reference to external measuring conditions or part icular machine
    models, but only in terms of language restrictions or
    logical/computational principles implying complexity properties.

    This workshop focuses on ICC methods related to programs (rather than
    descriptive methods). In this approach one relates complexity classes
    to restrictions on programming paradigms (functional programs, lambda
    calculi, rewriting systems), such as ramified recurrence, weak
    polymorphic types, linear logic and linear types, and interpretative
    measures. The two main objectives of this area are:

    * to find natural implicit characterizations of various
      complexity classes of functions, thereby illuminating their
      nature and importance;
    * to design methods suitable for static verification of
      program complexity.

    Therefore ICC connects both to the study of complexity classes and to
    static program analysis.  The workshop is open to contributions
    on various aspects of ICC including (but not exclusively):

    * types for controlling complexity
    * logical systems for implicit computational complexity
    * linear logic
    * semantics of complexity-bounded computation
    * rewriting and termination orderings
    * interpretation-based methods for implicit complexity
    * programming languages for complexity-bounded computation
    * theoretical foundations of program complexity analysis
    * application of implicit complexity to security


    Submission
    -----------

    Authors are invited to submit an extended abstract of up to 5 pages.
    Accepted abstracts will be presented at the workshop. Submissions will
    be judged on originality, relevance, interest and clarity. Preference
    will be given to abstracts describing work (including work in
    progress) that has not been published elsewhere before the workshop.
    Any previous publication or submission of submitted work should be
    clearly indicated in the submi ssion.  The workshop will not have
    formal proceedings and is not intended to preclude later publication
    at another venue.

    Abstracts should be written in English and can be submitted in PDF
    form to the DICE 2014 EasyChair page:
    https://www.easychair.org/account/signin.cgi?conf=dice2014

    Submissions of abstracts by PC members are allowed and encouraged.


    Program Committee
    ------------------

    * Martin Avanzini (University of Innsbruck)
    * Amir Ben-Amram (Tel-Aviv Academic College)
    * Pierre Clairambault (CNRS & ENS Lyon)
    * Daniel de Carvalho (Datalogisk Institut, Københavns Universitet)
    * David Nowak (CNRS & Lille 1 University)
    * Michele Pagani (LIPN ? Université de Paris 13)
    * Romain Péchoux (Université de Lorraine)
    * Brian Redmond (Grande Prairie Regional College, Canada)
    * Ulrich Schöpp (LMU Munich) (Chair)
    * Kazush ige Terui (RIMS, Kyoto University)


    Steering Committee
    -------------------

    * Patrick Baillot (ENS Lyon, CNRS)
    * Ugo Dal Lago (Università di Bologna)
    * Martin Hofmann (Ludwig-Maximilians-Universität München)
    * Jean-Yves Marion (Loria - INPL Nancy)
    * Simona Ronchi Della Rocca (Università di Torino)



    4 ) 25th Annual Symposium on Combinatorial Pattern Matching: call for papers



    (From Alexander S. Kulikov)

    25th Annual Symposium on Combinatorial Pattern Matching: call for papers

    *************************************************************
    CPM 2014
    25th Annual Symposium on Combinatorial Pattern Matching
    June 16-18, 2014, Moscow, Russia
    http://cpm2014.hse.ru/

    Submission deadline: ** January 10,  2014 **
    Notification:        ** February 20, 2014 **
    *************************************************************

    The year 2014  marks  the  quarter-of-a-century milestone for 
    the CPM symposiu m series. This special edition will celebrate 
    the many contributions made by  the CPM Community to the vast 
    area  of algorithms  and perhaps  more  importantly to break-
    throughs in applications  ranging from document searching  to 
    bioinformatics and computational biology.  CPM-2014 will fea-
    ture special sessions  and lectures offering a  retrospective  
    as well as help in identifying  the most promising future di-
    rections for this uniquely vibrant and useful specialty.

    SCOPE:   Papers in all areas related to combinatorial pattern
    matching and its applications are sought,  including, but not
    limited to:  bioinformatics and computational biology, coding
    and data compression,  combinatorics on words,  data  mining,
    information retrieval,  natural language processing,  pattern
    discovery, string algorithms, string processing in databases,
    and text searching.

    Both papers reporting on  original research unpublished else-
    where and surveys of important results are welcome.  The pro-
    ceedings will be published in the Springer-Verlag series Lec-
    ture Notes in Computer Science.


    KEYNOTE SPEAKERS:
       Alberto Apostolico (Georgia Tech and IASI-CNR)
       Maxime Crochemore (King's College London) 
       Zvi Galil (Georgia Tech) 


    ANNIVERSARY LECTURE:
       Gene Myers (Max Planck Institute)


    IMPORTANT DATES:
    Submission:      January 10, 2014
    Notification:    February 20, 2014
    Final version:   March 5, 2014
    Symposium:       June 16-18, 2014


    PROGRAM COMMITTEE:
    Max Alekseyev (University of South Carolina, USA)
    Amihood Amir (Bar-Ilan University, Israel)
    Maxim Babenko (Moscow State University, Russia)
    Dan Gusfield (University of California, Davis, USA)
    Martin Farach-Colton (Rutgers, USA)
    Paolo Ferragina (University of Pisa, Italy)
    Johannes Fischer (Technical University of Dortmund, Germany)
    Juha Karkkainen (University of Helsinki, Finland)
    Roman Kolpakov (Moscow State University, Russia)
    Gregory Kucherov (Université Paris-Est Marne-la-Vallée, France)
    Alexander Kulikov (Steklov Math. Institute, Russia, co-chair)
    Gad Landau (University of Haifa, Israel) 
    Stefano Lonardi (University of California, Riverside, USA)
    Ian Munro (University of Waterloo, Canada) 
    Muthu Muthukrishnan (Rutgers, USA)
    Gonzalo Navarro (University of Chile)
    Kunsoo Park (Seoul National University, South Korea)
    Pavel Pevzner (University of California San Diego, USA, co-chair) 
    Nadia Pisanti (University of Pisa, Italy)
    Mikhail A. Roytberg (Higher School of Economics, Russia)
    Tatiana Starikov skaya (Higher School of Economics, Russia)
    Jim Storer (Brandeis University, USA)
    Jens Stoye (University of Bielefeld, Germany)
    Esko Ukkonen (University of Helsinki, Finland)


    ORGANIZING COMMITTEE:
    Stepan Artamonov (Moscow State University, Russia)
    Maxim Babenko (Moscow State University, Russia)
    Dmitry Ignatov (Higher School of Economics, Russia)
    Dmitry Ilvovsky (Higher School of Economics, Russia)
    Alexander Kulikov (Steklov Math. Institute, Russia)
    Sergei Kuznetsov (Higher School of Economics, Russia, chair)
    Dmitry Morozov (Higher School of Economics, Russia)
    Kamil Salihov (Moscow State University, Russia)
    Ruslan Savchenko (Moscow State University, Russia)
    Tatiana Starikovskaya (Higher School of Economics, Russia)



    Further details and a full printable pdf version of this call
    for papers is maintained at the symposium web site:
    http://cpm2014.hse.ru/



    5 ) [ACRI 2014] 1st CfP - Cellular Automata for Research and Industry



    1st ACRI 2014 ANNOUNCEMENT - CALL FOR PAPERS - CFP - ACRI 2014

    [Apologies if you receive multiple copies of this message]

    ******************************************************************************************
    First Call for Papers
    11TH INTERNATIONAL CONFERENCE ON CELLULAR AUTOMATA FOR RESEARCH AND
    INDUSTRY (ACRI 2014)
    Krakow, Poland, September 22-25, 2014
    http://acri2014.agh.edu.pl
    ******************************************************************************************

    Cellular automata (CA) present a very powerful approach to the study of spatio-temporal systems where complex phenomena build up out of many simple local interactions. They account often for real phenomena or solutions of problems, whose high complexity could unlikely be formalised in different contexts. Furthermore parallelism and locality features of CA allow a straightforward and extremely easy parallelisation, therefore an immediate implementation on parallel computing resources. The aforementioned characteristics of the CA research resulted in the formation of interdisciplinary research teams. These teams produce remarkable research results and attract scientists from different fields. The main goal of the 11th edition of ACRI 2014 Conference (Cellular Automata for Research and Industry) is to offer both scientists and engineers in academies and industries an opportunity to express and discuss their views on current trends, challenges, and state-of-the art solutions to v arious problems in the fields of arts, biology, chemistry, communication, cultural heritage, ecology, economy, geology, engineering, medicine, physics, sociology, traffic control, etc.
    Topics of either theoretical or applied interest about CA and CA-based models and systems include but are not limited to:
    - Algebraic properties and generalization
    - Complex systems
    - Computational complexity
    - Dynamical systems
    - Hardware circuits, architectures, systems and applications
    - Modeling of biological systems
    - Modeling of physical or chemical systems
    - Modeling of ecological and environmental systems
    - Image Processing and pattern recognition
    - Natural Computing
    - Quantum Cellular Automata
    - Parallelism

    SUBMISSIONS:
    Authors are invited to submit papers presenting their original and unpublished research. Papers should not exceed 10 pages and should be formatted according to the usual LNCS article style (http://www.springer.com/computer/lncs). Details on the electronic submission procedure will be provided through the website of the conference (http://acri2014.agh.edu.pl).

    PUBLICATION:
    A volume of proceedings will be published by Springer-Verlag in the Lecture Notes in Computer Science series and will be available by the time of the conference. After the conference, refereed volumes of selected proceedings containing extended papers will be organized as special issues of ISI international journals like Journal of Cellular Automata.

    IMPORTANT DATES:
    Paper submission: March 19, 2014
    Notification of paper acceptance or rejection: April 22, 2014
    Final version of the paper for the proceedings: May 14, 2014
    Conference: September 22-25, 2014

    CONFERENCE LOCATION:
    ACRI2014 which will be held at AGH University of Science and Technology, Krakow, Poland on September 22-25 2014, is the eleventh in a series of conferences inaugurated in 1994 in Rende, Italy, and followed by ACRI 1996 in Milan, Italy, ACRI 1998 in Trieste, Italy, ACRI 2000 in Karlsruhe, Germany, ACRI 2002 in Geneva, Switzerland, ACRI 2004 in Amsterdam, The Netherlands, ACRI 2006 in Perpignan, France, ACRI 2008 in Yokohama, Japan, ACRI 2010 in Ascoli Piceno, Italy and ACRI 2012 in Santorini, Greece.
    AGH University of Science and Technology is one of the leading technical universities in Poland. The AGH University was established in 1919, serves the science and industry through education, as well as research and development.
    Krakow is the second largest city in Poland, known as "cultural capital of Poland" and "a city of tradition" and a city of a unique medieval architecture. Krakow is registered on the UNESCO World Heritage List and awarded the title of the European Capital of Culture in 2000. Krakow as such a very popular touristic destination is served by convenient air, road and rail connections.

    URL: http://acri2014.agh.edu.pl
    contact : acri2014@agh.edu.pl

    Chairs
    Jaroslaw Was (AGH University of Science and Technology)
    Georgios Sirakoulis (Democritus University of Thrace - Greece)

    Steering Committee
    Stefania Bandini (University of Milano-Bicocca - Italy)
    Bastien Chopard (University of Geneva - Switzerland)
    Giancarlo Mauri (University of Milano-Bicocca - Italy)
    Hiroshi Umeo (University of Osaka Electro-Communication - Japan)
    Thomas Worsch (University of Karlsruhe - Germany)

    Best Regards
    Jaros?aw W?s

















    6 ) The 2014 International Conference on Computational Science and Computational Intelligence (CSCI)




    CALL FOR PAPERS
    The 2014 International Conference on Computational
    Science and Computational Intelligence (CSCI)

    http://www.americancse.org/events/csci2014

    Paper Submission Deadline: November 18, 2013
    Conference Dates: March 10-13, 2014, Las Vegas, USA

    ========================================================================

    Publisher: CPS ( http://www.computer.org/portal/web/cscps/home )
    Copyright: http://www.ieee.org/publications_standards/publications/rights/copyrightpolicy.html

    The 2014 CSCI International Conference invites paper submissions from diverse
    communities, including researchers from: universities, corporations, government
    agencies, and standardization bodies. Accepted papers will be published in the
    conference proceedings by Computer Society's CPS (IEEE will own the copyrights).
    Papers are sought that address solutions to problems in all areas of
    computational science and computational intelligence.

    DEADLINES - DATES:
    ==================

    November 18, 2013: Submission of Papers (see below for instructions)
    December 17, 2013: Notification of acceptance
    January 10, 2014: Final papers and Registration
    March 10-13, 2014: The 2014 International Conference on Computational
    Science and Computational Intelligence (CSCI)

    SCOPE AND LIST OF TOPICS:
    =========================

    1. COMPUTATIONAL SCIENCE:

    - Big Data and Data Analytic:
    Software and hardware architectures; Big Data visualization; Services;
    Data analytics; toolkits; open platforms; business processes; Managing,
    analyzing, and using large volumes of structured and/or unstructured data;
    Simulation and modeling; Consumerization of Big Data; Big Data in social
    media; Big Data and decision sciences and analytics; Data and text mining;
    Crowdsourcing; Case studies; and Applications.

    - High Performance Computing and Communication Systems:
    Cluster computing; Supercomputing; Cloud computing; Autonomic computing;
    P2P computing; Mobile computing; Grid computing; Parallel/distributed
    architectures and algorithms; Networks and interconnection networks;
    Reliability and fault-tolerance; The use of building block processors;
    Real-time and embedded systems; Multimedia communications, systems, and
    applications; Software tools and environments for computational science;
    Performance analysis, evaluation and monitoring; Wireless networks and
    distributed systems; FPGA, multicore, GPU, SOC and applications;
    Nanotechnology in HPC; High-performance mobile computation and
    communication; Petri Nets; Web-based simulation and computing; Emerging
    technologies.

    - Modeling, Simulation and Visualization Methods:
    Computational modeling and simulation in science and engineering;
    Molecular modeling and simulation; Simulation languages and tools;
    Performance modeling; Information and scientific visualization; Modeling
    methodologies; Visual interactive simulation and modeling; Visualization
    tools and systems for simulation and modeling; Process, device, circuit
    simulation and modeling Multi-level modeling; CAD/CAE/CAM; Agent based
    simulation; Analytical and stochastic modeling techniques and applications;
    Chaos modeling, control and signal transmission; Simulation of complex
    systems; Simulation of intelligent systems; Vision and visualization;
    Prototyping and simulation; Biomedical visualization and applications;
    Discrete and numeric simulation; Internet, web and security visualization;
    Virtual reality and simulation; Object oriented and knowledge-based
    simulation.

    - Information and Knowledge Engineering:
    Information retrieval systems and databases; Information and knowledge
    structures; Knowledge management and cyber-learning; Information
    reliability and security; Knowledge mining; Knowledge classification
    tools; Knowledge representation and acquisition; Large-scale information
    processing methods; Intelligent knowledge-based systems; Aspect-oriented
    programming; Formal and visual specification languages; Decision support
    and expert systems; Ontology engineering, sharing and reuse; Ontology
    matching and alignment; Agent-based techniques and systems; Workflow
    management; Large-scale information processing methods and systems;
    Database engineering and systems; Data-web models and systems; Data
    warehousing and datacenters; Data security and privacy issues; Quantum
    information theory; Natural language processing; Information integration;
    Domain analysis and modeling.

    - Algorithms and Methods:
    Monte Carlo methods and applications; Numerical methods and simulation;
    Quantum computing; Computational number theory; Optimization and
    approximation methods; Probabilistic and randomized methodologies;
    Computational geometry; Computational biology; Computational chemistry;
    Computational fluid dynamics; Computational physics; Computational
    mechanics; Computational electromagnetics and computational
    electrodynamics; computational sociology; Splines and wavelets;
    Inversion problems; Cellular automata; Ordinary and partial differential
    equations; Stochastic differential equations; Finite element methods;
    Multi-level and Multi-grid methods; Operational research; Dynamical
    systems; Nonsymmetric solvers; Engineering problems and emerging
    applications.

    2. COMPUTATIONAL INTELLIGENCE:

    - Fuzzy Logic Systems:
    Fuzzy logic and fuzzy set theory; Computing with words; Neural-fuzzy
    systems; Fuzzy and rough data analysis; Fuzzy optimization and design;
    Fuzzy decision making; Systems modeling and identification; Systems
    architectures and hardware; Control and systems; Fuzzy logic applications.

    - Big Data and Data Analytic:
    Big Data Services; Optimization and data analytics; Machine learning
    technologies; Knowledge extraction and business processes; Big Data to
    knowledge mapping; Information engineering; Big Data and decision
    sciences; Data and information mining; Case studies; and Applications.

    - Neural Networks:
    Neural network theory and models; Evolutionary neural systems; Collective
    intelligence; Computational neuroscience; Cognitive models; Neurodynamics;
    Neuroinformatics; Neuroengineering; Neural hardware; Mathematical
    modeling of neural systems; Hybrid systems; Self-aware systems;
    Agent-based systems; Artificial life; and Neural network applications.

    - Evolutionary Computations:
    Metaheuristic optimization algorithms; Evolutionary algorithms; Genetic
    algorithms; Evolutionary programming; Evolution strategy; Particle swarm
    optimization; Ant colony optimization; Artificial immune systems;
    Differential evolution; Learning classifier systems; Learnable evolution
    models; Self-organizing maps and competitive learning; Multi-objective
    evolutionary algorithms; Reinforcement learning; Parallel simulated
    annealing; Cultural algorithms; Intelligent, bio-inspired and autonomic
    computing.

    - Artificial Intelligence (AI):
    All aspects of AI as they relate to Computational Intelligence, including:
    Brain models and cognitive science; Natural language processing; Fuzzy
    logic and soft computing; Software tools for AI; Expert systems; Decision
    support systems; Automated problem solving; Knowledge discovery;
    Knowledge-intensive problem solving techniques; Knowledge networks and
    management; Intelligent information systems; Intelligent data mining and
    farming; Intelligent web-based business; Intelligent agents; Intelligent
    user interface; Intelligent tutoring systems; Reasoning strategies;
    Distributed AI algorithms and techniques; Heuristic search methods;
    Languages and programming techniques for AI; Constraint-based reasoning
    and constraint programming; Intelligent information fusion; Search and
    meta-heuristics; Multisensor data fusion using neural and fuzzy techniques;
    Integration of AI with other technologies; Evaluation of AI tools; Social
    intelligence (markets and computational societies); Social impact of AI;
    and Satisfiability methods.

    3. APPLICATIONS OF COMPUTATIONAL SCIENCE AND COMPUTATIONAL INTELLIGENCE:

    - Pattern recognition applications; Machine vision; Brain-machine interface;
    Embodied robotics; Biometrics; Computational biology; Bioinformatics;
    Image and signal processing; Information mining and forecasting; Sensor
    networks; Information processing; Internet and multimedia; DNA computing;
    Machine learning applications; Multi-agent systems applications;
    Telecommunications; Transportation systems; Intrusion detection and fault
    diagnosis; Game technologies; Material sciences; Space, weather, climate
    systems and global changes; Computational ocean and earth sciences;
    Combustion system simulation; Computational chemistry and biochemistry;
    Computational physics; Medical applications; Transportation systems and
    simulations; Structural engineering; Computational electro-magnetic;
    Computer graphics and multimedia; Face recognition; Semiconductor
    technology, and electronic circuits and system design; Dynamic systems;
    Computational finance; Information mining and applications; Astrophysics;
    Biometric modeling; Geology and geophysics; Nuclear physics; Computational
    journalism; Computational sociology; Geographical Information Systems
    (GIS) and remote sensing; Military and defense related applications;
    Ubiquitous computing; and Emerging applications.


    CSCI CONFERENCE OBJECTIVE:
    ==========================

    Computational Science (CS) is the study of addressing problems that are
    impossible to solve (or difficult to solve) without computers. CS can be
    considered to be the bridge between computer science and other sciences. The
    field is interdisciplinary by nature and includes the use of advanced
    computing capabilities to understand and solve complex problems. In short,
    CS is the science of using computers to do science.
    Computational Intelligence (CI) is the study of computational methods in ways
    that exhibit intelligence. These methods adapt to changing environments and
    changing goals. There is a significant overlap between the fields of CI and
    Artificial Intelligence (AI). However, there is also a difference: AI
    techniques often involve top-to-bottom methods (i.e., methods to the
    solutions are imposed from the top) whereas CI techniques often involve
    bottom-up methods (i.e., solutions emerge from unstructured beginnings). An
    important part of CI includes a set of Nature-inspired computational approaches
    to address complex problems to which traditional methods are infeasible.
    CS and CI, both share the same objective: finding solutions to difficult
    problems. However, the methods to the solutions are different. The main
    objective of the CSCI Conference is to facilitate increased opportunities
    for cross-fertilization across CS and CI.


    INSTRUCTIONS FOR SUBMITTING PAPERS AND PUBLICATION INFORMATION:
    ===============================================================

    There are three types of submissions:

    - Full/Regular Research Papers (maximum of 6 pages):
    Regular Research Papers should provide detail original research
    contributions. They must report new research results that represent
    a contribution to the field; sufficient details and support for
    the results and conclusions should also be provided. The work
    presented in regular papers are expected to be at a stage of
    maturity that with some additional work can be published as journal
    papers.

    - Short Papers (maximum of 4 pages):
    Short papers report on ongoing research projects. They should provide
    overall research methodologies with some results. The work presented
    in short papers are expected to be at a stage of maturity that with
    some additional work can be published as regular papers.

    - Poster Papers (maximum of 2 pages):
    Poster papers report on ongoing research projects that are still in
    their infancy (i.e., at very early stages). Such papers tend to provide
    research methodologies without yet concrete results.

    Authors are invited to submit their papers by uploading them to:
    Submission web site at: http://american-cse.org/

    All submissions must be received by the deadline; submissions must be
    in either MS doc or pdf formats (about 6 pages for Regular Research Papers;
    about 4 pages for Short Papers; about 2 pages for Poster Papers - the number
    of pages include all figures, tables, and references).

    Papers should be typeset by using the general typesetting instructions
    available at:
    http://www.ieee.org/conferences_events/conferences/publishing/templates.html
    (i.e., use of regular Times New Roman, font size of 10, single line spacing,
    2-column format). Authors of accepted papers will later receive a more
    specific typesetting instructions.

    All submissions MUST be original (papers must not have been previously
    published or currently being considered by others for publication).
    The first page of the paper should include the followings:

    - Title of the paper.
    - Name, affiliation, postal address, and email address of each author
    (identify the name of the Contact Author).
    - Abstract (about 100 words).
    - A maximum of 5 topical keywords that would best represent the work
    described in the paper (see the list of topics).
    - Write the type of the submission as:
    "Full/Regular Research Papers", "Short Papers", or "Poster Papers".

    The actual paper can start from the first page (space permitting).

    Each paper will be peer-reviewed by 2 to 4 peers (except for papers
    that are philosophical in nature - such papers would be considered
    for panel discussions.) Confidentiality of submitted material will be
    maintained. Papers will be evaluated on the basis of originality,
    impact, significance, quality of research, quality of writing, and
    contribution to conference program and diversity. Papers whose authors
    include one or more members of the program committee will be evaluated
    using the double-blinded review process.

    The CSCI Conference is committed to encouraging diversity and eliminating
    discrimination in both its role as a conference and as a provider of
    services. CSCI aims to create a culture that respects and values each
    others' differences, that promotes dignity, equality and diversity,
    and that encourages individuals to develop and maximize their true
    potential. We are committed wherever practicable to organizing a
    conference that broadly reflects the international community.

    The proceedings will be published by Computer Society's CPS
    ( http://www.computer.org/portal/web/cscps/home ). Authors of accepted
    papers must agree with the standard IEEE's statement in reference to
    CPS Copyrights (Intellectual Property Rights):

    "The CSCI conference acknowledges that the IEEE shall at all
    times be the sole owner of all rights in and to the work. The IEEE
    shall have the exclusive right (but not the obligation) to obtain
    and renew copyright registration of, or relating to, any and all
    such works in the name of IEEE or in such other name or names as
    IEEE may elect. This agreement constitutes an assignment to IEEE
    of all rights in and to the work the conference agrees to execute
    and deliver to IEEE, promptly upon request, any documents that IEEE
    may reasonably request to attain and protect IEEE's exclusive rights."

    After the conference, selected authors will also be given the opportunity
    to have the extended versions of their papers considered for publication
    by journals and book publishers (Springer, Elsevier, ...) 157747


    CONFERENCE WEB SITE:
    ====================

    http://www.americancse.org/events/csci2014

    CONTACT:
    ========

    Questions and inquiries should be sent to:
    CSCI 2014 Conference Secretariat: cs@american-cse.org

    =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=

    This email was sent to: pmt6sbc@leeds.ac.uk

    To opt out of this email list:
    http://american-cse.org/cgi-bin/rm/acse.cgi?9c753a4c-2206-11e3-b9b2-a766bb2e787f







    7 ) 7th AISB Symposium on Computing and Philosophy: Is computation observer-relative?




    The 7th AISB Symposium on Computing and Philosophy:
    Is computation observer-relative?

    AISB-50, Goldsmiths, London, 1-4 April 2014

    As part of the AISB-50 Annual Convention 2014 to be held at Goldsmiths,
    University of London
    http://www.aisb.org.uk/events/aisb14

    The convention is organised by the Society for the Study of Artificial
    Intelligence and Simulation of Behaviour (AISB)
    http://www.aisb.org.uk/

    OVERVIEW:

    One of the claims integral to John Searle?s critique of computational
    cognitive science and ?Strong AI? was that computation is
    ?observer-relative? or ?observer-dependent? (Searle, The Rediscovery of
    the Mind, 1992). This claim has already proven to be very controversial
    in cognitive science and AI (Endicott 1996; Coulter & Sharrock, Rey, and
    Haugeland in Preston & Bishop (eds.), Views into the Chinese Room, 2002).

    Those who come to the subject of computation via physics, for example,
    often argue that computational properties are physical properties, that
    is, that computation is ?intrinsic to physics?. On such views,
    computation is comparable to the flow of information, where information
    is conceived of in statistical terms, and thus computation is both
    observer-independent and (perhaps) ubiquitous. Connected with this are
    related issues about causality and identity (including continuity of), as
    well as the question of alternative formulations of information.

    This symposium seeks to evaluate arguments, such as (but not limited to)
    Searle?s, which bear directly on the question of what kind of processes
    and properties computational processes and properties are. It thus seeks
    to address the general question ?What is computation?? in a somewhat
    indirect way. Questions that might be tackled include: Are computational
    properties syntactic properties? Are syntactic properties discovered, or
    assigned? If they must be assigned, as Searle argues, does this mean they
    are or can be assigned arbitrarily? Might computational properties be
    universally realized? Would such universal realizability be
    objectionable, or trivialise computationalism? Is syntax
    observer-relative? What kinds of properties (if any) are
    observer-relative or observer-dependent? Is observer-relativity a matter
    of degree? Might the question of whether computation is observer-relative
    have different answers depending on what is carrying out the computation
    in question? Might the answer to this question be affected by the advent
    of new computing technologies, such as biologically- and
    physically-inspired models of computation? Is it time to start
    distinguishing between different meanings of ?computation?, or is there
    still mileage in the idea that some single notion of computation is both
    thin enough to cover all the kinds of activities we call computational,
    and yet still informative (non-trivial)? Does Searle?s idea that syntax
    is observer-relative serve to support, or instead to undermine, his
    famous ?Chinese Room argument??

    TOPICS OF INTEREST:

    1. COMPUTATIONAL-PHILOSOPHICAL ISSUES

    Questions of ontology and epistemology

    i. COMPUTATION AS OBSERVER RELATIVE


    Is computation an observer relative phenomenon? What
    implications do answers to this question have for the
    doctrine of computationalism?


    ii. WHAT IS COMPUTATION?


    Does computation (the unfolding process of a computational
    system) define a natural kind? If so, how do we differentiate
    the computational from the non-computational?


    iii. IMPLICATIONS FOR COMPUTATIONAL ONTOLOGY, and
    PAN-COMPUTATIONALISM


    To what extent and in what ways can we say that computation
    is taking place in natural systems? Are the laws of natural
    processes computational? Does a rock implement every
    input-less FSA (Putnam, Chalmers)? Is the evolution of the
    universe computable as the output of an algorithm? I.e. is
    the temporal evolution of a state of the universe a digital
    informational process akin to what goes on in the circuitry
    of a computer? Digital ontology' (Zuse), "the nature of the
    physical universe is ultimately discrete"; cf. Kant's
    distinction - from the antinomies of pure reason - of "simple
    parts" and no simple parts; the discrete and the analogue.



    2. SOME COMPUTATIONAL-PHILOSOPHICAL ISSUES

    Computation in machines and computation in nature; Turing versus
    non-Turing computation

    i. COMPUTATION IN NATURE


    Investigating the difference between formal models of
    physical and biological systems and physical/biological
    reality-in-itself and the implication(s) for theory of mind /
    cognition.


    (a) The study of 'computation' using natural processes /
    entities (i.e. machines not exclusively based on [man-made]
    silicon-based architectures).
    (b) What is the underlying nature of such natural
    [physical/biological] computational processes? I.e. are the
    laws of natural processes computational at their very core OR
    merely contingently computational because the mathematical
    language we use to express them is biased towards being
    computational?


    SUBMISSION AND PUBLICATION DETAILS:

    Submissions must be full papers and should be sent via EasyChair:
    https://www.easychair.org/conferences/?conf=aisb14cp

    Text editor templates from a previous convention can be found at:


    We request that submitted papers are limited to eight pages. Each paper
    will receive at least two reviews. Selected papers will be published in
    the general proceedings of the AISB Convention, with the proviso that at
    least ONE author attends the symposium in order to present the paper and
    participate in general symposium activities.

    IMPORTANT DATES:

    i. Full paper submission deadline: 3 January 2014

    ii. Notification of acceptance/rejection decisions: 3
    February 2014

    iii. Final versions of accepted papers (Camera ready
    copy): 24 February 2014

    iv. Convention: 1st - 4th April 2014, Goldsmiths,
    University of London, UK [symposium date to be confirmed]


    ADDITIONAL INFORMATION:

    There will be separate proceedings for each symposium, produced before
    the Congress, and available to conference delegates. In previous years
    there have been awards for the best student paper, and limited student
    bursaries. These details will be circulated as and when they become
    available. Authors of a selection of the best papers will be invited to
    submit an extended version of the work to a journal special issue.

    SYMPOSIUM ORGANISERS:

    Symposium Chair: Dr. John Preston, Department of Philosophy,
    The University of Reading, Reading, UK.

    email:
    j.m.preston@reading.ac.uk

    tel. +44 (0) 118 378 7327

    web page: http://www.reading.ac.uk/philosophy/about/staff/j-m-preston.aspx>


    Symposium Executive-Officer and OC member: Dr. Yasemin J.
    Erden, CBET, St Mary's University College, Twickenham, UK.


    email:
    yj.erden@smuc.ac.uk

    tel: +44 (0) 208 224 4250

    web page:



    Symposium OC Member: Prof. Mark Bishop, Department of
    Computing, Goldsmiths, University of London, London, UK.


    email:
    m.bishop@gold.ac.uk

    tel: +44 (0) 207 078 5048

    web page:



    Symposium OC member: Prof. Slawomir J Nasuto, School of
    Systems Engineering, University of Reading, Reading, UK.


    email:
    s.j.nasuto@reading.ac.uk

    tel: +44 (0) 118 378 6701

    web page:



    SYMPOSIUM WEBSITE:http://extranet.smuc.ac.uk/events-conferences/aisb-symposium-2014/Pages/default.
    aspx

    POSTER ADVERTISING THE CFP: [To follow]

    PROGRAMME COMMITTEE:

    Dr Mark Coeckelbergh (University of Twente, NL)

    Prof. S. Barry Cooper (University of Leeds, UK)

    Dr. Anthony Galton (University of Exeter, UK)

    Dr Bob Kentridge (Durham University, UK)

    Dr Stephen Rainey (St Mary's University College, UK)

    Dr Mark Sprevak (University of Edinburgh, UK)

    Prof. Michael Wheeler (University of Stirling, UK)










    8 ) ICTAC 2014: Theoretical Aspects of Computing, Bucharest (Romania), 17-20 Sep 2014



    **********************************************************************
    11th International Colloquium on Theoretical Aspects of Computing
    17-20 September 2014, Bucharest, Romania
    http://fmi.unibuc.ro/ictac2014
    **********************************************************************

    ICTAC 2014 is the 11th International Colloquium on Theoretical Aspects of
    Computing and will bring together practitioners and researchers from
    academia, industry and government to present research and to exchange ideas
    and experience addressing challenges in both theoretical aspects of
    computing and in the exploitation of theory through methods and tools for
    system development. Another aim of ICTAC is to bring together researchers
    working on theoretical aspects of computing in order to present their recent
    results and to discuss new ideas concerning computer science.

    THEMES AND TOPICS OF PAPERS

    ICTAC 2014 calls for regular research papers on theories of computation and
    programming, foundations of software engineering and on formal techniques in
    software design and verification, as well as papers about tools that support
    formal techniques for software modeling, system design and verification.
    The topical areas of the conference include, but not limited to

    * Automata theory and formal languages;
    * Principles and semantics of programming languages;
    * Theories of concurrency, mobility and reconfiguration;
    * Logics and their applications;
    * Software architectures, their models, refinement and verification;
    * Relationship between software requirements, models and code;
    * Program static and dynamic analysis and verification;
    * Software specification, refinement, verification and testing;
    * Model checking and theorem proving;
    * Models of object and component systems;
    * Coordination and feature interaction;
    * Integration of theories, formal methods and tools for
    engineering computing systems;
    * Service-oriented architectures: models and development methods;
    * Models of concurrency, security, and mobility;
    * Theory of distributed, grid and cloud computing;
    * Real-time, embedded, hybrid and cyber-physical systems;
    * Type and category theory in computer science.

    PAPER SUBMISSION

    As for the past editions, the proceedings of ICTAC 2014 will be published by
    Springer in the series Lecture Notes in Computer Science (LNCS) and will be
    available at the colloquium. Special issue of few journals with extended
    version of selected papers from ICTAC 2014 is under negotiation. Submissions
    to the colloquium must not have been published or be concurrently considered
    for publication elsewhere. All submissions will be judged on the basis of
    originality, contribution to the field, technical and presentation quality,
    as well as their relevance to the conference.

    Regular Papers should not exceed 18 pages in LNCS format (see
    http://www.springer.de/comp/lncs/authors.html for details). Papers must be
    submitted by using www.easychair.org/conferences/?conf=ictac2014.

    IMPORTANT DATES:

    Abstract submission: 16 March 2014
    Submission deadline: 23 March 2014
    Paper notification: 30 May 2014
    Revised/final paper: 14 June 2014

    GENERAL CHAIRS

    Gabriel Ciobanu, Romanian Academy, ICS, Iasi, Romania
    Florentin Ipate, University of Bucharest, Romania

    PC CHAIRS

    Gabriel Ciobanu, Romanian Academy, ICS, Iasi, Romania
    Dominique Mery, LORIA, Universite de Lorraine, France

    PROGRAM COMMITTEE

    Yamine Ait-Ameur, IRIT, ENSEIHT, France
    Farhad Arbab, CWI and Leiden University, The Netherlands
    Michael Butler, University of Southampton, UK
    Ana Calvacanti, University of York, UK
    Jeremie Chalopin, CNRS, France
    Zhenbang Chen, National University of Defense Technology, China
    Maximiliano Cristia, Faculty of Exact Sciences, Argentina
    David Deharbe, Universidade Federal do Rio Grande do Norte, Brazil
    Rocco De Nicola, IMT Lucca, Italy
    Jose Luiz Fiadeiro, Royal Holloway, University of London, UK
    John Fitzgerald, Newcastle University, UK
    Simon Gay, University of Glasgow, UK
    Dimitra Giannakopoulou, NASA Ames, USA
    Stefania Gnesi, ISTI-CNR, Italy
    Lindsay Groves, Victoria University of Wellington, New Zealand
    Geoff Hamilton, Dublin City University, Ireland
    Ian J. Hayes, University of Queensland, Australia
    Rob Hierons, Brunel University, UK
    Jane Hillston, University of Edinburgh, UK
    Ross Horne, Romanian Academy, Iasi, Romania
    Zhenjiang Hu, National Institute of Informatics, Japan
    Florentin Ipate, University of Bucharest, Romania
    Tudor Jebelean, Johannes Kepler University, Austria
    Cliff Jones, Newcastle University, UK
    Lila Kari, University of Western Ontario, Canada
    Jetty Kleijn, Leiden University, The Netherlands
    Maciej Koutny, Newcastle University, UK
    Yassine Lakhnech, VERIMAG, France
    Kim G. Larsen, Aalborg University, Denmark
    Insup Lee, University of Pennsylvania, USA
    Axel Legay, INRIA, France
    Martin Leucker, University of Lubeck, Germany
    Zhiming Liu, UNU-IIST, Macau, China
    Marius Minea, Politehnica University of Timisoara, Romania
    Victor Mitrana, University of Bucharest, Romania
    Rosemary Monahan, National University of Ireland, Ireland
    Mohammed Mosbah, LABRI, University of Bordeaux, France
    Tobias Nipkow, Technical University Munich, Germany
    Manuel Nunez, Universidad Complutense de Madrid, Spain
    Paritosh Pandya, Tata Institute of Fundamental Research, India
    Jun Pang, University of Luxembourg, Luxembourg
    Corina Pasareanu, NASA Ames, USA
    Shengchao Qin, University of Teesside, UK
    Antonio Ravara, Universidade Nova de Lisboa, Portugal
    Grigore Rosu, University of Illinois at Urbana Champaign, USA
    Augusto Sampaio, Federal University of Pernambuco, Brasil
    Pierre-Yves Schobbens, Universite de Namur, Belgium
    Emil Sekerinski, McMaster University, Canada
    Natarajan Shankar, SRI International, USA
    Viorica Sofronie-Stokkermans, Max Planck Institute, Germany
    Gheorghe Stefanescu, University of Bucharest, Romania
    Andrzej Tarlecki, Warsaw University, Poland
    Elena Troubitsyna, Abo Akademi University, Finland
    Emilio Tuosto, University of Leicester, UK
    Martin Wirsing, Ludwig-Maximilian University of Munich, Germany
    Burkhart Wolff, Universite de Paris-Sud, France
    Jim Woodcock, University of York, UK
    Fatiha Zaidi, Universite de Paris-Sud, France
    Naijun Zhan, Chinese Academy of Sciences, China
    Jianjun Zhao, Shanghai Jiao Tong University, China
    Huibiao Zhu, East China Normal University, China

    STEERING COMMITTEE

    Ana Cavalcanti, University of York, UK
    John Fitzgerald, Newcastle University, UK
    Martin Leucker, University of Luebeck, Germany
    Zhiming Liu, UNU-IIST, Macao, China
    Tobias Nipkow, Technical University Munich, Germany
    Augusto Sampaio, Federal University of Pernambuco, Brasil
    Natarajan Shankar, SRI International, USA

    **********************************************************************
    This call for papers and additional information about the conference can
    be found on the ICTAC 2014 web page http://fmi.unibuc.ro/ictac2014/.
    For information regarding the conference and other queries, you can use
    the conference email address: ictac2014@fmi.unibuc.ro
    **********************************************************************






    9 ) PhD positions at the University of Bristol, UK



    PhD positions at the University of Bristol, UK

    We are looking for PhD students in the general areas of Algorithms and
    the Theory of Computing, to start in October 2014. The positions will
    be suitable for those who have a strong background in theoretical
    computer science and/or mathematics, and are interested in any of our
    research areas. There may also be the possibility of an immediate
    start for the right applicant.

    For further information on our research areas, please see

    http://www.cs.bris.ac.uk/Research/Algorithms/
    http://www.cs.bris.ac.uk/~montanar/
    http://www.cs.bris.ac.uk/Research/QuantumComputing/


    Subject to eligibility rules (see
    http://www.bris.ac.uk/engineering/graduate-school/pg-open/funding-pdfs/epsrcdta.pdf
    ) these are fully funded positions. They are competitive and early
    application is preferred.

    For further details or to apply, in the first instance please contact
    Raphael Clifford (clifford@cs.bris.ac.uk) or Ashley Montanaro
    (ashley@cs.bris.ac.uk).






    10 ) permanent and postdoctoral positions in LIAFA, Paris, France



    The Algorithms and Complexity group of LIAFA (CNRS and University Paris Diderot, Paris, France) is seeking excellent candidates for permanent and postdoctoral positions in classical and quantum computing. Topics of interest include (but are not limited to): algorithms, online algorithms, streaming algorithms, approximation algorithms, communication complexity, cryptography, computational game theory, quantum computing, computational applications of logic, randomness in computing, privacy.

    Interested candidates should consult the group webpage ( http://www.liafa.univ-paris-diderot.fr/algocomp/ ) for details on the positions available and the application process.







    11 ) ACM-W supporting, celebrating and advocating for Women in Computing



    ********************************************************************
    ACM-W Europe, the Association for Computing Machinery's Committee on
    Women in Computing in Europe are sponsoring a conference specifically
    for encouraging women to stay in the field. This conference will be
    held in Manchester, UK, with the motto womENcourage.
    Can you please distribute the
    poster at http://cdt.bilkent.edu.tr/ACM_WomENcourage2014
    and announce to your students about the conference?

    Encourage your students to submit a poster and to apply for travel
    grants so that they have the funds to travel to the conference.

    OPPORTUNITIES for Students
    --------------------------
    - Submit an abstract for the Student Poster session: http://womencourage.acm.org/poster.cfm
    We invite poster submissions of original work by students (female
    and male) in all areas of computing and related disciplines.

    DEADLINE December 13th, 2013.

    - Apply for a Travel Grant http://womencourage.acm.org/grants.cfm
    A limited number of travel grants will be available to assist with
    travel expenses to the conference. DEADLINE December 13th, 2013.

    - See the poster for the conference here: http://cdt.bilkent.edu.tr/ACM_WomENcourage2014
    which can be e-mailed to students or printed as small flyers. Please
    distribute this poster to your students and if you would like a
    larger poster for printing let us know and we will email it to you.

    We are looking forward to seeing you and your students at womENcourage
    on March 1, 2014. Please feel free to contact us at acm-w-europe@acm.org
    if you have questions or need more information.

    Best wishes,

    Reyyan Ayfer, ACM-W Europe Chair
    Eva Navarro Lopez, Conference Co-Chair
    Bev Bachmayer, Conference Co-Chair






    12 ) Algebra and Mathematical Logic: Theory and Applications



    -------------------------------------------------------------------------------------------
    International Conference

    <>,

    Kazan, June 2-6, 2014

    INFORMATION LETTER No.1

    Kazan Federal University and Tatarstan Republic Academy of Science will
    organize an International Conference "Algebra and Mathematical Logic:
    Theory and Applications" dedicated to the 80-th anniversary of the
    Department of Algebra of Kazan University, and to the 70-th anniversary of
    Professor M.M. Arslanov.

    The meeting will be held in Kazan (Russia), June 2-6, 2014. The main
    topics of the conference include (but are not limited to) Lie
    Algebras, Group Theory, Ring Theory, Algebraic Geometry, Universal
    Algebra, Model Theory, Mathematical Logic, Computability Theory,
    Algebraic and Logic Methods in Computer Science.

    The Program Committee of the conference consists of academician Yu. L.
    Ershov - Chairman, I.Sh. Kalimullin (Kazan) - Vice-chairman, Chairman
    of the Organizing ?ommittee, A.N. Frolov (Kazan) - Secretary of the
    conference, Yu.A. Alpin (Kazan), K. Ambos-Spies (Heidelberg, Germany),
    M.M. Arslanov (Kazan), V.A. Artamonov (Moscow), S.B. Cooper (Leeds,
    UK), S.S. Goncharov (Novosibirsk), C. Jockusch (Urbana-Champaign,
    USA), N.G. Khisamiev (Ust-Kamenogorsk, Kazakhstan), B. Khoussainov
    (Auckland, New Zealand), J. Knight (South Bend, USA), M.I. Kuznetsov
    (Nizhny Novgorod), V.N. Latyshev (Moscow), S. Lempp (Madison, USA),
    V.M. Levchuk (Krasnojarsk), A.A. Makhnev (Ekaterinburg), V.D. Mazurov
    (Novosibirsk), A. Montalban (Berkeley, USA), R.Sh. Omanadze (Tbilisi,
    Georgia), R.A. Shore (Ithaca, USA), S.M. Skryabin (Kazan), R.I. Soare
    (Chicago, USA), S.N. Tronin (Kazan), S.V. Vostokov (St. Petersburg),
    Y. Yang (Singapore, Singapore).

    Invited speakers (on October 20, 2013, the list is updating): K.
    Ambos-Spies (Heidelberg University, Germany), V.A. Artamonov (Moscow State
    University), S.B. Cooper (Leeds Universtity, UK), Yu.L. Ershov (Sobolev
    Institute of Mathematics), A.N. Frolov (Kazan Federal University), S.S.
    Goncharov (Sobolev Institute of Mathematics), I.Sh. Kalimullin (Kazan
    Federal University), N.G. Khisamiev (East Kazakhstan Technical State
    University, Kazakhstan), B. Khoussainov (University of Auckland, New
    Zealand), J. Knight (University of Notre Dame, USA), V.N. Latyshev (Moscow
    State University, S. Lempp (University of Wisconsin, USA), R.Sh. Omanadze
    (Tbilisi State University, Georgia), Y. Yang (National University of
    Singapore, Singapore).

    The scientific program of the conference includes invited plenary
    lectures and contributed talks.

    The official webpage of the conference: http://www.algmathlog14.kpfu.ru
    English version: http://www.kpfu.ru/main_page?p_sub=25931

    All necessary information can be found at this webpage.

    To participate at the conference you need proceed the registration
    (see "Registration" at the webpage).

    All your questions you may address to the secretary of the conference

    e-mail: algmathlog14@kpfu.ru - Secretary of the conference Frolov Andrey
    phone: (843) 233-70-39.

    Important dates:

    Deadline for submissions of abstracts: March 1, 2014

    Notification to authors: March 10, 2014

    Conference: June 2 - 6, 2014

    After the conference (on June 7) an excursion to the ancient city
    Bolghar (Volga Bulgaria) will be organized.

    The Organizing Committee






    13 ) PhD Studentships at the University of Bath







    14 ) CSR-2014: First Call for Papers



    (From Alexander S. Kulikov)

    CSR-2014: First Call for Papers

    The 9th International Computer Science Symposium in Russia
    June 6-12, 2014, Moscow, Russia
    http://logic.pdmi.ras.ru/csr2014

    Program Committee Chair:
    Jean-Eric Pin (CNRS and U. Paris-Diderot)

    Program Committee:
    Eric Allender (Rutgers)
    Andris Ambainis (U. of Latvia)
    Christel Baier (TU Dresden)
    Petra Berenbrink (Simon Fraser U.)
    Mikolaj Bojanczyk (U. of Warsaw)
    Andrei Bulatov (Simon Fraser U.)
    Victor Dalmau (U. Pompeu Fabra)
    Manfred Droste (U. of Leipzig)
    Zoltan Esik (U. of Szeged)
    Fedor Fomin (U. of Bergen)
    Edward A. Hirsch (Steklov Inst./St.Petersburg)
    Gregory Kucherov (CNRS and U. Marne-la-Vallee)
    Michal Kunc (Masaryk U.)
    Leonid Libkin (U. of Edinburgh)
    Konstantin Makarychev (Microsoft Research)
    Kurt Mehlhorn (Max-Planck Inst.)
    Georg Moser (U. of Innsbruck)
    Alexander Okhotin (U. of Turku)
    Giovanni Pighizzini (U. of Milano)
    Alexander Razborov (U. of Chicago and Steklov Inst./Moscow)
    Michel Rigo (U. of Liege)
    Nicole Schweikardt (U. of Frankfurt)
    Jacobo Toran (U. of Ulm)
    Mikhail Volkov (Ural Federal U.)
    Carsten Witt (TU Denmark)

    Distinguished opening lecture:
    Shafi Goldwasser (MIT)

    Invited Speakers include:
    Mark Braverman (Princeton)
    Volker Diekert (Stuttgart)
    Martin Grohe (RWTH Aachen)
    Benjamin Rossman (National Institute of Informatics, Tokyo)
    Alexei Semenov (Moscow)
    Igor Walukiewicz (Bordeaux)

    Important Dates:
    Submission: December 9, 2013
    Notification: February 12, 2014

    Topics: include, but are not limited to:
    algorithms and data structures
    algorithms for concurrent and distributed systems, networks
    computational complexity
    proof complexity
    Kolmogorov complexity
    combinatorial optimization
    constraint solving
    cryptography
    combinatorics in computer science
    automata theory and formal languages
    computational models and concepts
    database theory
    applications of logic to computer science
    proof theory
    model checking
    automated reasoning
    deductive methods

    Submission:
    Authors are invited to submit original (and not previously published)
    research. Submissions consist of two parts: the main paper and an appendix
    (which might be empty). The main paper must be at most 14 pages in length,
    including references. All proofs omitted from the main paper due to space
    constraints should be given in the appendix or made accessible through a
    reliable link to a freely available electronic preprint. The papers must
    be submitted in English, in the LNCS format (LaTeX, as pdf; final version
    with source) with page numbering turned on using the \pagestyle{plain}
    command; instructions are here:
    http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0
    Simultaneous submission to journals or to other conferences with published
    proceedings is not allowed. The proceedings of the symposium will be
    published in Springer's LNCS series. Accepted papers MUST be presented
    at the symposium.

    Submissions should be uploaded to the EasyChair Conference system:
    http://www.easychair.org/conferences/?conf=csr2014

    Yandex Awards
    for the best paper and for the best student paper will be given by the PC.

    Conference co-Chairs:
    Nikolay Vereshchagin (Moscow)
    Edward A. Hirsch (St.Petersburg)
    Sergei O. Kuznetsov (Moscow)

    Organized by
    Moscow Center for Continuous Mathematical Education
    National Research University Higher School of Economics
    Steklov Institute of Mathematics at St.Petersburg of Russian Academy of Sciences

    Sponsored by
    Yandex
    National Research University Higher School of Economics
    Russian Foundation for Basic Research

    Further information and contacts:
    Web: http://logic.pdmi.ras.ru/csr2014
    Email: csr2014 "at" googlegroups.com







    15 ) Stephen Smale Prize, Montevideo December 2014 -- first announcement






    Foundations of Computational Mathematics (FoCM) in Montevideo in December
    2014,
    http://www.fing.edu.uy/~jana/www2/focm_2014.html

    The FoCM society hereby calls for nominations of candidates. Nominations
    should be sent
    by email to the secretary of FoCM, Antonella Zanna, at
    Antonella.Zanna@math.uib.no rize%20nomination%20from%20FoCM%20web%20site>
    Deadline: 24:00 (GMT), March 10, 2014
    -------------------------------------------------------

    Full announcement of prize here: http://focm-society.org/smale_prize.php .

    SUMMARY:

    Background:
    ----------------
    The Society for the Foundations of Computational Mathematics was created in
    the summer of 1995, following the month-long meeting in Park City, Utah,
    which was principally organized by Steve Smale. The Park City meeting
    aimed, in Smale's words from the preliminary announcement, =93to strengthen
    the unity of mathematics and numerical analysis, and to narrow the gap
    between pure and applied mathematics." Smale's vision has been the
    Society's inspiration for all these years. The journal Foundations of
    Computational Mathematics was created, several colloquia and research
    semesters were organized and international conferences are held every three
    years. After fifteen years of existence, with an established and recognized
    position in the scientific community, the Society has created the "Stephen
    Smale Prize" whose objective is to recognize the work of a young
    mathematician in the areas at the heart of the society's interests and to
    help to promote his or her integration among the leaders of the scientific
    community. The first Stephen Smale Prize was awarded at the Budapest
    meeting in 2011 to Snorre H. Christiansen.

    Summary of prize rules (see http://focm-society.org/smale_prize.php for
    full details):

    ---------------------------------------------------------------------------=
    -----------------------
    * The goal of the Smale Prize is to recognize major achievements in
    furthering the understanding of the
    connections between mathematics and computation, including the
    interfaces between pure and applied mathematics, numerical analysis and
    computer science.


    * To be eligible for the prize a candidate must be
    in his or her early to mid career, meaning, typically,
    removed by at most 10 years of his/her (first) doctoral degree
    by the first day of the FoCM meeting (Dec 11, 2014).
    Allowances might be made for atypical life circumstances.

    * Eligible candidates should be nominated (self-nominations excluded)
    by sending an email to the secretary of FoCM, Antonella.Zanna@math.uib.no
    no later than March 10, 2014.
    Each nomination should be accompanied by a brief case for support.

    * There is no compulsory format for the nomination but
    it should include at least three letters of recommendation.

    * The recipient of the prize will be expected to give a lecture at
    the meeting. A written version of this lecture (tagged as the Smale Prize
    Lecture) will be included in the volume of plenary talks.
    ---------------------------------------------------------------------------=
    -----------------------










    16 ) 25th Annual Symposium on Combinatorial Pattern Matching: call for papers







    17 ) TPNC 2013: call for participation







    18 ) NCMA 2014: 1st Call-for-Papers



    6-th International Workshop on
    ``Non-Classical Models of Automata and Applications''
    (NCMA 2014)

    July 28 - 29, 2014, in Kassel, Germany

    Call for Papers:

    Research papers are invited that contain original contributions on non-
    classical models of automata and applications and related subjects. Many
    non-classical models of automata and grammar-like structures are the
    natural objects of theoretical computer science. They are studied from
    different points of view in various areas, both as theoretical concepts
    and as formal models for applications. The aim of the workshops on
    ``Non-Classical Models of Automata and Applications''
    is to provide an opportunity for researchers who work on different aspects
    of non-classical models of automata and grammars to exchange and develop
    novel ideas.

    In order to emphasize the workshop character of NCMA 2014, we also invite
    short contributions that report on recent results or ongoing work in addition
    to full papers. However, in contrast to the accepted regular (full) papers
    that will be published in the OCG proceedings, the accepted short papers will
    appear in a separate technical report.

    Topics for NCMA 2014 include
    - formal models inspired by Linguistics, Bio-Computing, Text Processing,
    Document Engineering, Self-Assemblance, etc.,
    - bio-inspired models of automata and generative devices,
    - cellular automata,
    - gorgetting automata and restarting automata,
    - automata with additional resources,
    - regulated rewriting/automata,
    - networks of automata or generative devices,
    - models of cooperation and communication,
    - quantum automata,
    but other related topics are welcome, too. In particular, it should be
    stressed that also contributions dealing with questions on classical automata
    and generative devices are welcome.

    The first workshop on Non-Classical Models of Automata and Applications,
    NCMA 2009, was held in Wroclaw, Poland, in 2009 as a satellite event of
    FCT 2009, sponsored by the AutoMathA project of the European Science
    Foundation (ESF). The second workshop, NCMA 2010, was held in Jena,
    Germany, as an associated workshop of the Conference on Membrane Computing
    (CMC 2010), the third workshop, NCMA 2011, was organized at the Universita
    degli Studi di Milano, Milano, Italy, the fourth workshop, NCMA 2012, was
    held in Fribourg, Switzerland, and the fifth workshop, NCMA 2013, was held
    in Umea, Sweden. The proceedings of these workshops have appeared as volumes
    256, 263, 282, 290, and 294 in the series books@ocg.at of the Austrian Computer
    Society. In addition, special issues of Fundamenta Informaticae were dedicated
    to NCMA 2009 (Fund. Inf. 104 (1-2), 2010) and to NCMA 2010 (Fund. Inf. 112
    (2-3), 2011), and a special issue of RAIRO Theoretical Informatics and
    Applications was dedicated to NCMA 2011 (RAIRO Theor. Inf. and Appl. 46 (4)
    2012). Furthermore, a special issue of the latter journal for NCMA 2012 and
    a special issue of Fundamenta Informaticae for NCMA 2013 are in preparation,
    and for NCMA 2014, a special issue of Fundamenta Informaticae is anticipated.

    Important Dates:

    Deadline for submissions of full papers: May 4, 2014
    Notification of acceptance (full papers): May 31, 2014
    Deadline for submissions of short papers: June 8, 2014
    Notification of acceptance (short papers): June 20, 2014
    Deadline for all final papers: July 1, 2014
    Workshop: July 28-29, 2014.

    Submissions:

    Authors are invited to submit full papers of up to 16 pages or short papers
    of up to 6 pages in electronic form (Postscript or PDF). All submissions should
    be prepared using the OCG-style (please see the web-page
    ``http://www.theory.informatik.uni-kassel.de/NCMA2014''
    for detailed information). Concerning full papers, proofs omitted due to space
    constraints may be put into an appendix that will be read by the reviewers at
    their discretion. All full papers will be reviewed by at least three referees,
    and simultaneous submissions to other conferences or workshops with published
    proceedings are not allowed. Short papers will be reviewed by at least two PC
    members, but simultaneous submissions of extended versions to other conferences
    or workshops with published proceedings are allowed. To submit your paper,
    please visit
    https://www.easychair.org/conferences/?conf=ncma2014

    Program Committee:
    - Artiom Alhazov (Chisinau, Moldavia)
    - Suna Bensch (Umea, Co-Chair)
    - Henning Bordihn (Potsdam, Germany)
    - Jerome Durand-Lose (Orleans, France)
    - Rudolf Freund (Vienna, Austria, Co-chair)
    - Mika Hirvensalo (Turku, Finland)
    - Martin Kutrib (Giessen, Germany)
    - Peter Leupold (Leipzig, Germany)
    - Andreas Maletti (Stuttgart, Germany)
    - Florin Manea (Kiel, Germany)
    - Nelma Moreira (Porto, Portugal)
    - Frantisek Mraz (Prague, Czech Republic)
    - Friedrich Otto (Kassel, Germany, Co-Chair)
    - Beatrice Palano (Milan, Italy)
    - Daniel Reidenbach (Loughborough, Great Britain)
    - Bianca Truthe (Magdeburg, Germany)
    - Gyorgy Vaszil (Debrecen, Hungary)

    Local Organizers:
    - Angelika Hoffmann-Hesse
    - Norbert Hundeshagen
    - Friedrich Otto
    - Qichao Wang

    Local Information:

    Kassel is easily reached by train from Frankfurt or Hannover.
    More information can be found at the web-page of NCMA 2014:
    http://www.theory.informatik.uni-kassel.de/NCMA2014







    19 ) MFCS 2014



    Call for Papers

    39th International Symposium on
    Mathematical Foundations of Computer Science
    MFCS 2014

    Budapest, August 25--29, 2014
    www.inf.u-szeged.hu/mfcs2014

    *Announcement*
    The series of MFCS symposia, organized since 1972, has a long and
    well-established tradition. The MFCS conferences encourage high-quality
    research in all branches of theoretical computer science. Their broad
    scope provides an opportunity to bring together researchers who do not
    usually meet at specialized conferences. Quality papers presenting
    original research on theoretical aspects of computer science are
    solicited.

    *Topics*
    Principal topics of interest include (but are not limited to):
    algorithms and data structures (incl. sequential, parallel,
    distributed, randomized, approximation, graph, network, on-line,
    parameterized, optimization algorithms),
    algorithmic game theory,
    algorithmic learning theory,
    computational complexity (structural and model-related),
    computational geometry,
    models of computation,
    networks (incl. wireless, sensor, ad-hoc networks),
    parallel and distributed computing,
    quantum computing,
    automata, grammars and formal languages,
    combinatorics on words, trees, and other structures,
    bioinformatics,
    computer-assisted reasoning,
    concurrency theory,
    cryptography and security,
    databases and knowledge-based systems,
    formal specifications and program development,
    foundations of computing,
    logic, algebra and categories in computer science,
    types in computer science,
    mobile computing,
    semantics and verification of programs,
    theoretical issues in artificial intelligence.

    *Invited Speakers*
    Krishnendu Chatterjee (IST Austria, Klosterneuburg, Austria),
    Achim Jung (U. of Birmingham, UK),
    D\'aniel Marx (Hungarian Academy of Sciences, Budapest, Hungary),
    Peter Bro Miltersen (Aarhus U., Denmark),
    Cyril Nicaud (U. Paris-Est, Marne-la-Vall\'ee, France),
    Alexander Sherstov (UCLA, Los Angeles, USA),
    Christian Sohler (TU Dortmund, Germany).

    *Program Committee*
    Albert Atserias (UPC, Barcelona, Spain),
    Giorgio Ausiello (U. ``La Sapienza'', Rome, Italy),
    Jos Baeten (CWI, Amsterdam, The Netherlands),
    Therese Biedl (U. of Waterloo, Canada),
    Miko\laj Boja\'nczyk (Warsaw U., Poland),
    Gerth St\olting Brodal (Aarhus U., Denmark),
    Christian Choffrut (U. Paris Diderot, France),
    Erzs\'ebet Csuhaj-Varj\'u (E\"otv\"os Lor\'and U., Budapest, Hungary,
    co-chair),
    Rocco De Nicola (IMT Lucca, Italy),
    Martin Dietzfelbinger (TU Ilmenau, Germany, co-chair),
    Manfred Droste (U. of Leipzig, Germany),
    Robert Els\"asser (U. Salzburg, Austria),
    Zolt\'an \'Esik (U. of Szeged, Hungary, chair),
    Uli Fahrenberg (Irisa/INRIA Rennes, France),
    Fedor V. Fomin (U. of Bergen, Norway),
    Fabio Gadducci (U. of Pisa, Italy),
    Anna G\'al (U. of Texas, Austin, USA),
    Dora Giammarresi (U. ``Tor Vergata'', Rome, Italy),
    Roberto Grossi (U. of Pisa, Italy),
    Anupam Gupta (CMU, Pittsburgh, USA),
    Michel Habib (U. Paris Diderot, France),
    Kristoffer Arnsfelt Hansen (Aarhus U., Denmark),
    Edith Hemaspaandra (RIT, Rochester, USA),
    Kazuo Iwama (Kyoto U., Japan),
    Yoshihiko Kakutani (U. of Tokyo, Japan),
    Juhani Karhum\"aki (U. of Turku, Finland),
    Bakhadyr Khoussainov (U. of Auckland, New Zealand),
    Elias Koutsoupias (U. of Athens, Greece),
    Rastislav Kr\'alovi\v c (Comenius U., Bratislava, Slovakia),
    Jan Kratochvil (Charles U., Prague, Czech Republic),
    Stefan Kratsch (TU Berlin, Germany),
    Amit Kumar (IIT, New Delhi, India),
    Kim G. Larsen (Aalborg U., Denmark),
    Fr\'ed\'eric Magniez (U. Paris Diderot, Paris, France),
    Ralph Matthes (U. Paul Sabatier, Toulouse, France),
    Madhavan Mukund (CMI, Chennai, India),
    Jean-\'Eric Pin (LIAFA, U. Paris Diderot, and CNRS, Paris, France),
    Alexander Rabinovich (Tel Aviv U., Israel),
    Peter Rossmanith (RWTH Aachen U., Germany),
    Jan Rutten (CWI, Amsterdam, and Radboud U. Nijmegen, The Netherlands),
    Wojciech Rytter (Warsaw U., Poland),
    Luigi Santocanale (Aix-Marseille U., France),
    Christian Scheideler (U. of Paderborn, Germany),
    Thomas Schwentick (TU Dortmund, Germany),
    Alex Simpson (U. of Edinburgh, UK),
    Mohit Singh (Microsoft Research, Redmond, USA),
    Klaus Sutner (CMU, Pittsburgh, USA),
    G\'abor Tardos (Hungarian Academy of Sciences, Budapest, Hungary),
    Gy\"orgy Tur\'an (U. of Illinois, Chicago, USA),
    Peter Widmayer (ETH Zurich, Switzerland),
    Philipp Woelfel (U. of Calgary, Canada).


    *Important dates*
    Paper submission deadline: *April 18, 2014.*
    Author notification: *June 3, 2014.*
    Camera-ready deadline: *June 16, 2014.*
    Conference: *August 25--29, 2014.*

    *Submission guidelines*
    Submissions to MFCS must not exceed 12 pages
    (in Springer-Verlag's Lecture Notes style and including bibliography).
    If the authors believe that more details are essential to substantiate
    the main claims, they may include a clearly marked appendix that will
    be read at the discretion of the program committee.
    Simultaneous submissions of papers to any other conference with
    published proceedings or simultaneous or previous submission of the
    same contribution to journals is not allowed. Only electronic submissions
    in PDF format are accepted.
    Information about the submission procedure will be available on the
    conference web page in due time. The proceedings will be published in the
    *ARCoSS subline of Lecture Notes in Computer Science by Springer-Verlag*.


    *Contact*
    Zolt\'an \'Esik:ze@inf.u-szeged.hu or
    Erzs\'ebet Csuhaj-Varj\'u:csuhaj@inf.elte.hu or
    Martin Dietzfelbinger:martin.dietzfelbinger@tu-ilmenau.de

    The conference is organized by the Department of Algorithms and their
    Applications, Faculty of Informatics, E\"otv\"os Lor\'and University,
    Budapest, and the Department of Foundations of Computer Science,
    Faculty of Science and Informatics, University of Szeged,
    in cooperation with EATCS.








    20 ) [CCA] Third Call for Submissions: LMCS special issue following CCA 2013 (Extended Deadline)



    ______________________________________________________________

    Call for Submissions for the Special issue of LMCS following

    Computability and Complexity in Analysis (CCA 2013)

    Extended submission deadline: 9 December 2013
    ______________________________________________________________

    The Tenth International Conference on

    Computability and Complexity in Analysis (CCA 2013)

    took place in Nancy, France, 8-10 July 2013, see

    http://cca-net.de/cca2013/

    Following this conference there will be a special issue of
    the journal

    Logical Methods in Computer Science (LMCS),

    which is an ISI listed open access journal, see

    http://www.lmcs-online.org/

    We invite submissions of original research papers in all
    CCA related areas to this special issue. Papers not presented
    at CCA 2013 may also be considered for submission. All papers
    will be refereed according to the usual standards of a
    high-quality journal. Submitted papers must not be previously
    published nor submitted for publication elsewhere.

    Further technical instructions for the submission of papers
    are included below.

    It is planned that the publication of this special issue
    follows the following schedule:

    Extended submission deadline: 9 December 2013
    Notifications: 17 March 2014

    Mathieu Hoyrup (Nancy, France)
    Martin Escardo (Birmingham, UK)
    Ker-I Ko (Stony Brook, USA)
    Robert Rettinger (Hagen, Germany)
    Ning Zhong (Cincinnati, USA)

    (Guest Editors of the LMCS Special Issue)

    ______________________________________________________________

    The submissions should follow the instructions that authors
    can find on the web page

    http://www.lmcs-online.org/ojs/information.php

    with the following special author instructions:

    1. Register as an author on the the web page

    http://www.lmcs-online.org/

    and use the "special code"

    cCa::13

    (In case you are already registered, go to "profile"
    and enter the above special code under "register
    for special issue".)

    2. Go through the submission routine on the webpage.

    In Step 0 choose the name of the meeting for
    which this special issue is being organized.










    21 ) 7th AISB Symposium on Computing and Philosophy: Is computation observer-relative?





    ***full paper submission deadline: 3 January 2014***

    The 7th AISB Symposium on Computing and Philosophy:
    Is computation observer-relative?

    AISB-50, Goldsmiths, London, 1-4 April 2014

    As part of the AISB-50 Annual Convention 2014 to be held at Goldsmiths,
    University of London
    http://www.aisb.org.uk/events/aisb14

    The convention is organised by the Society for the Study of Artificial
    Intelligence and Simulation of Behaviour (AISB)
    http://www.aisb.org.uk/

    OVERVIEW:

    One of the claims integral to John Searle?s critique of computational
    cognitive science and ?Strong AI? was that computation is
    ?observer-relative? or ?observer-dependent? (Searle, The Rediscovery of
    the Mind, 1992). This claim has already proven to be very controversial in
    cognitive science and AI (Endicott 1996; Coulter & Sharrock, Rey, and
    Haugeland in Preston & Bishop (eds.), Views into the Chinese Room, 2002).

    Those who come to the subject of computation via physics, for example,
    often argue that computational properties are physical properties, that
    is, that computation is ?intrinsic to physics?. On such views, computation
    is comparable to the flow of information, where information is conceived
    of in statistical terms, and thus computation is both observer-independent
    and (perhaps) ubiquitous. Connected with this are related issues about
    causality and identity (including continuity of), as well as the question
    of alternative formulations of information.

    This symposium seeks to evaluate arguments, such as (but not limited to)
    Searle?s, which bear directly on the question of what kind of processes
    and properties computational processes and properties are. It thus seeks
    to address the general question ?What is computation?? in a somewhat
    indirect way. Questions that might be tackled include: Are computational
    properties syntactic properties? Are syntactic properties discovered, or
    assigned? If they must be assigned, as Searle argues, does this mean they
    are or can be assigned arbitrarily? Might computational properties be
    universally realized? Would such universal realizability be objectionable,
    or trivialise computationalism? Is syntax observer-relative? What kinds of
    properties (if any) are observer-relative or observer-dependent? Is
    observer-relativity a matter of degree? Might the question of whether
    computation is observer-relative have different answers depending on what
    is carrying out the computation in question? Might the answer to this
    question be affected by the advent of new computing technologies, such as
    biologically- and physically-inspired models of computation? Is it time to
    start distinguishing between different meanings of ?computation?, or is
    there still mileage in the idea that some single notion of computation is
    both thin enough to cover all the kinds of activities we call
    computational, and yet still informative (non-trivial)? Does Searle?s idea
    that syntax is observer-relative serve to support, or instead to
    undermine, his famous ?Chinese Room argument??

    TOPICS OF INTEREST:

    1. COMPUTATIONAL-PHILOSOPHICAL ISSUES

    Questions of ontology and epistemology

    i. COMPUTATION AS OBSERVER RELATIVE

    Is computation an observer relative phenomenon? What implications do
    answers to this question have for the doctrine of computationalism?

    ii. WHAT IS COMPUTATION?

    Does computation (the unfolding process of a computational system)
    define a natural kind? If so, how do we differentiate the
    computational from the non-computational?

    iii. IMPLICATIONS FOR COMPUTATIONAL ONTOLOGY, and PAN-COMPUTATIONALISM

    To what extent and in what ways can we say that computation is
    taking place in natural systems?
    Are the laws of natural processes computational? Does a rock
    implement every input-less FSA
    (Putnam, Chalmers)? Is the evolution of the universe computable as
    the output of an algorithm?
    I.e. is the temporal evolution of a state of the universe a digital
    informational process akin to what goes on in the circuitry of a
    computer?
    Digital ontology'(Zuse), "the nature of the physical universe is
    ultimately discrete"; cf. Kant's distinction - from the antinomies of
    pure reason - of "simple parts" and no simple parts; the discrete
    and the analogue.

    2. SOME COMPUTATIONAL-PHILOSOPHICAL ISSUES

    Computation in machines and computation in nature; Turing versus
    non-Turing computation

    i. COMPUTATION IN NATURE

    Investigating the difference between formal models of physical and
    biological systems and physical/biological reality-in-itself and the
    implication(s) for theory of mind / cognition.

    (a) The study of 'computation' using natural processes / entities
    (i.e. machines not exclusively based on [man-made] silicon-based
    architectures).

    (b) What is the underlying nature of such natural [physical/biological]
    computational processes? I.e. are the laws of natural processes
    computational at their very core OR merely contingently
    computational because the mathematical language we use to express
    them is biased towards being computational?

    SUBMISSION AND PUBLICATION DETAILS:

    Submissions must be full papers and should be sent via EasyChair:
    https://www.easychair.org/conferences/?conf=aisb14cp

    Text editor templates from a previous convention can be found at:


    We request that submitted papers are limited to eight pages. Each paper
    will receive at least two reviews. Selected papers will be published in
    the general proceedings of the AISB Convention, with the proviso that at
    least ONE author attends the symposium in order to present the paper and
    participate in general symposium activities.

    IMPORTANT DATES:

    i. Full paper submission deadline: 3 January 2014
    ii. Notification of acceptance/rejection decisions: 3 February 2014
    iii. Final versions of accepted papers (Camera ready copy):
    24 February 2014
    iv. Convention: 1st - 4th April 2014, Goldsmiths, University of
    London, UK [symposium date to be confirmed]

    ADDITIONAL INFORMATION:

    There will be separate proceedings for each symposium, produced before the
    Congress, and available to conference delegates. In previous years there
    have been awards for the best student paper, and limited student
    bursaries. These details will be circulated as and when they become
    available. Authors of a selection of the best papers will be invited to
    submit an extended version of the work to a journal special issue.

    SYMPOSIUM ORGANISERS:

    Symposium Chair: Dr. John Preston, Department of Philosophy,
    The University of Reading, Reading, UK.
    email: j.m.preston@reading.ac.uk
    tel. +44 (0) 118 378 7327
    web page: http://www.reading.ac.uk/philosophy/about/staff/j-m-preston.aspx>

    Symposium Executive-Officer and OC member: Dr. Yasemin J. Erden, CBET,
    St Mary's University College, Twickenham, UK.
    email: yj.erden@smuc.ac.uk
    tel: +44 (0) 208 224 4250
    web page:


    Symposium OC Member: Prof. Mark Bishop, Department of Computing,
    Goldsmiths, University of London, London, UK.
    email: m.bishop@gold.ac.uk
    tel: +44 (0) 207 078 5048
    web page:

    Symposium OC member: Prof. Slawomir J Nasuto, School of Systems
    Engineering, University of Reading, Reading, UK.
    email: s.j.nasuto@reading.ac.uk
    tel: +44 (0) 118 378 6701
    web page:


    SYMPOSIUM WEBSITE:

    http://extranet.smuc.ac.uk/events-conferences/aisb-symposium-2014/Pages/default.aspx

    PROGRAMME COMMITTEE:

    Dr Mark Coeckelbergh (University of Twente, NL)
    Prof. S. Barry Cooper (University of Leeds, UK)
    Dr. Anthony Galton (University of Exeter, UK)
    Dr Bob Kentridge (Durham University, UK)
    Dr Stephen Rainey (St Mary's University College, UK)
    Dr Mark Sprevak (University of Edinburgh, UK)
    Prof. Michael Wheeler (University of Stirling, UK)






    22 ) Two new books from Prof. Yaroslav D. Sergeyev



    (From Dmitri Kvasov)


    1. Yaroslav D. Sergeyev, Arithmetic of Infinity, E-book, 2013.

    http://www.amazon.co.uk/Arithmetic-Infinity-Yaroslav-D-Sergeyev-ebook/dp/B00G7RB1FS/ref=sr_1_2?s=books&ie=UTF8&qid=1384278559&sr=1-2

    This book presents a new type of arithmetic that allows one to execute
    arithmetical operations with infinite numbers in the same manner as we
    are used to do with finite ones. The problem of infinity is considered
    in a coherent way different from (but not contradicting to) the famous
    theory founded by Georg Cantor. Surprisingly, the introduced
    arithmetical operations result in being very simple and are obtained as
    immediate extensions of the usual addition, multiplication, and division
    of finite numbers to infinite ones. This simplicity is a consequence of
    a newly developed positional numeral system used to express infinite
    numbers. In order to broaden the audience, the book was written as a
    popular one. This is the second revised edition of the book (the first
    paperback edition has been published in 2003, available at European
    Amazon sites).

    Opinions of some experts:
    "Mathematicians have never been comfortable handling infinities, such as
    those that crop up in the area of a Sierpinski carpet. But an entirely
    new type of mathematics looks set to by-pass the problem", MIT
    Technology Review, 03.19.2012.
    " We will mention here the timely proposal of an enlarged numerical
    system advanced recently by Yaroslav D. Sergeyev. This is simpler than
    non standard enlargements in its conception, it does not require
    infinitistic constructions and affords easier and stronger computation
    power." Lolli G. Infinitesimals and infinites in the history of
    mathematics: A brief survey, Applied Mathematics and Computation, 2012,
    218(16), 7979--7988.
    "He shows that it is possible to effectively work with infinite and
    infinitesimal quantities and to solve many problems connected to them in
    the field of applied and theoretical mathematics." De Cosmis S., De
    Leone R. The use of Grossone in Mathematical Programming and Operations
    Research, Applied Mathematics and Computation, 2012, 218(16), 8029-8038.
    "I am sure that the new approach presented in this book will have a very
    deep impact both on Mathematics and Computer Science." From the review
    written by D. Trigiante in Computational Management Science, 2007, 4(1),
    85-86.
    "These ideas and future hardware prototypes may be productive in all
    fields of science where infinite and infinitesimal numbers (derivatives,
    integrals, series, fractals) are used." From the review written by A.
    Adamatzky, Editor-in-Chief of the International Journal of
    Unconventional Computing, 2006, 2(2), 193-194.
    "The expressed viewpoint on infinity gives possibilities to solve new
    applied problems using arithmetical operations with infinite and
    infinitesimal numbers that can be executed in a simple and clear way."
    From the review written by P.M. Pardalos, Editor-in-Chief of the
    Journal of Global Optimization, 2006, 34, 157--158.

    At the web page of the author, the interested reader can find a number
    of reviews and technical articles of several researches.

    2. Yaroslav D. Sergeyev, Roman G. Strongin, Daniela Lera, Introduction
    to Global Optimization Exploiting Space-Filling Curves, 2013, Springer,
    E-book and paperback editions.

    http://www.amazon.co.uk/Introduction-Optimization-Exploiting-Space-Filling-SpringerBriefs/dp/1461480418/ref=sr_1_1?s=books&ie=UTF8&qid=1384363092&sr=1-1

    /Introduction to Global Optimization Exploiting Space-Filling
    Curves/provides an overview of classical and new results pertaining to
    the usage of space-filling curves in global optimization. The authors
    look at a family of derivative-free numerical algorithms applying
    space-filling curves to reduce the dimensionality of the global
    optimization problem; along with a number of unconventional ideas, such
    as adaptive strategies for estimating Lipschitz constant, balancing
    global and local information to accelerate the search. Convergence
    conditions of the described algorithms are studied in depth and
    theoretical considerations are illustrated through numerical examples.
    This work also contains a code for implementing space-filling curves
    that can be used for constructing new global optimization algorithms.
    Basic ideas from this text can be applied to a number of problems
    including problems with multiextremal and partially defined constraints
    and non-redundant parallel computations can be organized. Professors,
    students, researchers, engineers, and other professionals in the fields
    of pure mathematics, nonlinear sciences studying fractals, operations
    research, management science, industrial and applied mathematics,
    computer science, engineering, economics, and the environmental sciences
    will find this title useful.

    Yaroslav D. Sergeyev, Ph.D., D.Sc., D.H.C. is Distinguished Professor at
    the University of Calabria, Italy and Professor at N.I. Lobachevski
    Nizhniy Novgorod State University, Russia. He has been awarded several
    national and international research awards (Pythagoras International
    Prize in Mathematics, Italy, 2010; Outstanding Achievement Award from
    the 2010 World Congress in Computer Science, Computer Engineering, and
    Applied Computing, USA; Lagrange Lecture, Turin University, Italy, 2010;
    MAIK Prize for the best scientific monograph published in Russian,
    Moscow, 2008, etc.). His list of publications contains more than 200
    items, among them 5 books. He is a member of editorial boards of 4
    international scientific journals. He has given more than 30 keynote and
    plenary lectures at prestigious international congresses in mathematics
    and computer science. Software developed under his supervision is used
    in more than 40 countries of the world. Numerous magazines, newspapers,
    TV and radio channels have dedicated a lot of space to his research.









    23 ) UCNC 2014 Call for Papers




    UCNC 2014 CALL FOR PAPERS
    The 13th International Conference on Unconventional Computation
    & Natural Computation
    University of Western Ontario, London, Ontario, Canada
    July 14-18, 2014
    http://www.csd.uwo.ca/ucnc2014


    THE CONFERENCE

    The International Conference on Unconventional Computation and Natural Computation has been a forum where scientists with different backgrounds, yet sharing a common interest in novel forms of computation, human-designed computation inspired by nature, and the computational aspects of processes taking place in nature, meet and present their latest results. Continuing this tradition, the 13th International Conference on Unconventional Computation and Natural Computation will focus on the current experimental and theoretical results with the greatest impact.


    TOPICS

    Papers and poster presentations are sought in all areas that relate to unconventional computation and natural computation. Both theoretical and experimental papers are welcome. Typical, but not exclusive, topics are:

    * Molecular (DNA) computing, Quantum computing, Optical computing, Hypercomputation - relativistic computation, Chaos computing, Physarum computing, Computation in hyperbolic spaces, Collision-based computing, Computations beyond the Turing model;

    * Cellular automata, Neural computation, Evolutionary computation, Swarm intelligence, Ant algorithms, Artificial immune systems, Artificial life, Membrane computing, Amorphous computing;

    * Computational Systems Biology, Genetic networks, Protein-protein networks, Transport networks, Synthetic biology, Cellular (in vivo) computing.



    INSTRUCTIONS FOR AUTHORS

    Authors are invited to submit original papers (at most 12 pages in LNCS format) or one-page poster abstracts using the link

    https://www.easychair.org/conferences/?conf=ucnc2014

    Papers must be submitted in Portable Document Format (PDF). The revised version of the manuscripts, to appear in a LNCS volume by Springer, must be prepared in LATEX according to the LNCS format:

    http://www.springer.com/computer/lncs/lncs+authors

    The papers must not have been submitted simultaneously to other conferences with published proceedings. All accepted papers must be presented at the conference. The proceedings will be available at the conference venue.


    IMPORTANT DATES

    Submission deadline: March 7, 2014
    Notification of acceptance: April 7, 2014
    Final versions due: April 27, 2014
    Conference: July 14-18, 2014


    INVITED TUTORIALS

    Anne Condon (University of British Columbia, Canada)
    Ming Li (University of Waterloo, Canada)


    INVITED SPEAKERS: TBA


    WORKSHOPS

    Computational Neuroscience - Organizer Mark Daley (University of Western Ontario, Canada)

    DNA Computing by Self-Assembly - Organizer Matthew Patitz (University of Arkansas, USA)


    PROGRAM COMMITTEE

    Andrew Adamatzky (University of the West of England, UK)
    Selim G. Akl (Queen's University, Canada)
    Eshel Ben-Jacob (University of Tel-Aviv, Israel)
    Cristian S. Calude (University of Auckland, New Zealand)
    Jose Felix Costa (Technical University of Lisbon, Portugal)
    Erzsebet Csuhaj-Varju (Eotvos Lorand University, Hungary)
    Alberto Dennunzio (Universita degli Studi di Milano-Bicocca, Italy)
    Marco Dorigo (Universite Libre de Bruxelles, Belgium)
    Jerome Durand-Lose (Universite d'Orleans, France)
    Masami Hagiya (University of Tokyo, Japan)
    Oscar H. Ibarra (University of California, USA, Co-Chair)
    Jarkko Kari (University of Turku, Finland)
    Lila Kari (University of Western Ontario, Canada, Co-Chair)
    Kamala Krithivasan (IIT Madras, India)
    Viv Kendon (University of Leeds, UK)
    Giancarlo Mauri (Universita degli Studi di Milano-Bicocca, Italy)
    Yongli Mi (University of Hong Kong, China)
    Mario J. Perez-Jimenez (Universidad de Sevilla, Spain)
    Kai Salomaa (Queen's University, Canada)
    Hava Siegelmann (University of Massachusetts Amherst, USA)
    Susan Stepney (University of York, UK)
    Damien Woods (California Institute of Technology, USA)
    Byoung-Tak Zhang (Seoul National University, Korea)


    ORGANIZING COMMITTEE

    Mark Daley (University of Western Ontario)
    Helmut Jurgensen (University of Western Ontario)
    Lila Kari (University of Western Ontario, Chair)
    Steffen Kopecki (University of Western Ontario)
    Stephen Watt (University of Western Ontario)


    STEERING COMMITTEE

    Thomas Back (Leiden University, The Netherlands)
    Cristian S. Calude (University of Auckland, New Zealand, Founding Chair)
    Lov K. Grover (Bell Labs, USA)
    Natasha Jonoska (University of South Florida, USA, Co-Chair)
    Jarkko Kari (University of Turku, Finland, Co-Chair)
    Lila Kari (University of Western Ontario, Canada)
    Seth Lloyd (Massachusetts Institute of Technology, USA)
    Giancarlo Mauri (Universita degli Studi di Milano-Bicocca, Italy)
    Gheorghe Paun (Institute of Mathematics of the Romanian Academy, Romania)
    Grzegorz Rozenberg (Leiden University, The Netherlands, Emeritus Chair)
    Arto Salomaa (University of Turku, Finland)
    Tommaso Toffoli (Boston University, USA)
    Carme Torras (Institute of Robotics and Industrial Informatics, Spain)
    Jan van Leeuwen (Utrecht University, The Netherlands)











    24 ) CALL FOR NOMINATIONS FOR EATCS FELLOWS 2014



    INSTRUCTIONS: Please note: all nominees and nominators must be EATCS Members.

    Submit by December 31 of the current year for Fellow consideration by email to the EATCS Secretary (secretary@eatcs.org). The subject line of the email should read "EATCS Fellow Nomination - ".

    REQUIREMENTS FOR EATCS NOMINATION:

    The EATCS Fellows Program is established by the Association to recognize outstanding EATCS Members for their scientific achievements in the field of Theoretical Computer Science. The Fellow status is conferred by the EATCS Fellows-Selection Committee upon a person having a track record of intellectual and organizational leadership within the EATCS community. Fellows are expected to be "model citizens" of the TCS community, helping to develop the standing of TCS beyond the frontiers of the community.

    In order to be considered by the EATCS Fellows-Selection Committee, candidates must be nominated by at least four EATCS Members. Please verify your membership at http://www.eatcs.org/.

    The EATCS Fellows-Selection Committee consists of

    - Rocco De Nicola (IMT Lucca, Italy)
    - Paul Goldberg (Oxford, UK)
    - Anca Muscholl (Bordeaux, France, chair)
    - Dorothea Wagner (Karlsruhe, Germany)
    - Roger Wattenhofer (ETH Zurich, CH)

    INSTRUCTIONS:

    A nomination should consist of answers to the questions below. It can be co-signed by several EATCS members. At least two nomination letters per candidate are recommended. If you are supporting the nomination from within the candidate's field of expertise, it is expected that you will be specific about the individual's technical contributions.

    To be considered, nominations for 2014 must be received by December 31, 2013.

    1. Name of candidate
    Candidate's current affiliation and position
    Candidate's email address, postal address and phone number
    Nominator(s) relationship to the candidate

    2. Short summary of candidate's accomplishments (citation -- 25 words or less)

    3. Candidate's accomplishments: Identify the most important contributions that qualify the candidate for the rank of EATCS Fellow according to the following two categories:

    A) Technical achievements
    B) Outstanding service to the TCS community

    Please limit your comments to at most three pages.

    4. Nominator(s):
    Name(s) Affiliation(s), email and postal address(es), phone number(s).








    25 ) Human Brain Project - Competitive Call for Additional Beneficiaries and Call for Expert Evaluators



    Human Brain Project - Competitive Call for Additional Beneficiaries and
    Call for Expert Evaluators

    The Human Brain Project (HBP) is a ten-year, large-scale European
    research initiative whose goal is to understand the human brain and its
    diseases and ultimately to emulate its computational capabilities.

    HBP is an FP7 FET Flagship funded project that will operate until 31
    March 2016. It has reserved a portion of its funding for specific tasks
    to be carried out by new beneficiaries to the project who will be invited
    to join the consortium in 2014. These new beneficiaries will be selected
    from proposals submitted in response to the following competitive call.
    The proposals should encompass research activities exclusively.

    The call will open on 1 October 2013 and close on 6 November 2013, 4pm UK
    time. Results will be published in February 2014, with successful
    applicants joining the project on 1 April 2014.

    Existing beneficiaries in the HBP grant agreement cannot respond to this
    call. The list of the HBP beneficiaries is available at:
    http://www.humanbrainproject.eu/discover/the-community/partners

    Proposals may be submitted by one single organisation or by small groups
    of two to three organisations, depending on the topic.

    The Call topics are:

    1-Human and mouse neural channelomics and receptomics - 2 proposals with
    a maximum funding of ? 468,750 each will be selected.

    2-Genotype to phenotype mapping of the mouse brain - 1 or 2 proposals
    with a maximum shared funding of ? 937,500 will be selected.

    3-Identifying, gathering and organizing multimodal human and nonhuman
    neuroscience data - 2 proposals with a maximum funding of ? 468,750 each
    will be selected.

    4-Cognitive architectures - 3 to 5 proposals with a maximum funding of ?
    250,000 each will be selected.

    5-Novel methods for rule-based clustering of medical data - 4 proposals
    with a maximum funding of ? 234,375 each will be selected.

    6-Neural configurations for neuromorphic computing systems - 5 proposals
    with a maximum funding of ?116,250 each will be selected.

    7-Virtual robotic environments, agents, sensory & motor systems - 1 - 3
    proposals will be funded, depending on the number of elements of the
    toolkit covered. The maximum funding for each element of the toolkit will
    be ? 831,250.

    8-Theory of multiscale circuits - 4 proposals with a maximum funding of ?
    192,187 each will be selected.

    For more information about the call and the call topics please
    visit:
    http://www.humanbrainproject.eu/web/public/participate/competitive-calls-programme

    Expressions of interest from potential reviewers (remote participation)
    and Evaluation Panel members

    In the context of the above call, the Human Brain Project is inviting
    expressions of interest from potential reviewers (remote participation)
    and Evaluation Panel members. If you are interested, please write to
    hbp.call.expert@hbpconsortium.org summarizing your expertise in one or
    more of the topics covered by the Call (detailed above) and including the
    completed Reviewers Candidate form.

    More details can be found at:
    http://www.humanbrainproject.eu/web/public/independent-evaluators-and-evaluation-panel-members