Thursday, April 7, 2016

dmanet Digest, Vol 98, Issue 7

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. Second Call for Papers SGA 2016 (Tatjana Davidovic)
2. >>> CFP - extended deadlines (abstracts by Apr. 14), SRDS
2016 (IEEE Intl. Symp. on Reliable Distributed Systems),
Budapest, Sep. 26-29 <<< (Leszek T. Lilien)
3. Workshop "Mathematical Models and Computational Methods for
Complex Networks", Pisa, June 6-7, 2016 (Antonio Frangioni)
4. Postdoc in Algorithms, University of Vienna (Monika Henzinger)
5. CfP: JSC Special Issue on Symbolic Computation in Software
Science (Temur Kutsia)
6. COST/MINO PhD school on Advanced Optimization Methods 2016
(claudio gentile)


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

Message: 1
Date: Wed, 6 Apr 2016 18:08:15 +0200 (CEST)
From: Tatjana Davidovic <tanjad@turing.mi.sanu.ac.rs>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Second Call for Papers SGA 2016
Message-ID: <alpine.LRH.2.02.1604061807470.26966@turing.mi.sanu.ac.rs>
Content-Type: TEXT/PLAIN; FORMAT=flowed; CHARSET=UTF-8


Spectra of graphs and applications SGA 2016

May 18–20, 2016, Serbian Academy of Sciences and Arts, Belgrade, Serbia

The Mathematical institute of the Serbian Academy of Science and Arts is,
jointly with the Academy, organizing a conference in honor of Dragoš Cvetković
for his 75th birthday. Professor Cvetković is one of the pioneers of spectral
graph theory in mathematics and coauthor of classical monographs in the field,
such as Spectra of Graphs-Theory and Applications and Eigenspaces of Graphs.

URL: http://www.mi.sanu.ac.rs/conferences/sga2016.htm
Contact: graphopt@mi.sanu.ac.rs.


Invited speakers

- Willem Haemers (Tilburg): Spectral characterizations of graphs
- Christoph Helmberg (Chemnitz): A semidefinite programming view on
spectral properties of graph Laplacians
- Jack Koolen (Hefei): On graphs with smallest eigenvalue at least -3
- Vilmar Trevisan (Porto Alegre): Recent developments on Laplacian
eigenvalue distribution


Abstract submission

The deadline for submitting an abstract is April 15, 2016. Please use the
LaTeX template provided at conference web page and submit the source file by
sending an email to the organizers (graphopt@mi.sanu.ac.rs). The length of the
abstract should be between 50 and 250 words. If there are several authors, list
the speaker as the author and include the other authors at the end of the
abstract: "This is joint work with ….". All abstracts that are relevant for the
theme of the conference will be accepted.


Registration

The conference fee is 100 euros and includes welcome cocktail on May 18,
conference banquet on May 19, coffee breaks and conference material with a
T-shirt. The deadline for registration is April 15, 2016. To register, please,
visit the conference web-page, or
http://www.impalayu.com/sga02.php


Scientific committee

- Nair de Abreu (Rio de Janeiro)
- Francesco Belardo (Naples)
- Domingos Cardoso (Aveiro)
- Edwin van Dam (Tilburg)
- Tatjana Davidović (Belgrade)
- Ivan Gutman (Kragujevac)
- Vladimir Nikiforov (Memphis)
- Peter Rowlinson (Stirling)
- Slobodan Simić (Belgrade)
- Zoran Stanić (Belgrade)
- Dragan Stevanović (Belgrade, chairman) and
- Ian Wanless (Melbourne).

The local organizers are Dragan Stevanović and Tatjana Davidović.

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

Message: 2
Date: Wed, 06 Apr 2016 20:22:35 -0400
From: "Leszek T. Lilien" <leszek.lilien@wmich.edu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] >>> CFP - extended deadlines (abstracts by Apr. 14),
SRDS 2016 (IEEE Intl. Symp. on Reliable Distributed Systems),
Budapest, Sep. 26-29 <<<
Message-ID: <5705A84B.9010509@wmich.edu>
Content-Type: text/plain; CHARSET=US-ASCII; format=flowed

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

CALL FOR PAPERS - SRDS 2016
Extended Deadlines - abstracts: Apr. 14, papers: Apr. 21

--------------------------------------------------------------
IEEE 35th Intl. Symposium on Reliable Distributed Systems
SRDS 2016
September 26-29, 2016, Budapest, Hungary
http://srds2016.inf.mit.bme.hu/

Sponsored by IEEE Computer Society
--------------------------------------------------------------

IMPORTANT DATES

Abstract submission: April 4 (extended)
Paper submission : April 11 (extended)
Author notification: June 20
Camera-ready paper: July 22
Conference: September 26-29

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

SCOPE

The Symposium on Reliable Distributed Systems is a forum for researchers
and practitioners interested in distributed systems design, development
and evaluation, particularly with emphasis on reliability, availability,
safety, security, trust and real-time. We welcome original Research
Papers as well as Practical Experience Reports.

The major areas of interest include, but are not limited to:

* Autonomic, pervasive and ubiquitous computing
* Cloud computing and virtualization: X-As-A-Service
* Dependability benchmarking
* Dependability of distributed databases and transaction processing
* Dependability of distributed multimedia systems
* Dependable communication networks, QoS control and assessment
* Dependable cooperative mobile systems: ad hoc networks, sensor
networks, robot networks
* Dependability in cyber-physical systems and Internet-of-Things
* Distributed algorithms
* Distributed objects and middleware systems
* Experimental or analytical evaluations of dependable distributed
systems
* Fault tolerance, reliability and availability in distributed systems
* Formal methods and foundations for dependable distributed computing
* High-assurance and safety-critical distributed system design and
evaluation
* Internet-based systems and applications
* Parallel and distributed operating systems
* Privacy-assuring large-scale data management systems
* Resilience in distributed infrastructures (vehicular networks, power
grids, etc.)
* Secure and trusted distributed systems
* Self-stabilization and fault recovery in distributed systems


SUBMISSION GUIDELINES

Papers must be written in English and should be no longer than 10 pages,
following the IEEE two-column format for conference proceedings. All
necessary details to substantiate the main claims of the paper should be
included in a clearly marked appendix. Please check for information the
submission page at http://srds2016.inf.mit.bme.hu/call-for-papers/


PHD FORUM

SRDS 2016 will organize a PhD Student Forum. It provides an opportunity
for PhD students and graduate students to present their research to a
renowned audience, receive live feedback and exchange their ideas.


BEST PAPER AWARD

All papers accepted for presentation at the symposium will be evaluated
for the Best Paper Award.

=================================================================
v.ll-2016.04.06a


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

Message: 3
Date: Thu, 7 Apr 2016 10:23:46 +0200
From: Antonio Frangioni <frangio@di.unipi.it>
To: DMANET@zpr.uni-koeln.de
Subject: [DMANET] Workshop "Mathematical Models and Computational
Methods for Complex Networks", Pisa, June 6-7, 2016
Message-ID: <9BF55A18-DE45-424E-A609-72F06D0A72A7@di.unipi.it>
Content-Type: text/plain; charset=utf-8

Please find the included announcement for a forthcoming workshop to be held at University of Pisa. Apologies for multiple posting.

Workshop: Mathematical Models and Computational Methods for Complex Networks

June 6-7, 2016
Department of Computer Science, University of Pisa
Largo B. Pontecorvo 3, Pisa

The workshop is part of the interdisciplinary research project by the same name between the departments of computer science and mathematics.

The University of Pisa funded the project to foster stricter collaboration between experts in Numerical Analysis, Optimization and Operations Research for the solution of complex numerical problems arising from today's networks (ITC and telecommunication, transportation, energy, economic, social). Mathematical models with network structure can be analyzed both through graph and matrix theory yielding connections between numerical linear algebra, combinatorial optimization, nonlinear optimization and Markov chains. The meaningful overlapping between these fields makes it possible to look at the same problem from different points of view obtaining better results by exploiting different kinds of techniques jointly.

The workshop brings together experts in complex networks both from the modelling and computational perspective, attempting to provide an overview of the state of the art in both these research directions.

The workshop will take place on monday afternoon and tuesday morning.

Confirmed invited speakers:

Michele Benzi - Emory University, Atlanta (Georgia, USA)

Jacek Gondzio - The University of Edinburgh (UK)

Desmond J. Higham - University of Strathclyde, Glasgow (UK)

Carlo Mannino - Sintef ICT & University of Oslo (Norway)

Van Hien Nguyen - Université de Namur (Belgium)

Lothar Reichel - Kent State University, Kent (Ohio, USA)

Sebastian Stiller - Technische Universität Braunschweig (Germany)

Francesco Tudisco - Universität des Saarlandes, Saarbrücken (Germany)

Attendance to the workshop is welcome and free of charge. However, you are required to register by sending an e-mail to giancarlo.bigi@unipi.it or caterina.fenu@for.unipi.it providing your name, affiliation and day/days of attendance. The deadline for the registration is May 15.

Organizing committee: Giancarlo Bigi, Gianna Del Corso, Caterina Fenu, Antonio Frangioni, Laura Galli, Mauro Passacantando, Federico Poloni (University of Pisa, Italy)

More detailed information at http://www.di.unipi.it/complexnet.html

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

Message: 4
Date: Thu, 7 Apr 2016 12:53:11 +0200
From: Monika Henzinger <monika.henzinger@univie.ac.at>
To: DMANET@zpr.uni-koeln.de
Subject: [DMANET] Postdoc in Algorithms, University of Vienna
Message-ID: <57063C17.3000604@univie.ac.at>
Content-Type: text/plain; charset=utf-8; format=flowed

DEPARTMENTOFCOMPUTERSCIENCE
UNIVERSITY OF VIENNA

POSTDOC POSITION IN ALGORITHMS

A postdoc position is available in the research group "Theory and

Applications of Algorithms" led by Professor Monika Henzinger. See

http://informatik.univie.ac.at/forschung/forschungsgruppen/theory-and-applications-of-algorithms/

for more information on the research group.

The position is available starting September 1, 2016 (or later) and will be

of 4 years.See

https://univis.univie.ac.at/ausschreibungstellensuche/

(identifier 6495) for more details.

If you are interested, please send your application to
monika.henzinger@univie.ac.at
<https://webmail.univie.ac.at/src/compose.php?send_to=monika.henzinger%40univie.ac.at>
by April 30, 2016.

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

Message: 5
Date: Thu, 7 Apr 2016 13:18:05 +0200
From: Temur Kutsia <kutsia@risc.jku.at>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CfP: JSC Special Issue on Symbolic Computation in
Software Science
Message-ID: <570641ED.5080605@risc.jku.at>
Content-Type: text/plain; charset=utf-8


First Call for Papers

----------------------------------------
Special issue of the

JOURNAL OF SYMBOLIC COMPUTATION

on

SYMBOLIC COMPUTATION IN SOFTWARE SCIENCE
----------------------------------------
http://www.risc.jku.at/~tkutsia/organization/jsc-scss-2016.html


IMPORTANT DATES
---------
Abstract submission: June 27, 2016
Paper submission: July 11, 2016
Notification: October 17, 2016
Publication: 2017


SCOPE
--------
Symbolic Computation is the science of computing with symbolic objects
(terms, formulae, programs, representations of algebraic objects etc.).
Powerful symbolic algorithms and methods have been developed during the
past decades like computer algebra, theorem proving, automated
reasoning, software verification, model checking, rewriting,
formalization of mathematics, Groebner bases, characteristic sets,
telescoping for recurrence relations, cylindric algebraic decomposition
and other quantifier elimination techniques, etc.

The purpose of this special issue is to promote research on theoretical
and practical aspects of symbolic computation in software science. The
special issue is related to the topics of the International Symposium on
Symbolic Computation in Software Science: SCSS 2014 and SCSS 2016. It
will be published by Elsevier within the Journal of Symbolic Computation.

Participants of the SCSS 2014 and SCSS 2016 symposia, as well as other
authors are invited to submit contributions.


EXAMPLES of TOPICS
-------------------
This special issue solicits papers on all aspects of symbolic
computation and their applications in software sciences. The topics
include, but are not limited to the following:

- automated reasoning
- algorithm (program) synthesis and/or verification
- formal methods for the analysis of network and system security
- termination analysis and complexity analysis of algorithms (programs)
- extraction of specifications from algorithms (programs)
- related theorem proving methods and techniques
- proof carrying code
- generation of inductive assertion for algorithm (programs)
- algorithm (program) transformations
- formalization and computerization of knowledge (maths, medicine,
economy, etc.)
- component-based programming
- computational origami
- query languages (in particular for XML documents)
- semantic web and cloud computing


SUBMISSION GUIDELINES
---------------------
This special issue welcomes original high-quality contributions that
have been neither published in nor simultaneously submitted to any
journals or refereed conferences. Submissions will be peer-reviewed
using the standard refereeing procedure of the Journal of Symbolic
Computation.

Authors of papers presented at the SCSS 2014 and SCSS 2016 symposia are
welcome and encouraged to submit extended and revised versions of their
papers. Furthermore, submissions of papers that are in the scope of
SCSS, but did not appear in SCSS 2014 and SCSS 2016 are welcome as well.

Submitted papers must be in English and include a well written
introduction explicitly addressing the following questions in succinct
and informal manner:

- What is the problem?
- Why is the problem important?
- What has been done so far on the problem?
- What is the main contribution of the paper on the problem?
- Why is the contribution original? (Clarification: The results,
already appeared in the conference paper, will be still counted as an
original result for JSC refereeing process.)
- Why is the contribution non-trivial?
- How is the journal paper different from the conference paper? (For
submissions originated from the papers presented at the symposium.)

The submissions should be complete (since there is no rigid page limit):

- All the related works and issues must be completely and carefully
discussed.
- All the previous relevant JSC papers must be properly cited and
discussed.
- All the theorem must be rigorously proved (no sketch allowed).
- All the important definitions/theorems/algorithms must be illustrated
by well chosen examples.

Submissions originated from the papers presented at the symposium should
address all the feedback from the symposium's referee process and Q/A.


SUBMISSION
--------------------
Please prepare your submission in LaTeX using the JSC document format
from http://www4.ncsu.edu/~hong/jsc.htm
(link to the submission template:
http://www4.ncsu.edu/~hong/jsc/JSC_LaTex_2007_Mar_12.zip.)

Submission is via the EasyChair submission site at
https://easychair.org/conferences/?conf=jscscss2016.


GUEST EDITORS
--------------------
James H. Davenport (University of Bath, UK)
Temur Kutsia (RISC, Johannes Kepler University Linz, Austria)


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

Message: 6
Date: Thu, 7 Apr 2016 17:01:28 +0200
From: claudio gentile <claudio.gentile@iasi.cnr.it>
To: DMANET@zpr.uni-koeln.de
Subject: [DMANET] COST/MINO PhD school on Advanced Optimization
Methods 2016
Message-ID:
<CAKDPSDFpTuLE+skem4fQ1V_RiqvQeBj8m9DYK_z9eQHUrGjudQ@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

Dear colleagues,

this is to announce the COST/MINO PhD school on Advanced Optimization
Methods 2016.
Please see the webpage:

http://www.iasi.cnr.it/COSTSchoolRome2016

The school will include four courses:

- Polyhedral Combinatorics by Santanu S. Dey
- Interior Point methods by Jordi Castro
- Structured Dantzig-Wolfe Decomposition by Antonio Frangioni
- Semidefinite Programming by Veronica Piccialli

The school will be held at the CNR main building in ROME on June 6th to
10th 2016.

Some travel grants for students will be sponsored by the COST Action TD1207

http://td1207.zib.de/


Registration is free but compulsory. Deadline to register is May 13.
As there is a limited number of allowed registrations, students will be
accepted with the first come first served rule.


Looking forward to seeing you there!

The organizing committee:
Claudio Gentile
Giovanni Rinaldi
Anna Galluccio
Giuseppe Stecca
Lada Vetrini

--
Claudio Gentile
Istituto di Analisi dei Sistemi ed Informatica "Antonio Ruberti" (IASI-CNR)
Via dei Taurini, 19 - I 00185 Roma Italy.
Tel: +39 06 4993 7128 - Fax: +39 06 49937137 - e-mail: gentile@iasi.cnr.it

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

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 98, Issue 7
*************************************

No comments:

Post a Comment