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. Research grant (BI-D) - BacHBerry project (Susana Vinga)
2. 25th British Combinatorial Conference at the University of
Warwick, 5 July - 10 July 2015 (Viktor Zamaraev)
3. Tractable special cases of hard combinatorial optimization
problems (deadline extended) (Eranda Dragoti-Cela)
4. Special issue in TCS on ??Theory and Applications of Graph
Searching Problems?? (GRASTA) (Nicolas Nisse)
5. Postdoc positions in Budapest (parameterized complexity &
algorithms) (Daniel MARX)
6. [Deadline Extension] CFP COMCOM, Elsevier: SI on Security and
Privacy in Unified Communications: Challenges and Solutions,
Manuscript Due November 21, 2014 (Georgios Karopoulos)
----------------------------------------------------------------------
Message: 1
Date: Thu, 30 Oct 2014 15:05:04 +0000
From: Susana Vinga <susanavinga@tecnico.ulisboa.pt>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Research grant (BI-D) - BacHBerry project
Message-ID:
<CAOTdZdejUmxbUZrb1GDxLcG4dZN0vXxgCQjyUo6=C-t00sUCpA@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
Dear colleague,
Please distribute widely and sorry for crossposting. Thank you.
Best regards,
Susana Vinga
--------------------------------
1 Research Grant ? Post-doc (BI-D)
We are seeking one postdoc candidate in the context of a FP7 KBBE
European Project, BacHBerry - ?BACterial Hosts for production of
Bioactive phenolics from bERRY fruits, www.bachberry.eu (European
Union FP7- 613793).
Scientific Area: Optimization and Operations Research.
Required education Level and research experience: PhD in one of the
following areas: optimization, operations research, machine learning,
computer science, mathematics, statistics or related, with a taste for
inter-disciplinary research, and with very good interpersonal skills.
Ideally, the person will have a long experience with optimization
techniques, machine learning and graphical models. Unusual CVs are
welcome.
Workplan: With the development of genetic and metabolic engineering is
it now possible to increase the cells' production of given substances
by manipulating the corresponding metabolic networks, which can be
defined as hypergraphs (nodes are compounds, edges are chemical
reactions). BachBerry is interested in the generation of bacterial
platforms for sustainable bio-based production of phenolic compounds
found in berry fruits. This is accomplished by maximizing the fluxes
in the network, a problem similar to those occurring in transportation
and logistics optimization. The candidate will work on the development
and application of optimization methods and algorithms, in particular
expanding techniques based on linear programming (FBA), bi-level
mixed-integer (OptKnock) and multi-level optimization (OptCom). Also
sparse optimization might provide relevant solutions and will be
explored during the project.
Workplace and scientific supervision: The candidate will work in the
Center of Intelligent Systems at the IDMEC
(http://www.idmec.ist.utl.pt/), Instituto Superior T?cnico, Lisboa,
Portugal, under the supervision of Susana Vinga and in interaction
with the partners of BacHBerry, in particular the BAMBOO team at the
Inria-UCBL in Lyon, France (http://team.inria.fr/bamboo/) and
Marie-France Sagot. Both CSI and BAMBOO are methodological teams with
an expertise in computational and systems biology.
Duration: 12 months, from December 2014, and renewable for up to the
duration of the project.
Evaluation Criteria: The criteria for selection consists on the
academic record of the candidate (30%), publications in areas of the
grant (30%) and evidence of specialized knowledge in the area of the
grant, in particular in optimization (40%). The Jury may decide to
interview the candidates in order to perform a more objective
evaluation of some of the criteria.
Application Dates: From 10th November to 1st December 2014.
Documents to be submitted: Detailed curriculum vitae; motivation
letter; copy of academic study certificates; name of two personal
references. The applications should be submitted via email to
bachberry.wp8@gmail.com
For more details: http://web.ist.utl.pt/susanavinga/
--
_________________________
Susana Vinga, PhD
IDMEC/IST-UL
Av. Rovisco Pais, 1049-001 Lisboa, Portugal
Tel. (+351) 218 419 504 Fax: (+351) 218 498 097
Email: susanavinga@tecnico.ulisboa.pt
------------------------------
Message: 2
Date: Thu, 30 Oct 2014 15:25:05 +0000
From: Viktor Zamaraev <viktor.zamaraev@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] 25th British Combinatorial Conference at the
University of Warwick, 5 July - 10 July 2015
Message-ID:
<CADqKaUvguj8Y7araUQiADhYou+hWvo=JXApO5d2gjMF+sU3dgA@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
We are pleased to announce that the 25th British Combinatorial
Conference will take place in the Mathematics Institute at the
University of Warwick from Sunday 5 July (arrival date) to Friday 10
July 2015. The website for the conference is
http://warwick.ac.uk/25bcc where further information will be posted in
due course.
The invited speakers are:
- Manuel Bodirsky (?cole Polytechnique, Paris)
- Xing Chaoping (Nanyang Technological University)
- David Conlon (University of Oxford)
- Stefanie Gerke (Royal Holloway, University of London)
- Gil Kalai (Hebrew University of Jerusalem)
- Tomasz Luczak (Adam Mickiewicz University, Poznan)
- Gary McGuire (University College Dublin)
- Sergey Norin (McGill University, Montreal)
- Nik Ruskuc (University of St Andrews)
There will be an opportunity for participants to contribute talks, and
details of this will be announced in due course.
The local organisation is being handled by
Artur Czumaj
Agelos Georgakopoulos
Dan Kral
Vadim Lozin (chair)
Oleg Pikhurko.
A further announcement will be made when registration opens (beginning
of February 2015). In the meantime, email queries can be sent to
25bcc[at]warwick.ac.uk.
------------------------------
Message: 3
Date: Thu, 30 Oct 2014 17:38:34 +0100
From: Eranda Dragoti-Cela <cela@math.tugraz.at>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Tractable special cases of hard combinatorial
optimization problems (deadline extended)
Message-ID: <5452698A.1090503@math.tugraz.at>
Content-Type: text/plain; charset=utf-8
This is a reminder of the workshop
"Tractable special cases of hard combinatorial optimization problems",
www.opt.math.tu-graz.ac.at/scco14
we will be hosting at the Department of Optimization and Discrete
Mathematics of the Graz University of Technology
from December 15 to December 16, 2014.
This will be a two-day, single stream event focussing at polynomially
solvable or approximable special cases of provably hard combinatorial
optimization problems.
This line of research deals with NP-hard combinatorial optimization
problems which become polynomially tractable if specific structural
properties are imposed on their input.
The identification of the sometimes thin boarderline between hard and
tractable cases is often a hard and interesting challenge.
The workshop will host invited talks in the mornings as well as
contributed talks and discussions or working sessions in the afternoons.
Confirmed invited speakers are:
* Vladimir Deineko, Warwick Business School, UK
* Martin Milanic, University of Primorska, Slovenia
* Frits Spieksma, KU Leuven, Belgium
* Gerhard Woeginger, Eindhoven University of Technology, The Netherlands
We herewith invite you to participate in the workshop and submit a
contribution related to the workshop topic.
The workshop venue is the building of the Department of Optimization and
Discrete Mathematics, Graz University of Technology,
Steyrergasse 30, 8010 Graz, Austria.
There will be a small participation fee payable on site. This will
cover the lunches on December 15 and 16 and the refreshments during the
workshop breaks. The participants will be responsable for their own travel
and accomodation expenses.
Important Dates:
* November 15, 2014: Deadline for the submission of contributed talks
* November 15, 2014: Registration deadline
* December 15-16, 2014: Workshop
We are looking forward to meeting you in Graz. Please do not hesitate to
contact us for any additional information.
Best regards,
Eranda Cela and Bettina Klinz
--
Eranda Dragoti-Cela, PhD, Associate Professor (ao. Univ.-Prof.)
Department of Optimization and Discrete Mathematics,
Graz University of Technology,
Steyrergasse 30, A-8010 Graz, Austria
Tel. ++43 316 873 5366, Fax: ++43 316 873105366,
Email: cela@math.tugraz.at
------------------------------
Message: 4
Date: Fri, 31 Oct 2014 13:43:52 +0100
From: Nicolas Nisse <nicolas.nisse@inria.fr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Special issue in TCS on ??Theory and Applications of
Graph Searching Problems?? (GRASTA)
Message-ID: <3C43785D-4049-418D-9C2A-F0B3746FAAAC@inria.fr>
Content-Type: text/plain; charset=us-ascii
Call for Papers
Theoretical Computer Science (TCS)
Special Issue:
GRASTA'14, 6th Workshop on GRAph Searching, Theory and Applications
Cargese, Corsica, France, 2014
http://www-sop.inria.fr/coati/events/grasta2014/
Manuscripts are solicited for a special issue in the journal "Theoretical Computer Science" (TCS) on "Theory and Applications of Graph Searching Problems".
Graph searching is often referred to, in a more playful language, as a pursuit-evasion game. This is a kind of game where one part is a set of evaders, that hide in a graph representing a network, and the other part is a team of pursuers, that move systematically in the graph. The game may vary significantly according to the capabilities of the evaders and the pursuers. The objective of the game is to capture the evaders in an optimal way, where the notion of optimality itself admits several interpretations. The area of Graph Searching has become a very active research area in theoretical computer science and discrete mathematics, with impact and applications in various domains.
With this Special Issue, we wish to foster research in the area by exposing new results and directions for further research.
The purpose of the issue is to put together various recent results related to Graph Searching both from the applied and the theoretical point of view.
Potential topics include (but are not limited to) the following:
* Graph Searching and Logic
* Graph Parameters Related to Graph Searching
* Graph searching and Robotics
* Conquest and Expansion Games
* Database Theory and Robber and Marshals Games
* Probabilistic Techniques in Graph Searching
* Monotonicity and Connectivity in Graph Searching
* New Variants of Graph Searching
* Graph Searching and Distributed Computing
* Graph Searching and Network Security
Submissions should be made in PDF format using the standard TCS submission system at http://ees.elsevier.com/tcs/ (submissions will be possible from December 2014)
Papers will be refereed according to the standards of TCS.
Submissions must be received before March 31, 2015.
Please contact the guest editors for additional information.
We are looking forward to receiving your contribution.
The Guest Editors,
Pierre Fraigniaud
Fedor V. Fomin
Nicolas Nisse
Dimitrios Thilikos
------------------------------
Message: 5
Date: Fri, 31 Oct 2014 19:14:24 +0100
From: Daniel MARX <dmarx@cs.bme.hu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Postdoc positions in Budapest (parameterized
complexity & algorithms)
Message-ID: <5453D180.9030107@cs.bme.hu>
Content-Type: text/plain; charset=UTF-8; format=flowed
Postdoc positions are available at the Institute for Computer Science
and Control (Hungarian Academy of Sciences), Budapest, Hungary,
supported by the European Research Council (ERC) Starting Grant
PARAMTIGHT: "Parameterized complexity and the search for tight
complexity results" held by D?niel Marx. The goal of the project is to
systematically push the boundaries of algorithmic and hardness results,
mostly in the framework of parameterized complexity, with the aim of
obtaining tight results that give an optimal understanding of the
complexity of a problem.
The candidates should have (or expect to have shortly) a PhD degree in
Computer Science or related area; research experience at postdoctoral
level is of advantage. A successful candidate should have excellent
knowledge of algorithms and/or complexity, preferably in the setting of
parameterized complexity and fixed-parameter tractability. Strong
background in graph theory, combinatorics, constraint satisfaction,
approximation, or kernelization is of advantage.
The review of applicants will begin immediately and continue until the
positions are filled. Applications received by 15 November 2014 will
receive full consideration. Informal inquires by email (D?niel Marx,
dmarx@cs.bme.hu) are welcome.
------------------------------
Message: 6
Date: Fri, 31 Oct 2014 09:50:06 +0100
From: Georgios Karopoulos <georgios.karopoulos@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] [Deadline Extension] CFP COMCOM, Elsevier: SI on
Security and Privacy in Unified Communications: Challenges and
Solutions, Manuscript Due November 21, 2014
Message-ID:
<CALTy4CQKbovuJBEwxJobkbx7SE3id0ntLt7GVWggHs_auamWTQ@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
[Apologies if you receive multiple copies of this message]
Manuscript submission: extended to November 21, 2014
========================================================================
*Call for Papers*
Computer Communications Journal, Elsevier
(Current Impact Factor: 1.352)
Special Issue on:
Security and Privacy in Unified Communications: Challenges and Solutions
Direct Link:
http://www.journals.elsevier.com/computer-communications/call-for-papers/special-issue-on-security-and-privacy-in-unified-communicati/
========================================================================
Unified Communications (UC) merge different communication
technologies, types of products, and services, from various
manufacturers, operators, and countries, following diverse policies
and standards. Specifically, in the context of UC, a range of
communication tools are integrated in a way that both corporations and
individuals are able to manage all their communications in one entity
instead of doing it disjointly. It is therefore said that UC bridges
the opening between the various computer related communication
technologies and Voice over IP (VoIP). However, this high level of
heterogeneity expands the risks related to security and privacy that
stakeholders should deal with. To eliminate or even prevent the
increasing threats to end-users and operators, it is important to
explore this growing and timely research topic.
This feature topic will benefit the research community towards
identifying challenges and disseminating the latest methodologies and
solutions to UC security and privacy issues. Its objective is to
publish high-quality articles presenting open issues, algorithms,
protocols, policies, frameworks, standards, and solutions for UC
related to security and privacy. Only technical papers describing
previously unpublished, original, state-of-the-art research, and not
currently under review by a conference or a journal will be
considered. Reviews and case studies which address state-of-art
research and state-of-practice industry experiences are also welcomed.
We solicit papers in a variety of topics related to unified
communications security and privacy, including, but not limited to:
- Authorization and access control for UC services
- Denial of service prevention schemes for UC
- Reliability and availability issues on UC
- Penetration testing, intrusion detection and prevention
- End-to-end security solutions
- Cryptographic protocols for UC
- Voice security
- Signaling security and privacy
- Multimedia application security and privacy analysis
- Multimedia communication platforms vulnerabilities and attacks
- Security and privacy in mobile communication services
- Smartphone multimedia apps security and privacy
- Social networking security and privacy
- Testbed and case studies for secure and private UC services
- Trust establishment in UC
- IP Multimedia Subsystem (IMS) security
- Privacy and identity management
- Privacy enhancing technologies for UC
- Privacy models for UC
- Security and privacy assessment for UC
- Security policies
- Auditing, verification, and validation of UC services
- Risk analysis and management
- Cyber-security issues affecting UC
- Protection of UC as a Critical Information Infrastructure
- VoIP peering security issues
All received submissions will be sent out for peer review by at least
two experts in the field and evaluated with respect to relevance to
the special issue, level of innovation, depth of contributions, and
quality of presentation. Guest editors will make an initial
determination of the suitability and scope of all submissions. Papers
that either lack originality, clarity in presentation or fall outside
the scope of the special issue will not be sent for review and the
authors will be promptly informed in such cases. Submitted papers must
not be under consideration by any other journal or publication.
Schedule
Manuscript submission deadline: November 21, 2014
Pre-notification (first round): January 30, 2015
Final-notification (second round): April 3, 2015
Publication of special issue: 2015 (Tentative)
Submission Details
Authors should follow the instructions available at
http://ees.elsevier.com/comcom - kindly click the ?Guide for Authors?
link in the top box on the right side. When submitting the article,
select ?UC Security and Privacy? in the ?Select an Article Type? box
in the submission process.
Guest Editors
Georgios Karopoulos
Joint Research Centre (JRC), Italy
e-mail: georgios.karopoulos@jrc.ec.europa.eu
Georgios Portokalidis
Stevens Institute of Technology, USA
e-mail: gportoka@stevens.edu
Josep Domingo-Ferrer
Universitat Rovira i Virgili, Catalonia
e-mail: josep.domingo@urv.cat
Ying-Dar Lin
National Chiao Tung University (NCTU), Taiwan
e-mail: ydlin@cs.nctu.edu.tw
Dimitris Geneiatakis
Joint Research Centre (JRC), Italy
e-mail: dimitrios.geneiatakis@jrc.ec.europa.eu
Georgios Kambourakis
University of the Aegean, Greece
e-mail: gkamb@aegean.gr
------------------------------
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 80, Issue 23
**************************************
No comments:
Post a Comment