Mehryar Mohri and Karthik Sridharan
Program co-chairs, ALT 2018
Theorynet, DMANet and a few other announcements.
Dear colleagues,
We would like to draw your attention to the upcoming SIGOPT conference,
SIGOPT 2018 International Conference on Optimization,
to be held on
March 21-23, 2018, in Kloster Irsee, Germany.
You can find a preliminary web page with important dates and additional information at
http://www.math.uni-augsburg.de/tagungen/SIGOPT-2018
The SIGOPT conference series addresses the full range of theory and practice in all branches of mathematical optimization, e.g.,
- Linear and Nonlinear Programming
- Discrete and Combinatorial Optimization
- Optimal Control
- Stochastic Programming
- Multiobjective Programming
- Robust Optimization
- Game Theory and Bilevel Optimization
- Application of Optimization in Real-World Problems
Young researchers from all areas of optimization are especially encouraged to participate and to present their work.
The conference will provide a good opportunity for exchanging ideas, especially across disciplines,
and for establishing contacts with colleagues in the friendly atmosphere of Kloster Irsee.
Plenary Speakers:
- Immanuel Bomze (Universitaet Wien, Austria)
- Jacek Gondzio (The University of Edinburgh, Scotland, UK)
- Britta Peis (RWTH Aachen, Germany)
- Karl Schmedders (Universitaet Zuerich, Switzerland)
- Rico Zenklusen (ETH Zuerich, Switzerland)
Important Dates
• proposal of invited sessions: 01/10/2017 - 15/12/2017 Please submit your proposal via email to: sigopt2018@math.uni-augsburg.de
• registration and abstract submission: 01/11/2017 - 15/01/2018
• notification of acceptance: in timely manner, after abstract submission, latest end of January 2018
We hope to see you next year in Irsee!
With best regards,
the organizing committee
(Tobias Harks, Ralf Werner)
---------------------------------------------------------------
Prof. Dr. Tobias Harks, Prof. Dr. Ralf Werner
Institut fuer Mathematik
Universitaet Augsburg
86135 Augsburg
Tel.: 0821 598 2220 or 2212
E-Mail: sigopt2018@math.uni-augsburg.de
http://www.math.uni-augsburg.de/tagungen/SIGOPT-2018
---------------------------------------------------------------
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
This is a 18 months position. The starting date is expected to be before
September 2018, but it can be negotiated. The salary depends on the
candidate's experience (at least around 2100€/month).
Applicants should possess a PhD in mathematics or computer science and
research experience pertinent to some of the research topics of the
project. The successful applicant will conduct research on combinatorial
aspects of convex polytopes with Arnau Padrol and other members of the
ANR CAPPS (https://webusers.imj-prg.fr/~arnau.padrol/CAPPS).
Interested candidates should send their application to
arnau.padrol@imj-prg.fr, preferably by the end of 2017. Please include
your CV, a short research statement and a publication list. Letters of
recommendation are optional, but contact information of at least two
references should be provided. They might be eventually requested to
provide a letter.
For further inquiries contact arnau.padrol@imj-prg.fr
(https://webusers.imj-prg.fr/~arnau.padrol/).
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
The sheer volume of new data, which is being generated at an increasingly fast pace, has already produced an anticipated data deluge that is difficult to challenge. We are in the presence of an overwhelming vast quantity of data, owing to how easy is to produce or derive digital data. Even the storage of this massive amount of data is becoming a highly demanding task, outpacing the current development of hardware and software infrastructure. Nonetheless, this effort must be undertaken now for the preservation, organization and long-term maintenance of these precious data. However, the collected data is useless without our ability fully understand and make use of it. Therefore, we need new algorithms to address this challenge.
Data mining techniques and algorithms to process huge amount of data in order to extract useful and interesting information have become popular in many different contexts. Algorithms are required to make sense of data automatically and in efficient ways. Nonetheless, even though sequential computer systems performance is improving, they are not suitable to keep up with the increase in the demand for data mining applications and the data size. Moreover, the main memory of sequential systems may not be enough to hold all the data related to current applications.
This Special Issue takes into account the increasing interest in the design and implementation of parallel and distributed data mining algorithms. Parallel algorithms can easily address both the running time and memory requirement issues, by exploiting the vast aggregate main memory and processing power of processors and accelerators available on parallel computers. Anyway, parallelizing existing algorithms in order to achieve good performance and scalability with regard to massive datasets is not trivial. Indeed, it is of paramount importance a good data organization and decomposition strategy in order to balance the workload while minimizing data dependences. Another concern is related to minimizing synchronization and communication overhead. Finally, I/O costs should be minimized as well. Creating breakthrough parallel algorithms for high-performance data mining applications requires addressing several key computing problems which may lead to novel solutions and new insights in interdisciplinary applications.
Moreover, increasingly the data is spread among different geographically distributed sites. Centralized processing of this data is very inefficient and expensive. In some cases, it may even be impractical and subject to security risks. Therefore, processing the data minimizing the amount of data being exchanged whilst guaranteeing at the same time correctness and efficiency is an extremely important challenge. Distributed data mining performs data analysis and mining in a fundamentally distributed manner paying careful attention to resource constraints, in particular bandwidth limitation, privacy concerns and computing power.
The focus of this Special Issue is on all forms of advances in high-performance and distributed data mining algorithms and applications. The topics relevant to the Special Issue include (but are not limited to) the following.
TOPICS OF INTEREST
Scalable parallel data mining algorithms using message-passing, shared-memory or hybrid programming paradigms
Exploiting modern parallel architectures including FPGA, GPU and many-core accelerators for parallel data mining applications
Middleware for high-performance data mining on grid and cloud environments
Benchmarking and performance studies of high-performance data mining applications
Novel programming paradigms to support high-performance computing for data mining
Performance models for high-performance data mining applications and middleware
Programming models, tools, and environments for high-performance computing in data mining
Map-reduce based parallel data mining algorithms
Caching, streaming, pipelining, and other optimization techniques for data management in high-performance computing for data mining
Novel distributed data mining algorithms
SUBMISSION GUIDELINES
All manuscripts and any supplementary material should be submitted electronically through Elsevier Editorial System (EES) at http://ees.elsevier.com/ins (http://ees.elsevier.com/ins). The authors must select as "SI:PDDM" when they reach the "Article Type" step in the submission process.
A detailed submission guideline is available as "Guide to Authors" at: http://www.elsevier.com/journals/information-sciences/0020-0255/guide-for-authors.
IMPORTANT DATES
Submission deadline: December 1th, 2017
First round notification: March 1th, 2018
Revised version due: May 1st, 2018
Final notification: June 1st, 2018
Camera-ready due: July 1st, 2018
Publication tentative date: October 2018
Guest editors:
Massimo Cafaro, Email: massimo.cafaro@unisalento.it
University of Salento, Italy and Euro-Mediterranean Centre on Climate Change, Foundation
Italo Epicoco, Email: italo.epicoco@unisalento.it
University of Salento, Italy and Euro-Mediterranean Centre on Climate Change, Foundation
Marco Pulimeno, Email: marco.pulimeno@unisalento.it
University of Salento, Italy
-
************************************************************************************
Massimo Cafaro, Ph.D.
Associate Professor
Dept. of Engineering for Innovation
University of Salento, Lecce, Italy
Via per Monteroni
73100 Lecce, Italy
Voice/Fax +39 0832 297371
Web http://sara.unisalento.it/~cafaro
E-mail massimo.cafaro@unisalento.it
cafaro@ieee.org
cafaro@acm.org
CMCC Foundation
Euro-Mediterranean Center on Climate Change
Via Augusto Imperatore, 16 - 73100 Lecce
massimo.cafaro@cmcc.it
************************************************************************************
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
2018 Genetic and Evolutionary Computation Conference (GECCO 2018)
July, 2018, Kyoto, Japan
http://gecco-2018.sigevo.org/
Important Dates:
Tutorials, Workshops, and Competitions:
Proposals: November 7, 2017
Acceptance Decision: December 5, 2017
Conference: July 15-19, 2018
*** Call for Tutorials ***
Tutorials at GECCO 2018 will be presented by domain experts to cover
current topics relevant to evolutionary computation researchers and
practitioners. Each tutorial will be 110 minutes long. We encourage the
inclusion of interactive activities and demos.
Tutorials will be free to all GECCO 2018 attendees. It is expected that
all the instructors involved in an accepted tutorial will attend the
conference. One instructor/presenter of each accepted tutorial will be
able to register for GECCO at half the regular rate. (The discount can
be divided among tutorial instructors if there are more than one. Each
presenter is eligible for only a single tutorial discount, i.e., it is
not possible to aggregate discounts from more tutorials).
Accepted tutorials' slide sets will be collected by Sheridan/ACM Press,
and published as part of a companion volume to the conference
proceedings in the ACM Digital library.
* Submission Process *
Each tutorial proposal should include:
1. A half-page extended abstract (in plain text) that includes: the
title of the tutorial, the name and affiliation of the instructor(s),
and a description of the tutorial scope and content.
2. Short bio of the instructor(s) (about half page in plain text).
3. [Highly encouraged] A description of any interactive activity or demo
planned within the tutorial presentation.
* Reviewing *
Tutorial proposals will be reviewed by the GECCO 2018 organizing
committee, based on the GECCO attendees' likely interest in them, the
breadth and depth of the topic(s), and the expertise and credentials of
the instructor(s).
* Information and Submissions *
Tutorials proposals should be submitted to:
Hisao Ishibuchi, GECCO 2018 Tutorials Chair
Osaka Prefecture University, Osaka, Japan
Email: hisaoi@cs.osakafu-u.ac.jp
Webpage: http://gecco-2018.sigevo.org/index.html/Tutorials
*** Call for Workshops ***
GECCO workshops provide the possibility to commonly develop visions and
exchange ideas in an informal setting, especially if focused on an
emerging research field or interdisciplinary research area. In contrast
to regular sessions, workshops can (and should) host interactive
sessions (posters, discussions, demonstrations, etc.). Attendance at the
workshops will be free to all GECCO attendees.
Workshop organizers are responsible for coordination and publicity. They
collect and review papers, and provide a list of accepted papers and
their authors, if applicable. If required, the GECCO organizers may
provide additional support to the workshop organizers, such as
publicity. Note that organizers, participants and presenters must
register for the conference. Accepted workshop papers will be collected
by Sheridan/ACM Press, and published in a companion volume to the
conference proceedings.
* Submission Process *
Each workshop proposal needs to include:
1. A half-page extended abstract (in plain text) that includes: the
workshop title, the name and affiliation of the organizer(s), and a
description of scope and content. Please refrain from using special
characters in the title.
2. Short bio of the organizer(s) (about half-page in plain text).
3. [Highly encouraged] A description of any interactive activity or demo
planned within the workshop.
4. A draft schedule of the workshop, including the estimated duration (1
to max 4 sessions) and type of sessions.
5. If this workshop (or a similar event coordinated by the same
organizers or a subset of them) has taken place in previous years,
either at GECCO or at other events, then include URLs to the event pages.
* Reviewing of Proposals *
Workshop proposals will be reviewed by the GECCO 2018 organizing
committee, based on GECCO attendees' likely interest, the breadth and
the depth of the topic(s), and the expertise and credentials of the
organizer(s).
* Information and Proposal Submissions *
Workshops proposals should be submitted to:
Carlos Cotta and Tapabrata Ray, GECCO 2018 Workshops Chairs
Malaga University, Spain
Email: ccottap (at) lcc.uma.es
University of New South Wales, Australia
Email: t.ray (at) adfa.edu.au
Webpage: http://gecco-2018.sigevo.org/index.html/Workshops
*** Call for Competitions ***
Competitions demonstrate how Evolutionary Computation and related
techniques can be utilized in challenging practical, real-world and
gaming settings. They also enable fair comparisons between algorithms
and (for recurrent competitions) provide the possibility to follow the
development of approaches over time.
* Submission process *
Each competition proposal should include:
1. A half-page abstract (plain text) that includes: competition title,
the name and affiliation of the organizer(s), a description of the
competition. If the competition has been held before, then also
provide the web address of last edition and what you will change
in case you plan any changes.
2. In addition, you can voluntarily provide your thoughts on the
following items:
* sourcing of prizes
* judging process
* think about newcomers: can you provide tutorials (incl. videos)
to make the entrance easier?
* think about the eventual sharing of submitted algorithms and
their descriptions
We are currently exploring the possibility of offering the publication
of algorithm descriptions as 2-page contributions to the GECCO
Companion.
* Information and Submissions *
Competition proposals should be submitted by e-mail to:
Markus Wagner, GECCO 2018 Competitions Chair
University of Adelaide, Australia
markus.wagner (at) adelaide.edu.au
Webpage: http://gecco-2018.sigevo.org/index.html/Competitions
********
GECCO is sponsored by the Association for Computing Machinery Special
Interest Group for Genetic and Evolutionary Computation (ACM SIGEVO).
********
--
Tomohiro Yoshikawa
Associate Professor
Dept. of Information and Communication
Nagoya University
Andrew M. Sutton
Assistant Professor
Department of Computer Science
University of Minnesota Duluth
*********************************
Publicity Chairs GECCO 2018
*********************************
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
The IEEE 15th International Conference on Smart City (SmartCity2017), ieee-smartcity.org
The IEEE 3rd International Conference on Data Science and Systems (DSS2017), ieee-dss.orgm
Bangkok Thailand
December 18-20
Sponsored by the IEEE Computer Society, IEEE, and IEEE TCSC, this group of three co-located premier conferences brings together experts, research scientists and engineers and academics from around the globe to exchange latest research results and listen to some of the world's most renounced scientific leaders in these three general thematic vibrant areas of research and technological developments.
The Program Highlights Include:
- Very strong technical program based on a highly selective process that yielded 79 regular papers out of more than 200 submissions.
- An array of plenary speakers selected from world's authorities on HPCC, DSS and Smart City including:
o Pavan Balaji, Argonne National Lab, USA
o Pete Beckman, Argonne National Lab, USA
o Jose Fortes, University of Florida, USA
o Satoshi Matsuoka, Tokyo Institute of Technology, Japan
o Qian Depei, Beihang University, China
o Michela Taufer, U. of Delaware, USA
o Albert Zomaya, U. of Sydney, Australia
- A Discussion Panel led by Professor H.J. Siegel, U. of Colorado
- A rich cultural and social program to learn more about Thailand and provide and create friendships for more technical collaborations!
- One Registration, three conferences!
Register Today! Check the website if you need to submit a paper to the workshop!
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
2017 Doctoral Dissertation Award for
Operations Research in Network Analytics and Telecommunications
*Sponsored by the INFORMS Technical Section on Telecommunications*
Nominations are requested for the Doctoral Dissertation Award for
Operations Research in Network Analytics and Telecommunications awarded
by the INFORMS Technical Section on Telecommunications. The award aims
to recognize outstanding scholarly achievements of young people in the
field. The Award will be judged based upon three aspects: recommendation
by the nominee's dissertation advisor, presentation of the dissertation
at the 2018 INFORMS Telecommunications Conference in Hamburg, Germany
<https://www.bwl.uni-hamburg.de/en/iwi/forschung/konferenzen/informs2018.html>,
and the written dissertation itself.
Instructions to Nominees:
Each nominee must send by *January 15, 2018*
1.10 page extended abstract of the dissertation,
2.the dissertation itself, and
3.letter of recommendation by the dissertation advisor to :
*Associate Professor Eli Olinick*
Department of Engineering Management, Information, and Systems
Bobby B. Lyle School of Engineering
Southern Methodist University
PO Box 750123, Dallas, TX 75275-0123, USA
Electronic submissions to olinick@lyle.smu.edu
<mailto:olinick@lyle.smu.edu> are preferred. In case of hardcopy
submissions please make sure to send five copies of the extended
abstract and the letter of recommendation.
The letter of recommendation by the dissertation advisor should clearly
indicate the specific contribution(s) the dissertation has made in the
use of quantitative methods and analytical or Operations Research
techniques to address important problems in the fields of Network
Analytics and/or Telecommunications. The letter should discuss why the
dissertation is considered innovative, and why the research is relevant
and valuable for researchers and practitioners. The nominated
dissertation must have been accepted by the academic PhD committee of
the nominee no earlier than January 1, 2014 and no later than December
31, 2017. All items must reach the chair of the award selection
committee by *January 15, 2018*. Those who are selected as finalists
will receive notification in late February. To be eligible for the
award, each finalist must present a synopsis of his/her dissertation to
the Award Selection Committee at a special session at the 2018 INFORMS
Telecommunications Conference. The winner will be announced at the
meeting and receive $1,000 award at a later date.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
https://webapps2.is.qmul.ac.uk/jobs/job.action?jobID=2596
The closing date for applications is Thursday, 9th November 2017.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Important Dates:
Submission deadline: *Dec. 05, 2017*
First round of reviews: Jan. 31, 2018
Revised papers due: Feb. 20, 2018
Final notification: Mar. 20, 2018
Final manuscript due: Apr. 5, 2018
Expected publication: Jun. or Sep. 2018
#########################################################################################
*Special Issue Editors:
Dr. Eunice E. Santos, Ron Hochsprung Endowed Chair and Professor of
Computer Science, Illinois Institute of Technology, USA
Dr. John Korah, Research Assistant Professor, Illinois Institute of
Technology, USA
For inquiries, please contact the special issue editors via email to
parsocial@cs.iit.edu
*Scope of Special Issue:
Computational methods to represent, model and analyze problems using social
information have come a long way in the last decade. Computational methods,
such as social network analysis, have provided exciting insights into how
social information can be utilized to better understand social processes,
and model the evolution of social systems over time. Meanwhile, the
emergence of parallel architectures, in the form of multi-core/many-core
processors, and distributed platforms, have provided new approaches for
large-scale modeling and simulation, and new tools for analysis. This
special issue provides a platform to bring together interdisciplinary
researchers from areas, including computer science, applied mathematics,
social sciences, and computer engineering, to showcase innovative research
in computational social systems that leverage the emerging trends in
parallel and distributed processing, computational modeling, and high
performance computing.
The major topic areas covered by the special issue are:
1. Large-Scale Modeling and Simulation for Social Systems.
E.g. Social network based models, Models of social interactions/influence,
Complex Adaptive System (CAS) models, Models incorporating socio-cultural
factors, Agent based social modeling and simulation, Modeling with
uncertain/incomplete social data, real-time social modeling, social and
behavioral theories
2. Social Computing Algorithms for Parallel and Distributed Platforms
E.g. Analysis of massive social data, Algorithms for dynamic social data,
Analysis methods for incomplete, uncertain social data, Social computing on
new and emerging parallel/distributed architectures
3. Applications
E.g. Emergency management (in areas such as infrastructure resilience,
natural disaster management), National security, Health science, Social
media analytics
*Manuscript Submission:
Authors must ensure that the papers submitted to this special issue is
original and is not under consideration for publication in any other
journal or conference. Submission that are extensions of previously
published work must contain significant technical novelty and significant
new results. Manuscripts may be submitted via the IEEE TCSS submission
portal at https://mc.manuscriptcentral.com/tcss. *IMPORTANT* In the cover
letter, authors must mention the special issue so that the manuscript is
routed to the special issue editors. The manuscripts should follow the IEEE
formatting guidelines as provided at
http://ieeeauthorcenter.ieee.org/create-your-ieee-article/use-authoring-tools-and-ieee-article-templates/ieee-article-templates/templates-for-transactions/
<https://www.avast.com/sig-email?utm_medium=email&utm_source=link&utm_campaign=sig-email&utm_content=webmail&utm_term=icon>
Virus-free.
www.avast.com
<https://www.avast.com/sig-email?utm_medium=email&utm_source=link&utm_campaign=sig-email&utm_content=webmail&utm_term=link>
<#DAB4FAD8-2DD7-40BB-A1B8-4E2AA1F9FDF2>
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Research fellow in random discrete structures
======================================================================================================
The University of Birmingham invites applications for a research fellow to work with Nikolaos Fountoulakis on an EPSRC-funded project on dynamic models for random simplicial complexes. The post is available for a period of 29 months.
Applicants are expected to have a PhD in probabilistic combinatorics or probability theory or relevant research experience. Fluency in relevant models, techniques or methods is desirable.
Informal enquiries about this position are welcome and may be made to Nikolaos Fountoulakis (email: n.fountoulakis@bham.ac.uk)
(http://web.mat.bham.ac.uk/N.Fountoulakis/)
Closing date: 20 October 2017, Reference: 57590
Information about the Combinatorics group in Birmingham is available at http://web.mat.bham.ac.uk/combinatorics/
Information about the School of Mathematics is available on http://www.mat.bham.ac.uk
Further details of the post, together with information on application procedures, can be found via: http://www.birmingham.ac.uk/staff/jobs/index.aspx
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
The appointment is for one year with the possibility of extension.
The position is available from November 1st 2017, and there is some
flexibility on the starting date.
The gross salary is roughly 80.000 CHF per year (low taxes, around 15%).
There are no teaching duties and there is generous travel support.
The ideal candidate should hold (or be close to obtaining) a Ph.D. in
Computer Science or related fields, and should have a solid
publication record in the area of algorithms and complexity (possibly
in approximation algorithms). Top conferences in this area include
STOC, FOCS, SODA, ICALP, and ESA.
Team members will have the opportunity to cooperate with the
Algorithms and Complexity group at IDSIA, which currently counts 7
researchers.
IDSIA offers an international working environment. Lugano is a tidy
and lively town, with a wonderful view on Ceresio lake and mountains
around. Ticino Canton offers many opportunities for hiking, biking,
skiing, etc. Local restaurants serve very good (Italian style!) food.
Further details about the project can be found at:
http://people.idsia.ch/~grandoni/SNF2015.html
The interested candidates should email
- a detailed CV, including a list of publications and 2-3 references, and
- a short summary of past and current research interests
to:
fabrizio@idsia.ch
Applications should be sent as soon as possible.
For any question, do not hesitate to contact:
Prof. Fabrizio Grandoni
fabrizio@idsia.ch
http://people.idsia.ch/~grandoni/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
CASiM, the international and interdisciplinary research center of HHL
Leipzig
Graduate School of Management for business administration in the 21st
century,
invites applications for a competitive two-year doctoral scholarship
funded by
the Friede Springer Foundation.
The successful candidate does innovative research in the fields of
Management
Science, Logistics, Operations Management and/or (Algorithmic) Game Theory.
He/she holds a MSc degree (or equivalent) with a quantitative economic
or managerial
focus, e. g., in Operations Research, Industrial Engineering, Business
Mathematics,
Economics, Management Information Science, or in Mathematics
or Computer Science with a profound knowledge in business administration.
Fluency in English and excellent programming skills as well as experience in
using OR standard solvers (CPLEX or Gurobi) are of advantage.
CASiM offers the unique opportunity to pursue a doctoral project under the
guidance of internationally renowned scholars and to be part of a young and
dynamic team. Each scholarship provides a monthly grant of € 1,750, a yearly
budget for visiting international conferences as well as a waiver of the
tuition
fee for the doctoral program.
Applications include a completed application form, CV, motivation
letter, copies
of certificates, a recommendation letter from a previous academic advisor,
and the names and contact information of at least two additional referees. A
short research proposal is welcome but not required. Please send your
application
as PDF by email to casim@hhl.de addressed to the academic director
of CASiM, Prof. Dr. Erwin Pesch. Applications will be reviewed starting
from November
1, 2017. The scholarship is expected to start in Spring 2018.
HHL Leipzig Graduate School of Management
Jahnallee 59, 04109 Leipzig, Germany, T +49 341 9851-820, casim@hhl.de,
www.hhl.de
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
The European Joint Conferences on Theory and Practice of Software
(ETAPS) is the primary European forum for academic and industrial
researchers working on topics relating to Software Science. ETAPS,
established in 1998, is a confederation of five main annual conferences
(ESOP, FASE, FOSSACS, POST and TACAS) accompanied by satellite workshops
and other events. The 21st edition, ETAPS 2018, will take place in
Thessaloniki, Greece.
============================================================================
POST 2018: 7th International Conference on Principles of Security and Trust
============================================================================
Principles of Security and Trust is a broad forum related to all
foundational aspects of security and trust. We seek submissions on the
foundations of information security, privacy, and trust, relevant for
computer science and different application disciplines. Case studies
that reflect the strengths and limitations of existing foundations,
methods, and their supporting tools are also welcome, as are more
exploratory presentations on open questions.
-------------
New This Year
-------------
- The Important Dates differ from those of other ETAPS conferences.
- We have a rebuttal phase.
- We use a double-blind reviewing process.
- We accept position papers (in addition to systematization of knowledge
papers, tool papers, and regular research papers).
-----------------------------------------------------------------
Important Dates (different from those of other ETAPS conferences)
-----------------------------------------------------------------
Abstracts due: 22 November 2017 (two days after EuroS&P 2018 notification)
Papers due: 24 November 2017
Rebuttal: 12-16 January 2018
Notification: 25 January 2018
Camera-ready versions due: 23 February 2018
ETAPS Conference: 14-21 April 2018, Thessaloniki, Greece
--------------------------
Areas of interest include:
--------------------------
Access control
Accountability
Anonymity
Authentication
Availability
Cloud security
Confidentiality
Covert channels
Crypto foundations
Database security
Distributed systems security
Security and privacy economics
Cyber-physical systems security
Hardware security
Information flow
Integrity
Languages for security
Malicious code
Mobile security and privacy
Models and policies
Privacy and privacy-preserving systems
Provenance
Reputation and trust
Resource usage
Risk assessment
Security architectures
Security protocols
Trust management
Usable security and privacy
Usage control
Web security and privacy
-----------------------
Submission instructions
-----------------------
POST accepts four types of contributions: regular research papers,
systemization of knowledge papers, position papers, and tool papers (see
below for details). All four types of papers will appear in the
proceedings and have presentations during the conference. Titles of
systemization of knowledge papers, position papers, and tool papers
should start with a keyword that indicates the category ("SoK",
"Position Paper", "Tool Demonstration").
Submitted papers must be in English and present previously unpublished
work. They must be unpublished and not submitted for publication
elsewhere (this does not apply to abstracts). In particular,
simultaneous submission of the same contribution to multiple ETAPS
conferences is forbidden. The proceedings will be published in the
Advanced Research in Computing and Software Science (ARCoSS) subline of
Springer's Lecture Notes in Computer Science series. A condition of
acceptance is that one of the authors attends the conference to give the
presentation.
Papers must follow the formatting guidelines specified by Springer at
http://www.springer.de/comp/lncs/authors.html
and be submitted electronically in PDF through Easychair at
http://www.easychair.org/conferences/?conf=post2018
Submissions not adhering to the specified format and length requirements
may be rejected immediately.
POST will use a double-blind review process. Authors are asked to omit
their names, institutions, and other directly identifying information;
refer to their prior work in the third person, just as to prior work by
others; and not to include acknowledgements that might identify them.
-----------------------
Regular Research Papers
-----------------------
POST allows for submissions of at most 20 pages (excluding a
bibliography of max 2 pages). Additional material intended for reviewers
but not for publication in the final version—for example, details of
proofs—may be placed in a clearly marked appendix that is not included
in the page limit. ETAPS reviewers are at liberty to ignore appendices
and papers must be understandable without them.
-----------------------------------------
Systematization of Knowledge (SoK) Papers
-----------------------------------------
SoK evaluate, systematize, and contextualize existing knowledge.
Suitable papers are those that provide an important new viewpoint on
established research areas, challenge long-held beliefs in such an area
with compelling evidence, or present a comprehensive new taxonomy of
such an area. Survey papers without such insights are not appropriate.
Submissions should be distinguished by the prefix "SoK:" in the title.
They will be reviewed by the PC and held to the same standards as
traditional research papers, except instead of emphasizing novel
research contributions the emphasis will be on value to the community.
The regulation for the number of pages is the same as the one for
regular research papers.
-------------------------
Tool Demonstration Papers
-------------------------
Submissions of tool demonstration papers should consist of two parts:
- The first part, at most 6 pages, should describe the tool presented
and provide information that illustrates the maturity and robustness of
the tool (this part will be included in the proceedings). If available,
the URL of the tool should be provided in the appropriate field in
Easychair when submitting your paper. This field can only be seen by PC
chairs, and, hence, does not have to be anonymized. Of course, authors
may also include anonymized URLs directly in their submission. The title
of the submission should start with the words "Tool Demonstration:".
- The second part, at most 6 pages, should explain how the
demonstration will be carried out and what it will show, including
screen dumps and examples. (This part will not be included in the
proceedings, but will be evaluated.)
---------------
Position Papers
---------------
New this year, POST welcomes position papers that present a well
justified stance on a fundamental but possibly controversial question.
For example: "Privacy should trump security in all cases" (or the other
way around), "Cryptocurrencies should be outlawed because... /
encouraged because…", "Why we should/should not research internet-based
voting". A position paper can also propose new directions for
foundational research without having worked out all technical details.
Position papers will be selected based on originality, likelihood of
stimulating insightful discussion at the conference, and technical
merit. Position papers may be no longer than 10 pages (excluding a
bibliography of up to 2 pages) and their titles must start with the
words "Position Paper:".
-------------------
Programme Committee
-------------------
Lujo Bauer (Carnegie Mellon University, USA -- co-chair )
Ralf Kuesters (University of Stuttgart, Germany -- co-chair)
Karthikeyan Bhargavan (INRIA Paris, France)
Nataliia Bielova (INRIA Sophia Antipolis, France)
Stephen Chong (Harvard University, USA)
Veronique Cortier (CNRS, LORIA, France)
Stephanie Delaune (CNRS, IRISA, France)
Cormac Flanagan (University of California at Santa Cruz, USA)
Riccardo Focardi (Università Ca' Foscari di Venezia, Italy)
Michael Hicks (University of Maryland, USA)
Anja Lehmann (IBM Research Zürich, Switzerland)
Jay Ligatti (University of South Florida, USA)
Sergio Maffeis (Imperial College London, UK)
Heiko Mantel (Technische Universität Darmstadt, Germany)
Catherine Meadows (NRL, USA)
Frank Piessens (KU Leuven, Belgium)
Tamara Rezk (INRIA Sophia Antipolis, France)
Andrei Sabelfeld (Chalmers University of Technology, Sweden)
Gregor Snelting (Karlsruhe Institute of Technology, Germany)
Cynthia Sturton (University of North Carolina at Chapel Hill, USA)
Vanessa Teague (University of Melbourne, Australia)
Luca Vigano (King's College London, UK)
See also http://www.etaps.org/index.php/2018/post
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Intensive Research Program on
Discrete, Combinatorial and Computational Geometry
April 16 – June 8, 2018 - Barcelona, Spain
http://dccg.upc.edu/irp2018
CALL FOR PARTICIPATION
=======================================================================
- Registration is now open at http://dccg.upc.edu/irp2018.
- The deadline to apply for accommodation grants is November 15, 2017.
=======================================================================
The program will consist of 8 weeks of activities focused on hot topics
in discrete, combinatorial and computational geometry.
It has been designed to be interesting to researchers at all career
stages, by combining learning opportunities and research collaboration
chances in problems of theoretical nature in combinatorial and discrete
geometry, algorithmic problems from computational geometry, and
implementation issues in specialized software.
*Core of the program (5 weeks)*
April 16-20, 2018
Advanced Course I: Advanced Techniques for Algorithmic Geometry
Lecturers:
Erin Wolf Chambers (Saint Louis University)
Nabil Mustafa (ESIEE Paris)
April 23-27, 2018
Inspiring Lectures I: Computational Geometry Towards Applications
Lecturers:
Sergio Cabello (University of Ljubljana)
Erik Demaine (Massachusetts Institute of Technology)
Tamal Dey (The Ohio State University)
Vida Dujmovic (University of Ottawa)
Dan Halperin (Tel Aviv University)
Marc van Kreveld (Utrecht University)
April 30 - May 4, 2018
Hands-on course on Geometric Software
Lecturers:
Andreas Fabri (CGAL, Geometry Factory)
Nicolai Hähnle (OpenGL, AMD)
Michael Joswig (Polymake, TU Berlin)
Zoltan Kovács (GeoGebra, Johannes Kepler Universität)
May 7-11, 2018
Advanced Course II: New Results in Combinatorial & Discrete Geometry
Lecturers:
Bojan Mohar (Simon Fraser University & University of Ljubljana)
Gelasio Salazar (Univ. Autónoma San Luis Potosí)
May 14-18, 2018
Inspiring Lectures II: Challenges in Combinatorial & Discrete Geometry
Lecturers:
Karim Adiprasito (Hebrew University of Jerusalem)
Imre Bárány (Hungarian Academy of Sciences)
Alexander Barvinok (University of Michigan)
Fabrizio Frati (Università Roma Tre)
Adam Sheffer (California Institute of Technology)
Csaba D. Tóth (California State University Northridge)
Scientific Committee
Oswin Aichholzer (TU Graz, Austria)
Prosenjit Bose (Carleton U, Canada)
Erik Demaine (MIT, USA)
Clemens Huemer (UPC, Spain)
Joe Mitchell (Stony Brook U, USA)
János Pach (EPFL, Switzerland & Renyi Inst. Budapest, Hungary)
Vera Sacristán (UPC, Spain) (coordinator)
Rodrigo I. Silveira (UPC, Spain)
*Accommodation grants*
The organizers will provide a number of 5-week accommodation grants for
students and postdocs. The grants will cover accommodation in a Premium
Studio at the Vila Universitària from April 15 to May 19. Each studio
will be shared by two persons. Grants will be assigned on a competitive
basis. More information, as well as the registration form to opt for
accommodation grants are available at http://dccg.upc.edu/irp2018.
This event is organized by
Centre de Recerca Matemàtica (http://www.crm.cat)
DCCG Research Group at UPC (http://dccg.upc.edu)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
The optimization group at FAU has more than fifteen years of
experience in modeling and solving complex and very large-scale
planning and decision problems from logistics, energy, production,
engineering, and the natural sciences, see
https://www.mso.math.fau.de/de/edom/. Their key expertise is in
developing and applying models and algorithms, which yield proven
optimal solutions to optimization problems. This involves techniques
like linear, nonlinear, and integer programming, robust optimization,
graph algorithms, polyhedral combinatorics, and the like. Furthermore,
design of efficient heuristics and exact algorithms together with
effective implementations is key expertise. The chair EDOM -
Economics, Discrete Optimization, Mathematics (Chair
Wirtschaftsmathematik) consists of 20+ PhD students and Postdocs, and
is headed by Frauke Liers, Alexander Martin, Lars Schewe, and Martin
Schmidt. The group participates in many projects funded by the German
Science Foundation (DFG), the German Federal Ministry of Education and
Research (BMBF), the Federal Ministry for Economic Affairs and Energy
(BMWi), as well as by the industry.
The positions are for a period of at least three years and may start
as soon as January 2018.
It is expected that during their studies, candidates have gained
expertise in one or more of the following areas:
- mixed-integer linear and nonlinear optimization
- optimization under uncertainty, especially robust optimization
- discrete mathematics
You should be interested in developing and implementing optimization
algorithms. You should also like to validate them in real-world
applications.
The positions are available within research projects in different
fields of application, such as energy, logistics, and analytics.
Informal inquiries and applications (including cover letter, CV,
certificates, Transcript of Records) can be sent to
gabriele.elisabeth.bittner@fau.de
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
*The registration deadline is 15th October at the nominal rate of 70
dollars.*
What do we cover—a mix of classical basic results and new trends. In
particular
(1) Basic Materials: The essential parameterized complexity tools such as
branching, kernelization, uses of randomization, sophisticated branching,
iterative compression, hardness tools such as W[1]-hardness, ETH, SETH and
Kernel lower bounds.
(2) Advances in integer programming
(3) FPT Approximation: Upper Bound and Lower Bounds including the hardness
of biclique and dominating set
(4) Lossy Kernelizartion
(5) Structural sparsity and parameterized algorithms (such as parameterized
algorithms on graphs of bounded expansion and nowhere dense graphs)
(6) Computational social choice theory
(7) FPT in P
(8) Techniques in shaving polynomial factors in the running time of FPT
algorithms
Who will teach:
Piotr Faliszewski, AGH University of Science and Technology, Poland
Daniel Marx, Hungarian Academy of Sciences, Hungary
Shmuel Onn, Technion, Israel
Michał Pilipczuk, University of Warsaw, Poland
M. S. Ramanujan, University of Warwick, England
Uri Zwick, Tel Aviv University, Israel
Daniel Lokshtanov, University of Bergen
Saket Saurabh, Institute of Mathematical Sciences
Fedor Fomin, University of Bergen
Hadas Shachnai, Technion, Israel
Meirav Zehavi, Ben Gurion University, Israel
Apart from these we will have open problem session and a survey talk on
what next.
For more information see: https://rapctelaviv.weebly.com/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
we invite you to participate in the 36th conference "Colloquium on Combinatorics" (Kolkom 2017), which takes place at Paderborn University, on November 24-25, 2017.
The Colloquium on Combinatorics is a forum that brings together young researchers and well established scientists. The colloquium will cover all parts of Combinatorics and Discrete Mathematics in a broad sense, including combinatorial aspects in Algebra, Geometry, Optimization and Computer Science.
Keynote speakers are
Christine Bachoc (University of Bordeaux), Gunnar Brinkmann (Ghent University) , Dieter Jungnickel (University of Augsburg), Carsten Thomassen (Technical University of Denmark), Cun-Quan Zhang (West Virginia University)
For registration and more details please visit the conference web page www.kolkom.de<http://www.kolkom.de>.
We hope seeing you in Paderborn in November!
Eckhard Steffen and Kai-Uwe Schmidt
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
The Department of Mathematical Sciences at the University of Bath is
inviting applications for a full professorship in Probability.
Applicants must have a strong research vision, and a track record of
engagement within their Department and across the wider mathematical
community. Applicants are expected to have an excellent track record of
publications and research grant acquisition, commensurate to their stage of
career, as well as a keen interest in pursuing excellence in teaching and
in supervising graduate students. Key attributes are strategic leadership
and the ability to influence and shape the output and success of the
Department. We particularly welcome applications from established
Professors, as well as from Readers, Senior Lecturers and Associate
Professors or equivalent who can demonstrate a significant upward
trajectory.
Applications from all groups currently under-represented in academic posts
are particularly encouraged. Both the Department and the University are
committed to providing a supportive and inclusive working environment.
Flexible working options will be considered wherever possible. For more
information visit http://www.bath.ac.uk/hr/working/flexible-working/.
For further information on how to apply, please visit
https://www.bath.ac.uk/jobs/Vacancy.aspx?ref=SF5266
Contact Professor Andreas Kyprianou (a.kyprianou@bath.ac.uk) should you
have further questions.
Best,
Alexandre
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Authors of selected publications will be invited to submit an extended
version of their work to Springer's Genetic Programming and Evolvable
Machines (GPEM, impact factor: 1.514, fast track review process).
EvoApplications, the European Conference on the Applications of
Evolutionary Computation brings together researchers in a variety of areas
of application of Evolutionary Computation and other Nature-inspired
techniques.
EvoApplications' 21st edition will be held as part of the EvoStar 2018
event in Parma, Italy, 4-6 April 2018, and co-located within EvoStar with
three related conferences: EuroGP, EvoCOP and EvoMUSART.
*Publications*
- This year EvoApplications is accepting two kinds of submission: full
papers and short papers. Full papers require novel and complete research
work and have a limit of 16 pages. Short papers should present complete
research or interesting preliminary results and have a limit of 8 pages.
Both types of submission will undergo the same double-blind review process
and all accepted papers will be included in the LNCS proceedings. Based on
reviewers' assessment, accepted full papers will be presented as
full-length talks, and authors of accepted short papers will present a
short talk as well as present a poster. All authors of accepted papers
will be given the opportunity to further disseminate their work in poster
sessions.
- All accepted papers will be published by Springer Verlag in the Lecture
Notes in Computer Science series.
- The review process is double-blind. Please ensure to anonymize your
submission accordingly.
- Selected papers will be invited to submit extended versions to Genetic
Programming and Evolvable Machines.
*The Venue*
Parma is an elegant city with the refined atmosphere of a "petite
capitale". It is rich in cultural treasures and with its attractive
architecture, shops and restaurants, it is very welcoming. Parma is a
centre of gastronomic heritage, famous for Parma ham and Parmigiano
Reggiano cheese. The conference will be held at the University Campus.
*Tracks*
EvoApplications 2018 is composed of 14 tracks, each focusing on an area of
application of genetic and evolutionary computation and other related
Computational Intelligence fields. The following tracks will be running in
2018. Papers on applications of Evolutionary Computation and related
methods to other fields are also welcome and will be presented within a
"General" track.
- EvoBAFIN - Computational Intelligence Methods in Business Analytics
and Finance.
- EvoBIO - Evolutionary Computation, Machine Learning and Data Mining
for Biology and Medicine.
- EvoCOMNET - Nature-inspired Techniques for Communication Networks and
other Parallel and Distributed Systems.
- EvoCOMPLEX - Evolutionary Algorithms and Complex Systems.
- EvoENERGY - Evolutionary Algorithms in Energy Applications.
- EvoGAMES - Bio-inspired Algorithms in Games.
- EvoIASP - Evolutionary Computation in Image Analysis, Signal
Processing
and Pattern Recognition.
- EvoINDUSTRY - Evolutionary and Bio- Inspired Computational Techniques
within Real-World Industrial and Commercial Environments.
- EvoKNOW - Knowledge Incorporation in Evolutionary Computation.
- EvoNUM - Bio-inspired algorithms for Continuous Parameter
optimization.
- EvoPAR - Parallel Architectures and Distributed Infrastructures.
- EvoROBOT - Evolutionary Robotics.
- EvoSET - Nature-inspired algorithms in Software Engineering and
Testing.
- EvoSTOC - Evolutionary Algorithms and Meta-heuristics in Stochastic
and
Dynamic Environments.
Visit http://www.evostar.org/ or join the EVOstar group on LinkedIn for more
details and updates.
EvoApplications Coordinator
Kevin Sim, Edinburgh Napier University, United Kingdom
EvoApplications Publication Chair
Paul Kaufmann, Johannes Gutenberg University Mainz, Germany
Evo* Coordinator
Jennifer Willies, United Kingdom
Evo* Local Chairs
Stefano Cagnoni, Università degli Studi di Parma, Italy
Monica Mordonini, Università degli Studi di Parma, Italy
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
we are looking for a PhD student with a background in natural language processing and, possibly, network analysis.
See https://apply.refline.ch/845721/5686/pub/1/index.html for details.
Best,
B.
--
Prof. Dr. Ulrik Brandes
Department of Computer & | +49 7531 88-4433 (phone)
Information Science, Box 67 | +49 7531 88-3577 (fax)
University of Konstanz | ulrik.brandes@uni-konstanz.de
78457 Konstanz, Germany | http://www.inf.uni-konstanz.de/~brandes/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
############################################################
####################
Special Issue in the IEEE Computational Intelligence Magazine (IEEE CIM) --
Impact Factor 6.343
on *Computational Intelligence Techniques in Bioinformatics and
Bioengineering*
https://tinyurl.com/IEEE-CIM-SI-CITBB2018
############################################################
####################
*Aims and scope*
The focus of the special issue is on emerging topics at the interface of
computational intelligence, Bioinformatics and Bioengineering.
This is a rich area that includes important and diverse problems, such as
protein structure prediction, systems and synthetic biology, visualization
of large-scale biological data sets, epigenomics, as well as touches on a
vast range of topics in biomedical engineering, bioprocessing and
healthcare informatics, such as biomedical imaging/data modelling and
mining, biomarker discovery, development of personalized medicine and
treatment, mining of big healthcare dataset, biopharmaceutical manufacture
and computer-assisted closed-loop problems.
The computational intelligence community in bioinformatics and
bioengineering is fragmented and large. The aim of the special issue we are
proposing will be to capture some of the ongoing interdisciplinary research
that draws upon joint expertise in the domains of optimization and learning
via computational intelligence techniques and bioinformatics and
bioengineering. The focus will be to provide both breadth in the diversity
of selected problems and depth in state-of-the-art techniques for selected
problems.
*Topics of Interest include (but are not limited to)*
· Evolution, phylogeny, comparative genomics
· Gene expression array analysis
· Metabolic pathway analysis
· MicroRNA analysis
· Molecular sequence alignment and analysis
· Pattern recognition/data mining/optimization methods in
Bioinformatics
· Visualization of large biological data sets
· Systems and synthetic biology
· Structure prediction and folding
· Modelling, simulation, and optimization of biological systems
· Biological network reconstruction/robustness/evolvability
· Epigenomics
· Medical imaging and pattern recognition
· Biomedical data modelling/data mining/model parametrization
· Parallel/high performance computing
· Big data analysis and tools for biological and medical data
· Biomarker discovery and development
· Health data acquisition/analysis/mining
· Healthcare information systems/knowledge representation/reasoning
· Personalized medicine and treatment optimization
· Biopharmaceutical manufacturing
· Closed-loop optimization methods/platforms
*Submission Process*
The IEEE CIM requires all prospective authors to submit their manuscripts
in electronic format, as a PDF file. The maximum length for Papers is
typically 20 double-spaced typed pages with 12 point font, including
figures and references. Submitted manuscript must be typewritten in English
in single column format. Authors of Papers should specify on the first page
of their submitted manuscript up to 5 keywords. Additional information
about submission guidelines and information for authors is provided at the IEEE
CIM website
<http://cis.ieee.org/ieee-computational-intelligence-magazine/134-ieee-computational-intelligence-magazine-paper-submission-guidelines-and-information-for-authors.html>
.
Submission will be made via https://easychair.org/conf
erences/?conf=ieeecimcitbb2018.
*Important dates*
15th November, 2017: Submission of manuscript
15th January, 2018: Notification of review results
15th February, 2018: Submission of revised manuscript
15th March, 2018: Submission of final manuscript
*August 2018: Publication*
*Guest Editors*
Richard Allmendinger
University of Manchester, UK
e-mail: richard.allmendinger@manchester.ac.uk
Daniel Ashlock
University of Guelph, Canada
Email: dashlock@uoguelph.ca
Sansanee Auephanwiriyakul
Chiang Mai University, Thailand
email: sansanee@eng.cmu.ac.th
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************