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. open position (PhD candidate or Post-Doc) in the field of SDN
and NFV in the context of datacenter networks at TU Chemnitz,
Germany (Thomas Bauschert)
2. open position (PhD candidate or Postdoc) in the field of
network security in the context of datacenter networks at TU
Chemnitz, Germany (Thomas Bauschert)
3. 2nd Call for Papers - 5th Workshop on Hot Issues in Security
Principles and Trust (HotSpot 2017) (Ralf Kuesters)
4. Two postdoc positions at Université libre de Bruxelles
(Brussels, Belgium) (Samuel Fiorini)
5. 3rd Competition on the Optimisation of Problems with Multiple
Interdependent Components (Markus Wagner)
----------------------------------------------------------------------
Message: 1
Date: Fri, 23 Dec 2016 12:11:07 +0100
From: "Thomas Bauschert" <thomas.bauschert@etit.tu-chemnitz.de>
To: <DMANET@zpr.uni-koeln.de>
Subject: [DMANET] open position (PhD candidate or Post-Doc) in the
field of SDN and NFV in the context of datacenter networks at TU
Chemnitz, Germany
Message-ID: <001e01d25d0d$426f3cb0$c74db610$@etit.tu-chemnitz.de>
Content-Type: text/plain; charset="iso-8859-1"
The Chair for Communication Networks at TU Chemnitz invites applications for
an open PhD or PostDoc position. The position is available beginning from
January 2017 at the earliest until March 2018. Further continuation is
possible. The area of research is Software Defined Networking (SDN) and
Network Functions Virtualization (NFV) in the context of datacenter
networks. The candidate will participate in the European Celtic-Plus
research project SENDATE Secure-DCI
(https://www.celticplus.eu/project-sendate-secure-dci/).
Requirements:
- MSc or PhD degree in Electrical Engineering and Information
Technology or Computer Science
- Background in the following areas:
- communication networks and protocols (particularly IP and optical
transport networks)
- SDN (OpenDaylight, ONOS), NFV, Cloud technologies (OpenStack), ETSI
MANO
- datacenter network architectures
- modelling, simulation and analysis
- discrete optimization
- Good programming skills
- Good English language skills
Research Field and Responsibilities:
- Resource management and traffic engineering in datacenter/cloud
networks
- Application of SDN and NFV in datacenter/cloud networks
- Mechanisms for dynamic re-configuration of datacenter networks based
on SDN
- Dynamic placement of service function chains in datacenters
considering specific constraints
- Traffic engineering in networked datacenters
- Algorithms/methods for coordination of the aforementioned mechanisms
The Chair for Communication Networks offers an excellent working environment
within our international research group. Taking part in teaching graduate
seminar courses is encouraged but not required. TU Chemnitz envisages to
ensure equal opportunity for men and women. Applications from female
candidates with the advertised qualifications are explicitly solicited.
Applicants should submit their documents (including a letter of interest,
CV, copies of academic certificates and previous scientific work such as
master, diploma or PhD thesis) via Email mentioning the keyword "network"
to:
Technische Universität Chemnitz
Chair for Communication Networks
Prof. Dr.-Ing. Thomas Bauschert
D-09126 Chemnitz, Germany
Email: thomas.bauschert@etit.tu-chemnitz.de
<mailto:matthias.werner@informatik.tu-chemnitz.de>
------------------------------
Message: 2
Date: Fri, 23 Dec 2016 12:13:06 +0100
From: "Thomas Bauschert" <thomas.bauschert@etit.tu-chemnitz.de>
To: <DMANET@zpr.uni-koeln.de>
Subject: [DMANET] open position (PhD candidate or Postdoc) in the
field of network security in the context of datacenter networks at TU
Chemnitz, Germany
Message-ID: <002901d25d0d$89870150$9c9503f0$@etit.tu-chemnitz.de>
Content-Type: text/plain; charset="iso-8859-1"
The Chair for Communication Networks at TU Chemnitz invites applications for
an open PhD or PostDoc position. The position is available beginning from
January 2017 at the earliest until March 2018. Further continuation is
possible. The area of research is network security in the context of
datacenter networks. The candidate will participate in the European
Celtic-Plus research project SENDATE Secure-DCI
(https://www.celticplus.eu/project-sendate-secure-dci/).
Requirements:
- MSc or PhD degree in Electrical Engineering and Information
Technology or Computer Science
- Background in the following areas:
- network security
- datacenter network architectures
- communication networks and protocols (particularly IP and optical
transport networks)
- software defined networking (SDN) and network functions
virtualization (NFV)
- modelling, simulation and analysis
- Good programming skills
- Good English language skills
Research Field and Responsibilities:
- Security and resilience in networked datacenters and cloud networks
- Security risk and impact analysis according to ITU-T X.805
- Mechanisms for service and network layer threat/anomaly detection
- Robust design (wrt. security threats and failures) of networked
datacenters
- Mechanisms for security attack defense/mitigation and resilience for
networked datacenters based on SDN and NFV
The Chair for Communication Networks offers an excellent working environment
within our international research group. Taking part in teaching graduate
seminar courses is encouraged but not required. TU Chemnitz envisages to
ensure equal opportunity for men and women. Applications from female
candidates with the advertised qualifications are explicitly solicited.
Applicants should submit their documents (including a letter of interest,
CV, copies of academic certificates and previous scientific work such as
master, diploma or PhD thesis) via Email mentioning the keyword "security"
to:
Technische Universität Chemnitz
Chair for Communication Networks
Prof. Dr.-Ing. Thomas Bauschert
D-09126 Chemnitz, Germany
Email: thomas.bauschert@etit.tu-chemnitz.de
<mailto:matthias.werner@informatik.tu-chemnitz.de>
------------------------------
Message: 3
Date: Fri, 23 Dec 2016 14:11:24 +0100
From: Ralf Kuesters <kuesters@uni-trier.de>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] 2nd Call for Papers - 5th Workshop on Hot Issues in
Security Principles and Trust (HotSpot 2017)
Message-ID: <9484d6de-2dc3-bcd8-e66a-17c2074649c3@uni-trier.de>
Content-Type: text/plain; charset="utf-8"
2nd CALL FOR PAPERS
===================
HotSpot 2017
5th Workshop on Hot Issues in Security Principles and Trust
===========================================================
Affiliated with ETAPS 2017 ( http://www.etaps.org/2017/ )
Uppsala, Sweden
April 23rd, 2017
https://infsec.uni-trier.de/events/hotspot2017
Important Dates
===============
Deadline for submissions: January 15th, 2017
Notification: February 13th, 2017
Final version for informal proceedings (optional): February 20th, 2017
Workshop: April 23rd, 2017
Invited Speaker
===============
Andrei Sabelfeld, Chalmers University of Technology, Sweden
Taint Tracking without Tracking Taints
Scope
=====
This workshop is intended to be a less formal counterpart to the
Principles of Security and Trust (POST) conference at ETAPS with an
emphasis on "hot topics", both of security and of its theoretical
foundations and analysis.
Submissions about new and emerging topics (for example, those that have
not appeared prominently in conferences and workshops until now) are
particularly encouraged. Submissions of preliminary, tentative work are
also encouraged.
This workshop is organized by the IFIP WG 1.7: Theoretical Foundations
of Security Analysis and Design (http://www.dsi.unive.it./IFIPWG1_7/)
Program Committee Chair
=======================
Ralf Küsters, University of Trier, Germany
Program Committee
=================
Aslan Askarov, Aarhus University, Denmark
David Basin, ETH Zurich, Switzerland
Véronique Cortier, CNRS, Loria, France
Cas Cremers, University of Oxford, UK
Riccardo Focardi, Ca' Foscari University, Italy
Joshua Guttman, Worcester Polytechnic Institute, USA
Boris Köpf, IMDEA Software Institute, Spain
Ninghui Li, Purdue University, USA
Frank Piessens, Katholieke Universiteit Leuven, Belgium
Tamara Rezk, INRIA, France
Peter Ryan, University of Luxembourg, Luxembourg
Mark Ryan, University of Birmingham, UK
Geoffrey Smith, Florida International University, USA
Nikhil Swamy, MSR Redmond, USA
Submissions
===========
Submissions are via
EasyChair: https://easychair.org/conferences/?conf=hotspot2017
There is no page limit, but the length of your submission should be
appropriate to its content. There will be no formal proceedings.
Inclusion in informal proceedings is optional.
Contact
=======
Ralf Küsters (PC chair): kuesters@uni-trier.de
Registration, accommodation, and travel
=======================================
See ETAPS web site http://www.etaps.org/2017/
------------------------------
Message: 4
Date: Fri, 23 Dec 2016 16:28:24 +0100
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: <4F4303DB-E23D-4473-9730-ACD2DCD2130F@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. Each position can be extended by one extra year. 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.
Both positions are expected to start in Fall 2017. E-mail enquiries about the positions are welcome.
------------------------------
Message: 5
Date: Wed, 28 Dec 2016 01:39:03 +0100
From: Markus Wagner <wagner@acrocon.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] 3rd Competition on the Optimisation of Problems with
Multiple Interdependent Components
Message-ID: <28FAAFD3-6441-4B04-94DA-4BB623BE4E81@acrocon.com>
Content-Type: text/plain; charset=utf-8
"3rd Competition on the Optimisation of Problems with Multiple Interdependent Components"
Website: http://cs.adelaide.edu.au/~optlog/TTP2017Comp/ <http://cs.adelaide.edu.au/~optlog/TTP2017Comp/>
(contains links to code, instances, papers, ...)
Motivation
Real-world optimization problems often consist of several NP-hard combinatorial optimization problems that interact with each other. Such multi-component optimization problems are difficult to solve not only because of the contained hard optimization problems, but in particular, because of the interdependencies between the different components. Interdependence complicates a decision making by forcing each sub-problem to influence the quality and feasibility of solutions of the other sub-problems. This influence might be even stronger when one sub-problem changes the data used by another one through a solution construction process. Examples of multi-component problems are vehicle routing problems under loading constraints, the maximizing material utilization while respecting a production schedule, and the relocation of containers in a port while minimizing idle times of ships.
The goal of this competition is to provide a platform for researchers in computational intelligence working on multi-component optimization problems. The main focus of this competition is on the combination of TSP and Knapsack problems. However, we plan to extend this competition format to more complex combinations of problems (that have typically been dealt with individually in the past decades) in the upcoming years.
The set of benchmarks used in this competition follows the idea of the "Travelling Thief Problem" (Mohammad Reza Bonyadi, Zbigniew Michalewicz, Luigi Barone: The travelling thief problem: The first step in the transition from theoretical problems to realistic problems. IEEE Congress on Evolutionary Computation 2013: 1037-1044, http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6557681&tag=1 <http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6557681&tag=1>). Euclidian 2D Traveling Salesperson instances are combined with 0-1-Knapsack instances in such a way that it reflects aspects of problems from the real-world; for example, the total weight of the items in the knapsack influences the travel speed of a traveller. This introduced interdependence sets our benchmarks apart from capacitated vehicle routing problem instances, where this interdependence does not exist. For technical details on how the benchmarks were created, please see the manual (http://cs.adelaide.edu.au/~optlog/TTP2017Comp/2014gecco-ttp.pdf <http://cs.adelaide.edu.au/~optlog/TTP2017Comp/2014gecco-ttp.pdf>, identical to the GECCO 2014 article "A comprehensive benchmark set and heuristics for the traveling thief problem").
Some related work (including approximate approaches, instance analyses, and code) can be found at the University of Adelaide's TTP Project Page (http://cs.adelaide.edu.au/~optlog/research/ttp.php <http://cs.adelaide.edu.au/~optlog/research/ttp.php>).
All 9720 instances are available for researchers to experiment with: http://cs.adelaide.edu.au/~optlog/CEC2014COMP_InstancesNew/ <http://cs.adelaide.edu.au/~optlog/CEC2014COMP_InstancesNew/>. In order to encourage researchers during the weeks before the submission deadline, we invite you to submit solutions for the sample instances - the system to do this will be setup soon. If you are interested in an access ID, please contact Kelly (wanru.gao@adelaide.edu.au <mailto:wanru.gao@adelaide.edu.au>). These results will be displayed online (without a reference to the authors) and then will serve as performance indications for other researchers.
Tracks
Track 1: The original TTP formulation is used, as defined in the documents above.
Track 2: A relaxed TTP formulation is used, in which not all cities need to be visited, and more than one thief can be used (Shelvin Chand, Markus Wagner: Fast Heuristics for the Multiple Traveling Thieves Problem. Genetic and Evolutionary Computation Conference 2016).
In both tracks, the same 9720 instances will be used.
Individuals and teams can make one competition submission per track.
Evaluation
In contrast to previous years, we will not run the code, and we also do not impose any resource limits. The participants will send us the solutions (one solution per instance) in the pre-defined format. This relaxation has the advantage that researchers are no longer bounded by the established "10 minutes of 1 CPU core", opening up the research on multi-component problems to new approaches.
Prize
Markus Wagner provides AUD 1000 in cash. Additional sponsors are being sought right now.
Conference Participation
We encourage the entrants to write papers on their methods and to submit those to an relevant conference. Examples include, among other, CEC 2017, SEA 2017, GECCO 2017, ... (please do not submit the same research several times in parallel, of course)
While we do not require this, we strongly encourage the participants to register for a conference due to the advantages.
Important Dates
1 May 2017 (anywhere on Earth): submission deadline
Please contact us if you want to receive notifications via email.
The Competition Organizers wish you good luck and good health in 2017!
Wanru Gao, http://cs.adelaide.edu.au/~kelly/personalPage/index-kelly.html <http://cs.adelaide.edu.au/~kelly/personalPage/index-kelly.html>, wanru.gao@adelaide.edu.au <mailto:wanru.gao@adelaide.edu.au>
Sergey Polyakovskiy, http://cs.adelaide.edu.au/~sergey <http://cs.adelaide.edu.au/~sergey>, sergey.polyakovskiy@adelaide.edu.au <mailto:sergey.polyakovskiy@adelaide.edu.au>
Markus Wagner, http://cs.adelaide.edu.au/~markus <http://cs.adelaide.edu.au/~markus>, markus.wagner@adelaide.edu.au <mailto:markus.wagner@adelaide.edu.au>
School of Computer Science
The University of Adelaide
Adelaide, Australia
------------------------------
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 107, Issue 1
**************************************
No comments:
Post a Comment