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. CFPs Search-Based Software Engineering (SBSE) Track @ Genetic
and Evolutionary Computation Conference (GECCO) 2017 (Sarro, Federica)
2. 2 PhD/Postdoc Positions in Combinatorial Optimization
(Nicole Megow)
3. SEA CFP (Sabine Storandt)
4. Extended Deadline: ICFCA'17 — 14th International Conference
on Formal Concept Analysis (Daniel Borchmann)
----------------------------------------------------------------------
Message: 1
Date: Mon, 5 Dec 2016 15:33:22 +0000
From: "Sarro, Federica" <f.sarro@ucl.ac.uk>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] CFPs Search-Based Software Engineering (SBSE) Track
@ Genetic and Evolutionary Computation Conference (GECCO) 2017
Message-ID: <1B236022-0DFD-48BD-B477-FDE3A4D0C854@live.ucl.ac.uk>
Content-Type: text/plain; charset="Windows-1252"
CALL FOR PAPERS
Search-Based Software Engineering (SBSE) Track @ Genetic and Evolutionary Computation Conference (GECCO) 2017
http://gecco-2017.sigevo.org
Dear Colleague,
We invite you to contribute high quality papers to the Search-Based Software Engineering (SBSE) track of the Genetic and Evolutionary Computation Conference (GECCO 2017). After a few years as part of a combined track, SBSE is once again the subject of its own dedicated track at GECCO and thus we welcome your support for the track in this new form. Note also this year GECCO invites shorter "poster-only" papers in addition to full-length technical papers; see: http://gecco-2017.sigevo.org/index.html/Papers for details.
KEY INFORMATION
Paper Submission: 6 February 2017 (non-extensible; abstracts by 30 January)
Conference: 15-19 July 2017, Berlin, Germany
Track Details: http://gecco-2017.sigevo.org/index.html/Program+Tracks#id_SBSE%20-%20Search-Based%20Software%20Engineering
Paper Submission Details: http://gecco-2017.sigevo.org/index.html/Papers
SBSE TRACK DESCRIPTION
Search-Based Software Engineering (SBSE) is the application of search algorithms to the solution of software engineering tasks. Evolutionary computation is a foundation of SBSE, and since 2002 the SBSE track at GECCO has provided an opportunity to present SBSE research to the evolutionary computation community, and for SBSE to be informed by advances in evolutionary computation.
We invite papers that address problems in the software engineering domain through the use of heuristic search techniques. We particularly encourage papers demonstrating novel search strategies or the application of SBSE techniques to new problems in software engineering. Papers may also address the use of methods and techniques for improving the applicability and efficacy of search-based techniques when applied to software engineering problems. While empirical results are important, papers that do not contain results - but instead present new approaches, concepts, or theory - are also very welcome.
SCOPE
As an indication of the wide scope of the field, search techniques include, but are not limited to:
Ant Colony Optimization, Automatic Algorithm configuration and Parameter Tuning, Estimation of Distribution Algorithms,
Evolutionary Computation, Hybrid and Memetic Algorithms, Hyper-heuristics, Iterated Local Search,
Particle Swarm Optimization, Simulated Annealing, Tabu Search, Variable Neighbourhood Search.
The software engineering tasks to which they are applied are drawn from throughout the engineering lifecycle and include, but are not limited to:
Automated Software Design and Hyper-Heuristics
Automatic Algorithm Selection and Configuration
Configuring Cloud-Based Architectures
Creating Recommendation Systems to Support Software Development
Developing Dynamic Service-Oriented Systems
Enabling Self-Configuring/Self-Healing/Self-Optimizing Systems
Network Design and Monitoring
Optimizing Functional and Non-Functional Software Properties (Genetic Improvement)
Predictive Modelling for Software Engineering Tasks
Project Management and Organization
Regression Test Optimization
Requirements Engineering
Software Maintenance, Program Repair, Refactoring and Transformation
Software Security
System and Software Integration
Test Data Generation
REVIEW PROCESS
Each paper submitted to the track will be rigorously evaluated in a double-blind review process. Paper evaluation at GECCO occurs on a per-track basis, ensuring high interest and expertise of the reviewers. Review criteria include significance of the work, technical soundness, novelty, clarity, writing quality, and sufficiency of information to permit replication, if applicable. All accepted papers will be published in the ACM Digital Library.
Yours,
Federica Sarro (f.sarro@ucl.ac.uk<mailto:f.sarro@ucl.ac.uk>), Senior Research Associate, CREST, University College London, United Kingdom
and
Simon Poulding (simon.poulding@bth.se<mailto:simon.poulding@bth.se>), Assistant Professor, SERL, Blekinge Institute of Technology, Sweden
GECCO is sponsored by the Association for Computing Machinery Special Interest Group for Genetic and Evolutionary Computation (ACM SIGEVO).
--
Dr. Federica Sarro
Senior Research Associate
CREST, Department of Computer Science
University College London
Malet Place, London, WC1E 6BT, UK
http://www0.cs.ucl.ac.uk/staff/F.Sarro/
------------------------------
Message: 2
Date: Mon, 5 Dec 2016 21:08:46 +0100
From: Nicole Megow <nicole.megow@uni-bremen.de>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] 2 PhD/Postdoc Positions in Combinatorial
Optimization
Message-ID: <1cbc439b-36ab-9408-7f9e-ac0ec4f9d3d1@uni-bremen.de>
Content-Type: text/plain; charset=utf-8; format=flowed
2 PhD/Postdoc positions
University of Bremen, Germany
Two Phd and/or Postdoc positions in combinatorial optimization are
available in the group of Prof. Nicole Megow at the University of Bremen
in the department of mathematics and computer science. The group's
research focus is on combinatorial optimization, efficient algorithms,
approximation algorithms, scheduling, network design and algorithms,
optimization under uncertainty such as online, stochastic, and robust
optimization, and their application in practice.
Candidates should have an excellent academic degree in mathematics,
theoretical computer science or a related area, and must have good
knowledge in combinatorial optimization and algorithm theory. A
background in some of the other above-mentioned topics is desirable.
Good communication skills and solid English writing skills are
necessary. In addition, the successful candidate will be highly
self-motivated, passionate about his/her work, and have good ability to
work both independently as well as in a team.
Both positions are full-time positions, involve teaching, and they are
paid according to the Federal German Payment scale TV-L 13.
Applications will be reviewed starting from January 15, 2017, until the
position is filled. The envisioned starting date is as soon as possible
but may be negotiable.
Please send your application (including cover/motivation letter,
curriculum vitae, list of publications, and the names and contact
information of at least two references) to the address below. Electronic
submissions are highly encouraged (please attach relevant documents as
*a single pdf*).
Prof. Nicole Megow
Universität Bremen
FB 3: Mathematik/Informatik
Bibliothekstr. 1, MZH
28359 Bremen
Germany
Email: nicole.megow@uni-bremen.de
------------------------------
Message: 3
Date: Tue, 6 Dec 2016 10:15:41 +0100
From: Sabine Storandt <storandt@informatik.uni-freiburg.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] SEA CFP
Message-ID:
<a20c6413-401a-1745-4853-308ed8c27c3d@informatik.uni-freiburg.de>
Content-Type: text/plain; charset=utf-8; format=flowed
*******************************************************************************
Call for Papers
16th International Symposium on Experimental Algorithms (SEA 2017)
June 21-23, 2017, London, United Kingdom
http://www.dcs.kcl.ac.uk/events/SEA2017/
*******************************************************************************
SEA (Symposium on Experimental Algorithms), previously known as WEA
(Workshop on Experimental Algorithms), is an international forum for
researchers in the area of design, analysis, and experimental evaluation
and engineering of algorithms, as well as in various aspects of
computational optimization and its applications. The preceding symposia
were held in Riga, Monte Verità, Rio de Janeiro, Santorini, Menorca Island,
Rome, Cape Cod, Dortmund, Ischia Island, Crete, Bordeaux, Rome, Copenhagen,
Paris, and St. Petersburg.
SEA aims to attract papers from both the CS and the OR/Mathematical
Programming communities.
The main theme of the symposium is the role of experimentation and
of algorithm engineering techniques in the design and evaluation of
algorithms and data structures. Submissions should present significant
contributions supported by experimental evaluation, methodological
issues in the design and interpretation of experiments, the use of
(meta-) heuristics, or application-driven case studies that deepen
the understanding of the complexity of a problem.
In 2017 the proceedings of SEA will be published for the first time
in the Leibniz International Proceedings in Informatics (LIPIcs)
open-access series.
IMPORTANT DATES
Times AoE (Anywhere on Earth):
Abstract submission: 6 February, 2017.
Full paper submission: 13 February, 2017.
Acceptance notification: 27 March, 2017.
Camera-ready version: 6 April, 2017.
Conference dates: June 21-23, 2017.
TOPICS
Contributions solicited cover a variety of topics including but not
limited to:
Algorithm Engineering
Algorithmic Libraries
Algorithmic Mechanism Design
Analysis of Algorithms
Algorithms for Memory Hierarchies
Approximation Techniques
Bioinformatics
Branch-and-Bound Algorithms
Combinatorial and Irregular Problems
Combinatorial Structures and Graphs
Communication Networks
Complex Networks
Computational Geometry
Computational Learning Theory
Computational Optimization
Computer Systems
Cryptography and Security
Data Streams
Data Structures
Distributed and Parallel Algorithms
Evaluation of Algorithms for Realistic Environments
Experimental Techniques and Statistics
Graph Drawing
Heuristics for Combinatorial Optimization
Implementation, Testing, Evaluation and Fine-tuning
Information Retrieval
Integer Programming
Logistics and Operations Management
Machine Learning and Data Mining
Mathematical Programming
Metaheuristic Methodologies
Multiple Criteria Decision Making
Network Analysis
Novel Applications of Algorithms in Other Disciplines
Online Problems
Parallel Algorithms and Computing
Railway Optimization using Algorithmic Methods
Randomized Techniques
Robotics
Semidefinite Programming
Simulation
Software Repositories and Platforms for using Algorithms
Telecommunications and Networking
World-Wide-Web Algorithms
INVITED SPEAKERS
Graham Cormode (University of Warwick)
Martin Farach-Colton (Rutgers University)
Ruth Misener (Imperial College London)
PROGRAM COMMITTEE
Maike Buchin, Ruhr University Bochum, Germany
Christina Burt, University of Melbourne, Australia
Sandor Fekete, TU Braunschweig, Germany
Irene Finocchi, University of Rome - La Sapienza, Italy
Ambros Gleixner, Zuse Institute Berlin, Germany
Dominik Kempa, University of Helsinki, Finland
Nicole Megow, Technical University of Munich, Germany
Ulrich Meyer, Goethe-Universitat Frankfurt am Main, Germany
Shin-Ichi Minato, Hokkaido University, Japan
Petra Mutzel, Technical University of Dortmund, Germany
Gonzalo Navarro, University of Chile, Chile
Giuseppe Ottaviano, Facebook, USA
Panos Pardalos, University of Florida, USA
Solon Pissis, King's College London, UK - co-chair
Simon J. Puglisi, University of Helsinki, Finland - co-chair
Rajeev Raman, University of Leicester, UK - co-chair
Barna Saha, University of Massachusetts Amherst, USA
Alassandra Sala, Nokia Bell Labs, Ireland
Sabine Storandt, University of Wuerzburg, Germany
Rossano Venturini, University of Pisa, Italy
Dorothea Wagner, Karlsruhe Institute of Technology, Germany
Renato Werneck, Amazon, USA
Christos Zaroliagis, University of Patras, Greece
SUBMISSIONS
Authors are invited to submit an extended abstract not exceeding
12 single-spaced pages, including references, figures, title, authors,
affiliations, e-mail addresses, and a short (one paragraph) abstract.
Authors are strongly advised to use the LaTeX style file supplied for
the LIPIcs style here:
https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/
Final proceedings papers must be camera-ready in this format. A clearly
marked Appendix, which will not count toward the 12 page submission
limit, can be included and will be read at the referees' discretion.
All submissions have to be made via the EasyChair submission page for
the conference at:
https://easychair.org/conferences/?conf=sea2017
Papers submitted for review should present original, previously
unpublished work or surveys of important results. At the time the
extended abstract is submitted to SEA, and for the entire review period,
the paper (or essentially the same paper) should not be under review by
any other conference with published proceedings or by a scientific
journal. At least one author of each accepted paper will be expected to
attend the conference and present the paper.
FURTHER INFORMATION AND CONTACTS
Web: http://www.dcs.kcl.ac.uk/events/SEA2017/
------------------------------
Message: 4
Date: Tue, 06 Dec 2016 12:14:23 +0100
From: Daniel Borchmann <daniel.borchmann@tu-dresden.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Extended Deadline: ICFCA'17 — 14th International
Conference on Formal Concept Analysis
Message-ID: <874m2hgvhs.fsf@tu-dresden.de>
Content-Type: text/plain; charset=utf-8
================================================================================
NOTE: Extended deadlines, please see below!
================================================================================
ICFCA 2017
14th International Conference on Formal Concept Analysis
June 12—16, 2017, Rennes, France
Web: <http://icfca2017.irisa.fr/>
Mail: icfca2017@inria.fr
================================================================================
* Overview
Formal Concept Analysis emerged in the 1980's from attempts to restructure
lattice theory in order to promote better communication between lattice
theorists and potential users of lattice theory. Since its early years, Formal
Concept Analysis has developed into a research field in its own right with a
thriving theoretical community and a rapidly expanding range of applications in
information and knowledge processing including visualization, data analysis
(mining) and knowledge management and discovery.
The ICFCA conference series aims at bringing together researchers and
practitioners working on theoretical or applied aspects of Formal Concept
Analysis within major related areas such as Mathematics and Computer and
Information Sciences and their diverse applications to fields like Software
Engineering, Linguistics, Life and Social Sciences, etc.
All accepted submissions will be refereed, and the conference proceedings will
be published by Springer in the LNCS/LNAI series.
* Topics
Main topics of interest include, but are not limited to:
** Fundamental aspects of FCA
- FCA theory
- Lattice theory
- Lattice drawing
- Philosophical foundations
- Algorithms and complexity theory
** Bridging FCA to information sciences and artificial intelligence
- FCA and logic, e.g., semantic web, description logics
- FCA and conceptual structures, e.g., concept graphs, knowledge spaces
- FCA and data analysis, e.g., hierarchical classification, data organization
- FCA and data mining, e.g., pattern mining
- FCA and information retrieval, e.g. exploratory search, navigation, querying
- FCA and machine learning, e.g., learning with hypothesis, feature selection
- FCA and database theory, e.g., dependencies, rules, data cubes
- FCA and software engineering
- FCA and morphological mathematics
** Understanding, modelling real-world data and phenomena with FCA
- Analysis of "big data" with FCA, e.g., sampling, parallel computing
- Analysis of social networks and their dynamics
- Applications for scientific data analysis, e.g., in biology or health care
- Applications for sensors data and user interactions traces
- Other FCA applications
* Submission Details
We invite scientific publications on theory and applications of Formal Concept
Analysis. Papers of up to sixteen pages may be submitted in the PDF format via
the Easychair system
<https://easychair.org/conferences/?conf=icfca2017>.
Authors are requested to follow the formatting instructions for the Springer
LNCS style.[1] Submissions in LaTeX2e are preferred. Authors are encouraged to
provide an ORCID alongside their submission.[2]
Accepted papers have to be presented at the conference. Therefore, at least one
author per paper has to register timely.
[1]: https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines
[2]: https://www.springer.com/gp/authors-editors/orcid
* Important Dates
Submission of abstract: *December 19, 2016* (EXTENDED!)
Submission of full paper: *January 2, 2017* (EXTENDED!)
Notification of acceptance: February 6, 2017
Camera ready due: February 27, 2017
Conference: June 12—16, 2017
* Organization
The conference will be hosted by IRISA[3] and Centre de Recherche Inria Bretagne
Atlantique[4].
[3]: https://www.irisa.fr/en
[4]: https://www.inria.fr/centre/rennes
** Conference Chairs
Peggy Cellier, IRISA, INSA Rennes, France
Sébastien Ferré, IRISA, University Rennes 1, France
** Program Chairs
Karell Bertet, L3I, Université de La Rochelle, France
Daniel Borchmann, Technische Universität Dresden, Germany
** Editorial Board
Jaume Baixeries, Polytechnic University of Catalonia, Catalonia
Peggy Cellier, IRISA lab, Rennes, France
Florent Domenach, Akita International University, Japan
Peter Eklund, IT University of Copenhagen, Denmark
Sebastien Ferré, Université de Rennes 1, France
Bernhard Ganter, Technische Universität Dresden, Germany
Cynthia Vera Glodeanu
Mehdi Kaytoue, INSA-Lyon, LIRIS, France
Sergei Kuznetsov, Higher School of Economics, Moscow, Russia
Leonard Kwuida, Bern University of Applied Sciences
Rokia Missaoui, Université du Québec en Outaouais (UQO), Canada
Amedeo Napoli, LORIA, Nancy, France
Sergei Obiedkov, Higher School of Economics, Moscow, Russia
Manuel Ojeda-Aciego, University of Malaga, Spain
Uta Priss, Ostfalia University of Applied Sciences, Wolfenbüttel, Germany
Sebastian Rudolph, Technische Universität Dresden, Germany
Christian Sacarea, Babes-Bolyai University of Cluj-Napoca, Romania
Stefan E. Schmidt, Technische Universität Dresden, Germany
Gerd Stumme, Universität Kassel, Germany
Petko Valtchev, Université du Québec à Montréal, Canada
Karl Erich Wolff, University of Applied Sciences, Darmstadt, Germany
** Honorary Members
Vincent Duquenne, ECP6-CNRS, Université Paris 6, France
Rudolf Wille, Technische Universität Darmstadt, Germany
** Program Committee
Simon Andrews, Sheffield Hallam University, United Kingdom
François Brucker, Centrale Marseille, France
Claudio Carpineto, Fondazione Ugo Bordoni, Italy
Pablo Cordero, University of Málaga, Spain
Jean Diatta, Université de la Réunion, France
Felix Distel, d-fine GmbH, Germany
Christophe Demko, L3I lab, Université de La Rochelle, France
Stephan Doerfel, MICROMATA GmbH, Germany
Alain Gély, Université Paul Verlaine, Metz, France
Robert Godin, Université du Québec à Montréal, Canada
Marianne Huchard, LIRMM, Université Montpellier, France
Dmitry Ignatov, Higher School of Economics, Moscow, Russia
Robert Jäschke, University of Sheffield, England
Michal Krupka, Palacky University, Olomouc, Czech Republic
Marzena Kryszkiewicz, Warsaw University of Technology, Poland
Wilfried Lex, Universität Clausthal, Germany
Jesús Medina, Cadiz University, Spain
Engelbert Mephu Nguifo, LIMOS, Université de Clermont Ferrand 2, France
Lhouari Nourine, LIMOS, Université de Clermont Ferrand 2, France
Jan Outrata, Palacky University of Olomouc, Czech Republic
Jean-Marc Petit, LIRIS, INSA Lyon, France
Sandor Radeleczki, University of Miskolc, Hungary
Barış Sertkaya, Frankfurt University of Applied Sciences
Laszlo Szathmary, University of Debrecen, Hungary
Andreja Tepavčević, University of Novi Sad, Serbia
Jean-François Viaud, L3I lab, Université de La Rochelle, France
--
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Dr. rer. nat. Daniel Borchmann
Postdoctoral Research Associate
Technische Universität Dresden
Fakultät Informatik
Institut für Theoretische Informatik
Lehrstuhl für Automatentheorie
01062 Dresden
Tel.: +49 351 463-38351
E-Mail: daniel.borchmann@tu-dresden.de
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
------------------------------
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 106, Issue 8
**************************************
No comments:
Post a Comment