Tuesday, April 26, 2016

dmanet Digest, Vol 98, Issue 25

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. CFP: IEEE DIPDMWC2016 Moscow, Russia (Sandra Evans)


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

Message: 1
Date: Mon, 25 Apr 2016 21:54:48 +0800
From: Sandra Evans <sandra.sdiwc@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CFP: IEEE DIPDMWC2016 Moscow, Russia
Message-ID:
<CAEjUHKX3SNqEQzgNDbQ7nS9oq=962iWSz+1643d5Rh3jf6mQZA@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

The submission is open until June 6, 2016. Please consider submitting your
papers to DIPDMWC2016.

****ALL registered papers will be submitted to IEEE for POTENTIAL inclusion
to IEEE Xplore.****
=================================================================================================

The Third International Conference on Digital Information Processing, Data
Mining, and Wireless Communications (DIPDMWC2016)

July 06-08, 2016 » Moscow, Russia
National Research Nuclear University MEPhI (Moscow Engineering Physics
Institute)

Website: http://sdiwc.net/conferences/dipdmwc2016/

================
IMPORTANT DATES
================

Submission Dates Open from now until June 6, 2016
Notification of Acceptance 2-4 weeks from the submission date
Camera Ready Submission June 26, 2016
Registration Deadline June 26, 2016
Conference Dates July 6-8, 2016

You are invited to participate in The Third International Conference on
Digital Information Processing, Data Mining, and Wireless Communications
(DIPDMWC2016) that will be held in Moscow, Russia, on July 06-08, 2016. The
event will be held over three days, with presentations delivered by
researchers from the international community, including presentations from
keynote speakers and state-of-the-art lectures.

DIPDMWC2016 welcomes papers on the following (but not limited to) Digital
Information Processing, Data Mining, Wireless Communications and related
research topics.

SUBMISSION LINK:
http://sdiwc.net/conferences/dipdmwc2016/openconf/openconf.php

EMAIL:
dipdmwc16@sdiwc.net

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

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 25
**************************************

Monday, April 25, 2016

dmanet Digest, Vol 98, Issue 24

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. Two postdoc positions at Université libre de Bruxelles
(Brussels, Belgium) (Samuel Fiorini)
2. Reminder: post-doctoral position in graph theory for
sturctural biology at Sophia-Antipolis. (Frederic Havet)
3. Highlights of Algorithms HALG 2016): Call for participation
(Artur Czumaj)
4. CfP: ACM PODC Distributed Cloud Computing (Chen Avin)
5. DISC 2016 -- SECOND CALL FOR PAPERS (Swan Dubois)


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

Message: 1
Date: Fri, 22 Apr 2016 16:07:28 +0200
From: Samuel Fiorini <sfiorini@ulb.ac.be>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Two postdoc positions at Université libre de
Bruxelles (Brussels, Belgium)
Message-ID: <B3968D73-D810-4FC3-A9C6-8E4D522998A8@ulb.ac.be>
Content-Type: text/plain; charset=utf-8

Université libre de Bruxelles (ULB) in Brussels (Belgium) announces two Postdoc positions within the ERC project FOREFRONT (Frontiers of Extended Formulations) of Prof. Samuel Fiorini, with funding for up to 2 years. Strong candidates with interests in Combinatorial optimization (theoretical and/or computational aspects) and/or Complexity theory (communication complexity, inapproximability) are encouraged to apply.

See http://homepages.ulb.ac.be/~sfiorini/ERC.html for more information about the project and the way to apply.

The 1st postdoc position can start immediatyely. The 2nd postdoc position is expected to start in Fall 2016. E-mail enquiries about the positions are welcome.


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

Message: 2
Date: Sat, 23 Apr 2016 09:49:31 +0200 (CEST)
From: Frederic Havet <frederic.havet@cnrs.fr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Reminder: post-doctoral position in graph theory for
sturctural biology at Sophia-Antipolis.
Message-ID: <59053863.3595633.1461397771011.JavaMail.zimbra@inria.fr>
Content-Type: text/plain; charset=ISO-8859-1


We are inviting applications to a post-doc position entitled
``Improving inference algorithms for macromolecular structure determination'' starting Fall 2016.
It will take place at INRIA Sophia Antipolis in the teams ABS ( https://team.inria.fr/abs/ ) and COATI ( https://team.inria.fr/coati/ ) .

The proposed work is to design efficient algorithms for solving some graph problems arising from macromolecular structure determination.
Therefore we are looking for candidates having strong knowledge in graph algorithms, combinatorial optimisation and/or structural biology.

The deadline for application is April 30.

More details on the page

http://www.inria.fr/institut/recrutement-metiers/offres/post-doctorat/sejours-post-doctoraux/(view)/details.html?id=PGTFK026203F3VBQB6G68LONZ&LOV5=4508&LG=FR&Resultsperpage=20&nPostingID=10254&nPostingTargetID=16500&option=29&sort=ASC&nDepartmentID=19


Do not hesitate to circulate this e-mail.

Frédéric Havet


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

Message: 3
Date: Sat, 23 Apr 2016 10:57:19 +0100
From: Artur Czumaj <A.Czumaj@warwick.ac.uk>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Highlights of Algorithms HALG 2016): Call for
participation
Message-ID: <571B46FF.5080300@warwick.ac.uk>
Content-Type: text/plain; charset=utf-8; format=flowed

-------------------------------------------------------------------
Highlights of Algorithms - HALG 2016
June 6-8, 2016, Paris, France
http://highlightsofalgorithms.org/
-------------------------------------------------------------------

The Highlights of Algorithms conference is designed to be a forum for
presenting the highlights of recent developments in algorithms and for
discussing potential further advances in this area. The conference will
provide a broad picture of the latest research in algorithms through a
series of survey and invited talks, as well as possibility for all
researchers and students to present their recent results through a
series of short talks and poster presentations. Attending the Highlights
of Algorithms conference will also be an opportunity for networking and
meeting leading researchers in algorithms.

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

The registration for the Highlights of Algorithms conference is open.
To register, please visit the link at
http://highlightsofalgorithms.org/registration/. (early registration is
due April 30)

A preliminary program is available online at
http://highlightsofalgorithms.org/program/.
The program is packed with 28 invited talks and with even a larger
number of short contributions.

Those interested in attending the conference are advised to book
accommodation as early as possible (given the high hotel prices in Paris).

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

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

Message: 4
Date: Mon, 25 Apr 2016 06:58:36 +0300
From: Chen Avin <avin@cse.bgu.ac.il>
To: DMANET@zpr.uni-koeln.de
Subject: [DMANET] CfP: ACM PODC Distributed Cloud Computing
Message-ID:
<CAB1dc2OvpYmLiH8-5a0P0HJWzhNnHcoKxw=ic8=6b+RKOeSksg@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

ACM PODC Workshop on Distributed Cloud Computing (DCC)

http://www.podc.org/dcc2016/

co-located with ACM PODC 2016

25 July, 2016

Chicago, Illinois, USA

Important Dates

Abstract Submission: 5 May 2016 (extended!)

Submission: 12 May 2016 (extended!)

Notification: 1 June 2016

Camera-ready: 20 June 2016

Workshop: 25 July 2016

Keynote Speaker

Larry Peterson, Princeton, USA

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 telco 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 locality and a tighter coupling to the
access network. Applications with latency constraints or with too much data
to backhaul to a large mega data center can benefit from distributed
processing. 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.

Goals

The International Workshop on Distributed Cloud Computing (DCC) 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 fields 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.
In particular, this year's edition of DCC will feature an applied session
in the afternoon, chaired by Rick McGeer.

Scope

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

- Foundations and principles of distributed cloud computing

- Optimization and algorithms

- Economics and pricing

- Experience with and performance evaluation of existing deployments and
measurements (public, private, hybrid, federated environments)

- Architectural models, prototype implementations and applications

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

- Service and resource specification, languages, and formal verification

Submission and Publication

Submissions are single-blind and should not exceed 6 pages in length (in
ACM format:http://www.sigmetrics.org/sig-alternate-per.cls).

Accepted papers will appear on ACM Digital Library. However, authors may
voluntarily also opt out from an official publication, and simply present
their work at the workshop.

For an accepted paper, at least one author must attend the workshop.

Workshop History

DCC 2013 was co-located with IEEE/ACM UCC 2013, DCC 2014 was co-located
with ACM SIGCOMM 2014, and DCC 2015 was co-located with ACM SIGMETRICS.

TPC Chairs

Patrick Eugster, TU Darmstadt, Germany and Purdue, USA

James Kempf, Ericsson Research, Silicon Valley, USA

Rick McGeer, US Ignite, USA

Stefan Schmid, Aalborg University, Denmark

TPC

• Ali Al-Shabibi, Open Networking Laboratory (ONLab), USA

• Hadi Bannazadeh, University of Toronto, Canada

• Andy Bavier, Princeton University, USA

• Pramod Bhatotia, TU Dresden, Germany

• Annette Bieniusa, TU Kaiserslautern, Germany

• Ivona Brandic, Vienna University of Technology, Austria

• Justin Cappos, New York University, USA

• Gregory Chockler, Royal Holloway, University of London (RHUL), UK

• Lars Eggert, NetApp, Germany

• Serge Fidida, Université Pierre et Marie Curie (UPMC), Sorbonne
University, France

• Anshul Gandhi, Stony Brook University, USA

• Erwan Le Merrer, Technicolor, France

• Hanoch Levy, Tel Aviv University, Israel

• Tamás Lukovszki, Eötvös Loránd University, Hungary

• Joe Mambretti, Northwestern University, USA

• Catalin Meirosu, Ericsson Research, Sweden

• Hausi Müller, University of Victoria, Canada

• Akihiro Nakao, University of Tokyo, Japan

• Marina Papatriantafilou, Chalmers University of Technology, Sweden

• Fernando Pedone, University of Lugano (USI), Switzerland

• Glenn Ricart, US Ignite and U. Utah, USA

• Robert Ricci, University of Utah, USA

• Niky Riga, BBN Technologies, USA

• Rodrigo Miragaia Rodrigues, Instituto Superior Tecnico (University of
Lisbon) and INESC-ID, Portugal

• Elad Michael Schiller, Chalmers University of Technology, Sweden

• James P.G. Sterbenz, University of Kansas, USA

• François Taïani, Université de Rennes 1, France

• Vicraj Thomas, BBN Technologies, USA

• Kurt Tutschku, BTH, Sweden

• Maarten van Steen, University of Twente, the Netherlands

• Brecht Vermeulen, iMinds and Ghent University, Belgium

• Marko Vukolić, IBM Research Zurich, Switzerland

• John Wroclawski, University of Southern California, USA

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

Message: 5
Date: Mon, 25 Apr 2016 12:59:22 +0200
From: Swan Dubois <swan.dubois@lip6.fr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] DISC 2016 -- SECOND CALL FOR PAPERS
Message-ID: <571DF88A.6020102@lip6.fr>
Content-Type: text/plain; charset=utf-8; format=flowed

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

DISC 2016 -- SECOND CALL FOR PAPERS

30th International Symposium on Distributed Computing
September 26-29, 2016, Paris, France
www.disc-conference.org/wp/disc2016

SUBMISSION SITE IS NOW OPEN : https://easychair.org/conferences/?conf=disc16

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

DISC is the International Symposium on Distributed Computing, organized
in cooperation with the European Association for Theoretical Computer
Science (EATCS).

---------------
Important Dates
---------------

Abstract Registration : May 3, 2016 (AoE)
Paper Submission : May 10, 2016 (AoE)
Notification : July 7, 2016
Camera-Ready Submission : July 20, 2016
Conference : September 26--29, 2016

-----
Scope
-----

Original contributions to theory, design, implementation, modeling,
analysis, or application of distributed systems and networks are
solicited. Topics of interest include, but are not limited to:
- Distributed algorithms; correctness and complexity
- Concurrency, synchronization, and transactional memory
- Distributed operating systems, middleware, database systems
- Self-stabilizing, self-organizing, and autonomous systems
- Wireless, mobile, sensor and ad-hoc networks
- Fault tolerance, reliability, availability
- Game-theoretic approaches to distributed computing
- Specification, verification, and testing: tools, methodologies
- Networks: protocols, architectures, services, applications
- Multiprocessor and multicore architectures and algorithms
- System on chip and network on chip architectures
- Security in distributed computing, cryptographic protocols
- Distributed computing issues in the Internet and the Web
- Cloud and peer-to-peer computing
- Software-defined networking and network functions virtualization
- Mobile agents and autonomous robots

----------
Submission
----------

Papers are to be submitted electronically, following the guidelines on
the conference web page. Submissions must be in English, in .pdf format,
and begin with a cover page (not a cover letter) including: (1) title,
(2) authors' names and affiliations, (3) contact author's email address,
(4) a short abstract of the paper, (5) indication of whether this is a
regular paper or a brief announcement, and (6) indication of whether the
paper is eligible for the best student paper award.

A submission for a ***regular presentation*** must report on original
research that has not previously appeared, and has not been concurrently
submitted to a journal or conference with published proceedings. Any
overlap with a published or concurrently submitted paper must be clearly
indicated. A regular submission must not exceed 10 single-column pages
using at least 11 point font on letter paper (excluding cover page and
references). Authors are expected to include all the ideas necessary for
an expert to verify the central claims in the paper. If necessary, the
details may appear in a clearly marked appendix, which will be read at
the discretion of the program committee.

A ***brief announcement*** submission must not exceed 2 pages in the
same format. The material in brief announcements can be published in
other conferences. Submissions not conforming to these rules and papers
outside of the scope of the conference will be rejected without
consideration. If requested by the authors on the cover page, a regular
submission that is not selected for a regular presentation can be
considered for the brief announcements track. Such a request will not
affect consideration of the paper for a regular presentation.

-----------
Publication
-----------

The proceedings will be published as a volume in the ARCoSS Springer
Lecture Notes in Computer Science series. Camera-ready versions of
accepted papers must be submitted in the LNCS format. Accepted papers
must be presented by one of the paper's authors, at the conference site,
and according to the final schedule. Any paper accepted into the
technical program but not presented on-site will be withdrawn from the
official proceedings archived on Springer.

------
Awards
------

Awards will be given to the best paper and the best student paper. To be
eligible for the best student paper award at least one of the paper
authors must be a full-time student at the time of submission, and the
student(s) must have made a significant contribution to the paper.

-----------------
Program Committee
-----------------

Silvia Bonomi, Sapienza Università di Roma, Italy
Carole Delporte-Gallet, Paris-Diderot University, France
Swan Dubois, UPMC Sorbonne Universités, France
Michael Elkin, Ben-Gurion University of the Negev, Israel
Godard Emmanuel, Aix-Marseille University, France
Panagiota Fatourou, FORTH ICS & Crete University, Greece
Pascal Felber, Neuchâtel University, Switzerland
Paola Flocchini, Ottawa University, Canada
Cyril Gavoille (chair), Bordeaux University, France
Chryssis Georgiou, Cyprus University, Cyprus
Seth Gilbert, National University of Singapore, Singapore
Vincent Gramoli, Sydney University, Australia
Rachid Guerraoui, Ecole Polytechnique Fédérale de Lausanne, Switzerland
Magnús M. Halldórsson, Reykjavik University, Island
David Ilcinkas, CNRS & Bordeaux University, France
Matthew P. Johnson, CUNY Graduate Center, USA
Christoph Lenzen, MPI for Informatics, Germany
Toshimitsu Masuzawa, Osaka University, Japan
Mikhail Nesterenko, Kent State University, USA
Paolo Penna, Swiss Federal Institute of Technology in Zurich,
Switzerland
Luís Rodrigues, Lisbona University, Portugal
Elad M. Schiller, Chalmers University, Sweden
Johannes Schneider, ABB Corp. Research, Switzerland
Christian Sommer, Apple Inc., USA
Jennifer L. Welch Texas A&M University, USA
Philipp Woelfel, Calgary University, Canada

--------------------
Organizing Committee
--------------------

Lélia Blin (logistic chair), Evry University, France
Swan Dubois (publicity chair), UPMC Sorbonne Universités, France
David Ilcinkas (proceedings chair), CNRS & Bordeaux University, France
Colette Johnen (workshop chair), Bordeaux University, France
Petr Kouznetsov (sponsoring chair) Telecom ParisTech, France
Maria Potop-Butucaru (general chair), UPMC Sorbonne Universités, France
Stéphane Rovedakis (web chair), Conservatoire National des Arts et
Métiers, France

------------------
Steering Committee
------------------

Roberto Baldoni, Sapienza Università di Roma, Italy
Keren Censor-Hillel, Technion, Israel
Shlomi Dolev (chair), Ben-Gurion University of the Negev, Israel
Cyril Gavoille, Bordeaux University, France
Fabian Kuhn, Freiburg University, Germany
Yoram Moses, Technion, Israel
Achour Mostefaoui, Nantes University, France

-------------------
Contact Information
-------------------

If you have any question about the CFP and paper submission, please
email to gavoille@labri.fr.

-------------------
Swan DUBOIS
UPMC Sorbonne Universités
DISC 2016 Publicity Chair


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

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 24
**************************************

Saturday, April 23, 2016

dmanet Digest, Vol 98, Issue 23

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. MOPTA 2016 - Call for participation (Tamás Terlaky)


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

Message: 1
Date: Fri, 22 Apr 2016 06:16:19 -0400
From: Tamás Terlaky <tat208@lehigh.edu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] MOPTA 2016 - Call for participation
Message-ID: <5719F9F3.7040206@lehigh.edu>
Content-Type: text/plain; charset=utf-8; format=flowed


Dear Friends and Colleagues
With apologies for cross-postings...

We cordially invite you to contribute to the fourteenth annual
"Modeling and OPtimization: Theory and Applications" (MOPTA) conference,
organized at Lehigh University, Bethlehem, Pennsylvania, August 17-19, 2016.

MOPTA aims at bringing together a diverse group of people from both
discrete and continuous optimization, working on both theoretical and
applied aspects. There will be invited plenary talks from distinguished
speakers as well as organized sessions and contributed talks, spread
over three days. Our target is to provide a diverse set of exciting new
developments from different areas of optimization research while at the
same time providing a setting which will allow increased interaction
among the participants. We aim to bring together researchers from both
the theoretical and applied communities in the framework of a
medium-scale event who do not usually have the chance to interact in
larger meetings.

We welcome contributed talks, and we are also very interested in hearing
from people who could organize a session centered around one of their
topics of expertise. MOPTA sessions have 3 speakers, with 30 mins per
presentation including Q&A's. Speakers will be kindly asked to submit
their abstract on the MOPTA website. The deadline for abstract
submission is May 20.

Confirmed plenary speakers:
* Sem Borst (Technische Universiteit Eindhoven)
* Gerard P. Cornuejols (Carnegie Mellon University)
* Michael P. Friedlander (University of California, Davis)
* Jacek Gondzio (The University of Edinburgh)
* David Simchi-Levi (MIT)
* Michael Pinedo (New York University)
* Robert Shorten (University College Dublin)


Please contact
Alexander Stolyar (als714@lehigh.edu)
or
Martin Takac (Takac.MT@gmail.com)
if you would like to organize a session for MOPTA.


Alexander Stolyar, Martin Takac
Organizing Committee Co-Chairs

See more at http://coral.ie.lehigh.edu/~mopta

--
********************************************************
Tamás Terlaky, George N. and Soteria Kledaras '87 Endowed Chair Professor.
Chair, Department of Industrial and Systems Engineering
P.C. Rossin College of Engineering and Applied Science
Lehigh University, Harold S. Mohler Laboratory
200 West Packer Avenue, Bethlehem, PA 18015-1582
Phone: (610) 758-4050
Email: terlaky@lehigh.edu
Fax: (610) 758-4886
http://www.lehigh.edu/~tat208
http://coral.ie.lehigh.edu/~mopta
http://www.ise.lehigh.edu/
**********************************************************

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

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 23
**************************************

Friday, April 22, 2016

dmanet Digest, Vol 98, Issue 22

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. Two Ph.D. Positions in Operations Management at University of
Colorado—Boulder (Rui Zhang)
2. TAMC 2016 deadline extended to April 26, 2016 (Sun,Xiaoming)
3. PhD positions at university of Osnabrueck (Sigrid Knust)
4. Professor/Assistant Professor in Computer Science/Machine
Learning/Robotics in St.Petersburg Academic University, Saint
Petersburg, Russia (Uliana Egina)
5. Ph.D. Position in Security Modeling at IRISA in Rennes,
France (Barbara Kordy)


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

Message: 1
Date: Thu, 21 Apr 2016 14:48:06 -0400
From: Rui Zhang <barryzhangr@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Two Ph.D. Positions in Operations Management at
University of Colorado—Boulder
Message-ID: <etPan.57192066.4921848f.fe@RUIs-MacBook-Pro.local>
Content-Type: text/plain; charset="utf-8"

Leeds School of Business at University of Colorado—Boulder invites applications for its Ph.D. program in Operations Management for Fall 2016 admissions. At least two positions are available. The ideal candidate should have a solid background in optimization, linear programming, integer programming and analysis of algorithms. Proficiency in a computer programming language (C, C++, Java, python or Matlab) is preferred. 

Admitted students receive a full tuition waiver, a partial waiver of student health insurance costs, and stipend as long as they are in good standing with the department. Students work approximately 20 hours per week as research and/or teaching assistants in return for support. The 2015-2016 stipend is $25,000 for the nine-month academic year. Summer research fellowships are also available. While the continuation of financial aid is contingent on satisfactory performance, most students are funded for four years. Students may request a fifth year of funding. Fifth-year funding decisions are based a combination of factors including available funds, the student's progress in the program, and the division's support of the student. Further details about the program can be found at: http://www.colorado.edu/business/academic-programs/phd-program

Ranked as the # 5 Best Places to Live in the United States in 2015, Boulder is located at the base of the foot hills of the Rocky Mountain sat an elevation of 5,430 feet (1,655 m). The city is 25 miles (40 km) northwest of Denver. It is famous for its colorful Western history. Furthermore, the city of Boulder frequently acquires top rankings in health, well-being, quality of life, education and art. Check out the link for details: https://bouldercolorado.gov/newsroom/best-of-boulder-community-honors 

Any interested candidate should email a detailed CV to "dan.zhang@colorado.edu" as soon as possible. If it is possible, personal statement, transcripts, GRE, TOEFL and three reference letters should be included as well.

If you have any questions, please contact:

Prof. Dan Zhang

Email: dan.zhang@colorado.edu

Web: http://www.danzhang.com

Prof. Rui Zhang

Email: rui.zhang@colorado.edu

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

Message: 2
Date: Fri, 22 Apr 2016 17:09:05 +0800
From: "Sun,Xiaoming" <sunxiaoming@ict.ac.cn>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] TAMC 2016 deadline extended to April 26, 2016
Message-ID: <006101d19c76$9faa7f00$deff7d00$@ac.cn>
Content-Type: text/plain; charset="us-ascii"


The 13th Annual Conference on Theory and Applications of Models of
Computation

http://cs.xidian.edu.cn/tamc2016/

Xi'an, China July 20-22, 2016

Welcome to The 13th annual conference on Theory and Applications of Models
of Computation (TAMC), which will take place at Xi'an, China from 20th to
22nd, July, 2016. The event is supported by School of Computer Science and
Technology and School of Cyber Engineering, Xidian University.

Venue

Tangcheng Hotel

South Hanguang Road #229

Xi'an, China

All major events take place in this building. There is a fully equipped
lecture hall with a capacity for 200 attendees as well as a series of
lecture rooms, each of which can support 50 attendees. Of course, all
participants of TAMC-16 will have free internet access during the
conference.

Important Dates

Submission deadline: 11:59 pm EST April 26, 2016

Notification of authors: May 31, 2016

Final versions deadline: June 15, 2016

Proceedings and Post Conference Publications

Proceedings of accepted papers will be published in the LNCS series. A
special issue of the Journal of Computer and System Sciences devoted to a
select set of accepted papers of the conference is planned.

Submission of Papers

Authors should submit an extended abstract (not a full paper). The
submission should contain a scholarly exposition of ideas, techniques, and
results, including motivation and a clear comparison with related work.The
length of the extended abstract should not exceed ten (10) letter-sized
pages (not including bibliography and appendices.) Submitted papers must
describe work not previously published. They must not be submitted
simultaneously to another conference with refereed proceedings.

Please be advised that TAMC will consider submissions by the PC members
(those submissions will be assigned to another PC member to be reviewed).

The submission server is now available at
https://www.easychair.org/conferences/?conf=tamc16

Conference Chair

Jianfeng Ma (Xidian University)

Zhiyong Liu (Institute of Computing Technology, Chinese Academy of Sciences)

Programme Committee Chair

Jin-Yi Cai (University of Wisconsin)

Programme Committee Co-Chairs

Jiangtao Cui (Xidian University)

Xiaoming Sun (Institute of Computing Technology, Chinese Academy of
Sciences)

Steering Committee

Manindra Agrawal

Jin-Yi Cai

Barry Cooper

John Hopcroft

Angsheng Li

Zhiyong Liu

Local Organising Committee

Jianfeng Ma http://web.xidian.edu.cn/jfma/

Jiangtao Cui http://web.xidian.edu.cn/cuijt/

Hui Li http://web.xidian.edu.cn/hli/

Aims and Scope

TAMC 2016 aims at bringing together a wide range of researchers with
interests in computational theory and applications. The main themes of the
conference are computability, complexity, algorithms, models of computation
and systems theory. Typical but not exclusive topics of interest include:

Algebraic computation

Algorithmic coding theory

Algorithmic number theory

Approximation algorithms

Automata theory

Circuit complexity

Combinatorial algorithms computability

Computational biology, and biological computing

Computational complexity [including circuits, communication,
derandomization, PCPs, proof complexity, structural complexity]

Computational game theory

Computational logic

Computational geometry

Continuous and real computation

Cryptography

Data structures

Design and analysis of algorithms

Distributed algorithms

Domain models [Assets, Price of Abstraction, frameworks]

Fixed parameter tractability

Geometric algorithms

Graph algorithms

Information and communication complexity

Learning theory

Memory hierarchy tradeoffs

Model theory for computing [modal and temporal logics, specification,
verification, synthesis or automated software construction, aesthetics,
software behavior, transformation of models]

Natural computation

Nature inspired computing

Networks in nature and society

Network algorithms optimization

Online algorithms

Parallel algorithms

Philosophy of computing [emerging paradigms, morality, intentionality]

Privacy and security

Property testing

Proof complexity

Process models [for software construction, validating software under
construction, supply-chain]

Quantum computing

Randomness pseudorandomness

Randomized algorithms

Space - time tradeoffs

Streaming algorithms

Systems theory [Concurrent, Timed, Hybrid and Secure systems]

VLSI Models of Computation [Models for Hardware - Software Co-design]


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

Message: 3
Date: Fri, 22 Apr 2016 11:20:26 +0200
From: Sigrid Knust <sknust@uos.de>
To: DMANET@zpr.uni-koeln.de
Subject: [DMANET] PhD positions at university of Osnabrueck
Message-ID: <5719ECDA.3040005@uos.de>
Content-Type: text/plain; charset=utf-8; format=flowed


The DFG Research Training Group "Combinatorial Structures in Geometry"
at the University of Osnabrueck invites applications for

7*positions for PhD candidates and *

*1 postdoctoral position.
*
The starting date for these positions is October 1st, 2016. All
positions are
within the TV-L E13 German public sector pay scale. The PhD positions
are offered at a 75% base, the contracts are given for 2 ½ year and are
planned to be extended to 3 years. The postdoctoral positions are
offered at
a 100% base and the contracts are given for 1 ½ years and are planned
to be extended to 2 years.

The central research idea behind the Graduate School concerns the
interaction of combinatorics and geometry, and collaborations between
researchers from different disciplines, such as commutative algebra,
combinatorial optimization, harmonic analysis, homotopy theory,
K-theory, and stochastic geometry. For further information we refer to

www.mathematik.uni-osnabrueck.de/graduiertenkolleg
or

www.mathematik.uni-osnabrueck.de/en/en/research_training_group/combinatorial_structures_in_geometry.html


Applicants for the PhD positions should hold an excellent master/diploma
degree in mathematics or computer science. Good English language skills
are mandatory. Requirements for the postdoctoral positions are an excellent
PhD in one of the mentioned areas.

The University of Osnabrueck aims at increasing the proportion of female
employees in the involved departments substantially. Therefore applications
from women are particularly welcome, and will be treated with preference
subject to equal qualification. The same applies to qualified disabled
people.

Applications should include the relevant documents (curriculum vitae,
list of publications if available, certificates of academic
qualifications), a
reference letter written by a professor and an accompanying statement
mentioning one or several research projects the applicant wants to work on

(see
http://www.mathematik.uni-osnabrueck.de/en/en/research_training_group/research_projects.html)


Applications should be sent via email in PDF format to
Prof. Dr. Matthias Reitzner: gkmath@uni-osnabrueck.de, by May 19th, 2016.

--

-------------------------------------------------------------------
Prof. Dr. Sigrid Knust
Universitaet Osnabrueck
Institut fuer Informatik
Albrechtstr. 28
D-49069 Osnabrueck
Tel.: +49 541 969 2483
Fax.: +49 541 969 2799
sigrid@informatik.uni-osnabrueck.de
http://www.informatik.uni-osnabrueck.de/knust/
-------------------------------------------------------------------


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

Message: 4
Date: Fri, 22 Apr 2016 12:33:12 +0300
From: Uliana Egina <uliana.egina@jetbrains.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Professor/Assistant Professor in Computer
Science/Machine Learning/Robotics in St.Petersburg Academic
University, Saint Petersburg, Russia
Message-ID:
<CABYX95Bi5tMZk35PZm265o-sxjBfaBY=G2BgQGYfprXF=Dxo6Q@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

The Saint Petersburg Academic University of the Russian Academy of Sciences
(SPbAU RAS) is hiring full and associate professors to teach in a new
computer science program. Responsibilities include developing curriculum,
lecturing undergraduates, holding seminars and advising BSc and MSc
students on their theses and research projects. The teaching load is
expected to be 6-8 academic hours per week. Foreign candidates are welcome
as all students can study in English.

There are open positions available for each of the following subjects:


- Data Analysis and Machine Learning (with emphasis on Deep Learning)
- Robotics (Mobile Robot Programming, SLAM)
- System programming (Virtualization, Cloud Computing)
- Programming Language Theory

SPbAU was established in 1997 by the highly acclaimed physicist and Nobel
Prize laureate Zhores Alferov as a research and educational facility for
physics and IT. It is one of the very few state-accredited universities in
Russia to provide advanced BSc/MSc programs in cutting-edge computer
science fields, including bioinformatics or data science. With a lack of
bureaucracy in regards to the educational process, the academic staff at
SPbAU has exceptional flexibility in developing and updating curriculum to
keep up with the students' progress and recent advancements in the rapidly
changing world of computer science.

All students enrolled in the program stand out for their talent and great
potential, thanks to highly competitive entrance examinations. A third of
the freshmen had won prizes at the All-Russian Mathematical Olympiad for
high school students (the oldest and most reputable nationwide competition
in the country). In 2015, SPbAU had a highest average USE (Unified State
Exam) score among all Russian universities.

*Requirements*

Assistant professors:


- Ph.D. degree (Cand. Sci. for candidates from Russia and CIS countries)
- At least three publications in the last five years listed at
MathSciNet/DBLP
- Three or more years of experience in research or teaching (apart from
Ph.D. studies)

Full Professors:

-
*Ph.D. or equivalent degree (Habilitation, D. Sci. for candidates from
Russia and CIS) *
- *At least five refereed publications in the last five years listed at
MathSciNet/DBLP/Scopus/Web Of Science*
-
*5+ years of research/teaching experience (not counting Ph.D. studies) *

The salary is negotiable, with a guaranteed* lower bound* $1800/month for
associate and of $2500/month for full professor (paid in Russian rubles).
For international applicants, SPbAU will cover relocation expenses, arrange
visa and work permit, and provide lodging assistance.

All positions are funded by a grant from JetBrains Research.

If you are interested in applying for one of the positions, send your CV to
uliana.egina@jetbrains.com.

Kind regards,
Uliana Egina
Project Coordinator in Education
https://www.jetbrains.com/
The Drive to Develop

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

Message: 5
Date: Fri, 22 Apr 2016 11:35:09 +0200
From: Barbara Kordy <barbara.kordy@irisa.fr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Ph.D. Position in Security Modeling at IRISA in
Rennes, France
Message-ID: <5719F04D.9080902@irisa.fr>
Content-Type: text/plain; charset=utf-8; format=flowed

Looking for a Ph.D. thesis that combines computer security and mathematics?
IRISA, the computer science laboratory of Rennes in France, seeks to
hire an
outstanding Ph.D. student to perform research in the field of formal
modeling
and analysis of security. The position is within the project entitled
"Attack-Defense Trees for Computer Security: Formal Modeling of
Preventive and
Reactive Countermeasures".

Description of work
---------------------
Attack-defense trees constitute a methodology to represent how an attacker
may compromise a system and how a defender can protect it against potential
attacks. The project's objective is to increase the expressive power of
attack-defense trees by integrating reactive countermeasures into the
formalism.
The main tasks of the Ph.D. student will be to
- Develop mathematical foundations for attack-defense trees distinguishing
between protective and reactive countermeasures;
- Propose quantitative evaluation techniques for attack-defense trees with
protective and reactive countermeasures;
- Validate the extended model in real-life case studies performed in
collaboration
with industry;
- Co-supervise master students.

A detailed description of the thesis topic is available at
http://people.irisa.fr/Barbara.Kordy/vacancies.php

Candidate's profile
--------------------
The candidate is expected to have:
- A Master degree in computer science or mathematics;
- A proven interest in formal methods and formal modeling;
- Excellent written and oral English skills.

Background in computer security will be a plus. Knowledge of French is
not required.

Work environment
-----------------
We offer a three year appointment funded by the French Ministry of Higher
Education and Research. The successful candidate will participate in the
activities of the Embedded Security and Cryptography (EMSEC) research team
(http://www.irisa.fr/emsec/) co-led by Prof. Dr. Gildas Avoine and Prof.
Dr.
Pierre-Alain Fouque. The student will be supervised jointly by Dr. Barbara
Kordy (http://people.irisa.fr/Barbara.Kordy/) and Prof. Gildas Avoine
(http://www.avoine.net/).

IRISA (https://www.irisa.fr/en) is located in Rennes at the heart of the
beautiful Brittany region in the north-west of France. Rennes is situated
60km from the Atlantic Ocean, 60km from the UNESCO World Heritage Site of
Mont Saint-Michel, and 70km from the charming city of Saint Malo. Direct
high-speed rail service (TGV) connects Rennes with the center of Paris
within 2 hours and with the France's largest international airport
Paris Charles de Gaulle (CDG) within 3 hours.

Application
---------------
Applications should be written in English and include the following
documents:
- Motivation letter clearly explaining the candidate's interest in the
proposed
topic and his/her fit to the position;
- Curriculum Vitae (including contact information, education and work
experience,
short description of the master thesis, list of publications, etc.);
- Transcript of grades from all university-level courses taken;
- Contact information for 2 referees.

Applications will be considered on a rolling basis until the position is
filled.
Documents should be submitted by e-mail to Dr. Barbara Kordy
(barbara.kordy@irisa.fr).

Contact information
-----------------------
For further inquiries please contact Dr. Barbara Kordy
(barbara.kordy@irisa.fr)

For more information about this vacancy please check
http://people.irisa.fr/Barbara.Kordy/vacancies/PhD_16.pdf


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

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 22
**************************************

dmanet Digest, Vol 98, Issue 21

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. CFP:: MATCOS 16 (Andrej (Andy) Brodnik)
2. FGCT 2016 (Sidda Chandrappa)
3. BDA 2016 --- submission deadline extension (Yuval Emek)
4. Two One-Day Colloquia in Combinatorics 2016 (Jozef Skokan)


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

Message: 1
Date: Thu, 21 Apr 2016 02:08:28 +0200
From: "Andrej (Andy) Brodnik" <andrej.brodnik@fri.uni-lj.si>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CFP:: MATCOS 16
Message-ID: <571819FC.6020001@fri.uni-lj.si>
Content-Type: text/plain; charset=utf-8; format=flowed

Call for Papers
Middle-European Conference on Applied Theoretical Computer Science
(MATCOS)

Koper, Slovenia, October 12th and 13th, 2016.
http://matcos16.iam.upr.si

Held in conjunction with the 19th Multi-Conference on Information
Society, October 10-14, 2016, Ljubljana, Slovenia. (http://is.ijs.si)

Scope and Topics
----------------
During the past years, other fields have used several subjects,
methods and approaches of Theoretical Computer Science, and several
results have been integrated into practical applications. Solutions
for NP-hard problems, algorithmic-oriented AI and data mining
procedures, new models and methods in system biology and
bioinformatics, automata theory approaches in software and hardware
verification, prospective new models of computation and future
computer architecture are good examples to buttress the above
statement.

We set double aims as the scope of this conference: on one hand side
we expect ideas and solutions from the field of Theoretical Computer
Science which have been directly applied in real world
applications. On the other side we want to collect theoretical results
based on some fruitful idea that may be useful to adopt for practical
problems.

Suggested, but not exclusive, topics of interest include:
- Automata and formal languages, computability,
- Algorithms and data structures,
- Computational complexity,
- Artificial intelligence, machine learning,
- Optimization, approximation methods, NP-hard problems,
- Graph theory.

There is a special emphasis on use in applications such as simulation,
bioinformatics, digital signal and image processing, logistics etc.

Steering Committee
------------------
Andrej Brodnik (Ljubljana, Koper, Slovenia)
Gábor Galambos (Szeged, Hungary)
Miklós Krész (Szeged, Hungary)
Gerhard Reinelt (Heidelberg, Germany)

Keynote speaker
---------------
TODO: TBD

Paper submission
----------------

Papers presenting original research in conference topics are being
sought. Papers must be in English and provide sufficient details to
allow the program committee to assess their merits. Submissions, as
well as final versions, are limited to 4 pages sharp and will be
published in an Information Society multicon-ference proceeding.
Revised versions of full papers will appear in post-conference
proceedings published by the University of Primorska Press.
Instructions for preparing the papers can be downloaded from
Conference Website.

Only electronic submissions will be accepted (in pdf format), via
EasyChair:

https://easychair.org/conferences/?conf=matcos2016


Important dates
---------------
Paper submission: August 15th, 2016.
Notification: September 15th, 2016.

Website and Contacts
--------------------

More detailed on-line information is at http://matcos16.iam.upr.si.
Personal inquires should be sent to matcos16@iam.upr.si.

Organized by University of Primorska, Institute Andrej Marušič, and
Faculty of Mathematics, Natural Sciences and Information Technologies.

--
Andrej (Andy) Brodnik

University of Ljubljana
Faculty of Computer and Information Science

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

Message: 2
Date: Thu, 21 Apr 2016 09:43:42 +0530
From: Sidda Chandrappa <subscription@dirf.org>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] FGCT 2016
Message-ID: <9a5c58294369762cd01c087b9a0baa6f@dirf.org>
Content-Type: text/plain; charset=UTF-8; format=flowed

Fifth International Conference on the Future Generation Communication
Technologies (FGCT 2016)
Luton, (near London). UK
August 17-19, 2016
www.socio.org.uk/fgct
Technically co-sponsored by UK & RI IEEE
IEEE Xplore publication

In the last decade, a number of newer communication technologies have
been evolved, which have a significant impact on the technology, as a
whole. The impact ranges from incremental applications to dramatical
breakthrough in the society. Users rely heavily on broadcast technology,
social media, mobile devices, video games and other innovations to
enrich the learning and adoption process.

This conference is designed for teachers, administrators, practitioners,
researchers and scientists in the development arenas. It aims to provide
discussions and simulations in the communication technology at the broad
level and broadcasting technology and related technologies at the micro
level. Through a set of research papers, using innovative and
interactive approach, participants can expect to share a set of research
that will prepare them to apply new technologies to their work in
teaching, research and educational development amid this rapidly
evolving landscape.

Topics discussed in this platform are not limited to-

Emerging cellular and new network architectures for 5G
New antenna and RF technology for 5G wireless
Modulation algorithms
Circuits, software and systems for 5G
Convergence of multi-modes, multi-bands, multi-standards and multi-
applications in 5G systems
Cognitive radio and collaborative transmissions in 5G
Computing and processing platform for 5G
Programming models and development tools to enable 5G systems
Small cells and heterogeneous networks
Metrics and Evaluation of 5G systems
Standardization of 5G
Broadcast technology
Future Internet and networking architectures
Future mobile communications
Mobile Web Technology
Mobile TV and multimedia phones
Communication Security, Trust, Protocols and Applications
Communication Interfaces
Communication Modelling
Satellite and space communications
Communication software
Future Generation Communication Networks
Communication Network Security
Communication Data Grids
Collaborative Communication Technology
Intelligence for future communication systems
Forthcoming optical communication systems
Communication Technology for Elearning, Egovernment, Ebusiness
Games and games designing
Social technology devises, tools and applications
Crowdsourcing and Human Computation
Human-computer communication
Pervasive Computing
Grid, crowd sourcing and cloud computing
Hypermedia systems
Software and technologies for E-communication
Intelligent Systems for E-communication
Future Cloud for Communication
Future warehousing
Future communication for healthcare and medical devices applications
Future communication for Mechatronic applications

All presented papers in the conference will be published in the
proceedings of the conference and submitted to the IEEE Xplore Digital
Library.

The conference will have workshops on specific themes, industrial
presentation, invited talks and collaborative discussion forums.

Important Dates

Submission of Papers: June 01, 2016
Notification of Acceptance: July 01, 2016
Camera Ready: August 01, 2016
Registration: August 01, 2016
Conference Dates: August 17-19, 2016


The selected papers after extension and modification will be published
in many peer reviewed and indexed journals.

Journal of Computer and System Sciences/ (ISI/Scopus)
Journal of Digital Information Management (Scopus/EI)
International Journal of Computational Science and Engineering (Scopus
and EI Indexed)
Decision Analytics
International Journal of Big Data Intelligence
International Journal of Applied Decision Sciences (Scopus/EI)
International Journal of Management and Decision Making (Scopus/EI)
International Journal of Strategic Decision Sciences
International Journal of Enterprise Information Systems (Scopus/EI)
Journal of Electrical Systems
Recent Advances in Electrical & Electronic Engineering

General Chair

Ezendu Ariwa, University of Bedfordshire, UK

Programme Chairs

Carsten Maple, University of Bedfordshire, UK
Yong Yue, University of Bedfordshire, UK
Hathairat Ketmaneechairat, King Mongkut's University of Technology,
Thailand.

Submissions at http://www.socio.org.uk/fgct/paper-submission/
Conference email- fgct@socio.org.uk

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

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

Message: 3
Date: Thu, 21 Apr 2016 09:19:53 +0300
From: Yuval Emek <yemek@ie.technion.ac.il>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] BDA 2016 --- submission deadline extension
Message-ID:
<CAJfs=WxMqVAq-dm-PS3DqZwDexAmSksyN_uNmZK2VsYEYdrbSw@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

*** The submission deadline has been pushed forward to Apr 30 ***

=======================================================
The 4th Workshop on Biological Distributed Algorithms (BDA 2016)
Co-located with PODC 2016. July 25, 2016 in Chicago, IL USA
http://www.snl.salk.edu/~navlakha/BDA2016/
=======================================================

We are excited to announce the 4th workshop on Biological Distributed
Algorithms (BDA). The aim of the workshop is to foster collaborative research
between biologists and distributed computing theory researchers, with the hope
of producing better understanding of the behavior of distributed biological
systems, as well as new ideas for design of algorithms for engineered or
computational networks.

BDA 2016 will include presentations on distributed algorithms related to a
variety of biological systems, with special attention to communication and
coordination in insect colonies (e.g. foraging, navigation, task allocation,
construction) and networks in the brain (e.g. learning, decision-making,
attention).

This is a one-day workshop.

===========
SUBMISSIONS
===========
We solicit submissions of extended abstracts describing recent results
relevant to biological distributed computing. We especially welcome extended
abstracts describing new insights and / or case studies regarding the
relationship between distributed computing and biological systems even if
these are not fully formed. Since a major goal of the workshop is to explore
new directions and approaches, we especially encourage the submission of
ongoing work. Selected contributors would be asked to present, discuss and
defend their work at the workshop. By default, the submissions will be
evaluated for either oral or poster presentation, though authors may indicate
in their submission if it should be only considered for one of the
presentation types. Submissions should be in PDF and include title, author
information, and a 4-page extended abstract. Shorter submissions are also
welcome, particularly for poster presentation.

Please use the following EasyChair submission link:
https://easychair.org/conferences/?conf=bda20160

Note: The workshop will not include published proceedings. In particular, we
welcome submissions of extended abstracts describing work that has appeared or
is expected to appear in other venues.

=================================
Support for students and postdocs
=================================
To encourage the participation of researchers at the early stages of their
career, the NSF has generously granted us with the means to provide financial
support for student and postdoc participants. Specifically, for each accepted
(oral or poster) presentation, we will reimburse the registration fee and
at least $350 of additional travel expanses (the exact amount will be
determined later
on but it is expected to be higher) of one student/postdoc author.

===============
IMPORTANT DATES
===============
April 30, 2016 – Extended abstract submission deadline
May 25, 2016 – Decision notifications
July 25, 2016 – Workshop

================
INVITED SPEAKERS
================
Bernard Chazelle - Princeton
Melanie Moses - UNM
Konrad Kording - Northwestern

=================
PROGRAM COMMITTEE
=================
Ziv Bar-Joseph - CMU
Anna Dornhaus - University of Arizona
Yuval Emek - Technion (co-chair)
Amos Korman - CNRS and University of Paris Diderot
Nancy Lynch - MIT
Saket Navlakha - Salk Institute (co-chair)


--
Yuval Emek, Ph.D.
Assistant Professor
Industrial Engineering and Management
Technion - Israel Institute of Technology
http://ie.technion.ac.il/~yemek/

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

Message: 4
Date: Thu, 21 Apr 2016 15:54:32 +0100
From: Jozef Skokan <jozef.skokan.math@gmail.com>
To: DMANET@zpr.uni-koeln.de
Subject: [DMANET] Two One-Day Colloquia in Combinatorics 2016
Message-ID:
<CACRCtZPPXiJ99pXET3xCaKrvcx6KwKa=iJ3_bG7meAbk3vJPAA@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

Two One-Day Colloquia in Combinatorics

London, 11th - 12h May 2016

The tenth One-Day Colloquia in Combinatorics will take place at Queen
Mary (Wednesday 11th May) and LSE (Thursday 12th May). The programme
starts
at 10:30 on both days.

The speakers at Queen Mary are:

Karim Adiprasito, Bela Bollobas, David Conlon, Andrew Granville,
Imre Leader and Yufei Zhao.

The speakers at LSE are: Alan Frieze, Monique Laurent, Nati Linial,
Daniela Kuehn, James Maynard and Benny Sudakov.

See http://tiny.cc/Colloquia for the details of the programme,
abstracts of the talks, support for students and information about the
venues.


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

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 21
**************************************

Thursday, April 21, 2016

dmanet Digest, Vol 98, Issue 20

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. ATMOS 2016 Call for Papers (Marc Goerigk)
2. 2nd Call for Papers: GD 2016 -- 24th Int. Symp. on Graph
Drawing and Network Visualization (Martin Nöllenburg)


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

Message: 1
Date: Tue, 19 Apr 2016 18:13:45 +0100
From: Marc Goerigk <m.goerigk@math.uni-goettingen.de>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] ATMOS 2016 Call for Papers
Message-ID: <57166749.7090809@math.uni-goettingen.de>
Content-Type: text/plain; charset="utf-8"; format=flowed

16th Workshop on Algorithmic Approaches for Transportation Modeling,
Optimization, and Systems (ATMOS 2016)
(http://conferences.au.dk/algo16/atmos/)

Call for Papers

The workshop on Algorithmic Approaches for Transportation Modeling,
Optimization, and Systems (ATMOS) is an annual event bringing together
researchers and practitioners who are interested in all aspects of
algorithmic methods and models for transportation optimization. The
workshop provides a forum for the exchange and dissemination of new
ideas and techniques. The aim of making transportation better gives rise
to very complex and large-scale optimization problems requiring
innovative solution techniques and ideas from mathematical
optimization,theoretical computer science, and operations research.
Applicable tools and concepts include those from graph and network
algorithms, combinatorial optimization, approximation and online
algorithms, stochastic and robust optimization.

Topics

We invite authors to present work that advances optimization methods and
algorithms to facilitate planning and operational management of freight
and passenger transportation and traffic. The workshop welcomes but is
not limited to papers addressing the following challenges:
• Demand Forecasting
• Models for User Behavior
• Design of Pricing Systems
• Infrastructure Planning
• Multi-modal Transport Optimization
• Mobile Applications for Transport
• Congestion Modeling and Reduction
• Line Planning
• Timetable Generation and Information
• Routing and Platform Assignment
• Vehicle Scheduling
• Route Planning
• Crew and Duty Scheduling
• Rostering
• Delay Management
• Routing in Road Networks
• Traffic Guidance
The workshop welcomes but is not limited to papers applying and
advancing the following techniques: Graph and Network Algorithms,
Combinatorial Optimization, Mathematical Programming, Approximation
Algorithms, Methods for the Integration of Planning Stages, Stochastic
and Robust Optimization, Online and Real-time Algorithms, Algorithmic
Game Theory, Heuristics for Real-world Instances, Simulation Tools.

Submission guidelines

Authors are invited to submit an extended abstract or full paper of at
most 12 pages (including title page, abstract, references, but not
counting an optional appendix). Submissions must be formatted in LaTeX,
using the OASIcs style file. 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 can be
put into an appendix to be read by the program committee members at
their discretion. Papers must be submitted electronically via the
EasyChair submission system at

https://easychair.org/conferences/?conf=atmos2016

The submission must be received by *16 June 2016*.

By submitting a paper the authors acknowledge that in case of acceptance
at least one of the authors must register at ALGO 2016 or ATMOS 2016,
attend the conference, and present the paper. The proceedings will be
published online and as open-access in the Dagstuhl Open Access Series
in Informatics (OASIcs).

Important dates

Submission: 16 June 2016
Notification of acceptance: early July
Final version: 29 July 2016
Symposium: 25 August 2016

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

Message: 2
Date: Wed, 20 Apr 2016 13:16:38 +0200
From: Martin Nöllenburg <noellenburg@ac.tuwien.ac.at>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] 2nd Call for Papers: GD 2016 -- 24th Int. Symp. on
Graph Drawing and Network Visualization
Message-ID: <2349A443-2D36-4DAD-B8AB-8A9BC6E01DD4@ac.tuwien.ac.at>
Content-Type: text/plain; charset=utf-8

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

2nd Call for Papers

GD 2016

24th International Symposium on
Graph Drawing and Network Visualization

September 19-21, 2016 – Athens, Greece
http://algo.math.ntua.gr/~gd2016/

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

PDF version: http://algo.math.ntua.gr/~gd2016/data/uploads/gd16-cfp.pdf

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

Graph Drawing is concerned with the geometric representation of graphs and
constitutes the algorithmic core of Network Visualization. Graph Drawing and
Network Visualization are motivated by applications where it is crucial to
visually analyze and interact with relational datasets. Examples of such
application areas include data science, social sciences, Web computing,
information systems, biology, geography, business intelligence, information
security and software engineering.

GD has been the main annual event in this area for more than 20 years. Its
focus is on combinatorial and algorithmic aspects of graph drawing as well as
the design of network visualization systems and interfaces. GD 2016 will be
hosted by the Institute of Communications and Computer Systems, an affiliate of
the National Technical University of Athens from September 19 to 21, 2016 in
Athens, Greece. Researchers and practitioners working on any aspect of graph
drawing and network visualization are invited to contribute papers and posters
and to participate in the symposium and the graph drawing contest.

PAPERS
------

We invite authors to submit papers describing original research of theoretical
or practical significance to graph drawing and network visualization. Regular
papers must be submitted explicitly to one of two distinct tracks. Papers
submitted to one track will not compete with papers submitted to the other
track.

Track 1: Combinatorial and algorithmic aspects
----------------------------------------------

This track is mainly devoted to fundamental graph drawing advances, such as
combinatorial aspects and algorithm design. The range of topics for this track
includes (but is not limited to):

• Design and analysis of graph drawing algorithms
• Geometric graph theory
• Geometric computing
• Planarity and topological graph theory
• Optimization on graphs

Track 2: Experimental, applied, and network visualization aspects
-----------------------------------------------------------------

This track is mainly devoted to the practical aspects of graph drawing, such as
the development of network visualization systems and interfaces in different
application areas. The range of topics for this track includes (but is not
limited to):

• Visualization of graphs and networks in real world applications, including big data
• Engineering of network visualization algorithms and systems
• Experimental results in graph theory and algorithms
• Benchmarks and experimental studies of network visualization systems and user interfaces
• Cognitive studies on graph drawing readability and user interaction
• Interfaces and methods for interacting with graphs

Short papers
------------

Besides regular papers in the two tracks above there will be a separate
category for short papers. In this category it will be possible to submit
theoretical contributions and applied papers of shorter length. Papers in this
category will be assigned a shorter time for presentation during the conference.

Demos
-----

Authors of applied regular and short papers will have the opportunity to show a
demo of their software/system during the poster session.

Submission format
-----------------

All submissions must be formatted using the LaTeX style file for the conference
series Lecture Notes in Computer Science (LNCS) provided by Springer. The
default margins and fonts must not be modified. Submissions that do not comply
with this format risk being rejected. The length of regular papers is limited
to 12 pages (excluding references), while the length of short papers is limited
to 6 pages (excluding references). The claims of the paper should be fully
substantiated, including full proofs or appropriate experimental data. If this
information does not fit within the page limits, the authors should include it
in a clearly marked appendix, whose length is not constrained and which the
reviewers may read at their own discretion.

POSTERS
-------

Submissions of posters on graph drawing, network visualization, and related
areas are also solicited. The poster session will provide a forum for the
communication of late-breaking research results (which may also appear
elsewhere) to the graph drawing community. Authors of posters should prepare an
abstract (up to two pages in the LNCS style) that must be submitted together
with the poster itself.

CONTEST
-------

Details about the traditional Graph Drawing Contest held at the conference will
be provided on the conference Web site.

PUBLICATION
-----------

All accepted papers will appear in the conference proceedings, published by
Springer in the Lecture Notes in Computer Science (LNCS) series and, following
a green open access policy, as a conference index on the arXiv repository. The
LNCS proceedings will be made freely accessible to the GD community upon
publication and openly accessible to anyone after four years. The self-archived
arXiv proceedings will provide immediate and unrestricted open access. Twelve
pages (excluding references) will be allocated for regular papers and six pages
(excluding references) for short papers. Upon submission of the camera-ready
version of accepted papers, the identical paper (optionally including a clearly
marked appendix) must be submitted to the arXiv repository and its arXiv
identifier must be specified for inclusion in the conference index. For each
paper, an author must register and present the paper at the conference (baring
unforeseen circumstances) otherwise the paper will not be included in the
proceedings. Abstracts of accepted posters will also appear in the conference
proceedings (two pages), but will not be made available for indexing. Selected
papers will be invited for submission to a special issue of the Journal of
Graph Algorithms and Applications.

AWARDS
------

For each of the two tracks, the Program Committee of GD 2016 will give a Best
Paper Award. In addition, to recognize the effort of participants to present
their work and to prepare their posters in a clear and elegant way, there will
be a Best Presentation Award and a Best Poster Award voted on by the GD 2016
attendees.


IMPORTANT DATES
---------------

Paper submission deadline June 12 (23:59 PDT)
Notification of paper acceptance July 24
Poster submission deadline August 17 (23:59 PDT)
Notification of poster acceptance August 28
Final versions due September 1
Contest submission deadline September 11
Symposium on Graph Drawing and Network Visualization September 19-21

INVITED SPEAKERS
----------------

Daniel Keim, University of Konstanz, DE
Roger Wattenhofer, ETH Zurich, CH

PROGRAM COMMITTEE
-----------------

Patrizio Angelini, University of Tübingen, DE
Therese Biedl, University of Waterloo, CA
Walter Didimo, University of Perugia, IT
Cody Dunne, IBM Watson Health, USA
David Eppstein, UC Irvine, USA
Jean-Daniel Fekete, INRIA, FR
Stefan Felsner, TU Berlin, DE
Radoslav Fulek, IST Austria, AT
Emden Gansner, Google, USA
Yifan Hu (co-chair), Yahoo Labs, USA
Karsten Klein, Monash University, AU
Stephen Kobourov, University of Arizona, USA
Marc van Kreveld, Utrecht University, NL
Jan Kynčl, Charles University Prague, CZ
Kwan-Liu Ma, UC Davis, USA
Tamara Mchedlidze, Karlsruhe Institute of Technology, DE
Martin Nöllenburg (co-chair), TU Vienna, AT
Stephen North, Infovisible, Oldwick, USA
Maurizio Patrignani, Roma Tre University, IT
Helen Purchase, University of Glasgow, UK
Huamin Qu, HKUST, Hong Kong
Günter Rote, FU Berlin, DE
André Schulz, University of Hagen, DE
Lei Shi, Chinese Academy of Science, CN
Alexandru Telea, University of Groningen, NL

ORGANIZING COMMITTEE
--------------------

Kostas Karpouzis, National Tech. Univ. of Athens, GR
Chrysanthi Raftopoulou, National Tech. Univ. of Athens, GR
Antonios Symvonis (chair), National Tech. Univ. of Athens, GR
Ioannis Tollis, University of Crete and ICS-FORTH, GR

CONTEST COMMITTEE
-----------------

Philipp Kindermann, University of Hagen, DE
Maarten Löffler (chair), Utrecht University, NL
Lev Nachmanson, Microsoft Research, USA
Ignaz Rutter, Karlsruhe Institute of Technology, 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 98, Issue 20
**************************************

Wednesday, April 20, 2016

dmanet Digest, Vol 98, Issue 19

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. FINAL CFP: 10th Multidisciplinary Workshop on Advances in
Preference Handling (M-PREF) 2016 with IJCAI 2016 (Nicholas Mattei)
2. One Ph.D. position in Approximation Algorithms at IDSIA,
University of Lugano, Switzerland (Fabrizio Grandoni)
3. Open Post Doc Position in Operations research at INRIA Lille
, INOCS team (Luce Brotcorne)


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

Message: 1
Date: Tue, 19 Apr 2016 16:48:21 +1000
From: Nicholas Mattei <nsmattei@gmail.co
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] FINAL CFP: 10th Multidisciplinary Workshop on
Advances in Preference Handling (M-PREF) 2016 with IJCAI 2016
Message-ID:
<CAKa3QmDerGW6Gaqp_hq+2XCdYB5rKAbGwvc0AK+gUQ7UZCrLvw@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8


======================================================================
Final CALL FOR PAPERS:

10th Multidisciplinary Workshop on
Advances in Preference Handling (M-PREF)
New York, USA, July 9, 2016
in conjunction with IJCAI-16.

http://www.mpref-2016.preflib.org
======================================================================

Preference handling has become a flourishing topic. There are many
interesting results, good examples for cross-fertilization between
disciplines, and many new questions.

Preferences are a central concept of decision making. As preferences
are fundamental for the analysis of human choice behavior, they are
becoming of increasing importance for computational fields such as
artificial intelligence, databases, and human-computer interaction as
well as for their respective applications. Preference models are
needed in decision-support systems such as web-based recommender
systems, in automated problem solvers such as configurators, and in
autonomous systems such as Mars rovers. Nearly all areas of artificial
intelligence deal with choice situations and can thus benefit from
computational methods for handling preferences. Preference handling is
also important for machine learning as preferences may guide learning
behavior and be subject of dedicated learning methods. Moreover,
social choice methods are also of key importance in computational
domains such as multi-agent systems.

This broadened scope of preferences leads to new types of preference
models, new problems for applying preference structures, and new kinds
of benefits. Preferences are studied in many areas of artificial
intelligence such as knowledge representation & reasoning, multi-agent
systems, game theory, social choice, constraint satisfaction, decision
making, decision-theoretic planning, and beyond. Preferences are
inherently a multi-disciplinary topic, of interest to economists,
computer scientists, operations researchers, mathematicians and more.

This workshop promotes this broadened scope of preference handling and
continues a series of events on preference handling at AAAI-02,
Dagstuhl in 2004, IJCAI-05, ECAI-06, VLDB-07, AAAI-08, ADT-09,
ECAI-2010, ECAI-2012, IJCAI-13, AAAI-14, and IJCAI-15. At the
previous edition of ADT-15 and LPNMR-15, which were co-located, one of
the conclusions was that collaboration between the two areas can be
very fruitful and should be fostered.

The workshop will provide a forum for presenting advances in
preference handling and for exchanging experiences between researchers
facing similar questions, but coming from different fields. The
workshop builds on the large number of AI researchers working on
preference-related issues, but also seeks to attract researchers from
databases, multi-criteria decision making, economics, etc.


======================================================================
TOPICS OF INTEREST
======================================================================

The workshop on Advances in Preference Handling addresses all
computational aspects of preference handling. This includes methods
for the elicitation, learning, modeling, representation, aggregation,
and management of preferences and for reasoning about preferences. The
workshop studies the usage of preferences in computational tasks from
decision making, database querying, web search, personalized
human-computer interaction, personalized recommender systems,
e-commerce, multi-agent systems, game theory, social choice,
combinatorial optimization, planning and robotics, automated problem
solving, perception and natural language understanding and other
computational tasks involving choices. The workshop seeks to improve
the overall understanding of and best methodologies for preferences in
order to realize their benefits in the multiplicity of tasks for which
they are used. Another important goal is to provide
cross-fertilization between the numerous sub-fields that work with
preferences.

* Preference handling in artificial intelligence
* Preference handling in database systems
* Preference handling in multiagent systems
* Applications of preferences
* Preference elicitation
* Preference representation and modeling
* Properties and semantics of preferences
* Practical preferences


======================================================================
IMPORTANT DATES
======================================================================

May 1st, 2016: Workshop paper submission deadline.
May 20th, 2016: Notification on workshop paper submissions.
June 1st, 2016: Camera-ready copy due to organizers.
July 9th, 10th, or 11th, 2016: M-PREF'16 Workshop.


=====================================================================
SUBMISSION
=====================================================================

Researchers interested in preference handling from AI, OR, DB, CS or
other computational fields may submit a paper formatted according to
the IJCAI Formatting Instructions and up to 6 pages in length + 1 page
for references in PDF format. Workshop submissions and camera ready
versions will be handled by EasyChair. Feel free to submit either
anonymized or non-anonymized versions of your work. We have enabled
anonymous reviewing so EasyChair will not reveal the authors unless
you chose to do so in your submission.

At least one author from each accepted paper must register for the
workshop. Please see the IJCAI 2016 Website for information about
accommodation and registration.

Link to the paper submission page on EasyChair:

https://easychair.org/conferences/?conf=mpref16


======================================================================
WORKSHOP CHAIRS
======================================================================

Markus Endres, University of Augsburg (Germany)
Nicholas Mattei, Optimization Research Group, Data 61 (NICTA) and
University of
New South Wales (Australia)
Andreas Pfandler, TU Wien (Austria) and University of Siegen (Germany)

======================================================================
PROGRAM COMMITTEE
======================================================================

Thomas Allen, University of Kentucky
Stefano Bistarelli, Università di Perugia
Sylvain Bouveret, LIG – Grenoble INP
Darius Braziunas, Kobo Inc.
Jan Chomicki, University at Buffalo
Paolo Ciaccia, University of Bologna
James Delgrande, Simon Fraser University
Matthias Ehrgott, Lancaster
Gabor Erdelyi, Universitaet Siegen
Johannes Fürnkranz, TU Darmstadt
Judy Goldsmith, University of Kentucky
Ulrich Junker
Souhila Kaci, LIRMM
Jérôme Lang, LAMSADE
Nicolas Maudet, Université Pierre et Marie Curie
Vincent Mousseau, LGI, Ecole Centrale Paris
Patrice Perny, LIP6
Maria Silvia Pini, University of Padova
Francesca Rossi, University of Padova and Harvard University
Scott Sanner, University of Toronto
Alexis Tsoukias, CNRS – LAMSADE
Kristen Brent Venable, Tulane University and IHMC
Paolo Viappiani, CNRS and LIP6, Univ Pierre et Marie Curie
Toby Walsh, UNSW and Data61/NICTA
Antonius Weinzierl, Vienna University of Technology
Paul Weng, SYSU-CMU JIE
Lirong Xia, RPI
Neil Yorke-Smith, American University of Beirut
Yong Zheng, DePaul University

--

*Nicholas Mattei*

Senior Researcher | Optimisation / Algorithmic Decision Theory

Lecturer | University of New South Wales (UNSW)

*DATA61 | CSIRO*

E nicholas.mattei@nicta.com.au T +61 2 8306 0464 W www.nickmattei.net

Neville Roach Laboratory (UNSW Campus), Locked Bag 6016, Sydney NSW 1466,
Australia

www.data61.csiro.au


CSIRO's Digital Productivity business unit and NICTA have joined forces to
create digital powerhouse Data61

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

Message: 2
Date: Tue, 19 Apr 2016 13:19:19 +0200
From: Fabrizio Grandoni <fabrizio.grandoni@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] One Ph.D. position in Approximation Algorithms at
IDSIA, University of Lugano, Switzerland
Message-ID:
<CAJv5pPBj6ptf=nOcO7RcL4dbVSD7Wxu36HY8KGKPu5H_VgpzbA@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

The Algorithms and Complexity Group of IDSIA, University of Lugano
(Switzerland), opens one Ph.D. position in the area of approximation
algorithms. The position is supported by the SNSF Grant "Approximation
Algorithms for Network Problems", that already supports another Ph.D.
student and one PostDoc.

The position is for 3 years, with the possibility of an extension by 1
year (subject to approval by SNSF). The gross salary is roughly 50.000
CHF per year (low taxes). There is generous travel support.

The ideal candidate should be bright and creative, and hold (or be
close to obtaining) a Master Degree in Computer Science or related
areas. A solid background in Algorithms, Computational Complexity,
Discrete Mathematics, Probability Theory, and/or Graph Theory is
helpful. A good knowledge of written and spoken English is also
required (while knowledge of Italian is not needed).

Team members will have the opportunity to cooperate with the
Algorithms and Complexity group at IDSIA, which currently consists of
8 researchers. IDSIA offers an international working environment.

Lugano is a tidy and lively town, with a wonderful view on Ceresio
lake and mountains around. Ticino Canton offers many opportunities for
hiking, biking, skiing, etc. Restaurants serve very good (Italian
style!) food.

Any interested candidate should email a detailed CV (including a list
of passed Master degree exams with marks, a list of publications, if
any, and up to 3 references) to "fabrizio@idsia.ch" as soon as
possible. The position will be filled as soon as a strong candidate
will apply. In order to receive full consideration, please email your
CV by the end of April.

Further details about the project, the position, and how to apply can
be found at:
http://people.idsia.ch/~grandoni/SNF2015.html

For any question, do not hesitate to contact:

Prof. Fabrizio Grandoni
fabrizio@idsia.ch
http://people.idsia.ch/~grandoni/


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

Message: 3
Date: Tue, 19 Apr 2016 16:15:24 +0200 (CEST)
From: Luce Brotcorne <luce.brotcorne@inria.fr>
To: DMANET@zpr.uni-koeln.de
Subject: [DMANET] Open Post Doc Position in Operations research at
INRIA Lille , INOCS team
Message-ID:
<1217478036.25249043.1461075324147.JavaMail.zimbra@inria.fr>
Content-Type: text/plain; charset=ISO-8859-1


A Post-Doc position in Operations research is available at INRIA Lille (France) in the INOCS team :
https://team.inria.fr/inocs/


Title of the proposal : New Models and Methods for Demand Response in a Smart Grid Context

Supervisor of the Post-doc : Luce Brotcorne, Miguel F. Anjos (INRIA International Chair), Martine Labbé.

Keywords : Smart Grid, Optimization, Bilevel problems.

Do not hesitate to send your cv and contact Luce Brotcorne : luce.brotcorne@inria.fr before april 21 2016.

Job offer description

Context:


Electricity is a critical source of energy for our society. Due to the fundamental importance of electricity, economic growth is inevitably accompanied by a corresponding growth in the demand for electricity. However, investment in the power system infrastructure almost invariably lags this growth in demand, resulting in a reduction (and sometimes near absence) of spare supply, and hence a tightly constrained operating context. The operating time period of highest power consumption are called peaks and represent a major concern for the system operator.

A smart grid is the combination of a traditional electrical power production, transmission and distribution system with two-flows of information and of energy between suppliers and consumers. This combination is expected to deliver energy savings, cost reductions, and increased reliability and security. Nevertheless it induces new challenges to operate the resulting system. These include using the power grid already in place more efficiently, integrating renewable energy sources such as wind and solar power generation, managing the flows of power and of information, and integrating loads as active participants in the grid operations.

A central challenge in the full implementation of the smart grid is the effective integration of the customers as active participants in the grid, a process generally referred to as demand response . To capture this non cooperative sequential decision making process, we use a leader-follower approach. In its simplest form, this game-theoretic framework includes two players, namely the leader and the follower. The leader intrinsically integrates the reaction of the follower in its optimization process. The resulting model is a bilevel optimization problem.

Goal:


The goal of the project is i) to develop new bilevel optimization models to represent demand response in a smart grid energy management context, ii) to design and test new algorithms to solve the problem.


More precisely the objectives consists in extending the models propose by Afsar et al. [1] by taking into account the fact that the customers may decide to adjust their consumption or decline to consume and by integrating renewable energy sources. The algorithms developed to solve the problem (exact methods, or matheuristics) will be sharply based on the structure of the problem.

Skills and profile

Good knowledge in mathematical programming, combinatorial optimization, algorithmic.


Ability in programming in C++ or java. Knowledge of optimization solvers such as CPLEX or GUROBI is an add.


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

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 19
**************************************