dmanet Digest, Vol 79, Issue 13

Send dmanet mailing list submissions to
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. Presburger Award for Young Scientists 2015: Call for
nominations (Peter Widmayer)
2. LSSC'2015 conference (stefka fidanova)
3. ISAAC 2014 -- Call for Participation (Hee-Kap Ahn)
4. CfP AAAI-15 Workshop on Planning, Search, and Optimization:
PlanSOpt (Thorsten Koch)
5. PhD position at University of Kassel in Computational
Mathematics/Applied Discrete Optimization (Andreas Bley)
6. SLSP 2014: call for participation (GRLMC)


----------------------------------------------------------------------

Message: 1
Date: Fri, 19 Sep 2014 11:44:11 +0200
From: Peter Widmayer <widmayer@inf.ethz.ch>
To: <DMANET@zpr.uni-koeln.de>
Subject: [DMANET] Presburger Award for Young Scientists 2015: Call for
nominations
Message-ID: <541BFAEB.6010603@inf.ethz.ch>
Content-Type: text/plain; charset="UTF-8"; format=flowed


Presburger Award for Young Scientists 2015

Call for Nominations

Deadline: December 31st, 2014

Starting in 2010, the European Association for Theoretical Computer Science
(EATCS) established the Presburger Award. The Award is conferred annually
at the International Colloquium on Automata, Languages and Programming
(ICALP) to a young scientist (in exceptional cases to several young
scientists)
for outstanding contributions in theoretical computer science,
documented by a
published paper or a series of published papers. The Award is named after
Mojzesz Presburger who accomplished his path-breaking work on
decidability of the
theory of addition (which today is called Presburger arithmetic) as a
student in
1929.

Nominations for the Presburger Award can be submitted by any member or
group of members of the theoretical computer science community except
the nominee
and his/her advisors for the master thesis and the doctoral
dissertation. Nominated
scientists have to be at most 35 years at the time of the deadline of
nomination
(i.e., for the Presburger Award of 2015 the date of birth should be in 1979
or later). The Presburger Award Committee of 2015 consists of Zoltan
Esik (Szeged),
Claire Mathieu (Paris), and Peter Widmayer (Zu?rich, chair). Nominations,
consisting of a
two page justification and (links to) the respective papers, as well as
additional
supporting letters, should be sent by e-mail to:

Peter Widmayer
widmayer@inf.ethz.ch <mailto:widmayer@inf.ethz.ch>

The subject line of every nomination should start with Presburger Award
2015,
and the message must be received before December 31st, 2014.

The award includes an amount of 1000 Euro and an invitation to ICALP 2015
for a lecture.

PreviousWinners:
Miko?aj Bojanczyk, 2010
Patricia Bouyer-Decitre, 2011
Venkatesan Guruswami and Mihai Patrascu, 2012
Erik Demaine, 2013
David Woodruff, 2014

Official website: http://www.eatcs.org/index.php/presburger


------------------------------

Message: 2
Date: Fri, 19 Sep 2014 14:26:22 +0300
From: stefka fidanova <stefka.fidanova@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] LSSC'2015 conference
Message-ID:
<CAAL360vbOstZ15kObtuKLkP_OSwX7VKaadEPtfa4c__fABHSzA@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

Dear Colleague,

On behalf of the Organizing Committee, we invite you to participate in
the special session (workshop) on "APPLICATIONS OF METAHEURISTICS TO
LARGE-SCALE PROBLEMS" at the 9th International Conference on Large
Scale Scientific Computation - LSSC'13, June 8 - 12, 2015, Sozopol,
Bulgaria, with arrival: June 7 and departure: noon June 12.

The session is organized by:
Assoc. Prof. Stefka Fidanova (stefka@parallel.bas.bg)
from the Institut of Information and Communication Technologies
(former Institute for Parallel Processing), Bulgarian Academy of
Sciences and
Gabriel Luque (gabriel@lcc.uma.es) from University of Malaga, Spain.

Topics

The list of topics includes, but is not limited to:

combinatorial optimization
global optimization
multiobjective optimization
optimization in dynamic and/or noisy environments
large scale optimization
parallel and distributed approaches in optimization
random search algorithms,
simulated annealing,
tabu search
other derivative free optimization methods
nature inspired optimization methods (evolutionary algorithms, ant
colony optimization, particle swarm optimization, immune artificial
systems etc)
hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
optimization methods for learning processes and data mining
computational optimization methods in statistics, econometrics,
finance, physics, medicine, biology, engineering etc


Proceedings
We plan to continue publishing the proceedings of only refereed and
presented papers as a special volume of Springer Lecture Notes in
Computer Science (LNCS).

Important deadlines
Deadline for submission of abstracts
January 15, 2015
Notification of acceptance of the talks on the basis of the
submitted abstract
January 31, 2015
Deadline for submission of full papers
March 15, 2015
Notification of acceptance of full papers
April 30, 2015


Abstracts and contributed papers
The abstracts (up to 1 page stating clearly the originality of the
results) are to be written in standard LaTeX. The length of the
contributed papers is limited up to 8 pages. It is assumed that one
participant will present not more than one talk.

Send the abstracts and papers to special session organizers and
conference organizers, indicating the name of the special session.
After sending the abstract go to the conference web page and fill in
the registration form (personal data of the participants, minimum one
per paper, and the name of the special session).

Information about abstract and paper preparation, accommodation,
transportation, registration form and conference location you can find
at the conference web page
http://parallel.bas.bg/Conferences/SciCom15/


Special session organizers
Prof. Stefka Fidanova
Prof. Gabriel Luque

--
Assoc. Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642


------------------------------

Message: 3
Date: Fri, 19 Sep 2014 23:28:42 -0400
From: Hee-Kap Ahn <heekap@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] ISAAC 2014 -- Call for Participation
Message-ID:
<CAAUepCgONi5v2h9mo9brMocqOG=gFAFQSitw0MP6whZA9rMohA@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

The 25th International Symposium on Algorithms and Computation (ISAAC 2014)

December 15 - 17, 2014, Jeonju, Korea
http://tcs.postech.ac.kr/isaac2014

We are pleased to announce that ISAAC 2014 Registration is open:
http://tcs.postech.ac.kr/isaac2014/registration.html

Early Registration Deadline: October 17, 2014 23:59 Honolulu Time.

Information on Transportation and Hotels will be available soon at
http://tcs.postech.ac.kr/isaac2014

We hope to see you in Jeonju!


------------------------------

Message: 4
Date: Sat, 20 Sep 2014 19:26:13 +0200
From: Thorsten Koch <koch@zib.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CfP AAAI-15 Workshop on Planning, Search, and
Optimization: PlanSOpt
Message-ID: <541DB8B5.7050802@zib.de>
Content-Type: text/plain; charset=ISO-8859-1

CALL FOR PAPERS

================================================================
AAAI-15 Workshop on Planning, Search, and Optimization: PlanSOpt

Austin, Texas, 25-26 January 2015

http://org.nicta.com.au/plansopt-15

Submission deadline: October 14, 2014

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

Mainstream AI planning and heuristic search have traditionally been
concerned with finding paths through a state transition system. The
objective is typically to find either a feasible solution or an
optimal solution to a fairly restricted objective function (e.g.,
minimize plan length or the sum of the costs of actions in a plan).

While there have been pioneering efforts at using optimization for
planning (notably in compilation approaches to mixed integer
programming and constraint programming), there has been significant
renewed interest in a number of areas, including:

- formulating heuristic generation and selection as an optimization
problem

- linear programming as a basis for search heuristics in classical
planning

- hybridization of optimization approaches (e.g,. linear, mixed
integer linear, constraint, and non-linear programming) and
planning to solve more expressive problems involving time,
resources, and complex systems (e.g., the electricity grid)

- adaptation of optimization methods to design planning and search
algorithms that continually improve plan quality as time permits

The goal of this workshop is to bring together researchers in AI
planning, search, and optimization to investigate both problems and
solution approaches. We encourage applications of optimization
technology to planning/search problems, applications of traditional
planning/search technology (e.g., variations of A* search) to
optimization problems, and hybrid approaches that combine planning and
optimization.

SUGGESTED TOPICS

- Planning with time and/or resources
- Planning over complex systems
- Optimization over complex systems
- Optimization-based search heuristics
- Optimization techniques for planning and search (e.g. local search)
- Decomposition approaches for planning and search (e.g. column
generation, Benders Decomposition/Planning Modulo Theory)
- Anytime plan quality optimization
- AI-style search for optimization problems and solvers
- Reasoning about complex objective functions (e.g. requiring
multi-objective, bi-level, robust, or adversarial optimization or
search)
- Understanding, comparing, and combining the modelling approaches
from AI and optimization
- Hybrid and cross-over applications
- Comparing planning/search and optimization approaches on problems to
which both are applicable
- Search algorithms for graphical models, in particular weighted
counting and constraint satisfaction queries
- Exploitation of symmetries in search, in particular comparison of
such approaches in CP, MIP, and counting queries

WORKSHOP FORMAT

The workshop will include invited talks, presentations of accepted
contributions, and discussion. It will also feature tutorials about
planning and search for optimization researchers and about optimization
for planning and search researchers. It is expected that attendees
will have open minds and will engage in discussions in the spirit of
developing a mutual understanding of both problems and solution
approaches of interest to all backgrounds.

SUBMISSIONS

Papers should be accessible to researchers from AI planning, search,
and optimization. Work that only focuses on AI planning or search
without an aspect of optimization are not suitable. Conversely,
however, as our goal is to attract researchers from optimization, work
that is focused on optimization but that introduces problems or uses
techniques that the authors believe are of interest to the AI planning
and search communities are expressly encouraged.

Two paper formats are solicited:
- full-length papers (up to 8 pages in AAAI format)
- challenge or position papers (2 pages in AAAI format).

Papers should be submitted in PDF to EasyChair. All papers will be peer
reviewed.
Paper Submission website:
https://easychair.org/conferences/?conf=plansopt2015

IMPORTANT DATES

Submission: October 14, 2014
Notification: November 14, 2014
Final paper: November 25, 2014
Early Registration: November 28, 2014
Late Registration: January 2, 2014
Workshop: 25-25 January, 2015

ORGANIZING COMMITTEE

J. Christopher Beck (University of Toronto)
Robert Holte (University of Alberta)
Thorsten Koch (TU Berlin / Zuse Institute Berlin)
Sylvie Thiebaux (Australian National University & NICTA)

PROGRAM COMMITTEE

Peter van Beek (University of Waterloo)
John Chinneck (Carleton University)
Amanda Coles (Kings College London)
Rina Dechter (University of Calfornia, Irvine)
Stefan Edelkamp (University of Bremen)
Alex Fukunaga (University of Tokyo)
Malte Helmert (University of Basel)
Laurent Michel (University of Connecticut)
Gilles Pesant (Ecole Polytechnique, Montreal)
Ted Ralphs (Lehigh University)
Chris Rayner (University of Alberta)
Dan Steffy (Oakland University)
Wheeler Ruml (University of New Hampshire)


------------------------------

Message: 5
Date: Mon, 22 Sep 2014 14:04:15 +0200
From: Andreas Bley <andreas.bley@mathematik.uni-kassel.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] PhD position at University of Kassel in
Computational Mathematics/Applied Discrete Optimization
Message-ID:
<07FE8350-CD75-46F0-8DA2-991A3B3FD0A6@mathematik.uni-kassel.de>
Content-Type: text/plain; charset=windows-1252

==========================================
PhD position in Computational Mathematics/Applied Discrete Optimization, University of Kassel
==========================================

The Department of Mathematics and Natural Sciences at the University of Kassel
invites applications for a

PhD student position in Computational Mathematics/Applied Discrete Optimization
- fixed-term full-time research assistant (100% E13 TV-H) -
for 3 years, starting as soon as possible (from 01-Oct-2014 onwards)

within the BMBF funded project ?North Sea Offshore and Storage Network (NSON): Mathematical Methods for Network Design". The position is a fixed-term position for the duration of the project, contingent on the final approval of the project.

The position is subject to the usual regulations according to Hessian law. The official German announcement is available on

http://www.uni-kassel.de/intranet/aktuelles/stellenangebote/stellenausschreibung-details/tx_ukstellenausschreibung/24159.html

We are looking for a PhD student who is or wishes to specialize in computational and applied discrete optimization. The successful candidate will participate in the development and the implementation of mathematical models and algorithms to solve difficult and large-scale optimization problems arising in the planning of energy networks.

The position will be located in the group for "Computational Mathematics/Applied Discrete Optimization" at the University of Kassel. The group's research focus is on combinatorial optimization, integer programming, network optimization, and scheduling and their application in practice.

Candidates must hold a diploma/master's degree in mathematics or computer science and should have very strong background in computational integer programming and combinatorial optimization. Good command of C++ or an equivalent programming language is required. Experience in solving difficult real-world application problems is desirable.

Applicants should send their application containing:
- cover and motivation letter, with the job reference number 24159
- curriculum vitae
- copies of diplomas
- summary of Masters thesis (or Doctoral) thesis (max. 3 pages in English or German)

by

*September 29, 2014* (yet, applications will be considered as long as the position is still free)

either via mail to the

President of the University of Kassel
34109 Kassel

or, preferably, via email as a *single pdf file* to

bewerbungen@uni-kassel.de

For further information please contact Prof. Dr. Andreas Bley, andreas.bley@mathematik.uni-kassel.de


Prof. Andreas Bley
Institut f?r Mathematik
Computational Mathematics / Angewandte Diskrete Mathematik
Universit?t Kassel
Heinrich-Plett-Str. 40
34132 Kassel
Germany
Tel: +49 561 804 4650
Fax: +49 561 804 4646
E-Mail: andreas.bley@mathematik.uni-kassel.de




------------------------------

Message: 6
Date: Sat, 20 Sep 2014 18:18:34 +0200
From: "GRLMC" <grlmc@urv.cat>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] SLSP 2014: call for participation
Message-ID: <F7C0B91396DE4776AA82F36E9A4C4EA4@Carlos1>
Content-Type: text/plain; charset="UTF-8"

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

2nd INTERNATIONAL CONFERENCE ON STATISTICAL LANGUAGE AND SPEECH PROCESSING

SLSP 2014

Grenoble, France

October 14-16, 2014

Organised by:

?quipe GETALP
Laboratoire d?Informatique de Grenoble

Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University

http://grammars.grlmc.com/slsp2014/

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

PROGRAM


Tuesday, October 14


9:00 - 10:00 Registration

10:00 - 10:15 Opening

10:15 - 11:05 Roger K. Moore: Spoken Language Processing: Time to Look Outside? - Invited Lecture

11:05 - 11:35 Coffee Break

11:35 - 12:50

Georgios Kontonatsios, Claudiu Mihaila, Ioannis Korkontzelos, Paul Thompson, and Sophia Ananiadou: A Hybrid Approach to Compiling Bilingual Dictionaries of Medical Terms from Parallel Corpora

Wei Liu, Zhipeng Chang, and William J. Teahan: Experiments with a PPM Compression-based Method for English-Chinese Bilingual Sentence Alignment

Chi-kiu Lo and Dekai Wu: BiMEANT: Integrating Cross-lingual and Monolingual Semantic Frame Similarities in the MEANT Semantic MT Evaluation Metric

12:50 - 14:20 Lunch

14:20 - 15:35

Mathias Verbeke, Vincent Van Asch, Walter Daelemans, and Luc De Raedt: Lazy and Eager Relational Learning using Graph-Kernels

Mohamed Amine Boukhaled, and Jean-Gabriel Ganascia: Probabilistic Anomaly Detection Method for Authorship Verification

Uli Fahrenberg, Fabrizio Biondi, Kevin Corre, Cyrille Jegourel, Simon Kongshj, and Axel Legay: Measuring Global Similarity between Texts

16:00 - 18:00 Touristic visit


Wednesday, October 15


9:00 - 9:50 Claire Gardent: Syntax and Data-to-Text Generation - Invited Lecture

9:50 - 10:05 Break

10:05 - 11:20

Borb?la Sikl?si and Attila Nov?k: Identifying and Clustering Relevant Terms in Clinical Records Using Unsupervised Methods

Amine Abdaoui, J?r?me Az?, Sandra Bringay, Natalia Grabar, and Pascal Poncelet: Predicting Medical Roles in Online Health Fora

Ekaterina Pronoza, Elena Yagunova, and Svetlana Volskaya: Corpus-based Information Extraction and Opinion Mining for the Restaurant Recommendation System

11:20 - 11:50 Coffee Break and Group Photo

11:50 - 13:05

Ra?l Ernesto Gutierrez de Pi?erez Reyes and Juan Francisco D?az-Fr?as: Informal Mathematical Discourse Parsing with Conditional Random Fields

Waad Ben Kheder, Driss Matrouf, Pierre-Michel Bousquet, Jean-Fran?ois Bonastre and Moez Ajili: Robust Speaker Recognition Using MAP Estimation of Additive Noise in i-vectors Space

Arseniy Gorin and Denis Jouvet: Structured GMM Based on Unsupervised Clustering for Recognizing Adult and Child Speech

13:05 - 14:35 Lunch

14:35 - 16:35 Visit to the Domus apartment


Thursday, October 16


9:00 - 9:50 Martti Vainio: Phonetics and Machine Learning: Hierarchical Modelling of Prosody in Statistical Speech Synthesis - Invited Lecture

9:50 - 10:05 Break

10:05 - 11:20

G?bor Kiss and Kl?ra Vicsi: Physiological and Cognitive Status Monitoring on the Base of Acoustic-phonetic Speech Parameters

Barbara Schuppler, Sebastian Grill, Andr? Menrath, and Juan A. Morales-Cordovilla: Automatic Phonetic Transcription in Two Steps: Forced Alignment and Burst Detection

Mian Du, Matthew Pierce, Lidia Pivovarova, and Roman Yangarber: Supervised Classification using Balanced Training

11:20 - 11:50 Coffee Break

11:50 - 13:05

M?rius ?ajgal?k, Michal Barla, and M?ria Bielikov?: Exploring Multidimensional Continuous Feature Space to Extract Relevant Words

Zhemin Zhu, Djoerd Hiemstra, and Peter Apers: Linear Co-occurrence Rate Networks (L-CRNs) for Sequence Labeling

Th?odore Bluche, Hermann Ney, and Christopher Kermorvant: Handwriting Recognition with Deep and Recurrent Neural Networks

13:05 - 13:15 Closing


---
Este mensaje no contiene virus ni malware porque la protecci?n de avast! Antivirus est? activa.
http://www.avast.com




------------------------------

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 79, Issue 13
**************************************