Sunday, June 16, 2013

[DMANET] Call for informal presentations: Machines, Computations and Universality 2013

Machines, Computation and Universality (MCU) 2013
Zurich, Switzerland, September 9-12
http://mcu2013.ini.uzh.ch/


CALL FOR INFORMAL PRESENTATIONS

There will be an informal presentation session at MCU 2013, in which
presenters will give a short talk on topics within the scope of MCU.
These informal presentations can discuss ongoing work, present partial
results and/or conjectures, or propose new research directions.

SCOPE

MCU explores computation in the setting of various discrete models
(Turing machines, register machines, cellular automata, tile assembly
systems, rewriting systems, neural models etc.) and analog and hybrid
models (BSS machines, infinite time cellular automata, real machines,
quantum computing etc.). There is particular (but not exclusive)
emphasis given towards the following:

1. the search for frontiers between decidability and undecidability in
the various models. (For example, what is the smallest number of pairs
of words for which the Post correspondence problem is undecidable, or
what is the largest state-symbol product for which the halting problem
is decidable for Turing machines?)

2. the search for the simplest universal models (such as small universal
Turing machines, universal rewriting systems with few rules, universal
cellular automata with small neighborhoods and a small number of states,
etc.)

3. the computational complexity of predicting the evolution of
computations in the various models. (For example, is it possible to
predict an arbitrary number of time steps for a model more efficiently
than explicit step by step simulation of the model?)

4. universality and undecidability in continuous models of computation.


IMPORTANT DATES

Submission deadline for informal presentations: June 30, 2013
Conference: September 9-12, 2013


PROGRAM COMMITTEE

Andrew Adamatzky (University of the West of England, UK)
Matthew Cook (University of Zurich and ETH Zurich) (co-chair)
Erzsébet Csuhaj-Varjú (Eötvös Loránd University, Budapest, Hungary)
Jérôme Durand-Lose (University of Orléans, France)
Rudolf Freund (University of Vienna, Austria)
Gabriel Istrate (Institute e-Austria, Timisoara, Romania)
Jarkko Kari (University of Turku, Finland)
Lila Kari (University of Western Ontario, London, Canada)
Kamala Krithivasan (Indian Institute of Technology, Chennai, India)
Maurice Margenstern (University of Lorraine, France)
Turlough Neary (University of Zurich and ETH Zurich) (co-chair)
Matthew Pattitz (University of Arkansas, Fayetteville, USA)
Igor Potapov (University of Liverpool, UK)
Klaus Sutner (Carnegie Mellon University, Pittsburgh, USA)
Sergey Verlan (University of Paris Est, France)
Damien Woods (California Institute of Technology, USA)


INVITED SPEAKERS

Liesbeth De Mol (Ghent University, Belgium)
Jarkko Kari (University of Turku, Finland)
Kenichi Morita (Hiroshima University, Japan)
Erik Winfree (California Institute of Technology, USA)
Damien Woods (California Institute of Technology, USA)


STEERING COMMITTEE

Maurice Margenstern (University of Lorraine, France) (chair)
Jérôme Durand-Lose (University of Orléans, France) (vice-chair)
Erzsébet Csuhaj-Varjú (Eötvös Loránd University, Hungary)
Natasha Jonoska (University of South Florida, USA)
Kenichi Morita (Hiroshima University, Japan)
Gheorghe Păun (The Romanian Academy, Romania)
Arto Salomaa (University of Turku, Finland)
K. G. Subramanian (University of Science, Malaysia)


ABSTRACT PREPARATION AND SUBMISSION

Researchers are invited to submit an abstract of no more than 2 pages
(including references) via the EasyChair system at
https://www.easychair.org/conferences/?conf=mcu2013. The main criterion
for acceptance is that the topic outlined for presentation be of
interest to the MCU audience. Submissions must be in the form of a PDF
prepared using the EPTCS style file (available at
http://style.eptcs.org/). The title page of the abstract should include
the names, affiliations and email addresses of each of the authors.


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] FCT 2013 Call for Participation (Aug 19-21)

FCT 2013, University of Liverpool

The 19th International Symposium on Fundamentals of Computation
Theory (FCT 2013) will be hosted by the Department of Computer
Science at the University of Liverpool.

Dates: Aug 19-21, 2013
Website: http://fct2013.csc.liv.ac.uk/
Registration page: http://cgi.csc.liv.ac.uk/~fct2013/register.html

Early registration (until July 15) is £300 (£225 for students).

The invited speakers at FCT 2013 are Marek Chrobak (UC Riverside),
Joël Ouaknine (Oxford University), and David Peleg (Weizmann Institute).

List of accepted papers: http://cgi.csc.liv.ac.uk/~fct2013/accepted.html

Program chairs: Leszek Gasieniec, University of Liverpool
Frank Wolter, University of Liverpool

Conference scope
----------------
FCT covers

Algorithms, including algorithm design, optimization,
approximation and randomized algorithms, computational
complexity, computational geometry, machine learning, artificial
intelligence, computational algebra, online algorithms,
and parallel and distributed computing.

Formal methods, including algebraic and categorical
methods, automata and formal languages, database theory,
foundations of concurrency, logic and model checking,
principles of programming languages, program analysis
and transformation, specification, refinement and verification,
and security.

Emerging fields, including algorithmic game theory,
computational biology, foundations of cloud computing, and
quantum computing.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

CALL FOR PARTICIPATION: Workshop on Quantum and Classical Complexity

Workshop on Quantum and Classical Complexity
Riga, Latvia, July 7 2013, Satellite event to ICALP 2013

CALL FOR PARTICIPATION

Please visit page http://users.utu.fi/mikhirve/workshop/ to see the
workshop program and fill in the registration form. No registration
fee is collected.

Looking forward to see you in Riga!
Mika Hirvensalo and Abuzer Yakaryilmaz

SSTiC 2013: next registration deadline 26 June

*To be removed from our mailing list, please respond to this message with
UNSUBSCRIBE in the subject line*

*********************************************************************

2013 INTERNATIONAL SUMMER SCHOOL ON TRENDS IN COMPUTING

SSTiC 2013

Tarragona, Spain

July 22-26, 2013

Organized by
Rovira i Virgili University

http://grammars.grlmc.com/SSTiC2013/

*********************************************************************

+++ next registration deadline: June 26 +++

*********************************************************************

AIM:

SSTiC 2013 will be an open forum for the convergence of top class well
recognized computer scientists and people at the beginning of their research
career (typically PhD students) as well as consolidated researchers.

SSTiC 2013 will cover the whole spectrum of computer science by means of 56
six-hour courses dealing with hot topics at the frontiers of the field. By
actively participating, lecturers and attendees will share the idea of
scientific excellence as the main motto of their research work.

ADDRESSED TO:

Graduate students from around the world. There are no pre-requisites in
terms of the academic degree the attendee must hold. However, since there
will be several levels among the courses, in the description of some of them
reference may be made to specific knowledge background.

SSTiC 2013 is appropriate also for people more advanced in their career who
want to keep themselves updated on developments in the field.

Finally, senior researchers will find it fruitful to listen and discuss with
people who are main references of the diverse branches of computing
nowadays.

REGIME:

7 parallel sessions will be held during the whole event. Participants will
be able to freely choose the courses they will be willing to attend as well
as to move from one to another.

VENUE:

Palau Firal i de Congressos de Tarragona
Arquitecte Rovira, 2
43001 Tarragona
http://www.palaucongrestgna.com

COURSES AND PROFESSORS:

Shun-ichi Amari (Riken) [introductory] Information Geometry and Its
Applications

James Anderson (Chapel Hill) [intermediate] Scheduling and Synchronization
in Real-Time Multicore Systems

Pierre Baldi (Irvine) [intermediate] Big Data Informatics Challenges and
Opportunities in the Life Sciences

Yoshua Bengio (Montréal) [introductory/intermediate] Deep Learning of
Representations

Stephen Brewster (Glasgow) [advanced] Multimodal Human-Computer Interaction

Bruno Buchberger (Linz) [introductory] Groebner Bases: An Algorithmic Method
for Multivariate Polynomial Systems. Foundations and Applications

Rajkumar Buyya (Melbourne) [intermediate] Cloud Computing

Jan Camenisch (IBM Zurich) [intermediate] Cryptography for Privacy

Larry S. Davis (College Park) [intermediate] Video Analysis of Human
Activities

Paul De Bra (Eindhoven) [intermediate] Adaptive Systems

Paul Dourish (Irvine) [introductory] Ubiquitous Computing in a Social
Context

Max J. Egenhofer (Maine) [introductory/intermediate] Qualitative Spatial
Relations: Formalizations and Inferences

Richard M. Fujimoto (Georgia Tech) [introductory] Parallel and Distributed
Simulation

David Garlan (Carnegie Mellon) [advanced] Software Architecture: Past,
Present and Future

Mario Gerla (Los Angeles) [intermediate] Vehicle Cloud Computing

Georgios B. Giannakis (Minnesota) [advanced] Sparsity and Low Rank for
Robust Data Analytics and Networking

Ralph Grishman (New York) [intermediate] Information Extraction from Natural
Language

Francisco Herrera (Granada) [intermediate] Imbalanced Classification:
Current Approaches and Open Problems

Paul Hudak (Yale) [introductory] Euterpea: From Signals to Symphonies Using
Haskell

Niraj K. Jha (Princeton) [intermediate] FinFET Circuit Design

George Karypis (Minnesota) [introductory] Introduction to Parallel
Computing: Architectures, Algorithms, and Programming

Aggelos K. Katsaggelos (Northwestern) [intermediate/advanced] Sparsity-based
Advances in Image Processing

Arie E. Kaufman (Stony Brook) [advanced] Advances in Visualization

Hugo Krawczyk (IBM Research) [intermediate] An Introduction to the Design
and Analysis of Authenticated Key Exchange Protocols

Pierre L'Ecuyer (Montréal) [intermediate] Quasi-Monte Carlo Methods in
Simulation: Theory and Practice

Laks Lakshmanan (British Columbia) [intermediate/advanced] Information and
Influence Spread in Social Networks

Wenke Lee (Georgia Tech) [introductory] DNS-based Monitoring of Malware
Activities

Maurizio Lenzerini (Roma La Sapienza) [intermediate] Ontology-based Data
Integration

Ming C. Lin (Chapel Hill) [introductory/intermediate] Physically-based
Modeling and Simulation

Jane W.S. Liu (Academia Sinica) [intermediate] Critical Information and
Communication Technologies for Disaster Preparedness and Response

Satoru Miyano (Tokyo) [intermediate] How to Hack Cancer Systems with
Computational Methods

Aloysius K. Mok (Austin) [intermediate] From Real-time Systems to
Cyber-physical Systems

Hermann Ney (Aachen) [intermediate/advanced] Probabilistic Modelling for
Natural Language Processing - with Applications to Speech Recognition,
Handwriting Recognition and Machine Translation

Cathleen A. Norris (North Texas) & Elliot Soloway (Ann Arbor) [introductory]
Primary & Secondary Educational Computing in the Age of Mobilism

Jeff Offutt (George Mason) [intermediate] Cutting Edge Research in
Engineering of Web Applications

David Padua (Urbana) [intermediate] Parallel Programming with Abstractions

Bijan Parsia (Manchester) [introductory] The Semantic Web: Conceptual and
Technical Foundations

Charles E. Perkins (FutureWei) [intermediate/advanced] Beyond 4G

Prabhakar Raghavan (Google) [introductory/intermediate] Web Search and
Advertising

Phillip Rogaway (Davis) [introductory/intermediate] Provably Secure
Symmetric Encryption

Gustavo Rossi (La Plata) [intermediate] Topics in Model Driven Web
Engineering

Kaushik Roy (Purdue) [introductory/intermediate] Low-energy Computing

Robert Sargent (Syracuse) [introductory] Validating Models

Douglas C. Schmidt (Vanderbilt) [intermediate] Patterns and Frameworks for
Concurrent and Networked Software

Bart Selman (Cornell) [intermediate] Fast Large-scale Probabilistic and
Logical Inference Methods

Mubarak Shah (Central Florida) [intermediate/advanced] Visual Crowd
Surveillance

Ron Shamir (Tel Aviv) [introductory] Revealing Structure in Disease
Regulation and Networks

Dawn Xiaodong Song (Berkeley) [introductory] Selected Topics in Computer
Security

Mike Thelwall (Wolverhampton) [introductory] Sentiment Strength Detection
for the Social Web

Julita Vassileva (Saskatchewan) [introductory/intermediate] Engaging Users
in Social Computing Systems

Philip Wadler (Edinburgh) [introductory] Topics in Lambda Calculus and Life

Yao Wang (Polytechnic New York) [introductory/advanced] Video Compression:
Fundamentals and Recent Development

Gio Wiederhold (Stanford) [introductory] Software Economics: How Do the
Results of the Intellectual Efforts Enter the Global Market Place

Limsoon Wong (National Singapore) [introductory/intermediate] The Use of
Context in Gene Expression and Proteomic Profile Analysis

Michael Wooldridge (Oxford) [introductory] Autonomous Agents and Multi-Agent
Systems

Ronald R. Yager (Iona) [introductory/intermediate] Fuzzy Sets and Soft
Computing

Philip S. Yu (Illinois Chicago) [advanced] Mining Big Data

REGISTRATION:

It has to be done at

http://grammars.grlmc.com/SSTiC2013/Registration.php

Since the capacity of the venue is limited, registration requests will be
processed on a first come first served basis. The registration period will
be closed when the capacity of the venue will be complete.

FEES:

Fees may be for the whole week (full-time participant) or per blocks of days
(part-time participant). They are a flat rate allowing one to attend all
courses within the time window set: 5, 4, 3 or 2 days. Fees vary depending
on the deadline.

ACCOMMODATION:

Information about accommodation is available on the website of the School.

CERTIFICATE:

Participants will be delivered a certificate of attendance.

IMPORTANT DATES:

Announcement of the programme: January 26, 2013

Registration deadlines:

next: June 26, 2013
last: July 25, 2013

QUESTIONS AND FURTHER INFORMATION:

Lilica Voicu:
florentinalilica.voicu@urv.cat

POSTAL ADDRESS:

SSTiC 2013
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain

Phone: +34-977-559543
Fax: +34-977-558386

ACKNOWLEDGEMENTS:

Departament d'Economia i Coneixement, Generalitat de Catalunya
Universitat Rovira i Virgili

Saturday, June 15, 2013

[DMANET] SSTiC 2013: next registration deadline 26 June

*To be removed from our mailing list, please respond to this message with
UNSUBSCRIBE in the subject line*

*********************************************************************

2013 INTERNATIONAL SUMMER SCHOOL ON TRENDS IN COMPUTING

SSTiC 2013

Tarragona, Spain

July 22-26, 2013

Organized by
Rovira i Virgili University

http://grammars.grlmc.com/SSTiC2013/

*********************************************************************

+++ next registration deadline: June 26 +++

*********************************************************************

AIM:

SSTiC 2013 will be an open forum for the convergence of top class well
recognized computer scientists and people at the beginning of their research
career (typically PhD students) as well as consolidated researchers.

SSTiC 2013 will cover the whole spectrum of computer science by means of 56
six-hour courses dealing with hot topics at the frontiers of the field. By
actively participating, lecturers and attendees will share the idea of
scientific excellence as the main motto of their research work.

ADDRESSED TO:

Graduate students from around the world. There are no pre-requisites in
terms of the academic degree the attendee must hold. However, since there
will be several levels among the courses, in the description of some of them
reference may be made to specific knowledge background.

SSTiC 2013 is appropriate also for people more advanced in their career who
want to keep themselves updated on developments in the field.

Finally, senior researchers will find it fruitful to listen and discuss with
people who are main references of the diverse branches of computing
nowadays.

REGIME:

7 parallel sessions will be held during the whole event. Participants will
be able to freely choose the courses they will be willing to attend as well
as to move from one to another.

VENUE:

Palau Firal i de Congressos de Tarragona
Arquitecte Rovira, 2
43001 Tarragona
http://www.palaucongrestgna.com

COURSES AND PROFESSORS:

Shun-ichi Amari (Riken) [introductory] Information Geometry and Its
Applications

James Anderson (Chapel Hill) [intermediate] Scheduling and Synchronization
in Real-Time Multicore Systems

Pierre Baldi (Irvine) [intermediate] Big Data Informatics Challenges and
Opportunities in the Life Sciences

Yoshua Bengio (Montréal) [introductory/intermediate] Deep Learning of
Representations

Stephen Brewster (Glasgow) [advanced] Multimodal Human-Computer Interaction

Bruno Buchberger (Linz) [introductory] Groebner Bases: An Algorithmic Method
for Multivariate Polynomial Systems. Foundations and Applications

Rajkumar Buyya (Melbourne) [intermediate] Cloud Computing

Jan Camenisch (IBM Zurich) [intermediate] Cryptography for Privacy

Larry S. Davis (College Park) [intermediate] Video Analysis of Human
Activities

Paul De Bra (Eindhoven) [intermediate] Adaptive Systems

Paul Dourish (Irvine) [introductory] Ubiquitous Computing in a Social
Context

Max J. Egenhofer (Maine) [introductory/intermediate] Qualitative Spatial
Relations: Formalizations and Inferences

Richard M. Fujimoto (Georgia Tech) [introductory] Parallel and Distributed
Simulation

David Garlan (Carnegie Mellon) [advanced] Software Architecture: Past,
Present and Future

Mario Gerla (Los Angeles) [intermediate] Vehicle Cloud Computing

Georgios B. Giannakis (Minnesota) [advanced] Sparsity and Low Rank for
Robust Data Analytics and Networking

Ralph Grishman (New York) [intermediate] Information Extraction from Natural
Language

Francisco Herrera (Granada) [intermediate] Imbalanced Classification:
Current Approaches and Open Problems

Paul Hudak (Yale) [introductory] Euterpea: From Signals to Symphonies Using
Haskell

Niraj K. Jha (Princeton) [intermediate] FinFET Circuit Design

George Karypis (Minnesota) [introductory] Introduction to Parallel
Computing: Architectures, Algorithms, and Programming

Aggelos K. Katsaggelos (Northwestern) [intermediate/advanced] Sparsity-based
Advances in Image Processing

Arie E. Kaufman (Stony Brook) [advanced] Advances in Visualization

Hugo Krawczyk (IBM Research) [intermediate] An Introduction to the Design
and Analysis of Authenticated Key Exchange Protocols

Pierre L'Ecuyer (Montréal) [intermediate] Quasi-Monte Carlo Methods in
Simulation: Theory and Practice

Laks Lakshmanan (British Columbia) [intermediate/advanced] Information and
Influence Spread in Social Networks

Wenke Lee (Georgia Tech) [introductory] DNS-based Monitoring of Malware
Activities

Maurizio Lenzerini (Roma La Sapienza) [intermediate] Ontology-based Data
Integration

Ming C. Lin (Chapel Hill) [introductory/intermediate] Physically-based
Modeling and Simulation

Jane W.S. Liu (Academia Sinica) [intermediate] Critical Information and
Communication Technologies for Disaster Preparedness and Response

Satoru Miyano (Tokyo) [intermediate] How to Hack Cancer Systems with
Computational Methods

Aloysius K. Mok (Austin) [intermediate] From Real-time Systems to
Cyber-physical Systems

Hermann Ney (Aachen) [intermediate/advanced] Probabilistic Modelling for
Natural Language Processing - with Applications to Speech Recognition,
Handwriting Recognition and Machine Translation

Cathleen A. Norris (North Texas) & Elliot Soloway (Ann Arbor) [introductory]
Primary & Secondary Educational Computing in the Age of Mobilism

Jeff Offutt (George Mason) [intermediate] Cutting Edge Research in
Engineering of Web Applications

David Padua (Urbana) [intermediate] Parallel Programming with Abstractions

Bijan Parsia (Manchester) [introductory] The Semantic Web: Conceptual and
Technical Foundations

Charles E. Perkins (FutureWei) [intermediate/advanced] Beyond 4G

Prabhakar Raghavan (Google) [introductory/intermediate] Web Search and
Advertising

Phillip Rogaway (Davis) [introductory/intermediate] Provably Secure
Symmetric Encryption

Gustavo Rossi (La Plata) [intermediate] Topics in Model Driven Web
Engineering

Kaushik Roy (Purdue) [introductory/intermediate] Low-energy Computing

Robert Sargent (Syracuse) [introductory] Validating Models

Douglas C. Schmidt (Vanderbilt) [intermediate] Patterns and Frameworks for
Concurrent and Networked Software

Bart Selman (Cornell) [intermediate] Fast Large-scale Probabilistic and
Logical Inference Methods

Mubarak Shah (Central Florida) [intermediate/advanced] Visual Crowd
Surveillance

Ron Shamir (Tel Aviv) [introductory] Revealing Structure in Disease
Regulation and Networks

Dawn Xiaodong Song (Berkeley) [introductory] Selected Topics in Computer
Security

Mike Thelwall (Wolverhampton) [introductory] Sentiment Strength Detection
for the Social Web

Julita Vassileva (Saskatchewan) [introductory/intermediate] Engaging Users
in Social Computing Systems

Philip Wadler (Edinburgh) [introductory] Topics in Lambda Calculus and Life

Yao Wang (Polytechnic New York) [introductory/advanced] Video Compression:
Fundamentals and Recent Development

Gio Wiederhold (Stanford) [introductory] Software Economics: How Do the
Results of the Intellectual Efforts Enter the Global Market Place

Limsoon Wong (National Singapore) [introductory/intermediate] The Use of
Context in Gene Expression and Proteomic Profile Analysis

Michael Wooldridge (Oxford) [introductory] Autonomous Agents and Multi-Agent
Systems

Ronald R. Yager (Iona) [introductory/intermediate] Fuzzy Sets and Soft
Computing

Philip S. Yu (Illinois Chicago) [advanced] Mining Big Data

REGISTRATION:

It has to be done at

http://grammars.grlmc.com/SSTiC2013/Registration.php

Since the capacity of the venue is limited, registration requests will be
processed on a first come first served basis. The registration period will
be closed when the capacity of the venue will be complete.

FEES:

Fees may be for the whole week (full-time participant) or per blocks of days
(part-time participant). They are a flat rate allowing one to attend all
courses within the time window set: 5, 4, 3 or 2 days. Fees vary depending
on the deadline.

ACCOMMODATION:

Information about accommodation is available on the website of the School.

CERTIFICATE:

Participants will be delivered a certificate of attendance.

IMPORTANT DATES:

Announcement of the programme: January 26, 2013

Registration deadlines:

next: June 26, 2013
last: July 25, 2013

QUESTIONS AND FURTHER INFORMATION:

Lilica Voicu:
florentinalilica.voicu@urv.cat

POSTAL ADDRESS:

SSTiC 2013
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain

Phone: +34-977-559543
Fax: +34-977-558386

ACKNOWLEDGEMENTS:

Departament d'Economia i Coneixement, Generalitat de Catalunya
Universitat Rovira i Virgili


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] SLSP 2013: call for participation

*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line*

************************************************************************************************

1st INTERNATIONAL CONFERENCE ON STATISTICAL LANGUAGE AND SPEECH PROCESSING

SLSP 2013

Tarragona, Spain

July 29-31, 2013

http://grammars.grlmc.com/SLSP2013/

************************************************************************************************

PROGRAMME

Monday, July 29:

8:00 - 8:50 Registration

8:50 - 9:00 Opening

9:00 - 9:50 Yoshua Bengio: Deep Learning of Representations: Looking Forward (I) - Invited Tutorial

9:50 - 10:20 Coffee Break

10:20 - 11:35

Horacio Saggion, Stefan Bott, and Luz Rello: Comparing Resources for Spanish Lexical Simplification

Borbála Siklósi, Attila Novák, and Gábor Prószéky: Context-aware Correction of Spelling Errors in Hungarian Medical Documents

Attia Nehar, Djelloul Ziadi, and Hadda Cherroun: Rational Kernels for Arabic Text Classification

11:35 - 11:45 Break

11:45 - 13:00

Horia Cucu, Andi Buzo, Laurent Besacier, and Corneliu Burileanu: Statistical Error Correction Methods for Domain-Specific ASR Systems

Myung-Jae Kim, Il-Ho Yang, and Ha-Jin Yu: Histogram Equalization Using Centroids of Fuzzy C-Means of Background Speakers' Utterances for Speaker Identification

Layla El Asri, Romain Laroche, and Olivier Pietquin: Reward Shaping for Statistical Optimisation of Dialogue Management

13:00 - 14:30 Lunch

14:30 - 15:20

Samuel W. K. Chan and Mickey M. C. Chong: Predicting Part-of-Speech Tags and Morpho-Syntactic Relations using Similarity-based Technique

Nobal Niraula, Rajendra Banjade, Dan Ștefănescu, and Vasile Rus: Experiments with Semantic Similarity Measures based on LDA and LSA

15:20 - 15:30 Break

15:30 - 16:20 Yoshua Bengio: Deep Learning of Representations: Looking Forward (II) - Invited Tutorial

Tuesday, July 30:

9:00 - 9:50 Christof Monz: Challenges and Opportunities of Multilingual Information Access - Invited Lecture

9:50 - 10:20 Coffee Break

10:20 - 11:35

Akira Hayashi, Kazunori Iwata, and Nobuo Suematsu: Finding the Most Likely Upper Level State Sequence for Hierarchical HMMs

Jordan Rodu, Dean P. Foster, Weichen Wu, and Lyle H. Ungar: Using Regression for Spectral Estimation of HMMs

Amit Kirschenbaum: Unsupervised Segmentation for Different Types of Morphological Processes Using Multiple Sequence Alignment

11:35 - 11:45 Break

11:45 - 13:00

Abdessalam Bouchekif, Géraldine Damnati, and Delphine Charlet: Complementarity of Lexical Cohesion and Speaker Role Information for Story Segmentation of French TV Broadcast News

Markus Saers, Karteek Addanki, and Dekai Wu: Iterative Rule Segmentation under Minimum Description Length for Unsupervised Transduction Grammar Induction

Ngoc Thang Vu, Heike Adel, and Tanja Schultz: An Investigation of Code-Switching Attitude Dependent Language Modeling

13:00 - 14:30 Lunch

14:30 - 15:20

Hans Moen and Erwin Marsi: Cross-Lingual Random Indexing for Information Retrieval

Javad Nouri, Lidia Pivovarova, and Roman Yangarber: MDL-based Models for Transliteration Generation

15:20 - 15:30 Break

15:30 - 16:20

Sanja Štajner and Richard Evans: Can Statistical Tests Be Used for Feature Selection in Diachronic Text Classification?

Luis Trindade, Hui Wang, William Blackburn, and Niall Rooney: Factored Semantic Sequence Kernel for Sentiment Polarity Classification

17:30 Visit to the City

Wednesday, July 31:

9:00 - 9:50 Tanja Schultz: Multilingual Speech Processing with a special emphasis on Rapid Language Adaptation - Invited Lecture

9:50 - 10:20 Coffee Break

10:20 - 11:35

Fethi Bougares, Mickael Rouvier, Nathalie Camelin, Paul Deléglise, and Yannick Estève: An Investigation of Single-pass ASR System Combination for Spoken Language Understanding

Marwa Graja, Maher Jaoua, and Lamia Hadrich Belguith: Discriminative Framework for Spoken Tunisian Dialect Understanding

Bassam Jabaian, Fabrice Lefèvre, and Laurent Besacier: Generalization of Discriminative Approaches for Speech Language Understanding in a Multilingual Context

11:35 - 11:45 Break

11:45 - 13:00

Felix Stahlberg, Tim Schlippe, Stephan Vogel, and Tanja Schultz: Pronunciation Extraction from Phoneme Sequences Through Cross-Lingual Word-to-Phoneme Alignment

Stanisław Kacprzak and Mariusz Ziółko: Speech/Music Discrimination via Energy Density Analysis

Karteek Addanki and Dekai Wu: Unsupervised Rhyme Scheme Identification in Hip Hop Lyrics using Hidden Markov Models

13:00 Closing


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

STACS 2014 Call for Papers

*** Please forward to colleagues who might be interested ***

************************************************************************

STACS 2014 CALL FOR PAPERS


31st International Symposium on Theoretical Aspects of Computer Science



March 5 - March 8, 2014, Lyon, France


Submission Deadline: Sep 20, 2013 (23:59:59 GMT/UTC)


http://stacs2014.sciencesconf.org/


************************************************************************


SCOPE

*****

Authors are invited to submit papers presenting original and

unpublished research on theoretical aspects of computer

science. Typical areas include (but are not limited to):


* algorithms and data structures, including: parallel, distributed,

 approximation, and randomized algorithms, computational geometry,

 cryptography, algorithmic learning theory, analysis of algorithms;

* automata and formal languages, games;

* computational complexity, parameterized complexity, randomness in computation;

* logic in computer science, including: semantics, specification and

 verification, rewriting and deduction;

* current challenges, for example: natural computing, quantum

 computing, mobile and net computing.


PROGRAM COMMITTEE

*****************


- Edith Cohen, Microsoft Research (Silicon Valley)

- Samir Datta, Chennai Mathematical Institute

- Laurent Doyen, CNRS, LSV, École Normale Supérieure de Cachan

- Yuval Emek, Technion

- Kousha Etessami, University of Edinburgh

- Martin Hofmann, Ludwig-Maximilians-Universität München

- Stefan Kratsch, Technische Universität Berlin

- Jerzy Marcinkowski, Uniwersytet Wrocławski

- Wim Martens, Universität Bayreuth

- Ernst W. Mayr, TUM - Technische Universität München (co-chair)

- Gonzalo Navarro, Universidad de Chile

- Eldar Fischer, Technion

- Joachim Niehren, INRIA Lille

- Simon Perdrix, CNRS, Université de Grenoble

- Natacha Portier, École Normale Supérieure de Lyon (co-chair)

- Alex Rabinovich, Tel Aviv University

- Venkatesh Raman, The Institute of Mathematical Sciences, Chennai

- Heiko Röglin, Universität Bonn

- Nitin Saxena, Indian Institute of Technology Kanpur

- Sven Schewe, University of Liverpool

- Henning Schnoor, Christian-Albrechts-Universität zu Kiel

- Micha Sharir, Tel Aviv University

- Wojciech Szpankowski, Purdue University

- Ioan Todinca, Université d'Orléans

- Stéphane Vialette, Université de Marne-la-Vallée

- Marius Zimand, Towson University


INVITED SPEAKERS

****************

- Javier Esparza, TUM - Technische Universität München

- Peter Bro Miltersen, Aarhus University

- Luc Segoufin, INRIA, École Normale Supérieure de Cachan


TUTORIAL

********

Neeraj Kayal, Microsoft Research India: Arithmetic Circuit Complexity


SUBMISSIONS

***********

Authors are invited to submit a draft of a full paper with at most 12

pages. The usage of pdflatex and the LIPIcs style file (see below) are

mandatory; no changes to font size, page geometry etc. are permitted.

Submissions not in the correct format or submitted after the deadline

will not be considered.


The paper should contain a succinct statement of the issues and of

their motivation, a summary of the main results, and a brief

explanation of their significance, accessible to non-specialist

readers.  Proofs omitted due to space constraints must be put into an

appendix, to be read by the program committee members at their

discretion.


Simultaneous submission to other conferences with published

proceedings or to journals is not allowed.

PC members are excluded from submitting.


The submission site, which opens on June 15, 2013, is

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


PROCEEDINGS

***********

Accepted papers will be published in the proceedings of the symposium.

As usual, these proceedings will appear in the Leibniz International

Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl.

This guarantees perennial, free and easy electronic access, while the

authors retain the rights over their work.


In addition, the proceedings will also be available as archives in the

open access electronic repository HAL.


With their submission, authors consent to sign a license authorizing

the program committee chairs to organize the electronic publication of

their paper, provided the paper is accepted.


Further details are available on www.stacs-conf.org and will be on the

conference website, http://stacs2014.sciencesconf.org/


IMPORTANT DATES

***************

Submission website opens: Jun 15, 2013

Submission deadline: Sep 20, 2013 (23:59:59 GMT/UTC)

Notification: Dec 6, 2013

Final version due: Jan 8, 2014

Symposium: Mar 5-Mar 8, 2014


LIPICS STYLE FILES

******************

LIPIcs homepage: http://www.dagstuhl.de/en/publications/lipics

tar ball: http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz


CONTACT INFORMATION

*******************

stacs2014@sciencesconf.org  (for general information)

pc-chairs-stacs2014@easychair.org  (for information regarding paper submission)


Friday, June 14, 2013

[DMANET] CfP: Workshop on Distributed Cloud Computing

FIRST CALL FOR PAPERS

Workshop on
Distributed Cloud Computing (DCC)

https://sites.google.com/site/dcc2013workshop/

held in Dresden, Germany
December 9-12

co-located with 6th IEEE/ACM International Conference on Utility and Cloud
Computing (UCC)


DATES

Abstracts due: 14 July 2013

Submissions due: 21 July 2013

Notification of acceptance: 10 September 2013

Camera-ready papers due: 27 September 2013

WORKSHOP GOAL

The workshop is interdisciplinary and touches both distributed systems as
well as networking and cloud computing. It is intended as a forum where
people with different backgrounds can learn from their respective field and
expertise. We want to attract both industry relevant papers as well as
papers from academic researchers working on the foundations of the
distributed cloud.

DCC 2013 accepts high-quality papers related to the distributed cloud which
fall into at least one of the following categories:

- Novel ideas on how to design and operate/manage the distributed cloud

- Principles and foundations of distributed cloud computing; algorithmic
solutions (resource management, scheduling, embedding, elasticity,
brokering)

- Architectural models, prototype implementations and applications (content
distribution, games, social networks, scientific computing, business)

- Virtualization technology and enablers (network virtualization,
software-defined networking)

- Experience with existing deployments and measurements (private, public,
hybrid, federated, aggregated clouds)

- Service and resource specification, languages, and formal verification

- Economic, robustness, and energy aspects of the distributed cloud (e.g.,
pricing and service models)


SYNOPSIS

Most of the focus in public cloud computing technology over the last 10
years has been on deploying massive, centralized data centers with thousands
or hundreds of thousands of servers. The data centers are typically
replicated with a few instances on a continent wide scale in semi-autonomous
zones. This model has proven quite successful in economically scaling cloud
service, but it has some drawbacks. Failure of a zone can lead to service
dropout for tenants if the tenants do not replicate their services across
zones. Some applications may need finer grained control over network latency
than is provided by a connection to a large centralized data center, or may
benefit from being able to specify location as a parameter in their
deployment.
Nontechnical issues, such as the availability of real estate, power, and
bandwidth for a large mega data center, also enter into consideration.

Another model that may be useful in many cases is to have many micro or even
nano data centers, interconnected by medium to high bandwidth links, and the
ability to manage these data centers and interconnecting links as if they
were one larger data center. This distributed cloud model is perhaps a
better match for private enterprise clouds, which tend to be smaller than
the large, public mega data centers, and it also has attractions for public
clouds run by telcom carriers which have facilities in geographically
diverse locations, with power, cooling, and bandwidth already available. It
is attractive for mobile operators as well, since it provides a platform on
which applications can be deployed and easily managed that could benefit
from a tighter coupling to the wireless access network. The two models are
not mutually exclusive:
for instance a public cloud operator with many large data centers
distributed internationally could manage its network of data centers like a
distributed cloud. The distinguishing characteristic from federated clouds
is that the component data centers are more integrated, especially with
respect to authentication and authorization, so that the computation,
storage, and networking resources are as tightly managed as if they were in
a single large data center.

SUBMISSION AND PUBLICATION

Submissions are single-blind and should not exceed 6 pages in length (in
IEEE format). For an accepted paper, at least one author must attend the
workshop (all participants must pay the UCC 2013 workshop and conference
fee).

Submissions will be handled by EasyChair.

The DCC 2013 workshop proceedings will be published as part of the UCC 2013
proceedings volume.


CHAIRS

James Kempf, Ericsson Research, San Francisco, USA

Stefan Schmid, Telekom Innovation Laboratories (T-Labs) & TU Berlin, Germany


TPC:

Chen Avin, Ben Gurion Uni, Israel

Raouf Boutaba, Uni Waterloo, Canada

David Breitgand, IBM Research Haifa, Israel

Marco Canini, T-Labs & TU Berlin, Germany

Yvonne Coady, Uni Victoria, Canada

Paolo Costa, Microsoft Research Cambridge & Imperial College, United Kingdom

György Dán, KTH, Sweden

Xiaoming Fu, Uni Goettingen, Germany

Pan Hui, HKUST, Hong Kong

Holger Karl, Uni Paderborn, Germany

Wolfgang Kellerer, TU Munich, Germany

Hermann de Meer, Uni Passau, Germany

Ruben S. Montero, Universidad Complutense de Madrid, Spain

Djamel F. H. Sadok, UFPE, Brazil

Arunabha Sen, Arizona State University, USA

Srini Seetharaman, T-Labs Silicon Valley, USA

Azimeh Sefidcon, Ericsson Research, Sweden

Puneet Sharma, HP Labs Palo Alto, USA

Upendra Sharma, IBM T. J. Watson Research Center, USA

Soren Telfer, AT&T Palo Alto, USA

Benoit Tremblay, Ericsson Research, Canada

Christian Tschudin, Uni Basel, Switzerland

VENUE:

DCC 2013 will take place in the Dorint Hotel Dresden, in the center of the
lively capital of Saxony. Dresden offers much more than the historic center
with its opera house, the 'Semperoper', and the 'Frauenkirche' church.
Dotted along the approximately 30 km long stretch of the Elbe River which
runs through the city, you will find many treasures: castles, villas,
vineyards, historic funiculars, and steamboats that are up to 130 years old.
During the conference week, the 579th annual Striezelmarkt will welcome all
conference participants for a unique artisanal and culinary experience.



**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] WAW 2013 --- 2nd Call for Papers

Call for Papers---10th Workshop on Algorithms and Models for the Web
Graph (WAW 2013)

http://www.math.ryerson.ca/waw2013/

The 10th Workshop on Algorithms and Models for the Web Graph (WAW 2013)
will take place at Harvard University, December 15-16, 2013. This is an
annual meeting, which is traditionally co-located with another, related,
conference. WAW 2013 will be co-located with the Workshop on Internet &
Network Economics (WINE 2013).

The list of plenary speakers of WAW 2013 includes:
- Alan Frieze [Carnegie Mellon University]
- Jukka-Pekka Onnela [Harvard University]

WAW 2013 invites original research papers on all aspects of algorithmic
and mathematical research in the areas pertaining to the World-Wide Web,
especially papers that espouse the view of complex data as networks.
Submissions are invited in, but not limited to, the following areas:
- Algorithms: graph algorithms, clustering, collaborative filtering.
- Analysis: structural properties, visualization, patterns, communities,
discovery.
- Data Models: graph models, evolution, trust and reputation networks.
- Topics: Web, social networks, recommender networks, citation networks,
Wikipedia, biological networks, blogs, p2p.
- Applications: web mining, social applications, web search and ranking.

Important Dates:
- Full paper submission: August 1, 2013
- Notification of acceptance: September 1, 2013
- Final version due: October 1, 2013

The papers must be formatted according to Springer LNCS style. The
maximum length of papers is at most 12 pages. The workshop proceedings
will be published as a Springer LNCS volume. Selected papers from the
workshop will be invited to a special issue of Internet Mathematics.

We are looking forward to seeing you at Harvard,

Organizing Committee
Anthony Bonato (Ryerson University)
Michael Mitzenmacher (Harvard University)
Pawel Pralat (Ryerson University)

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] LMS-EPSRC short instructional course on random graphs, geometry and asymptotic structure (19-23 August 2013)

This is the second announcement of a short course on aspects of the theory of random structures that will take place at the School of Mathematics, University of Birmingham this summer.

Title: LMS-EPSRC short instructional course on Random Graphs, Geometry and Asymptotic Structure

Dates: 19 - 23 August 2013

Venue: University of Birmingham

Lecturers: Michael Krivelevich (Tel Aviv University)
Konstantinos Panagiotou (Ludwig-Maximilians-Universität, München)
Mathew Penrose (University of Bath)

Special guest speaker: Colin McDiarmid (University of Oxford)

Organizers: Nikolaos Fountoulakis and Dan Hefetz (University of Birmingham)

Application deadline: 8 July 2013 (notification of acceptance will be sent within two weeks after the deadline)

This short course is aimed at research students, post-docs and those working in industry. The number of participants is restricted and a successful application is necessary for an invitation. An application form can be found here: http://www.surveymonkey.com/s/3CDNQ6L

Registration fees:

UK-based students: £100
UK-based postdoctoral fellows: £250 (registration) + £150 (subsistence)
Everyone else: £250 (registration) + £300 (subsistence)

The above fees will cover accommodation costs as well as breakfasts, lunches and coffee breaks.


The objectives of this course are two-fold:

1. to provide an introduction to recent developments and techniques for classical problems in the theory of random graphs;

2. to cover geometric and topological aspects of the theory of random graphs and introduce participants to the diversity and the depth of the combinatorial, probabilistic and analytical methods that have been invented in this context.

The three main lecture course topics are:

. Long paths and hamiltonicity in random graphs (M. Krivelevich, Tel Aviv University)

. Random graphs from restricted classes (K. Panagiotou, Ludwig-Maximilians-Universität)

. Random geometric graphs (M. D. Penrose, University of Bath)

There will also be a special guest lecture: Random planar graphs (C. McDiarmid, University of Oxford)

Additional information can be found here: http://web.mat.bham.ac.uk/combinatorics/LMS-EPSRC/index.html
as well as through the LMS webpage: http://www.lms.ac.uk/events/forthcoming-short-courses

The generous financial support of the LMS and the EPSRC is kindly acknowledged.

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Ph.D. position available, University of Avignon, France

Dear all,

The University of Avignon is seeking good candidates for a Ph.D.
position (starting October 2013). The position is granted by the
Provence-Alpes-Côte d'Azur Region and is related to the development
and use of Optimization techniques to Urban development and planning.
The candidate will be part of a larger project on "Smart Cities",
granted by the French Government (thanks to the PREDIT organization).
The project is held by two research teams of the University: the
Laboratoire d'Informatique d'Avignon (http://lia.univ-avignon.fr/)and
UMR ESPACE (UMR 7300, http://www.umrespace.org/). Both laboratories
have received the best possible evaluation from French Research
Agencies.

The chosen candidate will receive 1300 Euros (with a teaching task) or
1100 Euros (without a teaching task) monthly and will be a member of
the two research teams. As a consequence, he will have full access to
all the facilities provided by the university (an office shared with
other researchers, desk, computer, email account, library, French
courses, help with installation etc.)

Interested candidates are invited to send a CV, a short cover letter,
and one recommendation letter before July 7, to the three persons
mentioned below. The application package should be sent by email to
all three persons mentioned below. Interested candidates can also get
more information and establish a contact, either by telephone or via
email:

Philippe Michelon, LIA and UMR Espace,
philippe.michelon@univ-avignon.fr, 334 90 84 35 16
Cyrille Genre-Grandpierre, UMR Espace,
cyrille.genre-grandpierre@univ-avignon.fr, 334 90 16 26 94
Serigne Gueye, LIA, serigne.gueye@univ-avignon.fr, 334 90 83 35 52

Kindest regards,

--
Philippe Michelon
Professeur

Université d'Avignon et des Pays de Vaucluse
CERI/LIA

tel : 33/0 4 90 84 35 16

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Groups St Andrews 2013: deadlines approaching

Dear Colleagues

This is a brief update on preparations for Groups St Andrews 2013.

The website has been substantially updated, and now contains an outline academic programme, as well as much more information about the social programme. There's also travel information, and much else besides. Please see

http://www.groupsstandrews.org/2013/index.shtml.

Various conference deadlines are approaching!

- 30th June is the deadline for submitting an abstract for a contributed talk.
- 1st July is the deadline for submitting an article to the Proceedings.
- 12th July is the deadline for booking accommodation via the University of St Andrews.

We look forward to seeing you all in St Andrews in August

The Organisers

The University of St Andrews is a charity registered in Scotland : No SC013532


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Call for industrial track papers - SustainIT 2013 (paper registration deadline June 30)

-------------------------------------------------------------------
*** Our apologies if you receive multiple copies of this e-mail ***
-------------------------------------------------------------------

CALL FOR INDUSTRIAL TRACK PAPERS

The Third IFIP Conference on
Sustainable Internet and ICT for Sustainability
(SustainIT 2013)

http://www.dicgim.unipa.it/networks/sustainit2013

October 30-31, 2013
Palermo, Sicily, Italy

- Technically sponsored by the IFIP TC6 WG 6.3 (Performance of
Communication Systems)
- Technically co-sponsored by IEEE TCCC
(Technical Committee on Computer Communications)
- In cooperation with IEEE TSGCC (Technical Subcommittee on Green
Communications and Computing)
- Supported by EINS: The Network of Excellence in Internet Science

------------------------------------------------------------------------
SCOPE AND OVERVIEW
------------------------------------------------------------------------

SUSTAINIT 2013 will feature an industrial track providing a forum for researchers and developers from academia, industry, and government to interact and share latest research results achieved by national and international projects on the areas of Sustainable Internet and ICT for Sustainability. Towards this goal, SUSTAINIT seeks participations from all three entities. The industrial track offers the opportunity to present the latest findings by ongoing projects or the overview of recently approved projects. Industrial track paper submissions are
welcome in all aspects of Sustainable Internet and ICT for Sustainability, including algorithms, protocols, applications, hardware and tools, new research prototypes, testbeds, etc. Authors are asked to submit a paper of up to 5 pages (including figures, tables, and references) (one additional page is allowed upon a fee payment). The paper should highlight the main contributions and describe the details of the project, with a focus on the interaction with the audience and highlighting the environmental sustainability benefits either achieved or targeted. Please refer to the Submission Instructions below for more details.


IMPORTANT DATES
------------------------------------------------------------------------
- Industrial track paper registration deadline: June 30, 2013
- Industrial track paper submission deadline: July 5, 2013
- Acceptance/Reject notification: July 20, 2013
- Camera-ready version due: August 5, 2013


INDUSTRIAL TRACK PAPER SUBMISSION
------------------------------------------------------------------------

Papers must be submitted electronically in PDF format through EDAS (http://edas.info/newPaper.php?c=14317). Manuscripts must be formatted in accordance with the IEEE Computer Society author guidelines (http://edas.info/newPaper.php?c=14317). Industrial track papers must be limited to 5 pages (one additional page is allowed upon a fee payment), single spacing, double column, and must strictly adhere to the template format. Detailed instructions for manuscript preparation and submission are available on the conference website
(http://www.dicgim.unipa.it/networks/sustainit2013/submission.html).

FOR MORE INFORMATION
------------------------------------------------------------------------
For questions about the industrial track paper submission and review process, please contact the SUSTAINIT 2013 Industrial Track Co-Chairs:

Maria Cristina Bueti, International Telecommunication Union (ITU) -
cristina (dot) bueti (at) itu (dot) int
Luca Valcarenghi, Scuola Superiore Sant'Anna, luca (dot) valcarenghi
(at) sssup (dot) it
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] JCDCGG2013

--- 2nd Call For Papers ---

The 16th Japan Conference on Discrete and Computational Geometry and
Graphs (JCDCG^2 2013)

Date: September 17--19, 2013
Conference Site: Tokyo University of Science (Kagurazaka Campus, Tokyo)
http://www.tus.ac.jp/en/campus/kagurazaka.html
Web Site:
http://www.ried.tokai.ac.jp/JCDCGG_2013/
Submission Deadline: June 28, 2013

----

The 16th Japan Conference on Discrete and Computational Geometry and
Graphs (JCDCG^2 2013) will be held on September 17-19, 2013 at Tokyo
University of Science, Tokyo, Japan (a different venue than in the
past). The previous conferences were held in Tokyo as JCDCG 1997,
1998, 1999, 2000, 2002, 2004, 2006, 2011 (Japan Conference on Discrete
and Computational Geometry; including domestic conferences); in Kyoto
as KyotoCGGT 2007 (Kyoto International Conference on Computational
Geometry and Graph Theory); and in Kanazawa as JCCGG 2009 (Japan
Conference on Computational Geometry and Graphs). Other conferences in
this series were also held in the Philippines (2001), Indonesia
(2003), China (2005, 2010), and Thailand (2012).

Topics of interest include but are not limited to:
- discrete geometry
- computational geometry
- graph theory
- graph algorithms
- algorithms and data structures
- exact or approximation algorithms
- combinatorial optimization
- randomized algorithms
- recreational mathematics

The collection of abstracts will be distributed on the site of the
conference.

Submission format: Authors are required to submit an extended abstract
of at most 2 pages in a standard 10-point font on A4-paper through the
submission website:

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

*** Note ***: Please write the name of the (expected) speaker in the
Abstract field of the submissions page.


************ NEW *************
Post-conference proceedings: A post-conference proceedings, which
consists of full papers of the talks in this conference, will be
published as a volume of Lecture Notes in Computer Science (LNCS,
Springer-Verlag). Papers will be strictly refereed in keeping with the
standards of LNCS. The submission deadline is planning to be after the
conference. Details will be announced later.
************ NEW *************


Important Dates:
- Extended-Abstract Submissions Deadline: June 28, 2013 (JST)
- Notification: July 24, 2013
- Early Registration: August 16, 2013 (GMT)
- Conference: September 17 -- 19, 2013

Invited Plenary Speakers:
- Sergey Bereg (University of Texas at Dallas, USA)
- Erik Demaine (MIT, USA)
- Ferran Hurtado (Universitat Politecnics de Catalunya, Spain)
- Ken-ichi Kawarabayashi (NII and JST ERATO Kawarabayashi Large Graph
Project, Japan)
- David Kirkpatrick (University of British Columbia, Canada)
- Stefan Langerman (Universite Libre de Bruxelles, Belgium )
- Janos Pach (EPFL, Switzerland and Renyi Institute, Hungary)
- Kokichi Sugihara (Meiji University, Japan)
- Jorge Urrutia (Universidad Nacional Autonoma de Mexico, Mexico)

Conference Chair:
- Jin Akiyama (Tokyo University of Science, Japan)

Program Co-Chairs:
- Hiro Ito (The University of Electro-Communications, Japan)
- Akira Saito (Nihon University, Japan)

Organizing Chair:
- Toshinori Sakai (Tokai University, Japan)

Program Committee:
- Hiro Ito (The University of Electro-Communications, Japan, co-chair)
- Akira Saito (Nihon University, Japan, co-chair)
- Hiroyoshi Miwa (Kwansei Gakuin University, Japan)
- Chie Nara (Tokai University, Japan)
- Yoshio Okamoto (The University of Electro-Communications, Japan)
- Toshinori Sakai (Tokai University, Japan)
- Yushi Uno (Osaka Prefecture University, Japan)

Web Site:
http://www.ried.tokai.ac.jp/JCDCGG_2013/

HIRO ITO and AKIRA SAITO, JCDCG^2 2013 PC co-chairs
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Call for Abstracts - Topological Methods in Complexity Science (ECCS 2013)

Call for Abstracts

Topological Methods in Complexity Science (Satellite of the European
Conference on Complexity Science 2013)

Satellite website: http://toposys.org/tmcs2013/

Main conference website: http://www.eccs13.eu/

We invite contributions in the form of extended abstracts not
exceeding 4 pages (excluding references). The topics include but are
not limited to

-Mesoscopic analysis of complex networks
-Topological foundations of complex systems
-Applications of topological methods to complex systems
-New topological techniques

The workshop welcomes any relevant contribution in the area of
computational/applied topology and applications of topological
techniques to understanding complex systems. These include new
application areas, new techniques to specific applications or new
interpretations of existing results.

There will be no formal proceedings though the abstracts will be made
available online.

Important Dates:

Deadline for abstracts: August 1, 2013
Notification of acceptance: August 14, 2013
Date of Workshop: September 18, 2013
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Thursday, June 13, 2013

[DMANET] SPAA & PODC early registration ends on June 21

(apologies for crosspostings)

The 32nd ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2013)
http://www.podc.org

and the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
http://www.spaa-conference.org

will be colocated in Montreal, Quebec, Canada, July 22-25.

Early registration deadline is June 21. Later registrations will be $75-$130 more expensive.
Cut-off date for room reservations at conference rates is June 30.

Please visit the conference pages for further information and registration.

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************