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. SCSS 2014: Deadline extension (Temur Kutsia)
2. Autumn School: Approximation Algorithms for Stochastic
Optimization (near Berlin, 09/29-10/01) (Nicole Megow)
----------------------------------------------------------------------
Message: 1
Date: Tue, 24 Jun 2014 19:06:26 +0200
From: Temur Kutsia <kutsia@risc.jku.at>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] SCSS 2014: Deadline extension
Message-ID: <53A9B012.1040007@risc.jku.at>
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
[Please post - apologies for multiple copies.]
Deadline Extension
================================================
SCSS 2014
Symbolic Computation in Software Science
6th International Symposium
Gammarth, La Marsa, Tunisia, December 7-11, 2014
http://www.easychair.org/smart-program/SCSS2014/
================================================
Important Dates
---------------
July 7, 2014: Abstract submission deadline (extended)
July 14, 2014: Paper submission deadline (extended)
August 25, 2014: Notification
September 22, 2014: Camera-ready copy deadline
December 7-11, 2014: SCSS 2014 in Gammarth
Scope
--------
The purpose of SCSS 2014 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 2014 solicits both regular and tool 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 security
- termination analysis and complexity analysis of algorithms (programs)
- extraction of specifications from algorithms (programs)
- 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
Invited Speakers
----------------
Nikolaj Bjorner (Microsoft Research)
William M. Farmer (McMaster University)
Program Chairs
--------------
Temur Kutsia (RISC, Johannes Kepler University Linz, Austria)
Andrei Voronkov (University of Manchester, UK)
Program Committee
------------------
Elvira Albert (Complutense University of Madrid, Spain)
Adel Bouhoula (Higher School of Communications of Tunis, Tunisia)
James H. Davenport (University of Bath, UK)
Roberto Giacobazzi (University of Verona, Italy)
Arie Gurfinkel (Carnegie Mellon University, USA)
Nao Hirokawa (JAIST, Japan)
Tetsuo Ida (University of Tsukuba, Japan)
Florent Jacquemard (INRIA - IRCAM, France)
Laura Kovacs (Chalmers University of Technology, Sweden)
Temur Kutsia (RISC, Johannes Kepler University Linz, Austria) - chair
Ali Mili (New Jersey Institute of Technology, USA)
Joel Ouaknine (Oxford University, UK)
Ruzica Piskac (Yale University, USA)
Andrei Voronkov (University of Manchester, UK) - chair
Dongming Wang (Beihang University, China and UPMC-CNRS, France)
General Chairs
---------------
Adel Bouhoula (Higher School of Communications of Tunis, Tunisia)
Tetsuo Ida (University of Tsukuba, Japan)
Local Chair
-----------
Mohamed Becha Kaaniche (University of Carthage, Tunisia)
Submission
----------
Submission is via EasyChair:
https://www.easychair.org/conferences/?conf=scss2014
Submissions are invited in two categories: regular research papers and
tool papers.
- Regular research papers must not exceed 12 pages in the EasyChair
Class format, with up to 3 additional pages for technical appendices.
- Tool papers must not exceed 6 pages in the EasyChair Class format.
Publication
----------
The proceedings will be published in the EasyChair Proceedings in
Computing. We plan also to have a special issue of the Journal of
Symbolic Computation on SCSS 2014. 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.
------------------------------
Message: 2
Date: Wed, 25 Jun 2014 20:16:27 +0200
From: Nicole Megow <nmegow@math.tu-berlin.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Autumn School: Approximation Algorithms for
Stochastic Optimization (near Berlin, 09/29-10/01)
Message-ID: <53AB11FB.7010608@math.tu-berlin.de>
Content-Type: text/plain; charset=UTF-8; format=flowed
SECOND AND LAST CALL FOR APPLICATION AND PARTICIPATION
======================================================================
MDS Autumn School
Approximation Algorithms for Stochastic Optimization
September 29 to October 1, 2014
D?llnsee, nearby Berlin, Germany
http://www3.math.tu-berlin.de/MDS/summerschool14.html
======================================================================
The purpose of the autumn school is to give an introductory overview on
models and approximation techniques in the area of stochastic
optimization and to present current research directions. The event shall
give international students and postdocs working in this or related
fields the opportunity to meet and to get to know each other, and to get
in contact with established scientists.
The distinguished lecturers at the school are:
Anupam Gupta (Carnegie Mellon University)
Viswanath Nagarajan (IBM T.J. Watson Research Center)
Marc Uetz (University of Twente).
The school runs for full three days (Mon-Wed) with arrival on Sunday
evening and departure Wednesday evening. There will be 3x2 lectures on
? Multi-Stage Stochastic Optimization with Recourse
? Stochastic Matching Problems
? Stochastic Scheduling Problems.
In addition to the lectures, exercises will be solved in small groups
with solution sessions. The language of the school is English.
PARTICIPATION:
The school is addressed to advanced undergraduate students, graduate
students, and young postdocs in Mathematics or Computer Science who are
interested in optimization, algorithms, stochastic problems and related
areas. Basic knowledge in combinatorial optimization and linear
programming is assumed. Students of other fields are welcome to apply if
they have this prerequisite knowledge.
The number of participants is limited to about 25. Applications can be
submitted using the online form on the school website until June 30, 2014.
LOCATION & COST:
The autumn school will take place at D?llnsee, a picturesque lake in a
natural reserve 60 km northeast of Berlin. The costs per participant are
EURO 150 and include full board during the summer school and organized
transportation from Berlin (September 28, late afternoon) and back to
Berlin (October 1, late afternoon).
SUPPORT & ORGANIZATION:
The school is organized within the Research Training Group "Methods for
Discrete Structures" (MDS), a certified unit of the "Berlin Mathematical
School" hosted by all three Berlin universities and supported by the
German Research Foundation (DFG). It is further supported by DFG project
ME 3825/1 and TU Berlin.
The organizers are Nicole Megow and Martin Skutella.
For further information please visit the homepage
http://www3.math.tu-berlin.de/MDS/summerschool14.html
or contact the organizers via
summerschool2014@math.tu-berlin.de
------------------------------
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 76, Issue 23
**************************************
No comments:
Post a Comment