dmanet@zpr.uni-koeln.de
To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de
You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de
When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."
Today's Topics:
1. AUTOMATA 2017 - Preliminary Call for Papers (AUTOMATA 2017)
2. NYCAC 2016 on Friday November 18 in New York (Antonis Achilleos)
3. CFP: SCSS 2017 (Temur Kutsia)
4. Multimedia Exposition - CfP 2017 (Matias Korman)
5. Multiple permanent faculty positions in Algorithms and
Complexity at the University of Edinburgh, School of Informatics
(Kousha Etessami)
----------------------------------------------------------------------
Message: 1
Date: Fri, 11 Nov 2016 22:18:31 +0100
From: AUTOMATA 2017 <automata2017@disco.unimib.it>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] AUTOMATA 2017 - Preliminary Call for Papers
Message-ID: <6c974283-c1f7-92bc-e74c-84fdc97d5de8@disco.unimib.it>
Content-Type: text/plain; charset=UTF-8; format=flowed
*****************************************************************************
AUTOMATA 2017 - Preliminary Call for Papers
23rd International Workshop on Cellular Automata and Discrete Complex
Systems
June 7 - 9, 2017
University of Milano-Bicocca
Milan, Italy
http://automata17.disco.unimib.it
*****************************************************************************
SCOPE
Papers presenting original and unpublished research on all fundamental
aspects of cellular automata, affine/correlated models of automata
(such as automata networks, finite automata over finite/infinite words,
picture languages), and related discrete complex systems are sought.
Topics of interest include (but are not limited to):
- dynamics, topological, ergodic and algebraic aspects
- algorithmic and complexity issues
- emergent properties
- formal languages
- symbolic dynamics
- tilings
- models of parallelism and distributed systems
- synchronous versus synchronous models
- phenomenological descriptions and scientific modelling
- practical applications
IMPORTANT DATES
Submission deadline: February 8, 2017
Notification of acceptance: March 15, 2017
Final versions: March 22, 2017
Submission deadline for exploratory papers: May 3, 2017
Notification of acceptance for exploratory papers: May 10, 2017
AUTOMATA 2017: June 7-9, 2017
PAPER CATEGORIES
There are two categories of submission – full papers and exploratory
papers. Full papers are meant to report more complete and denser research,
while the later submission deadline for exploratory papers allows quick
reporting of recent discoveries, work-in-progress and/or partial
results. Submissions in the full paper category are refereed and
selected by the program committee. Papers in the exploratory category
go through a less rigorous evaluation process. All accepted papers must
be presented at the conference.
INVITED SPEAKERS
Eric Goles (Universidad Adolfo Ibanez, Chile)
Adrien Richard (Université Nice Sophia Antipolis, France)
Ville Salo (University of Turku, Finland), to be confirmed
PROGRAM COMMITTEE
Matthew Cook (Switzerland), to be confirmed
Alberto Dennunzio (Italy), co-chair
Pedro de Oliveira (Brazil)
Bruno Durand (France)
Nazim Fatès (France)
Paola Flocchini (Canada)
Enrico Formenti (France), co-chair
Anahi Gajardo (Chile)
Dora Giammaresi (Italy)
Eric Goles (Chile)
Katsunobu Imai (Japan)
Jarkko Kari (Finland)
Petr Kurka (Czech Republik), to be confirmed
Martin Kutrib (Germany)
Andreas Malcher (Germany)
Carlos Martin-Vide (Spain)
Giancarlo Mauri (Italy)
Kenichi Morita (Japan)
Ronnie Pavlov (USA), to be confirmed
Karl Petersen (USA)
Ion Petre (Finland)
Renzo Pinzani (Italy)
Siamak Taati (Netherlands)
Edgardo Ugalde (Mexico)
Hiroshi Umeo (Japan)
ORGANIZING COMMITTEE
Alberto Dennunzio (co-chair)
Enrico Formenti (co-chair)
Luca Manzoni
Luca Mariot
Antonio E. Porreca
SUBMISSION
Authors are invited to submit papers of no more than 12
pages (for full papers) or 8 pages (for exploratory papers) via the
EasyChair system.
Submissions should contain original research that has not previously
been published. Concurrent submissions to other conferences/journals are
not allowed. Supplementary material that exceeds the above mentioned
page limits may be included as an appendix and will be considered at
the committee's discretion (note that appendices will not be published
in the proceedings). Submission must be formatted in LaTeX using the
LNCS format (see http://www.springer.com/computer/lncs/lncs+authors)
and submitted in Portable Document Format (PDF). Papers authored or
co-authored by PC members are also welcome and will follow a specific
evaluation process.
PROCEEDINGS
Accepted full papers will appear in the proceedings published by
Springer in the LNCS series.
Exploratory papers will not be included in the LNCS proceedings.
JOURNAL SPECIAL ISSUE
It is planned that extended version of some selected papers will be
considered for publication in special issues of an international
reknown journal.
------------------------------
Message: 2
Date: Sun, 13 Nov 2016 21:56:03 +0000
From: Antonis Achilleos <aachilleos@gc.cuny.edu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] NYCAC 2016 on Friday November 18 in New York
Message-ID:
<CAADirotAudosmUVrqyZ+v=rMjeNXfkKxYpFNSu7YJ28bS=d-2w@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
We are pleased to announce that this year's New York Colloquium on
Algorithms and Complexity (NYCAC) will take place on Friday, November 18 at
the Graduate Center of CUNY.
link:http://www.sci.brooklyn.cuny.edu/~zachos/nycac_2016/
NYCAC, the New York Colloquium on Algorithms and Complexity is an annual
event. Its purpose is to give the opportunity to graduate students in New
York to observe talks of researchers from all areas of the theory of
Algorithms and Computational Complexity.
This year's invited speakers are:
Eric Allender (Rutgers)
Alexandr Andoni (Columbia)
Xi Chen (Columbia)
William Gasarch (U Maryland)
Vasilis Gkatzelis (Drexel)
Periklis A. Papakonstantinou (Rutgers)
Rocco Servedio (Columbia)
Vasilis Syrgkanis (Microsoft Research)
We hope to see you there and don't forget to register.
For more information: http://www.sci.brooklyn.cuny.edu/~zachos/nycac_2016/
To register:
http://www.sci.brooklyn.cuny.edu/~zachos/nycac_2016/registration.shtml
Venue:
http://www.sci.brooklyn.cuny.edu/~zachos/nycac_2016/venue.shtml
On behalf of the organizers,
Antonis Achilleos
------------------------------
Message: 3
Date: Mon, 14 Nov 2016 11:20:46 +0100
From: Temur Kutsia <kutsia@risc.jku.at>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CFP: SCSS 2017
Message-ID: <80d8614a-0836-b9d5-82a4-b3f411b51cc4@risc.jku.at>
Content-Type: text/plain; charset=utf-8
=====================
Call for Papers
=====================
SCSS 2017
The 8th International Symposium on
Symbolic Computation in Software Science
April 6-9, 2017 in Gammarth, Tunisia.
Scope
-----
The purpose of SCSS 2017 is to promote research on theoretical and
practical aspects of symbolic computation in software science. The
symposium provides a forum for active dialog between researchers from
several fields of computer algebra, algebraic geometry, algorithmic
combinatorics, computational logic, and software analysis and
verification. SCSS 2017 solicits regular papers on all aspects of
symbolic computation and their applications in software science. The
topics of the symposium include, but are not limited to the following:
- automated reasoning
- algorithm (program) synthesis and/or verification
- formal methods for the analysis of network and system security
- termination analysis and complexity analysis of algorithms (programs)
- extraction of specifications from algorithms (programs)
- related theorem proving methods and techniques
- proof carrying code
- generation of inductive assertion for algorithm (programs)
- algorithm (program) transformations
- formalization and computerization of knowledge (maths, medicine,
economy, etc.)
- component-based programming
- computational origami
- query languages (in particular for XML documents)
- semantic web and cloud computing
Submission
----------
Submissions of regular research papers are invited. Regular research
papers must not exceed 12 pages in the EasyChair LaTeX Class format
(www.easychair.org/publications/easychair.zip), with up to 3 additional
pages for technical appendices. Student's abstracts must be no longer
than 4 pages in the same format and mention the category "student
paper". There will be a Best Paper Award, sponsored by ATSN: the
Tunisian Society for Digital Security. All submissions must be done via
Easychair on the website page
https://easychair.org/conferences/?conf=scss2017
Publication
-----------
The proceedings of SCSS 2017 will be published in the EasyChair
Proceedings in Computing (EPiC). After the symposium, we will have a
special issue of the Journal of Symbolic Computation. The full version
of selected papers will be considered for the publication of the special
issue subjected to the normal peer review process of the journal. The
submission deadline of the special issue will be 2 months after the
symposium.
Important Dates
---------------
Title and Abstract Due: November 20, 2016
Manuscript Due: November 27, 2016
Author Notification: January 5, 2017
Camera Ready Papers: February 5, 2017
Author Registration: February 20, 2017
Conference dates: April 6-9, 2017 in Gammarth, Tunisia
Invited Speaker
---------------
Gérard Huet (INRIA, Paris, France)
General Chairs
--------------
Adel Bouhoula (Sup'Com, University of Carthage, Tunisia)
Tetsuo Ida (University of Tsukuba, Japan)
Program Chairs
--------------
Mohamed Mosbah (LaBRi Bordeaux, France)
Michaël Rusinowitch (INRIA, France)
Program Committee
-----------------
Anas Abou El Kalam (Cadi Ayyad University, Morocco)
Adel Bouhoula (Sup'Com - University of carthage, Tunisia)
Khalil Drira (LAAS, CNRS, Toulouse, France)
Rachid Echahed (CNRS and University of Grenoble, France)
Jacques Garrigue (Nagoya University, Japan)
Ahmed Hadj Kacem (ReDCAD-FSEG Sfax, Tunisia)
Tetsuo Ida (University of Tsukuba, Japan)
Florent Jacquemard (INRIA - IRCAM, Paris, France)
Mohamed Jmaeil (ReDCAD, ENIS, Tunisia)
Cezary Kaliszyk (University of Innsburck, Austria)
Yukiyoshi Kameyama (University of Tsukuba, Japan)
Michael Kohlhase (KWARC, Germany)
Laura Kovacs (Chalmers University of Technology, Sweden)
Temur Kutsia (RISC, Johannes Kepler University Linz, Austria)
Yoshihiro Mizoguchi (Kyushu University, Japan)
Mohamed Mosbah (LaBRI - Bordeaux INP - University of Bordeaux, France)
Julein Narboux (LSIIT, University of Strasbourg, France)
Naoki Nishida (Nagoya University, Japan)
Renaud Rioboo (ENSIIE, Ivry, France)
Riadh Robbana (LIP2 - INSAT - University of Carthage, Tunisia)
Michael Rusinowitch (LORIA - INRIA Nancy, France)
Sofiene Tahar (Concordia University, Canada)
Dongming Wang (Beihang University and CNRS, Paris, France)
Stephen Watt (University of Waterloo, Canada)
Local Arrangement Committee
---------------------------
Mohamed Bécha Kaaniche (Sup'Com, University of Carthage, Tunisia)
Hanen Boussi Rahmouni (University of El Manar, Tunisia) (Chair)
Fadoua Ghourabi (Ochanomizu University, Japan)
Riadh Ksantini (Sup'Com, University of Carthage, Tunisia)
Amina Saadaoui (Sup'Com, University of Carthage, Tunisia)
------------------------------
Message: 4
Date: Mon, 14 Nov 2016 21:39:22 +0900
From: Matias Korman <korman@nii.ac.jp>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Multimedia Exposition - CfP 2017
Message-ID:
<CAG+JB83q5J8_tqbNVbe9zdOAbiFL8=v8r_jdHtVe-E+eRCeOTw@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
The 26th International Computational Geometry Multimedia Exposition (CG:MME)
Brisbane, Australia, July 4-7, 2017
Call for Papers
(see full version at http://socg2017.smp.uq.edu.au/multimedia.html)
Multimedia presentations are sought for the 26th International
Computational Geometry Multimedia Exposition (CG:MME), which will take
place in July as part of Computational Geometry Week 2017. Computational
Geometry Week also encompasses the 33rd International Symposium on
Computational Geometry. The Multimedia Exposition showcases the use of
visualisation in computational geometry for exposition and education, for
visual exploration of geometry in research, and as an interface and a
debugging tool in software development.
Content and Form
The content of multimedia presentations should be related to computational
geometry or neighbouring areas, but is otherwise unrestricted. We encourage
submissions that support papers submitted to the Symposium on Computational
Geometry, but this is not required. In particular, results being presented
are not required to be new. We explicitly encourage submissions that take
new views on classic results from computational geometry, which may help to
make such results more widely accessible.
The form of multimedia presentations can be anything other than the
traditional paper or slide show. Algorithm animations, visual explanations
of structural theorems, descriptions of applications of computational
geometry, demonstrations of software systems, and games that illustrate
concepts from computational geometry are all appropriate. There are no
limitations on creativity, anything that leverages the possibilities of
multimedia to enlighten and entertain the viewer while learning about
computational geometry or neighbouring areas will do. This includes
rendered animation, films with narrators and/or actors, and interactive
stories, as well as interactive demos.
Quality Requirements
The "format" as well as the creative content of Multimedia submissions
influences their acceptance. For videos, a length of three to five minutes
is usually ideal; ten minutes is the upper limit. For the final version, we
require video in 720p or better, using H.264. The embedded audio stream
should be AAC of at least 128kBit/s. Telephone-sounding audio (limited
frequency range, noise) or live rooms, as often recorded with cheap
headsets, should be avoided, as well as speakers with too heavy accent.
Interactive applications (e.g., HTML5, Flash, AIR, Java, executable files,
etc.) should provide a "demo" video demonstrating the functionalities of
the software, for archiving on the website. These videos can be created
with any screen recording software (such as CamStudio/VideoPad for Windows,
QuickTime/iMovie for Mac, or Kazam/Kdenlive for GNU/Linux) together with
voice description (by the authors or by a speech generator, such as eSpeak).
Multimedia submissions are limited to 100MB. Authors are free to post
higher quality versions on their own web sites, and we will include links
in the electronic proceedings to their version, in addition to the official
(<100MB) version archived on www.computational-geometry.org.
It is strongly encouraged to contact the CG:MME program committee well in
advance to 1) discuss the quality of a video submission (based on sample
files) or 2) to present your non-video idea and how it could be reviewed,
presented, and distributed.
Submission
Submissions should be deposited online where they are accessible through
the web or via FTP. A video submission should play trouble-free on programs
like VLC Media Player. For ease of sharing and viewing, we encourage (but
do not require) that each video submission be uploaded to YouTube, and that
the corresponding URL be included with the submission.
The application itself should be submitted with a small "how-to" use
documentation in plain text. Ideally, the application should be universal
(be able to run on any device and OS), but it is ok as long as it runs in
reasonably common setups (for example, desktop computers with windows and
Mac OS). We also recommend adding a "makefile" or a similar file to ease
compilation.
Each submission should include a description of at most four pages of the
material shown in the presentation, and where applicable, the techniques
used in the implementation. This four-page description must be formatted
according to the guidelines for the conference proceedings, using the
LIPIcs format. LIPIcs typesetting instructions can be found at
http://www.dagstuhl.de/en/publications/lipics and the lipics.cls LaTeX
style file at http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz.
Send a mail to the CG:MM chair, Matias Korman (korman at nii.ac.jp) by
March 10, 2017, with the following information:
-the names and institutions of the authors
-the email address of the corresponding author
-instructions for downloading the submission
-if available: the link to the YouTube video
-and the PDF abstract.
We encourage multimedia submissions that support papers submitted to the
Symposium. However, submitted papers and associated multimedia submissions
will be treated entirely separately by the respective committees:
acceptance or rejection of one will not influence acceptance or rejection
of the other.
Important Dates
March 10, 2017: Multimedia submissions due
March 24, 2017: Notification of acceptance/rejection
April 7, 2017: Final version of written abstracts due
May 19, 2017: Final versions of multimedia content due
July 4-7, 2017: CGWeek 2017
All deadlines are 23:59 anywhere on earth.
Multimedia Committee
Matthew Gibson, University of Texas at San Antonio, USA
Matias Korman (chair), Tohoku University, Japan
Yoshio Okamoto, University of Electro-Communications, Japan
Alexander Pilz, ETH Zurich, Switzerland
Rodrigo I. silveira, Universitat Politecnica de Catalunya, Spain
Darren Strash, Colgate University, USA
Kevin Verbeek, TU Eindhoven, the Netherlands
Sander Verdonschot, University of Ottawa, Canada
------------------------------
Message: 5
Date: Mon, 14 Nov 2016 13:50:29 +0000 (GMT)
From: Kousha Etessami <kousha@staffmail.ed.ac.uk>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Multiple permanent faculty positions in Algorithms
and Complexity at the University of Edinburgh, School of Informatics
Message-ID: <alpine.LRH.2.11.1611141346520.9386@yetholm.inf.ed.ac.uk>
Content-Type: TEXT/PLAIN; format=flowed; charset=US-ASCII
The School of Informatics at the University of Edinburgh seeks to
appoint multiple permanent faculty positions in Algorithms and
Complexity at all levels over the coming year.
Posts are available as Lecturer (~equivalent to Assistant Professor), Reader
(~equivalent to Associate Professor),
and Chair (Full Professor).
We are eager to attract applicants from a variety of specialisms within
algorithms and complexity, including (but not limited to): algorithms for large
data sets, algorithmic game theory and the interface of algorithms with
economics, complexity theory, algorithmic learning theory, randomized
algorithms, approximation algorithms, algorithmic foundations of data privacy,
online algorithms, and algorithmic aspects of security and cryptography, and
quantum algorithms/complexity.
The application deadline for these posts is ** January 31st, 2017 **.
The School of Informatics is one of the top ranked computer science departments
in Europe, with over 100 faculty members. The School is housed in the modern
Informatics Forum building, located in the center of Edinburgh.
Edinburgh, the capital city of Scotland, is a UNESCO world heritage city, and
has been consistently voted one of the most livable cities in the UK.
More information regarding these positions, their application procedure, and a
link to their online application form (click "Apply" at the bottom of the web
page) can be found at the following two URLs:
For the Lecturer/Reader positions:
https://www.vacancies.ed.ac.uk/pls/corehrrecruit/erq_jobspec_version_4.jobspec?p_id=037926
For the Chair (Full Professor) position:
https://www.vacancies.ed.ac.uk/pls/corehrrecruit/erq_jobspec_version_4.jobspec?p_id=037970
Best,
Kousha Etessami
Director, Lab for Foundations of Computer Science
School of Informatics
University of Edinburgh
Edinburgh, EH8 9AB, UK
Email: kousha@inf.ed.ac.uk
--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.
------------------------------
Subject: Digest Footer
_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
------------------------------
End of dmanet Digest, Vol 105, Issue 14
***************************************
No comments:
Post a Comment