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. Several associate and assistant professorships in CS
(including TCS) at KTH Royal Institute of Technology
(Jakob Nordström)
2. IEEE CEC Special Session & Competition on: Niching Methods
for Multimodal Optimization (Michael Epitropakis)
3. PODC 2017 Call for Papers - the submission site is now open
(Suomela Jukka)
4. Postdoc in Portfolio Optimization at University of Edinburgh
(KALCSICS Joerg)
----------------------------------------------------------------------
Message: 1
Date: Sat, 7 Jan 2017 13:38:53 +0000
From: Jakob Nordström <jakobn@kth.se>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Several associate and assistant professorships in CS
(including TCS) at KTH Royal Institute of Technology
Message-ID: <1483796333340.88027@kth.se>
Content-Type: text/plain; charset="iso-8859-1"
The School of Computer Science and Communication at KTH Royal Institute of Technology invites applications for a tenured associate professorship in computer science with a broad profile, covering all research areas currently represented at the school including theoretical computer science.
KTH is the leading technical university in Sweden. The Theory Group at KTH (http://www.csc.kth.se/tcs/) offers a strong research environment covering a wide range of research topics such as complexity theory and approximation algorithms, computer and network security, cryptography, formal methods and natural language processing. The group has a consistent track record of publishing in the leading theoretical computer science conferences and journals worldwide, and the research conducted here has attracted numerous international awards and grants in recent years.
The working language of the TCS group is English, and knowledge of English is also fully sufficient to navigate life in Sweden in general. It might also be worth mentioning that Sweden routinely scores at the absolute top in rankings of quality of life such as, e.g., the OECD Better Life Index (http://www.oecdbetterlifeindex.org/).
The application deadline is February 17, 2017. See http://www.kth.se/en/om/work-at-kth/lediga-jobb/what:job/jobID:96024/where:4/ for the full announcement with more information and instructions how to apply. Informal enquiries about this position (and possibly about how to navigate the application procedure at KTH) are welcome and may be sent to Johan Hastad at johan@kth.se or Jakob Nordstrom at jakobn@kth.se.
It should also be pointed out that this is only one of several openings in computer science at KTH, including also, for instance:
- One tenured associate professorship in computer science with a specialization in software engineering http://www.kth.se/en/om/work-at-kth/lediga-jobb/what:job/jobID:118880/where:4/
- One tenure-track assistant professorship in computer science with a specialization in software engineering http://www.kth.se/en/om/work-at-kth/lediga-jobb/what:job/jobID:118874/where:4/
- One tenure-track assistant professorship in computer science with a specialization in machine learning http://www.kth.se/en/om/work-at-kth/lediga-jobb/what:job/jobID:118778/where:4/
All of these positions have an application deadline of February 17, 2015.
------------------------------
Message: 2
Date: Sat, 7 Jan 2017 20:48:09 +0000
From: Michael Epitropakis <m.epitropakis@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] IEEE CEC Special Session & Competition on: Niching
Methods for Multimodal Optimization
Message-ID:
<CAOu7d3bro3a_NG3T7hL_rdT163=t5dAosyWP7GcV1h+i+2Kg5g@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
################
Call for Papers
################
2017 IEEE Congress on Evolutionary Computation Special Session and
Competition on: "Niching Methods for Multimodal Optimization"
June 5-8, 2017, at Donostia - San Sebastián, Spain
URL: http://www.epitropakis.co.uk/cec17-niching/
URL: http://www.epitropakis.co.uk/cec17-niching/competition/
** Paper Submission: 16 January 2017 **
In the Main research topics drop-down menu please select: *SS36:
Niching Methods for Multimodal Optimization*
============
Objectives
============
Population or single solution search-based optimization algorithms (i.e.
{meta,hyper}-heuristics) in their original forms are usually designed for
locating a single global solution. Representative examples include among others
evolutionary and swarm intelligence algorithms. These search algorithms
typically converge to a single solution because of the global selection scheme
used. Nevertheless, many real-world problems are "multimodal" by nature, i.e.,
multiple satisfactory solutions exist. It may be desirable to locate many such
satisfactory solutions, or even all of them, so that a decision maker can
choose one that is most proper in his/her problem domain. Numerous techniques
have been developed in the past for locating multiple optima (global and/or
local). These techniques are commonly referred to as "niching" methods. A
niching method can be incorporated into a standard search-based optimization
algorithm, in a sequential or parallel way, with an aim to locate multiple
globally optimal or suboptimal solutions. Sequential approaches locate optimal
solutions progressively over time, while parallel approaches promote and
maintain formation of multiple stable subpopulations within a single
population. Many niching methods have been developed in the past, including
crowding, fitness sharing, derating, restricted tournament selection, clearing,
speciation, etc. In more recent times, niching methods have also been developed
for meta-heuristic algorithms such as Particle Swarm Optimization, Differential
Evolution and Evolution Strategies.
Most of existing niching methods, however, have difficulties that need to be
overcome before they can be applied successfully to real-world multimodal
problems. Some identified issues include: difficulties to pre-specify some
niching parameters; difficulties in maintaining found solutions in a run; extra
computational overhead; poor scalability when dimensionality and modality are
high. This special session aims to highlight the latest developments in niching
methods, bringing together researchers from academia and industries, and
exploring future research directions on this topic. We invite authors to submit
original and unpublished work on niching methods. Topics of interest include
but are not limited to:
- Theoretical developments in multimodal optimization
- Niching methods that incurs lower computational costs
- Handling the issue of niching parameters in niching methods
- Handling the scalability issue in niching methods
- Handling problems characterized by massive multi-modality
- Adaptive or parameter-less niching methods
- Multiobjective approaches to niching
- Multimodal optimization in dynamic environments
- Niching methods applied to discrete multimodal optimization problems
- Niching methods applied to constrained multimodal optimization problems
- Niching methods using parallel or distributed computing techniques
- Benchmarking niching methods, including test problem design and performance
metrics
- Comparative studies of various niching methods
- Niching methods applied to engineering and other real-world multimodal
optimization problems
Please note that we are NOT interested if the adopted task is to find
a single solution of a multimodal problem.
Furthermore, a companion competition on Niching Methods for Multimodal
Optimization will also be organized in conjunction with our special
session. See further information at:
http://www.epitropakis.co.uk/cec17-niching/competition/
The aim of the competition is to provide a common platform that encourages fair
and easy comparisons across different niching algorithms. The competition
allows participants to run their own niching algorithms on 20 benchmark
multimodal functions with different characteristics and levels of difficulty.
Researchers are welcome to evaluate their niching algorithms using this
benchmark suite, and report the results by submitting a paper to the associated
niching special session (i.e., submitting via the on-line submission system of
CEC'2017). In case it is too late to submit the paper (i.e., passing the
CEC'2017 submission deadline), author may submit their results in a report
directly to the special session organizers, in order to be counted in the
competition.
These events are supported by the newly established IEEE CIS Task Force on
Multi-modal Optimization (http://www.epitropakis.co.uk/ieee-mmo/)
================
Important Dates
================
- Paper Submission: 16 January 2017
- Notification of Acceptance: 26 February 2017
Paper Submission:
Manuscripts should be prepared according to the standard format and
page limit of regular papers specified in CEC'2017 and submitted
through the CEC'2017 website: CEC 2017 submissions. Special session
papers will be treated in the same way as regular papers and included
in the conference proceedings.
In the Main research topics drop-down menu please select:
*SS36: Niching Methods for Multimodal Optimization*
==========================
Organizers
==========================
Michael G. Epitropakis, Lancaster University, UK.
Xiaodong Li, RMIT University, Australia
Andries Engelbrecht, University of Pretoria, South Africa
------------------------------
Message: 3
Date: Sun, 8 Jan 2017 07:50:43 +0000
From: Suomela Jukka <jukka.suomela@aalto.fi>
To: "DMANET@zpr.uni-koeln.de" <DMANET@zpr.uni-koeln.de>
Subject: [DMANET] PODC 2017 Call for Papers - the submission site is
now open
Message-ID: <C95547EF-6B7A-4A68-90F8-619178600853@aalto.fi>
Content-Type: text/plain; charset="us-ascii"
PODC 2017
36th ACM Symposium on Principles of Distributed Computing
July 25-27, 2017, Washington, D.C., USA
http://www.podc.org/
SECOND CALL FOR PAPERS
DATES
Submission of papers: 23:59 EST, February 9th, 2017
Notification of acceptance: April 26th, 2017
Camera ready copy due: May 20th, 2017
Conference: July 25th - 27th, 2017
The submission site is now open.
SCOPE
The ACM Symposium on Principles of Distributed Computing is an international forum on the theory, design, analysis, implementation and application of distributed systems and networks. We solicit papers in all areas of distributed computing. Papers from all viewpoints, including theory, practice, and experimentation, are welcome. The common goal of the conference is to improve understanding of the principles underlying distributed computing. Topics of interest include, but are not limited to, the following:
- distributed algorithms: design, analysis, and complexity
- communication networks: algorithms, protocols, applications
- multiprocessor and multi-core architectures and algorithms
- shared and transactional memory, concurrency, synchronization
- fault-tolerance, reliability, self-organization, self-stabilization
- Internet applications, social networks, recommendation systems
- dynamic, adaptive and machine learning distributed algorithms
- distributed operating systems, middleware, databases
- biological distributed algorithms
- game-theoretic approaches to distributed computing
- peer-to-peer systems, overlay networks
- high-performance, cluster, cloud and grid computing
- wireless networks, mobile computing, autonomous agents
- context-aware distributed systems
- security in distributed computing, cryptographic protocols
- quantum and optics based distributed algorithms
- sensor, mesh, and ad hoc networks
- specification, semantics, verification of concurrent systems
PAPER SUBMISSION
Papers are to be submitted electronically through EasyChair, at
https://easychair.org/conferences/?conf=podc2017
following the guidelines on the conference web page (www.podc.org). Submission must be in English, in pdf format. The papers must be formatted as follows: letter-size paper (8.5x11 inch), single-column, using at least 1 inch margins, 11-point font. Submissions not conforming to these rules as well as the papers outside of the scope of the conference will be rejected without consideration.
A regular paper submission must report on original research that has not been previously or concurrently published; concurrent submissions to journals or conferences are not permitted. A regular submission must begin with a cover page containing: 1) title, with the subtitle "Regular Submission", 2) author names and affiliations, 3) contact author's email, address, and telephone number, 4) one paragraph abstract of the paper, 5) indication of whether at least one author is a full-time student and the paper is eligible for best student paper award. The paper must not exceed 10 pages (excluding cover page and references). All of the ideas necessary for an expert to verify fully the central claims in the paper should be included, some of which may be placed in a clearly marked appendix that will be read at the discretion of the program committee. If desired, the authors can simply attach a copy of the full paper as the appendix.
A submission for a brief announcement must be at most 3 pages, including title, authors' names and affiliations, and references. Such submissions may describe work in progress or work presented elsewhere. The title of a brief announcement must begin with the words "Brief Announcement:".
If requested by the authors on the cover page, a regular submission that is not selected for a regular presentation will be considered for the brief announcement format. This will not affect consideration of the paper for a regular presentation.
PUBLICATION
Regular papers of up to 10 pages and brief announcements of up to 3 pages will be included in the conference proceedings. Extended and revised versions of selected papers will be considered for a special issue of the Distributed Computing journal. Two papers will be considered for publication in JACM.
ORGANIZATION
Program Committee:
Lorenzo Alvisi - University of Texas Austin and Cornell University, USA
Hagit Attiya - The Technion, Israel
Michael Bender - Stony Brook University, USA
Borzoo Bonakdarpour - McMaster University, Canada
Silvia Bonomi - Sapienza Universita di Roma, Italy
Christian Cachin - IBM Research, Switzerland
Irina Calciu - VMware Research, USA
Bogdan Chlebus - University of Colorado Denver, USA
Carole Delporte-Gallet - Universite Paris Diderot, Paris 7, France
Shlomi Dolev - Ben-Gurion University, Israel
Greg Eisenhauer - Georgia Tech, USA
Faith Ellen - University of Toronto, Canada
Panagiota Faturu - University of Crete, Greece
Antonio Fernandez Anta - IMDEA, Spain
Paola Flocchini - University of Ottawa, Canada
Chryssis Georgiou - University of Cyprus, Cyprus
Andreas Haeberlen - University of Pennsylvania, USA
Magnus Halldorsson - Reykjavik University, Iceland
Anne-Marie Kermarrec - INRIA, Rennes, France
Aggelos Kiayias - Edinburgh University, UK
Kishori Konwar - MIT, USA
Nancy Lynch - MIT, USA
Calvin Newport - Georgetown University, USA
Cristina Nita-Rotaru - Northeastern Univ, USA
Merav Parter - Weizmann Institute, Israel
Andrzej Pelc - University of Quebec, Canada
Franck Petit - Universite Pierre-et-Marie-Curie, Paris 6, France
Maria Potop-Butucaru - Universite Pierre-et-Marie-Curie, Paris 6, France
Michel Raynal - IRISA, Rennes, France
Andrea Richa - Arizona State University, USA
Luis Rodrigues - IST, ULisboa, Portugal
Elad Schiller - Chalmers University Tech., Sweden
Alexander Schwarzmann, Chair - University of Connecticut, USA
Robert Soule - USI, Lugano, Switzerland
Paul Spirakis - University Liverpool, UK & CTI, Greece
Gadi Taubenfeld - IDC Herzliya, Israel
Nitin Vaidya - University of Illinois, USA
Robbert van Renesse - Cornell University, USA
Jennifer Welch - Texas A&M University, USA
Conference Committee:
Leonid Barenboim (Workshop Coordinator) - Open University of Israel, Israel
Bapi Chatterjee (Travel Grant Coordinator) - Chalmers University of Technology, Sweden
Jeremy Fineman (Organizing Chair) - Georgetown University, USA
Theo Hadjistasi (Proceedings Coordinator) - University of Connecticut, USA
Calvin Newport (Treasurer) - Georgetown University, USA
Elad Schiller (General Chair) - Chalmers University of Technology, Sweden
Alexander Schwarzmann (PC Chair) - University of Connecticut, USA
Jukka Suomela (Communication Chair) - Aalto University, Finland
Mark Tuttle (Publicity Chair) - Amazon, USA
Steering Committee:
Nitin Vaidya, Chair (2015-2018) - University of Illinois, USA
Pierre Fraigniaud (2015-2017) - CNRS, Universite Paris-Diderot, France
Calvin Newport (2016-2018) - Georgetown University, USA
Andrzej Pelc (2015-2018) - Universite du Quebec en Outaouais, Canada
Alexander Schwarzmann (2016-2019) - University of Connecticut, USA
Paul Spirakis (2014-2017) - University of Liverpool, UK
Elad Schiller (2015-2017) - Chalmers University of Technology, Sweden
------------------------------
Message: 4
Date: Mon, 9 Jan 2017 11:10:07 +0000
From: KALCSICS Joerg <Joerg.Kalcsics@ed.ac.uk>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Postdoc in Portfolio Optimization at University of
Edinburgh
Message-ID:
<VI1PR0502MB2941206EAF89409876659266B3640@VI1PR0502MB2941.eurprd05.prod.outlook.com>
Content-Type: text/plain; charset="iso-8859-1"
The University of Edinburgh's School of Mathematics is seeking a Postdoc in Portfolio Optimization. A sound background in combinatorial and discrete optimization would also be desirable.
https://www.vacancies.ed.ac.uk/pls/corehrrecruit/erq_jobspec_version_4.jobspec?p_id=038421
Applications are invited for an 18 month postdoctoral position in the areas of mathematical finance and optimization with a particular focus on probabilistic and optimization methods used in portfolio theory. The position will be based at the School of Mathematics, University of Edinburgh. There is a possibility of an extension for a further 18 months.
We look for candidates with a Ph.D. in Mathematics, Optimization, Operations Research, or any related field with a strong track record evidenced by publications in top quality journals.
The successful candidate will join a team of four mathematicians:
Sergio García Quiles, Jacek Gondzio, Joerg Kalcsics and Sotirios Sabanis who bridge between the Edinburgh Research Group in Optimization and the Probability group.
The project is funded by the EPSRC Impact Acceleration Account and Standard Life Investments and initially will involve research in portfolio construction approaches to optimal diversification.
The project is a step towards a strategic partnership between Edinburgh University and Standard Life Investments (SLI) focused on quantitative portfolio and investment research. There will be opportunities to interact with SLI in order to enhance understanding of practical research implications and aid further career development.
The position should be taken up in March 2017 or soon after.
The starting salary will be in the range of £32,004 - £38,183, depending on experience.
Please include a CV and research statement with your application and arrange for two referees to send letters of recommendation to hr@maths.ed.ac.uk by the closing date.
The closing date for applications is 5pm GMT on 12 January 2017.
Informal enquiries:
Prof Gondzio: +44 131 650 8574, J.Gondzio@ed.ac.uk Dr Sabanis: +44 131 650 5084, S.Sabanis@ed.ac.uk
----------------------------------------------
Joerg Kalcsics
Lecturer in Operational Research
School of Mathematics
University of Edinburgh
James Clerk Maxwell Building
Peter Guthrie Tait Road
Edinburgh, EH9 3FD, UK
Room: 6226
Phone: +44 (0)131 650 5953
Email: joerg.kalcsics@ed.ac.uk<mailto:joerg.kalcsics@ed.ac.uk>
Web: http://www.maths.ed.ac.uk/people/show?person=450
------------------------------
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 6
**************************************
No comments:
Post a Comment