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. [Algorithms] Second Call: Special Issue "Parameterized
Algorithmics - Challenges from Real-World Applications"
(Stefan Kratsch)
2. Fwd: BlockCourse Additive Combinatorics - FU Berlin (2nd
announcement) (Juanjo Ru?)
3. Final Meeting / Summer School for the DFG Priority Program
1307 "Algorithm Engineering" (Vitaly Osipov)
4. Master programme "Applied Mathematics and Stochastics",
Novosibirsk State University (Artem Pyatkin)
5. ReSA4CI CFP - Deadline Extension to May 31st (Silvia Bonomi)
6. SPAA 2014 - call for participation (Jeremy Fineman)
----------------------------------------------------------------------
Message: 1
Date: Mon, 19 May 2014 11:47:12 +0200
From: Stefan Kratsch <stefan.kratsch@tu-berlin.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] [Algorithms] Second Call: Special Issue
"Parameterized Algorithmics - Challenges from Real-World Applications"
Message-ID: <5379D320.70600@tu-berlin.de>
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Dear Colleagues,
we would like to recall the upcoming deadline for submissions to the
special issue
Parameterized Algorithmics - Challenges from Real-World Applications
http://www.mdpi.com/si/algorithms/Parameterized_Algorithmics
of the open access journal Algorithms (ISSN 1999-4893,
http://www.mdpi.com/journal/algorithms). The submission deadline
is 31 May 2014, but you may send your manuscript at any time before
then. If you plan to contribute a research or review article, please send
a short abstract to the Editorial Office (algorithms@mdpi.com).
A detailed call for submissions can be found below.
We look forward to your contributions.
Christian Komusiewicz
Stefan Kratsch
Rolf Niedermeier
Guest Editors
-------------------------------------------------------------------------------------------------------
Call for submissions:
Over the last decade, parameterized complexity analysis for NP-hard
problems
has developed into one of the most prospering areas in algorithms and
complexity
research. So far, the main research focus is on purely theoretical
analysis (mostly
concerning graph-theoretic problems).
However, practical success often relies on one or more of the following
aspects:
* The problem under study occurs in real-world applications and
ideally
comes along with real-world data for testing.
* The considered parameterization yields small parameter values in
real-world
instances.
* The running time analysis accounts for the combinatorial
explosion behind
exponential parameter functions, as well as for polynomial
running time factors in
the overall input size.
We invite submissions that address one or more of the aforementioned
points in
analyzing the parameterized complexity of NP-hard problems, which arises
from
application areas including (but not limited to) network analysis
(biological, social,
and technical), computational geometry, SAT solving, bioinformatics, string
problems, operations research and combinatorial optimization, computational
social choice, data clustering, and mining.
We particularly welcome submissions that introduce new but practically
relevant
problem formulations and/or parameterizations, present linear-time fixed-
parameter tractability and/or kernelization results, or that take into
account
aspects of algorithm engineering. In particular, such aspects could
include the
measurement or estimation of parameter values in real-world data.
Finally, feature
papers or surveys addressing some of the above aspects are also of
interest.
Keywords
* NP-hard problems
* exact algorithms
* fixed-parameter tractability
* kernelization and data reduction
* efficient algorithms
* algorithm engineering
The deadline for submission is 31 May 2014, but you may send your
manuscript
at any time before then. All submissions are peer-reviewed and accepted
papers
will be published immediately. If you plan to contribute, please send a
short
abstract to the Editorial Office (algorithms@mdpi.com).
Algorithms is an open access journal, which has no income from selling
subscriptions. To defray the editorial and production costs, the journal
levies an
Article Processing Charge (APC) for accepted papers. Please refer to
http://www.mdpi.com/journal/algorithms/apc/ for more information. The
charge
currently is of 300 CHF (Swiss Francs) per accepted paper.
------------------------------
Message: 2
Date: Mon, 19 May 2014 11:53:54 +0200
From: Juanjo Ru? <juanjo.rue@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Fwd: BlockCourse Additive Combinatorics - FU Berlin
(2nd announcement)
Message-ID:
<CAEmmRhVrtcqbhDmLhBE4xrqHJxrivYFZYVHU3AorCkj1zqb1=g@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
BlockCourse: Towards the Polynomial Freiman-Ruzsa Conjecture
FU Berlin
6-23 October 2014
http://www-ma2.upc.edu/jrue/BlockCourse.html
Scope
The course is intended for master students, PhD-students and
postdoctoral researchers interested in the field of Additive
Combinatorics and related areas.
Participants can join any part of the course, depending on their
individual background and interest.
Topics and lecturers
Week 1: Giorgis Petridis (University of Rochester): Classical and new
results in Additive Combinatorics
6 - 10 October 2014
Week 2: Julia Wolf (University of Bristol): Analytic techniques in
Additive Combinatorics
13 - 16 October 2014
Week 3: Tomasz Schoen (Adam Mickiewicz University): The Polynomial
Freiman-Ruzsa Conjecture
20 - 23 October 2014
Audience
The course is addressed to graduate students and postdocs of
Mathematics or Computer Science, who are interested in additive
combinatorics, applications of Fourier analysis in discrete
mathematics, and related fields.
Organizers
The Block Course is organized within the Research Training Group
"Methods for Discrete Structures? and organized by Jun. Prof. Juanjo
Ru? and Prof. Tibor Szab?.
Participation/Stipend
Applications for participation in the course (the whole or part of it
-- please indicate the weeks you plan to participate in), with a short
curriculum vitae and scientific background, should be sent by June 30,
2014, preferably by email, to Jun. Prof. Juanjo Ru? at jrue (at)
zedat.fu-berlin.de
There is a limited amount of financial support available for
PhD-students or for advanced Master/Diploma students in a field
related to the topics of the course.
Applications for financial support, with curriculum vitae, copies of
certificates, thesis, areas of interest, and a letter of
recommendation (sent directly by the letter writer) should be sent by
May 31, 2014, preferably by e-mail, to Jun. Prof. Juanjo Ru? at jrue
(at) zedat.fu-berlin.de
------------------------------
Message: 3
Date: Mon, 19 May 2014 12:37:05 +0200
From: Vitaly Osipov <osipov@kit.edu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Final Meeting / Summer School for the DFG Priority
Program 1307 "Algorithm Engineering"
Message-ID:
<CADuui2zi-KCTc9-TtfMECW-imypVsULxhppNcpcCBFixeFBThA@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
CALL FOR PARTICIPATION
------------------------------------------
Final Meeting for the DFG Priority Program 1307 "Algorithm Engineering"
Karlsruhe/Bad Herrenalb September 17-19, 2014
The DFG priority program on algorithm engineering will have its
concluding event open to the general public.
September 17 will be a one day colloquium with renowned researchers
from inside and outside of the priority program.
September 18-19 will continue with an international summer school
intended for PhD students interested in algorithm engineering.
See http://www.algorithm-engineering.de/final-meeting for details.
REGISTRATION DEADLINE: June 30 2014.
------------------------------------------
PRELIMINARY PROGRAM OF THE COLLOQUIUM
---------------------------------------------------------------------------
Extended Talks:
- Lars Arge, Madalgo Aarhus University, Danemark
- Martin Gr?tschel, Konrad-Zuse-Zentrum f?r Informationstechnik Berlin, Germany
Linear and Mixed Integer Optimization Solvers:?Theoretical,
Practical, and Software Engineering Aspects
- Paolo Ferragina, University of Pisa, Italy
BiCriteria Data Compression
- Dorothea Wagner, Karlsruhe Institute of Technology, Germany
Clustering Evolving Networks
- Renato Werneck, Microsoft Research, USA
Building a Real-World Routing Engine
Short Talks:
- Stefan Edelkamp, University of Bremen, Germany
- Henning Meyerhenke, Karlsruhe Institute of Technology, Germany
- Matthias M?ller-Hannemann, University of Halle-Wittemberg, Germany
- Knut Reinert, Freie Universit?t Berlin, Germany
LECTURERS IN THE SUMMER SCHOOL
-------------------------------------------------------------
Martin Gr?tschel, Gerald Gamrath, Paolo Ferragina, Henning Meyerhenke,
Dorothea Wagner, Renato Werneck.
ORGANIZATION
------------------------
Prof. Peter Sanders, Karlsruhe Institute of Technology, Karlsruhe, Germany
Anja Blancani
Vitaly Osipov
------------------------------
Message: 4
Date: Mon, 19 May 2014 17:39:59 +0700
From: Artem Pyatkin <artem@math.nsc.ru>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Master programme "Applied Mathematics and
Stochastics", Novosibirsk State University
Message-ID: <5379DF7F.70705@math.nsc.ru>
Content-Type: text/plain; charset=windows-1251; format=flowed
Information Letter
Master programme `Applied Mathematics and Stochastics?
Department of Mathematics and Mechanics
Novosibirsk State University (Novosibirsk, Russia)
This is a new 2-year English-taught programme at the Master level. It is
aimed at training and developing research skills in a number of areas of
modern mathematics and statistics, and in their applications. At the end
of the studies, students are awarded a Master Degree from Novosibirsk
State University, with an approval by the Russian Ministry of Science
and Education.
The programme is planned to start in October 2014.
GENERAL OVERVIEW. The programme will start in four main directions. They
are Probability and Statistics, Numerical Statistical Modelling,
Numerical Methods, and Discrete Mathematics and Combinatorial
Optimization, with a number of applications that include insurance,
information security, and transport logistics. In 2015-16, the list of
directions is expected to expand.
The Programme is research-oriented. Each semester a student is supposed
to devote a half of time to a research project, to be done at one of
institutes of the Russian Academy of Sciences. The 2nd year of studies
is completed by a Master Dissertation.
Lecture courses and research supervision will be provided by professors
of the Novosibirsk State University and leading researchers from
institutes of the Russian Academy of Sciences. The lists of prospective
courses, of potential lecturers and supervisors, and further related
details may be found at our webpage.
ACCOMMODATION: students will be accommodated at the student?s hostel.
FORMAL ENTRANCE REQUIREMENTS: BSc in mathematics/applied mathematics
from a recognized university (with sufficiently high scores ? equivalent
to British 2.1 Degree)
FEES: US$ 5.200 per year. Five scholarships for students outside Russia
will be free, that is, they will be covered by the Novosibirsk State
University funds. The number of free scholarships may be reduced
depending on quality of applications.
APPLICATION PROCEDURE
Step 1. Submission of application form on
http://mmf.nsu.ru/en/education/int-masters.
Step 2. Given acceptance, a student is contacted by the foreign
department of NSU to start the Visa procedure.
IMPORTANT DATES (preliminary schedule):
Call for application forms online: until 16 July 2014;
1 August 2014 ? preliminary admission of students, start of visa
application;
1 September 2014 ? final admission of students;
20-25 September 2014 ? arrival of students to Novosibirsk;
1 October ? start of the 1st semester.
All details regarding the programme are exposed on the web-page:
http://mmf.nsu.ru/en/education/int-masters
------------------------------
Message: 5
Date: Mon, 19 May 2014 16:39:43 +0200
From: Silvia Bonomi <bonomi@dis.uniroma1.it>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] ReSA4CI CFP - Deadline Extension to May 31st
Message-ID: <2DA7CFD8-D2AC-45A6-94FD-CD19BABC993D@dis.uniroma1.it>
Content-Type: text/plain; charset=us-ascii
[Apologies if you receive multiple copies of this message]
Due to some requests, we have decided to extend the submission deadline to May 31st.
==========================================================================
CALL FOR PAPERS
1st International Workshop on Reliability and Security Aspects for Critical Infrastructure Protection - ReSA4CI 2014
co-located with SAFECOMP 2014
September 9th, 2014, Florence, Italy
http://www.safecomp2014.unifi.it/resa4ci/
==========================================================================
===========
Scope
===========
This workshop aims at providing a forum for researchers and engineers in academia and industry to foster an exchange of research results, experiences, and products in the area of reliable, dependable and secure computing for critical systems protection from both a theoretical and practical perspective. Its ultimate goal is to envision new trends and ideas about aspects of designing, implementing, and evaluating reliable and secure solutions for the next generation critical infrastructures. Critical Infrastructures present several challenges in the fields of distributed systems, dependability and security methods and approaches crucial for improving trustworthiness on ICT facilities. The workshop aims at presenting the advancement on the state of art in these fields and spreading their adoption in several scenarios involving main infrastructures for modern society.
Topics of interest are (but not limited to):
- Model-based and experimental assessment of safety, reliability and security
- Security & Privacy
- Quantitative analysis of dependability and security metrics
- Risk Assessment and Management
- Fault tolerant and Dependable Distributed Algorithm
- Threat Analysis
- Monitoring systems
- Adaptive solutions for secure and safe systems
- Self-* solutions
Domains of application are (but not limited to):
- Critical infrastructure, Smart Grid, and SCADA systems
- Medical device and healthcare
- Telecommunication and networks
- Railways, automotive, aerospace, and avionics
- Defence, cyber intelligence
=================
General Chair
=================
Silvia Bonomi, University of Rome La Sapienza, Italy
Ilaria Matteucci, IIT-CNR, Italy
==================
Program Committee
==================
Valentina Bonfiglio, University of Florence, Italy
Silvia Bonomi, University of Rome La Sapienza, Italy (co-chair)
Felicita Di Giandomenico, ISTI-CNR, Italy
Karama Kanoun, LAAS, France
Ilaria Matteucci, IIT-CNR, Italy (co-chair)
Alessia Milani, University of Bordeaux, France
Simin Nadjm-Tehrani, Linkoeping University, Sweden
Federica Paci, University of Trento, Italy
Marta Patino Martinez, Technical University of Madrid, Spain
Marinella Petrocchi, IIT-CNR, Italy
Maria Gradinariu Potop-Butucaru, UPMC Paris 6, France
Sara Tucci Piergiovanni, CEA, France
========================
Important dates
========================
Submission deadline: May 31, 2014 (Extended)
Acceptance notification: June 20, 2014
Camera-ready copy due: July 1, 2014
===================
Submission
===================
Submitted papers must be written in English and each paper must contain results that have not previously appeared and have not been concurrently submitted to a journal or conference with published proceedings.
In all cases, any partial overlap with any published or concurrently submitted paper must be clearly indicated.
Submissions are limited to 10 pages in the LNCS format. Additional details maybe included in a clearly marked appendix that will be read at the discretion of
the PC. The papers must be submitted electronically following the instructions at http://www.safecomp2014.unifi.it/resa4ci/.
====================
Publication
====================
The selection of contributions to be presented at the conference and published in the proceedings will be based on peer-review by the Program Committee.
Accepted papers will be published in the Springer's Lecture Notes in Computer Science series jointly with the SAFECOMP 2014 proceedings.
It is required that each accepted paper be presented at the workshop by one of its authors.
Authors of accepted papers are required to submit the final, camera-ready versions of their papers (in LNCS format), including
an electronic version as specified in the authors' instructions.
>
------------------------------
Message: 6
Date: Mon, 19 May 2014 21:15:35 -0400
From: Jeremy Fineman <jfineman@cs.georgetown.edu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] SPAA 2014 - call for participation
Message-ID: <136FD466-87D4-4FE1-A15D-7067065B9EED@cs.georgetown.edu>
Content-Type: text/plain; charset=us-ascii
The early registration deadline is May 23.
======================================================
SPAA 2014 Call for Participation
======================================================
26th ACM Symposium on
Parallelism in Algorithms and Architectures (SPAA 2014)
June 23-25, 2014 Charles University, Prague, Czech Republic
http://www.spaa-conference.org
Highlight: The two keynote speakers will be Bruce Maggs and Fabian Kuhn.
======================================================
Please visit the conference webpage for:
- list of accepted papers
- registration
- information on local arrangements
------------------------------
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 75, Issue 16
**************************************
No comments:
Post a Comment