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. ISCO2016 Special Issues on Networks and JOCO: deadline
extension (31 October) (info@isco2016.it)
2. Position of junior research group leader for "Optimization
under Uncertainty" at TU Berlin (Skutella, Martin, Prof. Dr.)
3. Postdoc positions at TU Munich (Jannik Matuschke)
4. Call for Participation - 9th International Symposium on
Foundations & Practice of Security (FPS 2016), Quebec City,
October 2016 (Joaquin Garcia-Alfaro)
5. First Call for Papers: ISSAC 2017 (Michael Sagraloff)
----------------------------------------------------------------------
Message: 1
Date: Fri, 30 Sep 2016 15:15:59 +0200
From: info@isco2016.it
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] ISCO2016 Special Issues on Networks and JOCO:
deadline extension (31 October)
Message-ID: <c5c795141d31a8a1c3ca8b60b6ae0350@pop.isco2016.it>
Content-Type: text/plain; charset=UTF-8; format=flowed
=================================================================
ISCO2016 Special Issues on Networks and JOCO: DEADLINE EXTENSION
=================================================================
The submission deadline has been extended to OCTOBER 31, 2016.
--
The Organizing Committee - ISCO 2016
---------------------------------------------------------------------
ISCO 2016
4th International Symposium on Combinatorial Optimization
www.isco2016.it
CALL FOR PAPERS
SPECIAL ISSUES on NETWORKS and JOURNAL OF COMBINATORIAL OPTIMIZATION
---------------------------------------------------------------------
Special Issues of Networks and of Journal of Combinatorial Optimization
are associated with ISCO 2016.
The calls for papers are reported below.
--------
NETWORKS
--------
We invite submissions of novel research articles for a forthcoming issue
of Networks.
This special issue is associated with the 4th International Symposium on
Combinatorial Optimization (ISCO 2016) that was held in Vietri sul Mare,
Italy, May 16-18, 2016. However it is also open to papers which have not
been presented at the conference.
High quality research papers are solicited to address theoretical as
well as practical issues of Combinatorial Optimization of a theoretical
or practical nature involving graphs.
TOPICS OF INTEREST include, but are not limited to:
- Approximation algorithms
- Graph coloring
- Exact algorithms
- Graph and network algorithms
- Computational complexity
- Network flow theory
- Location theory
- Vehicle routing
- Fast algorithms for special graph classes
- Scheduling algorithms
The deadline for submission of full papers is OCTOBER 31, 2016.
We aim at completing a first review of all papers by January 31, 2017.
Submission Manuscripts should be submitted electronically to the
following address:
specialissuenetworks@gmail.com
Research articles, review articles as well as communications are
invited.
Submitted manuscripts should not have been published previously, nor be
under consideration for publication elsewhere (except conference
proceedings papers).
All manuscripts are refereed through a peer-review process.
Additional information about the special issue can be obtained from the
Guest Editors.
GUEST EDITORS:
Francesco Carrabs
Dep. of Mathematics, University of Salerno, Italy
fcarrabs@unisa.it
Raffaele Cerulli
Dep. of Mathematics, University of Salerno, Italy
raffaele@unisa.it
Monica Gentili
Dep. of Mathematics, University of Salerno, Italy
Industrial Engineering Dep., University of Louisville, KY, USA
mgentili@unisa.it
monica.gentili@louisville.edu
-------------------------------------
JOURNAL OF COMBINATORIAL OPTIMIZATION
-------------------------------------
We invite submissions of novel research articles for a forthcoming issue
of Journal of Combinatorial Optimization on Combinatorial Optimization.
This special issue is associated with the 4th International Symposium on
Combinatorial Optimization (ISCO 2016) that was held in Vietri sul Mare,
Italy, May 16-18, 2016. However it is also open to papers which have not
been presented at the conference.
High quality research papers are solicited to address theoretical as
well as practical issues of Combinatorial Optimization.
TOPICS OF INTEREST include, but are not limited to:
- Approximation algorithms
- Cutting-plane algorithms
- Polyhedral combinatorics
- Branch-and-cut-and-price algorithms
- Graph and network algorithms
- Linear and nonlinear (mixed-)integer programming
- Computational complexity
- Randomized algorithms
- Scheduling algorithms
- Interior point methods
The deadline for submission of full papers is OCTOBER 31, 2016.
We aim at completing a first review of all papers by January 31, 2017.
For their submissions, the authors should follow the "Instructions for
Authors" of the journal website
https://www.editorialmanager.com/joco/default.aspx. The article type for
this issue is "S.I. : ISCO2016" and selecting this article type will
ensure that the submission is sent to the editors of the special issue.
Information about Journal of Combinatorial Optimization is available at
http://link.springer.com/journal/10878
Additional information about the special issue can be obtained from the
Guest Editors.
GUEST EDITORS:
Satoru Fujishige
RIMS, Kyoto University, Japan
fujishig@kurims.kyoto-u.ac.jp
A. Ridha Mahjoub
LAMSADE, Université-Paris Dauphine, Paris, France
mahjoub@lamsade.dauphine.fr
Franz Rendl
Alpen-Adria University Klagenfurt, Institut für Mathematik, Klagenfurt,
Austria
franz.rendl@aau.at
------------------------------
Message: 2
Date: Mon, 3 Oct 2016 14:44:18 +0000
From: "Skutella, Martin, Prof. Dr." <martin.skutella@tu-berlin.de>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Position of junior research group leader for
"Optimization under Uncertainty" at TU Berlin
Message-ID: <C3F8CDA7-4C86-4AFC-BC91-95D41E752D79@win.tu-berlin.de>
Content-Type: text/plain; charset="us-ascii"
Position of junior research group leader for "Optimization under Uncertainty" at TU Berlin
In the framework of the Einstein Center for Mathematics Berlin (ECMath) we are looking for candidates to lead a junior research group "Optimization under Uncertainty" in the area of Algorithmic Discrete Mathematics. The position is paid according to "Entgeltgruppe 14 TV-L Berliner Hochschulen".
The area of Algorithmic Discrete Mathematics plays a key role as a connecting link between mathematics, computer science, and applications in economics and industry. Candidates are expected to have a solid background in Algorithmic Discrete Mathematics with clear connections to Discrete Optimization and the ECMath Innovation Area "Mathematics in Metropolitan Infrastructure". Favored research areas are Optimization under Uncertainty, Robust Optimization, and Algorithmic Game Theory. Candidates should be interested in interdisciplinary projects with other scientific disciplines as well as industry.
We are looking for postdocs who have already proved their scientific independence and are about to establish their own research program. Initially the position is limited to 3 years and might be extended to 6 years upon positive evaluation and subject to availability of funds. The junior research group also includes a position for a PhD student.
Please send your written application by October 28th, 2016 with appropriate documentation to
TU Berlin
- Der Praesident -
Fak. II, Sekr. MA 3-1
Str. des 17. Juni 136
10623 Berlin
Germany
Please send copies only. Original documents will not be returned.
------------------------------
Message: 3
Date: Mon, 03 Oct 2016 16:04:34 +0000
From: Jannik Matuschke <jannik.matuschke@tum.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Postdoc positions at TU Munich
Message-ID:
<CANOWcw9Sq-jp_hZmDjnp=c+fanqoSRLvfPyRBSqp=1cwhOOGuw@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
Postdoctoral fellowships are available in the Department of Mathematics at
TU Munich. We are seeking exceptional, highly motivated candidates with
expertise or interest in algorithms, algorithmic game theory, combinatorial
optimization, integer programming, machine learning, or stochastic
optimization.
Positions are initially for one year, with the possibility of extension.
The starting date is flexible. Compensation is competitive and depends on
the applicant's qualification. Funds for conference travel, extended stays
abroad, visitor programs, and other activities are available.
Located in southern Germany, very close to the Alps, Munich is considered
one of the most beautiful and livable cities, rich in culture and with
ample opportunities for leisurely activities. TU Munich is ranked among
the best universities in the world. Its highly renowned Math and CS
Departments provide an excellent environment for both young and established
researchers. The group, headed by Alexander von Humboldt-Professor Andreas
S. Schulz, has an international focus and maintains strong collaborations
with leading scientists worldwide.
Applicants should have a PhD degree in mathematics, theoretical computer
science, operations research, or a related discipline. Applications should
include a detailed CV, a brief statement of research interests and career
aspirations, transcripts, and names and contact details of at least three
references.
Please send your application via email, as a single pdf file, to our
assistant, Ms. Jamila Tazit, at jamila.tazit@tum.de. The deadline to
ensure full consideration is October 17, 2016. Late applications may be
considered on a case-by-case basis.
TUM is an equal opportunity employer. Women are particularly encouraged to
apply. For candidates with equal qualification, preference will be given
to people with disabilities.
------------------------------
Message: 4
Date: Mon, 3 Oct 2016 18:26:18 +0200
From: Joaquin Garcia-Alfaro
<joaquin.garcia_alfaro@telecom-sudparis.eu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Call for Participation - 9th International Symposium
on Foundations & Practice of Security (FPS 2016), Quebec City, October
2016
Message-ID: <2a9398a0-02a8-d089-21d3-c3c3eb1093f4@telecom-sudparis.eu>
Content-Type: text/plain; charset=utf-8; format=flowed
CALL FOR PARTICIPATION
======================
*********************************************************************
9th International Symposium on Foundations & Practice of Security
(FPS 2016), Quebec city, QC, Canada, 24-26 October 2016
*********************************************************************
** Early Bird Registration until October 10, 2016 **
ABOUT THE CONFERENCE
====================
The aim of FPS is to discuss and exchange theoretical and practical
ideas that address security issues in inter-connected systems. It aims
to provide scientific presentations as well as to establish links,
promote scientific collaboration, joint research programs, and student
exchanges between institutions involved in this important and fast
moving research field.
The Foundations & Practice of Security (FPS) Symposium started as a
Franco-Canadian meeting sponsored by MITACS, INRIA and Institut
Mines-Telecom, and has since 2011 grown to be an international event
on its own. After the previous meetings held in Clermont-Ferrand,
La Rochelle, Montreal, Grenoble, Toronto and Paris, this 9th edition
of the FPS symposium will be held in Quebec City, Canada.
FPS 2016 KEYNOTES
==================
** Jeremy Clark, Concordia University, Canada.
(The Bitcoin & Blockchain Technology Landscape)
** François Laviolette, Laval University, Canada.
(Machine Learning, Big Data and Security)
** Jean-Yves Marion, LORIA, France.
(A Morphological Approach to Binary Code Analysis)
FPS 2016 PROGRAM
=================
Monday, October 24th
09:00 Keynote Talk 1
Machine Learning, Big Data and Security.
François Laviolette.
10:30 Session 1: Malware and Anomaly Detection
- MalProfiler: Automatic and Effective Classification of Android
Malicious Apps in Behavioral Classes. Antonio La Marra, Fabio
Martinelli, Andrea Saracino and Mina Sheikhalishahi.
- Andrana: Quick and Accurate Malware Detection for Android.
Andrew Bedford, Sebastien Garvin, Jose Desharnais, Nadia Tawbi,
Hana Ajakan, Frederic Audet and Bernard Lebel.
- Micro-Signatures: The Effectiveness of Known Bad N-Grams for
Network Anomaly Detection (short paper). Richard Harang and Peter
Mell.
13:30 Session 2: Intrusion Response
- Multi-Criteria Recommender Approach for Supporting Intrusion
Response System. Tarek Bouyahia, Nora Cuppens-Boulahia, Frederic
Cuppens and Fabien Autrel.
- An Optimal Metric-Aware Response Selection Strategy for
Intrusion Response Systems. Nadine Herold, Matthias Wachs,
Stephan-A. Posselt and Georg Carle.
- Attack Mitigation by Data Structure Randomization (short paper).
Zhongtian Chen and Hao Han.
15:30 Session 3: Vulnerability Analysis and and Security Metrics
- Vulnerability Analysis of Software Defined Networking.
Salaheddine Zerkane, David Espes, Frederic Cuppens and Philippe Le
Parc.
- Towards Metric-Driven, Application-Specific Visualization of
Attack Graphs. Mickael Emirkanian-Bouchard and Lingyu Wang.
- Insider threat likelihood assessment for access control systems:
Quantitative approach (short paper). Sofiene Boulares, Kamel Adi
and Luigi Logrippo.
Tuesday, October 25th
09:00 Keynote Talk 2
A morphological Approach to binary Code Analysis.
Jean-Yves Marion.
10:30 Session 4: Privacy and Verification
- An Enhancement of Privacy-preserving Wildcards Pattern Matching.
Tushar Kanti Saha and Takeshi Koshiba.
- Privacy-aware Data Sharing in a Tree-based Categorical
Clustering Algorithm. Mina Sheikhalishahi, Mohamed Mejri, Nadia
Tawbi and Fabio Martinelli.
- Three Views of Log Trace Triaging. Raphael Khoury, Sebastien
Gaboury and Sylvain Halle
13:30 Session 5: Crypto and Communication Security
- A Multi-Round Side Channel Attack on AES using Belief Propagation.
Helene Le Bouder, Ronan Lashermes, Gael Thomas, Yanis Linge and
Jean-Yves Zie.
- Anonymizable Ring Signature Without Pairing. Olivier Blazy,
Xavier Bultel and Pascal Lafourcade.
- Security analysis of WirelessHART communication scheme. Lyes
Bayou, David Espes, Nora Cuppens-Boulahia and Frederic Cuppens.
Wednesday, October 26th
09:00 Keynote Talk 3
The Bitcoin & Blockchain Technology.
Jeremy Clark.
10:30 Session 6: Malware and Antivirus
- Function classification for the retro-engineering of malwares.
Guillaume Bonfante and Julien Oury Nogues.
- On the Feasibility of Malware Authorship Attribution. Saed
Alrabaee, Paria Shirani, Mourad Debbabi and Lingyu Wang
- Micro-Signatures: Semantically Non-Preserving Transformations
for Antivirus Evaluation (short paper). Erkan Ersan, Lior Malka
and Bruce Kapron.
13:30 Session 7: Web, Cloud, and Delegation
- A self-correcting information flow control model for the
web-browser. Deepak Subramanian, Guillaume Hiet and Christophe
Bidan.
- Threat Modeling for Cloud Data Center Infrastructures. Nawaf
Alhebaishi, Lingyu Wang, Sushil Jajoda and Anoop Singhal.
- Strategies for Incorporating Delegation into Attribute-Based
Access Control (ABAC) (short paper). Daniel Servos and Sylvia L.
Osborn
15:30 Session 8: Physical Security
- Patrolling Trees with Mobile Robots. Jurek Czyzowicz,Adrian
Kosowski, Evangelos Kranakis, and Najmeh Taleb.
- Towards Side-Channel Secure Firmware Updates - A Minimalist
Anomaly Detection Approach. Oscar Guillen, Fabrizio De Santis,
Ralf Brederlow and Georg Sigl.
REGISTRATION
============
Registration information is available at:
https://www.fps2016.fsg.ulaval.ca/publications/registration/
Early Bird Registration until October 10, 2016.
HOTEL AND TRAVEL
================
Information on the conference venue is available at:
https://www.fps2016.fsg.ulaval.ca/publications/venue/
https://www.fps2016.fsg.ulaval.ca/publications/accomodation/
https://www.fps2016.fsg.ulaval.ca/publications/travel_information/
MORE INFORMATION
================
Additional information about the symposium is available at:
https://www.fps2016.fsg.ulaval.ca/
------------------------------
Message: 5
Date: Tue, 4 Oct 2016 09:52:24 +0200
From: Michael Sagraloff <msagralo@mpi-inf.mpg.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] First Call for Papers: ISSAC 2017
Message-ID: <6f08a3d4-d14e-938c-9f67-9f88b9b7548c@mpi-inf.mpg.de>
Content-Type: text/plain; charset=utf-8; format=flowed
----------------------------------------------------------------------
ISSAC 2017
International Symposium on Symbolic and Algebraic Computation
University of Kaiserslautern, Germany,
July 25-28 2017.
FIRST CALL FOR PAPERS
http://www.issac-conference.org/2017
----------------------------------------------------------------------
The International Symposium on Symbolic and Algebraic Computation is
the premier conference for research in symbolic computation and
computer algebra. ISSAC 2017 will be the 42nd meeting in the series,
which started in 1966 and has been held annually since 1981. The
conference presents a range of invited speakers, tutorials, poster
sessions, software demonstrations and vendor exhibits with a
centerpiece of contributed research papers.
ISSAC 2017 is held on 25-28 July 2017 at the University of
Kaiserslautern, Germany. Tutorial Sessions will be held on July 25-th
2017.
Important Dates:
----------------
Abstract submission: January, 21 2017
Paper submission: January, 28 2017
Notification of acceptance/rejection: April 6, 2017
Camera-ready copy due: May 2, 2017.
Submission Instructions
-----------------------
ISSAC 2017 invites the submission of original research contributions
to be considered for publication and presentation at the conference.
Papers should not duplicate work published or submitted for
consideration elsewhere.
Papers must be in English and should not exceed 8 pages in the ACM
sig-alternate.cls style, found at
http://www.acm.org/publications/proceedings-template
Submissions in other article styles are also accepted, but the final
version must be at most 8 pages when compiled in sig-alternate.cls
style (equivalent to about 17 pages of letter size paper, typeset in
12pt with normal spacing and reasonably large margins). Extended
abstracts are not allowed. Papers may have an appendix that may be
read by the reviewers and PC members at their discretion, but will
not be included in the published version of the paper. At least one
author of each accepted paper must register for the conference and
present the paper.
Submission is via EasyChair, at the web site
https://www.easychair.org/conferences/?conf=issac2017
Topics
---------
All areas of computer algebra and symbolic mathematical computation
are of interest. These include, but are not limited to:
Algorithmic aspects:
* Exact and symbolic linear, polynomial and differential algebra
* Symbolic-numeric, homotopy, perturbation and series methods
* Computational algebraic geometry, group theory and number theory
* Computer arithmetic
* Summation, recurrence equations, integration, solution of ODEs & PDEs
* Symbolic methods in other areas of pure and applied mathematics
* Complexity of algebraic algorithms and algebraic complexity
Software aspects:
* Design of symbolic computation packages and systems
* Language design and type systems for symbolic computation
* Data representation
* Considerations for modern hardware
* Algorithm implementation and performance tuning
* Mathematical user interfaces
Application aspects:
* Applications that stretch the current limits of computer algebra
algorithms or systems, use computer algebra in new areas or new
ways, or apply it in situations with broad impact.
Conference Organization
-----------------------
General Chair: Chee Yap (Courant Institute, New-York University, USA)
Program Committee Chair: Mohab Safey El Din (University Pierre and Marie
Curie, France)
Local Arrangement Chair: Wolfram Decker and Claus Fieker (University of
Kaiserslautern, Germany)
Publicity Chair/Webmaster: Michael Sagraloff (MPI for Informatics)
Program Committee
-----------------
Hirokazu Anai (Fujitsu Laboratories Ltd and Kyushu University, Japan)
Christian Eder (University of Kaiserslautern, Germany)
Ioannis Emiris (National Kapodistrian University of Athens, Greece)
Xiao-Shan Gao (Chinese Academy of Sciences, China)
Mark Giesbrecht (University of Waterloo, Canada)
Jaime Gutierrez (University of Cantabria, Spain)
Anton Leykin (Georgia Tech, USA)
Pierre Lairez (Inria Saclay Ile-de-France, France)
Mioara Joldes (LAAS-CNRS, France)
Gregor Kemper (Technical University of Munich, Germany)
Erich Kaltofen (North Carolina State University, USA)
Christoph Koutschan (RICAM, Austrian Academy of Sciences, Austria)
Daniel S. Roche (United States Naval Academy, USA)
Mohab Safey El Din (University Pierre and Marie Curie)
Eric Schost (University of Waterloo, Canada)
Vikram Sharma (Institute of Mathematical Sciences, India)
Pierre-Jean Spaenlehauer (Inria Nancy-Grand Est, France)
Adam Strzebonski (Wolfram Research, USA)
Caroline Uhler (Massachussets Institute of Technology, USA)
Lihong Zhi (Chinese Academy of Sciences, China)
------------------------------
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 104, Issue 2
**************************************
No comments:
Post a Comment