Tuesday, March 8, 2016

dmanet Digest, Vol 97, Issue 9

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. Postdoctoral Researchers and Research Fellow positions in
Computer Science, DL 1 April 2016 (Jukka Suomela)
2. Two PhD studentships in Optimization (Strathclyde Business
School, UK) (Kerem Akartunali)
3. Call for Presentations: ESCC 2016, Marathon, Athens, Greece
(Steffen Rebennack)
4. 2nd CFP: Graphical Models for Security (GraMSec'16)
(Barbara Kordy)
5. Junior Professorship (W1) Algorithmic Game Theory (Sándor Fekete)


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

Message: 1
Date: Mon, 7 Mar 2016 21:20:24 +0200
From: Jukka Suomela <jukka.suomela@aalto.fi>
To: <DMANET@zpr.uni-koeln.de>
Subject: [DMANET] Postdoctoral Researchers and Research Fellow
positions in Computer Science, DL 1 April 2016
Message-ID: <56DDD478.3060402@aalto.fi>
Content-Type: text/plain; charset="utf-8"; format=flowed

Aalto University and the University of Helsinki, the two leading
universities in Finland within computer science and information
technology, are looking for several researchers in Computer Science. For
a detailed list of the research areas please visit:
https://www.hiit.fi/openpositions/details-available-positions-computer-science

For the full call text and information about the application process
please visit
http://www.aalto.fi/fi/about/careers/jobs/view/668/

The deadline for sending the application is 1 April 2016 at 2pm Finnish
time.


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

Message: 2
Date: Mon, 7 Mar 2016 23:31:11 +0000
From: Kerem Akartunali <kerem.akartunali@strath.ac.uk>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Two PhD studentships in Optimization (Strathclyde
Business School, UK)
Message-ID:
<4B17C6D6A097C347A22F9A3FB601F5B93ECE9BFD@EX2010-MBX2.ds.strath.ac.uk>
Content-Type: text/plain; charset="Windows-1252"


Two PhD studentshsips in optimization are available at the Dept. of Management Science, University of Strathclyde Business School, Glasgow, UK. Funding is available to cover 3 years of tuition fees plus a tax free stipend (currently higher than £14,000 per year). Both studentships are open to candidates from any nationality (UK/EU/international), and the project topics are:

1) Data Mining in Social Networks
2) Node Deletion and Edge Deletion Problems in Networks

More details about the projects, funding, expected skills and how to apply are provided below. Also check the following link for further details (as well as other PhD studentships in the department):

http://www.strath.ac.uk/studywithus/scholarships/strathclydebusinessschoolscholarships/managementsciencescholarships/


ABOUT THE PROJECTS

1) Data Mining in Social Networks: Social data from networks such as Twitter and Facebook can be represented as networks. Similarly, various data about city living obtained through City Observatory housed in the Technology & Innovation Centre (TIC) Future Cities theme can be represented in a similar structure, using individuals as nodes of such a network and their connections as edges of the network. The proposed project will design efficient algorithms to mine opinions and sentiments in such networks, in particular in real-time and when big data is present. The problem of sentiment and opinion analysis involves studying the negative and positive expressions opined in social media on a specific subject matter. We will work on such algorithms that volume and velocity of data accumulated in the context of social media is the most crucial design factor. This will also exploit some of the theoretical insights gained in an ongoing cross-faculty PhD project with Department of Mathematics & Statistics. The project aims to establish both theoretical and computational analysis, using various tools and techniques such as network optimization, design of algorithms and integer programming. As part of the computational work, we plan to use ARCHIE-WeSt, the high performance computing centre housed at University of Strathclyde.

2) Node Deletion and Edge Deletion Problems in Networks: In this project, we plan to develop efficient algorithms to study the node and edge deletion problems on networks. These problems stem from various important applications in energy networks (e.g., how to build a network that can survive failures on particular power lines), epidemic containment (e.g., how to ensure disconnectivity between various populations) and defense operations (e.g., where to focus attacks on enemy to ensure faster victory). The problem involves in effectively identifying a subset of nodes or edges of a network, which on deletion results in a subgraph with desirable properties. Some of the properties of interest include the connectivity in the graph, a restrictive size of the largest component, and denseness of the components formed. As part of the research, we plan to establish theoretical and empirical analysis for two specific network types. The theoretical work might include methods such as complexity analysis, analysis of the hardness of approximation and developing approximation algorithms and polyhedral analysis for the problems. The experimental work might involve designing and implementing exact computational integer programs and efficient heuristics that would be built upon the theoretical foundation.


FUNDING AND ELIGIBILITY

Funding is available to cover 3 years of tuition fees for a UK/EU/international student, plus a tax free stipend higher than £14,000 per year. The student will be given opportunities to attend a conference and/or specialized training every year.

These PhD projects require a highly numerate graduate with skills and interests in computational science. Candidates should have at least a strong Honours degree or equivalent (a strong 2:1 Honours degree, or a B.Sc. degree with 3.3 GPA in a 4.0 system), or preferably a Master's degree in a quantitative discipline such as industrial engineering, operations research, mathematics or computer science (amongst others). Experience in programming and fundamental knowledge in optimization (in particular integer programming) are not essential but highly desirable. Candidates who are not native English speakers will be required to provide evidence for their English skills (such as by IELTS or similar tests that are approved by UKVI, or a degree completed in an English speaking country)

Applications are admitted until 31st May, or until a suitable candidate is found thereafter.


HOW TO APPLY

All PhD applications are to be made online at http://pgr.strath.ac.uk/. All documents (including scans of original documents) can be uploaded during the online application process. Candidates are expected to submit a cover letter, a research proposal detailing their 3-year plan, CV, any university degree certificates and transcripts, English test results (if applicable), two recommendation letters (or contact details of two referees, if letters are not available to them), and any other supporting documents. In order to be considered for this studentship, candidates should specifically note the title of this project in their online application when prompted about funding and their source of finance, and they should notify Ms Alison Kerr for their intent for studentship application.

More information about the department can be found here: http://www.strath.ac.uk/business/managementscience/

Informal enquiries about the projects to Dr Kerem Akartunali (kerem.akartunali@strath.ac.uk) or Dr Ashwin Arulselvan (ashwin.arulselvan@strath.ac.uk).

Enquiries regarding applications to: Ms Alison Kerr (alison.kerr@strath.ac.uk)

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

Message: 3
Date: Mon, 7 Mar 2016 21:27:53 -0700
From: Steffen Rebennack <steffen.rebennack@gmail.com>
To: DMANET@zpr.uni-koeln.de
Subject: [DMANET] Call for Presentations: ESCC 2016, Marathon, Athens,
Greece
Message-ID:
<CADo=1XJ0YOp3me2RTxzj5OC=ehSdOQZvqoYn8kfjw6AF+xkAXA@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

We are pleased to invite you to the *3rd International Conference on
"Energy, Sustainability and Climate Change" - ESCC 2016*, which will take
place near the historical place of the Battle of Marathon at Cabo Verde
Hotel, Marathone, Greece, on July 10-16, 2016, under the auspices of the
University of Florida (UF), USA and the University of Thessaly (UTH),
Greece. The conference aims on bringing together leading experts in the
fields of Energy, Sustainability and Climate Change as well as optimization
and computational methods to discuss recent advancements and trending
topics.

The topics of the conference include, but are certainly not limited to the
following subjects: Energy Systems, Energy Efficiency, Emissions, Fuels,
Sustainability in Supply Chain, Multi-objective Optimization, Renewable
Energy, Linear and Nonlinear Optimization, Integer and Combinatorial
Optimization, Convex and Nonsmooth Optimization, Global Optimization,
Semi-definite Programming, Semi-infinite Programming, Stochastic
Optimization, Complementarity and Variational Inequality Problems, Network
Optimization, Scheduling Problems, Optimal Control, Automatic
Differentiation, Optimization Software, Decision Making, Decision Support
Systems, Multi-criteria Analysis, Vulnerability, Sustainability &
Stochasticity, Transportation, Logistics, Maritime and Air Transportation,
Energy & Environment, Power Systems, Power Generation and Trading,
Electricity Risk Management and Competition in Electricity Markets, Process
Optimization, Synthesis, Design and Operation

*Submission of Abstracts:*

Those interested in giving talks are invited to submit abstracts via the
website or registration page.

Abstracts should not exceed 400 words and should be written as plain text.
We kindly ask to avoid the use of complicated notation or mathematical
formulas which cannot be written in plain text.

*Important Deadlines:*

Abstract submissions: March 31st, 2016

Notification of acceptance: Mai 1st, 2016

Early registration: May 31st, 2016

*Registration Fee:*

Conference participants can register and pay the registration fee early (by
bank transfer) or late (cash, on-site). Note that this year there is
available a registration fee including rooms at the hotel of the
conference. For more details about the registration options please check
out our website.

A copy (photocopy) of the document for payment will be sent to the
Secretariat of the conference by email: conference.escc@gmail.com. Please
note in the etiology of the deposit your name, your abstract number and the
conference acronym (e.g. Papadopoulos K, Q33, escc2016).

*Plenary Speakers:*

*Professor Fuad Aleskerov, HSE, Russia*

*Professor Stefan Pickl, University of Munich, Germany*

Additional information can be found at the conference's website.

For further information, please contact:

Dr. George K.D. Saharidis (saharidis@gmail.com) or alternative contact the
secretary of the conference (conference.escc@gmail.com)

We look forward to welcoming you to the conference.

*Chairmen of the Conference:*

*Dr. Panos Pardalos (University of Florida, USA)Dr. Georgios K.D. Saharidis
(University of Thessaly, Greece) *

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

Message: 4
Date: Tue, 8 Mar 2016 09:46:30 +0100
From: Barbara Kordy <barbara.kordy@irisa.fr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] 2nd CFP: Graphical Models for Security (GraMSec'16)
Message-ID: <56DE9166.1000805@irisa.fr>
Content-Type: text/plain; charset=utf-8; format=flowed

*****************************************************************
GraMSec'16
The Third International Workshop on Graphical Models for Security
Co-located with CSF 2016

Lisbon, Portugal - June 27, 2016
http://gramsec.uni.lu/
*****************************************************************

Graphical security models provide an intuitive but systematic approach to
analyze security weaknesses of systems and to evaluate potential protection
measures. Formal methods and cyber security researchers, as well as
security
professionals from industry and government, have proposed various graphical
security modeling schemes. Such models are used to capture different
security
facets (digital, physical, and social) and address a range of challenges
including vulnerability assessment, risk analysis, defense analysis,
automated defensing, secure services composition, policy validation and
verification. The objective of the GraMSec workshop is to contribute to the
development of well-founded graphical security models, efficient algorithms
for their analysis, as well as methodologies for their practical usage.

The workshop seeks submissions from academia, industry, and government
presenting novel research on all theoretical and practical aspects of
graphical models for security. The topics of the workshop include, but are
not limited to:
- Graphical models for threat modeling and analysis
- Graphical models for risk analysis and management
- Graphical models for requirements analysis and management
- Textual and graphical representation for system, organizational, and
business security
- Visual security modeling and analysis of socio-technical and
cyber-physical systems
- Graphical security modeling for cyber situational awareness
- Graphical models supporting the security by design paradigm
- Methods for quantitative and qualitative analysis of graphical
security models
- Formal semantics and verification of graphical security models
- Methods for (semi-)automatic generation of graphical security models
- Enhancement and/or optimization of existing graphical security models
- Scalable evaluation of graphical security models
- Evaluation algorithms for graphical security models
- Dynamic update of graphical security models
- Game theoretical approaches to graphical security modeling
- Attack trees, attack graphs and their variants
- Stochastic Petri nets, Markov chains, and Bayesian networks for security
- UML-based models and other graphical modeling approaches for security
- Software tools for graphical security modeling and analysis
- Case studies and experience reports on the use of graphical security
modeling paradigm.

IMPORTANT DATES
Submission deadline: April 18, 2016
Acceptance notification: May 20, 2016
Camera ready version: June 3, 2016
GraMSec'16 workshop: June 27, 2016

SUBMISSION INSTRUCTIONS
We solicit two types of submissions:
- Regular papers (up to 15 pages) describing original and unpublished work
within the scope of the workshop.
- Short papers (up to 7 pages) describing original and unpublished work in
progress.

All submissions must be prepared using the LNCS style.

Each paper will undergo a thorough review process. All accepted (regular
and
short) papers will be included in the workshop's post-proceedings. As last
year, we plan to publish the GraMSec'16 post-proceedings in the Lecture
Notes
in Computer Science (LNCS) series of Springer (confirmation pending).
Submissions should be made using the GraMSec'16 EasyChair web site:
https://www.easychair.org/conferences/?conf=gramsec16.

INVITED SPEAKER
The invited lecture of GraMSec'16 will be given by Xinming Ou, associate
professor at Computer Science and Engineering, University of South
Florida, USA

GENERAL CHAIR
Barbara Kordy, INSA Rennes, IRISA, France

PROGRAM COMMITTEE CO-CHAIRS
Mathias Ekstedt, KTH Royal Institute of Technology, Sweden
Dong Seong Kim, University of Canterbury, New Zealand

PROGRAM COMMITTEE
- Mathieu Acher, IRISA, FR
- Massimiliano Albanese, George Mason University, USA
- Ludovic Apvrille, Télécom ParisTech, CNRS LTCI, FR
- Thomas Bauereiss, DFKI GmbH, DE
- Giampaolo Bella, University of Catania, IT
- Stefano Bistarelli, University of Perugia, IT
- Marc Bouissou, EDF R&D, FR
- Frédéric Cuppens, Télécom Bretagne, FR
- Nora Cuppens-Boulahia, Télécom Bretagne, FR
- Binbin Chen, Advanced Digital Sciences Center, SG
- Jason Crampton, RHUL, UK
- Hervé Debar, Télécom SudParis, FR
- Giovanna Dondossola, RSE, IT
- Ulrik Franke, SICS, SE
- Frank Fransen, TNO, NL
- Olga Gadyatskaya, University of Luxembourg, LU
- Paolo Giorgini, University of Trento, IT
- Erlend Andreas Gjare, SINTEF, NO
- Dieter Gollmann, TU Hamburg, DE
- Olivier Heen, Technicolor, FR
- Hannes Holm, Swedish Defence Research Agency, SE
- Siv Hilde Houmb, Secure-NOK AS, NO
- René Rydhof Hansen, Aalborg University, DK
- Ravi Jhawar, University of Luxembourg, LU
- Henk Jonkers, BiZZdesign, NL
- Sushil Jajodia, George Mason University, USA
- Florian Kammueller, Middlesex University London, UK
- Nima Khakzad, TU Delft, NL
- Pascal Lafourcade, University of Auvergne, FR
- Jean-Louis Lanet, INRIA, FR
- Jean Leneutre, Télécom ParisTech, FR
- David Lubicz, DGA, FR
- Sjouke Mauw, University of Luxembourg, LU
- Per Hakon Meland, SINTEF, NO
- Jogesh Muppala, HKUST, HK
- Simin Nadjm-Tehrani, Linköping University, SE
- Steven Noel, MITRE, USA
- Andreas L. Opdahl, University of Bergen, NO
- Xinming Ou, University of South Florida, USA
- Stéphane Paul, Thales Research & Technology, FR
- Ludovic Piètre-Cambacédès, EDF, FR
- Sophie Pinchinat, University Rennes 1, IRISA, FR
- Vincenzo Piuri, University of Milan, IT
- Marc Pouly, Lucerne University of Applied Sciences and Arts, CH
- Cristian Prisacariu, University of Oslo, NO
- Nicolas Prigent, Supélec, FR
- Christian W. Probst, TU Denmark, DK
- David Pym, University College London, UK
- Sasa Radomirovic, ETH Zurich, CH
- Indrajit Ray, Colorado State University, USA
- Frédéric Remi, Amossys, FR
- Arend Rensink, University of Twente, NL
- Yves Roudier, EURECOM, FR
- Pierangela Samarati, University of Milan, IT
- Guttorm Sindre, NUST, NO
- Ketil Stolen, Sintef, NO
- Mariëlle Stoelinga, University of Twente, NL
- Axel Tanner, IBM Research Zürich, CH
- Kishor S. Trivedi, Duke University, USA
- Alexandre Vernotte, KTH, SE
- Luca Vigano, King's College London, GB
- Lingyu Wang, Concordia University, CA
- Jan Willemson, Cybernetica, EE

This call for papers and additional information about the workshop
can be found at http://gramsec.uni.lu/


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

Message: 5
Date: Tue, 8 Mar 2016 11:58:37 +0100
From: Sándor Fekete <s.fekete@tu-bs.de>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>,
Cc: Sándor Fekete <s.fekete@tu-bs.de>, Ina Schaefer
<i.schaefer@tu-braunschweig.de>
Subject: [DMANET] Junior Professorship (W1) Algorithmic Game Theory
Message-ID: <87A490D6-BF5D-475D-9BCA-5BEFE73EED85@tu-bs.de>
Content-Type: text/plain; charset=windows-1252

Technische Universität Braunschweig

The Computer Science Department as part of the Carl Friedrich Gauss Faculty invites applications for a

Junior Professorship (Salary Scale W1)

for Algorithmic Game Theory

(without tenure track) to be appointed at earliest convenience. The candidate is expected to have a strong, internationally visible track record in developing and implementing innovative models and methods in Algorithmic Game Theory. Research interests should include several of the following topics in relation to Algorithmic Game Theory:

• Algorithmic mechanism design
• Inefficiency of equilibria (price of anarchy, price of stability)
• Computing equlibria
• Cooperative game theory
• Distributed algorithms
• Mechanisms for Peer-to-Peer Networks
• Multi-agent systems

The new professorship will further strengthen the department's profile in Theoretical Computer Science, and contribute to expanding the scientific activities into the field of novel technological aspects of cooperation. The candidate is expected to actively seek and successfully acquire third-party funding (e.g., DFG, EU, BMBF). His/her teaching responsibilities should complement our existing Bachelor and Master programs by attractive courses on Algorithmic Game Theory.
At Braunschweig University of Technology (founded in 1745) with more than 16,000 students are Engineering and Natural sciences as core disciplines closely linked with the Economics, Social Sciences, Humanities and Educational sciences. TU Braunschweig is a member of the Alliance TU9 German Institutes of Technology and the City of Braunschweig is as "Europe's research region no. 1" attractive for scientists and their families.
Conditions of appointment are in accordance with § 30, Niedersachsen Higher Education Act (NHG). Part time employment can be arranged on request.
As an equal opportunities employer, TU Braunschweig has set itself the strategic aim of significantly increasing the proportion of women. Female scientists are therefore particularly encouraged to apply. Equally qualified candidates with disabilities will be given preference.
The position is initially limited to three years and may be renewed after a positive evaluation for another three years.
Further information is available from the Head of the Search Committee, Prof. Dr. Ina Schaefer, +49 (0)531 – 391-2275, i.schaefer@tu-bs.de,
or from Prof. Dr. Sándor Fekete, +49 (0)531 – 391-3111, s.fekete@tu-bs.de
Please submit your full application by regular mail before March 31st, 2016 to:
TU Braunschweig, Carl-Friedrich-Gauss-Fakultaet, Prof. Dr. Thomas Sonar, Rebenring 58a, 38106 Braunschweig, Germany (http://www.tu-braunschweig.de/fk1)
We kindly ask you to additionally send a single pdf-file (addressed to fk1@tu-bs.de) and to make sure that all text in the document is searchable.

——

Technische Universität Braunschweig

Im Department für Informatik der Carl-Friedrich-Gauß-Fakultät ist eine

Juniorprofessur (BesGr. W1)

für Algorithmische Spieltheorie

(ohne Tenure-Option) zum nächstmöglichen Zeitpunkt zu besetzen. Von der Stelleninhaberin/dem Stelleninhaber wird internationales Forschungsrenommee im Bereich der Entwicklung und Umsetzung innovativer Modelle und Methoden der Algorithmischen Spieltheorie erwartet.

Forschungsschwerpunkte sollten möglichst viele der folgenden Themen mit Bezug zu Algorithmischer Spieltheorie sein:

• Algorithmic Mechanism Design
• Ineffizienz von Gleichgewichten (price of anarchy, price of stability)
• Berechnung von Gleichgewichten
• Kooperative Spieltheorie
• Verteilte Algorithmen
• Mechanismen für Peer-to-Peer-Netze
• Multi-agent systems

Die Stelleninhaberin/der Stelleninhaber wird das bereits ausgeprägte Profil des Departments Informatik im Bereich der Theoretischen Informatik weiter verstärken und zur Ausdehnung der wissenschaftlichen Aktivitäten in den Bereich neuer technischer Aspekte der Kooperation beitragen. Die Einwerbung und Durchführung eigener Drittmittelprojekte (z.B. DFG, EU, BMBF) wird erwartet. In der Lehre sollen themenbezogene Angebote unsere Bachelor- und Masterstudienprogramme attraktiv ergänzen.
An der Technischen Universität Braunschweig (gegründet 1745) mit 16.000 Studierenden sind Ingenieur- und Naturwissenschaften als Kerndisziplinen eng vernetzt mit den Wirtschafts- und Sozial-, Geistes- und Erziehungswissenschaften. Die TU Braunschweig ist Partner in der Allianz der TU9 German Institutes of Technology. Es wird die Bereitschaft vorausgesetzt, an koordinierten interdisziplinären Programmen mitzuwirken und sich in Forschung und Lehre einzubringen.
Braunschweig liegt im Zentrum einer der forschungsstärksten Regionen der EU. Erstklassige Infrastruktur, regionale, deutschlandweite und internationale Partner in Forschung und Lehre sowie die anregende Forschungsumgebung machen die TU Braunschweig als zertifizierte familiengerechte Hochschule zu einem sehr attraktiven Ort sowohl für Wissenschaftlerinnen und Wissenschaftler als auch für ihre Familien.
Die Einstellungsvoraussetzungen ergeben sich aus § 30 des Niedersächsischen Hochschulgesetzes. Auf Wunsch kann Teilzeitbeschäftigung ermöglicht werden.
Die TU Braunschweig hat sich das strategische Ziel gesetzt, den Anteil von Frauen deutlich zu erhöhen. Wissenschaftlerinnen werden deshalb nachdrücklich um ihre Bewerbung gebeten. Schwerbehinderte Bewerberinnen und Bewerber werden bei gleicher Eignung bevorzugt. Bewerbungen von Wissenschaftlerinnen und Wissenschaftlern aus dem Ausland sind ausdrücklich erwünscht.
Die Stelle ist zunächst auf drei Jahre befristet und kann nach einer positiven Evaluation um weitere drei Jahre verlängert werden.
Weitere Auskünfte erteilt die Vorsitzende der Berufungskommission, Frau Prof. Dr. Ina Schaefer, Tel. +49 (0)531 391-2275, i.schaefer@tu-bs.de, oder
Prof. Dr. Sándor Fekete, Tel. +49 (0)531 391-3111, s.fekete@tu-bs.de. Schriftliche Bewerbungen richten Sie bitte bis zum 31.03.2016 an den Dekan der Carl-Friedrich-Gauß Fakultät, Herrn Prof. Dr. Thomas Sonar, Rebenring 58a, 38106 Braunschweig. Zusätzlich wird um die elektronische Übersendung eines durchsuchbaren pdf-Dokumentes der Bewerbungsunterlagen an fk1@tu-braunschweig.de gebeten.

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

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 97, Issue 9
*************************************

No comments:

Post a Comment