Tuesday, December 8, 2015

dmanet Digest, Vol 94, Issue 7

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. SAT 2016 call for papers (Jakob Nordström)
2. IEEE CEC 2016 Special Session - Optimization, Learning, and
Decision-Making in Bioinformatics and Bioengineering (OLDBB)
(Richard Allmendinger)
3. London Stringology Days/Algorithmic Workshop 2016 (Second
Call for Participation) (Robert Mercas)


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

Message: 1
Date: Sat, 5 Dec 2015 23:06:31 +0000
From: Jakob Nordström <jakobn@kth.se>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] SAT 2016 call for papers
Message-ID: <1449356789419.29057@kth.se>
Content-Type: text/plain; charset="iso-8859-1"

CALL FOR PAPERS

Nineteenth International Conference on
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING
--- SAT 2016 ---

Bordeaux, France, July 5-8, 2016

Abstract submission deadline: February 14, 2016
Paper submission deadline: February 21, 2016

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

The International Conference on Theory and Applications of
Satisfiability Testing (SAT) is the premier annual meeting for
researchers focusing on the theory and applications of the propositional
satisfiability problem, broadly construed. In addition to plain
propositional satisfiability, it also includes Boolean optimization
(such as MaxSAT and Pseudo-Boolean (PB) constraints), Quantified Boolean
Formulas (QBF), Satisfiability Modulo Theories (SMT), and Constraint
Programming (CP) for problems with clear connections to Boolean-level
reasoning.

Many hard combinatorial problems can be tackled using SAT-based
techniques including problems that arise in Formal Verification,
Artificial Intelligence, Operations Research, Computational Biology,
Cryptography, Data Mining, Machine Learning, Mathematics, et cetera.
Indeed, the theoretical and practical advances in SAT research over the
past twenty years have contributed to making SAT technology an
indispensable tool in a variety of domains.

SAT 2016 aims to further advance the field by soliciting original
theoretical and practical contributions in these areas with a clear
connection to Satisfiability. Specifically, SAT 2016 invites scientific
contributions addressing different aspects of SAT interpreted in a broad
sense, including (but not restricted to) theoretical advances (such as
exact algorithms, proof complexity, and other complexity issues),
practical search algorithms, knowledge compilation, implementation-level
details of SAT solvers and SAT-based systems, problem encodings and
reformulations, applications (including both novel application domains
and improvements to existing approaches), as well as case studies and
reports on findings based on rigorous experimentation.

SAT 2016 takes place in the nice city of Bordeaux, which is located in
the South West of France. Bordeaux is well-known to be the world wine
capital, and also ranked UNESCO town.

IMPORTANT DATES
===============

- February 14, 2016: Abstract submission deadline
- February 21, 2016: Paper submission deadline
- March 21-23, 2016: Author response period
- April 3, 2016: Author notification
- April 23, 2016: Camera-ready versions of papers due
- July 4, 2016: Pre-conference workshops
- July 5-8, 2016: Main conference

Follow us on the [conference web site](http://sat2016.labri.fr/),
[twitter](http://twitter.com/sat2016bordeaux) or
[facebook](http://www.facebook.com/sat2016bordeaux/) for updates.

SCOPE
=====

SAT 2016 welcomes scientific contributions addressing different aspects
of the satisfiability problem, interpreted in a broad sense. Domains
include MaxSAT and Pseudo-Boolean (PB) constraints, Quantified Boolean
Formulae (QBF), Satisfiability Modulo Theories (SMT), as well as
Constraint Satisfaction Problems (CSP). Topics include, but are not
restricted to:

- Theoretical advances (including exact algorithms, proof complexity,
and other complexity issues);

- Practical search algorithms;

- Knowledge compilation;

- Implementation-level details of SAT solving tools and SAT-based
systems;

- Problem encodings and reformulations;

- Applications (including both novel applications domains and
improvements to existing approaches);

- Case studies and reports on insightful findings based on rigorous
experimentation.

OUT OF SCOPE
============

Papers claiming to resolve a major long-standing open theoretical
question in Mathematics or Computer Science (such as those for which a
[Millennium Prize is
offered](http://www.claymath.org/millennium-problems), are outside the
scope of the conference because there is insufficient time in the
schedule to referee such papers; instead, such papers should be
submitted to an appropriate technical journal.

PAPER CATEGORIES
================

Submissions to SAT 2016 are solicited in three paper categories,
describing original contributions.

- LONG PAPERS (9 to 15 pages, excluding references)
- SHORT PAPERS (up to 8 pages, excluding references)
- TOOL PAPERS (up to 6 pages, excluding references)

LONG and SHORT papers should contain original research, with sufficient
detail to assess the merits and relevance of the contribution. For
papers reporting experimental results, authors are strongly encouraged
to make their data and implementations available with their submission.
Submissions reporting on case studies are also encouraged, and should
describe details, weaknesses, and strengths in sufficient depth. LONG
papers and SHORT papers will be evaluated with the same quality
standards, and are expected to contain a similar contribution per page
ratio.

The authors should choose between a LONG or a SHORT paper depending on
the space they need to fully describe their contribution. The
classification between LONG and SHORT papers is mainly a way to balance
the workload of the reviewing process among PC members. It also impacts
the duration of the presentation of the work during the conference. It
is the responsibility of the authors to make sure that their paper is
self-contained in the chosen limit of pages. There will be no
requalification of the submissions by the PC.

TOOLS papers must obey to a specific content criteria in addition to
their size limit. A tool paper should describe the implemented tool and
its novel features. Here "tools" are interpreted in a broad sense,
including descriptions of implemented solvers, preprocessors, etc., as
well as systems that exploit SAT solvers or their extensions to solve
interesting problem domains. A demonstration is expected to accompany a
tool presentation. Papers describing tools that have already been
presented previously are expected to contain significant and clear
enhancements to the tool.

Submissions should not be under review elsewhere nor be submitted
elsewhere while under review for SAT 2016, and should not consist of
previously published material.

Submissions not consistent with the above guidelines may be returned
without review.

Besides the paper itself, authors may submit a supplement consisting of
one file in the format of a gzipped tarball (.tar.gz or .tgz) or a
gzipped file (.gz) or a zip archive (.zip). Authors are encouraged to
submit a supplement when it will help reviewers evaluate the paper.
Supplements will be treated with the same degree of confidentiality as
the paper itself. For example, the supplement might contain detailed
proofs, examples, software, detailed experimental data, or other
material related to the submission. Individual reviewers may or may not
consult the supplementary material; the paper itself should be
self-contained.

Long and short papers may be considered for a best paper award. If the
main author is a student, both in terms of work and writing, the paper
may be considered for a best student-paper award. Use the supplement to
your submission to state (in a brief cover letter) if the paper
qualifies as a student paper.

Links to information on the Springer LNCS style are available through
the [SAT 2016 website](http://sat2016.labri.fr/).

All papers submissions are done exclusively via
[EasyChair](http://www.easychair.org/conferences/?conf=sat2016).

One author of each accepted paper is expected to present it at the
conference.

PROCEEDINGS
===========

All accepted papers are expected to be published in the proceedings of
the conference, which will be published within the Springer LNCS series.

STUDENT GRANTS
==============

A limited number of student travel support grants will be available from
our sponsors. Applicants should acquire a letter of support from their
advisor and prepare a statement detailing why the travel support is
needed. This information should be emailed to the SAT'16 conference
chairs at sat2016@easychair.org by March 31st, 2016. Determinations will
be made shortly after the notification to the authors.

ORGANIZATION
============

PROGRAM CHAIRS
--------------

- Nadia Creignou Aix-Marseille Université, LIF-CNRS France
- Daniel Le Berre Université d'Artois, CRIL-CNRS France

LOCAL CHAIR
-----------

- Laurent Simon Bordeaux INP, University of Bordeaux, LaBRI-CNRS,
France

PROGRAM COMMITTEE
-----------------

- Fahiem Bacchus University of Toronto
- Yael Ben-Haim IBM Research
- Olaf Beyersdorff University of Leeds
- Armin Biere Johannes Kepler University
- Nikolaj Bjorner Microsoft Research
- Maria Luisa Bonet Universitat Politecnica de Catalunya
- Sam Buss UCSD
- Nadia Creignou Aix-Marseille Université, LIF-CNRS
- Uwe Egly TU Wien
- John Franco University of Cincinnati
- Djamal Habet Aix-Marseille Université, LSIS-CNRS
- Marijn Heule The University of Texas at Austin
- Holger Hoos University of British Columbia
- Frank Hutter University of Freiburg
- Mikolas Janota Microsoft Research
- Matti Järvisalo University of Helsinki
- Hans Kleine Büning University of Paderborn
- Daniel Le Berre Université d'Artois, CRIL-CNRS
- Ines Lynce INESC-ID/IST, University of Lisbon
- Marco Maratea DIBRIS, University of Genova
- Joao Marques-Silva INESC-ID, IST, ULisbon
- Stefan Mengel CRIL-CNRS
- Alexander Nadel Intel
- Nina Narodytska Samsung Research America
- Jakob Nordström KTH
- Albert Oliveras Technical University of Catalonia
- Roberto Sebastiani DISI, University of Trento
- Martina Seidl Johannes Kepler University Linz
- Yuping Shen Institute of Logic and Cognition, Sun Yat-sen University
- Laurent Simon Bordeaux INP, University of Bordeaux, LaBRI-CNRS
- Takehide Soh Information Science and Technology Center, Kobe
University
- Stefan Szeider TU Wien
- Allen Van Gelder University of California, Santa Cruz

CONTACT
=======

sat2016@easychair.org

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

Message: 2
Date: Mon, 7 Dec 2015 10:14:06 +0000
From: Richard Allmendinger <richard.allmendinger@gmail.com>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] IEEE CEC 2016 Special Session - Optimization,
Learning, and Decision-Making in Bioinformatics and Bioengineering
(OLDBB)
Message-ID:
<CAG9V9fLqfQEQ_kyfMTLVuWfNrRFHmBqJE7JduTfHdSpE0Fp_ZA@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

Dear colleagues,

If you are working at the interface of computational intelligence and
biology, then the Special Session below (organized at IEEECEC in beautiful
Vancouver, CAN) may be of interest to you.

Best wishes,
Richard


*************************************************************
CALL FOR PAPERS
*************************************************************
*Special Session on *

*Optimization, Learning, and Decision-Making in Bioinformatics and
Bioengineering (OLDBB)*
http://tinyurl.com/SpecialSession-OLDBB-CEC2016

2016 IEEE Congress on Evolutionary Computation (IEEE CEC 2016)
25 - 29 July 2016, Vancouver, Canada

<http://www.ucl.ac.uk/~ucberal/SS-OMBB-IEEE_SSCI_2014.html>
Submission deadline: 15 January 2016
Submission details: http://www.wcci2016.org/submission.php
*************************************************************

*Scope of the session*
This special session invites papers discussing recent advances in the
development and application of Optimization, Learning, and Decision-Making
in Bioinformatics and Bioengineering (OLDBB).

Bioinformatics and Bioengineering (BB) are interdisciplinary scientific
fields involving many branches of computer science, engineering,
mathematics, and statistics. Bioinformatics is concerned with the
development and application of computational methods for the modeling,
retrieving and analysis of biological data, while Bioengineering is the
application of engineering techniques to biology so as to create usable and
economically viable products.

The main aim of this special session is to bring together both experts and
new-comers working on Optimization, Learning and Decision-Making in
Bioinformatics and Bioengineering (OLDMBB) to discuss new and exciting
issues in this area. This session is supported by the IEEE CIS
Bioinformatics and Bioengineering Technical Committee (BBTC) and the IEEE
CIS Task Force on Optimization Methods in Bioinformatics and Bioengineering.

We encourage submission of papers describing new
optimization/learning/decision-making strategies, challenges,
and applications in the area of BB. You are invited to submit papers that
are unpublished original work on topics that are, but not limited to, the
following

* (Single and multiobjective) optimization techniques for Bioinformatics
and Bioengineering (BB) problems
- Evolutionary algorithms
- Swarm Intelligence
- Metaheuristics
- Fuzzy optimization
- Surrogate-based methods
- Hybrid optimization algorithms (combinations of heuristics and exact
methods)

* Decision-making techniques for BB problems
- Preference elicitation and representation
- Aggregation-based techniques
- Fuzzy logic-based techniques
- Bayesian-based techniques

* Learning in the optimization of BB problems
- Link between Decision Maker's learning and model's learning
- Capturing and learning from user preferences
- Integrating optimization with machine learning
- Interactive learning and optimization techniques
- Techniques for learning user-driven parameter settings from examples

* Tuning of optimization, learning and decision-making techniques for BB
problems
- Performance measures
- Test and benchmark problems
- (Interactive) visualization techniques
- Optimization and visualization software

* Emerging Topics in in BB
- Novel applications (process design, manufacturing, etc)
- Challenging problem features (e.g. many decision variables, dynamic
problems, uncertainty, expensive and limited evaluations, etc)
- Closed-loop applications and challenges
- Many-objective optimization, learning, and decision-making
- Ecoinformatics
- Side effect machines and other kernal representations for sequence
analysis
- Data modelling/mining and Big Data analytics

*Submission Instructions*
We welcome original contributions describing ongoing projects or completed
work. The instructions for authors, and LaTeX and Word templates can be
found at http://www.wcci2016.org/submission.php

*Key Dates*
Paper Submissions due: 15 January 2016
Notification of Acceptance: 15 March 2016
Camera-Ready Papers due: 15 April 2016

*Organizers*
Richard Allmendinger, University College London, UK
Daniel Ashlock, University of Guelph, Canada
Sanaz Mostaghim, Otto von Guericke University of Magdeburg, Germany

*Program Committee*
Ashlock Wendy, York University, Canada
Auephanwiriyakul Sansanee, Chiang Mai University, Thailand
Branke Juergen, University of Warwick, UK
Brown Joseph, Innopolis University, Russia
Brown Michael, University of Maryland University College, USA
Coker James, University of Maryland University College, USA
Corns Steven, Missouri University, USA
Fogel Gary, Natural Selection Inc, USA
Handl Julia, University of Manchester, UK
Houghten Sheridan, Brock University, Canada
Jin Yaochu, University of Surrey, UK
Knowles Joshua, University of Manchester, UK
Langdon Bill, University College London, UK
Lavygina Anna, Imperial College London, UK
Rombo Simona, University of Palermo, Italy
Yifeng Li, University of British Columbia, Canada

*Contact*
For further information please contact Richard Allmendinger (
richard.allmendinger@manchester.ac.uk <r.allmendinger@ucl.ac.uk>)

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

Message: 3
Date: Mon, 7 Dec 2015 13:59:18 +0100
From: Robert Mercas <robertmercas@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] London Stringology Days/Algorithmic Workshop 2016
(Second Call for Participation)
Message-ID: <9D3650C6-FC33-43E7-B21A-DE7ADCBF4203@gmail.com>
Content-Type: text/plain; charset=us-ascii

Dear all,

We will be hosting LSD & LAW 2016 (London Stringology Days & London Algorithmic Workshop 2016) at King's College London on the 4th and 5th of February 2016 (http://www.inf.kcl.ac.uk/events/LSD&LAW16/ <http://www.inf.kcl.ac.uk/events/LSD&LAW16/>).

If you would like to give a talk (around 25 mins) at this two-day workshop, we would be grateful if you send us the Title and Abstract by end of December 2015 (please send the titles and/or abstracts to robertmercas@gmail.com <mailto:robertmercas@gmail.com>). We particularly encourage talks with relevance to the additional theme of the 2016 LSD & LAW meeting: From Symbolic Dynamics to Approximation Methods.

There won't be a formal registration, but to help us with preparations, please let us know if you are planning to attend the workshop.

We hope to see you in London!

Best Regards,
Golnaz Badkobeh, Jakub Radoszewski, and Robert Mercas
on behalf of the LSD & LAW 2016 organising committee.


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

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 94, Issue 7
*************************************

No comments:

Post a Comment