DMANET: DISCRETE MATHEMATICS AND ALGORITHMS: dmanet Digest, Vol 92, Issue 3

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. KaDraw -- Karlsruhe Graph Drawing (Christian Schulz)
2. Internet Mathematics special issue on "Algorithms for
evolving networks" (Gionis Aristides)
3. Simons-Berkeley Research Fellowships 2016-17 (Alistair Sinclair)
4. 2nd CfP: EvoCOP 2016 (submission deadline: November 1, 2015)
(José Francisco Chicano García)
5. PhD Position in Computability Theory (Timo Kötzing)
6. CFP: ACM Transactions on Multimedia Computing, Communications
and Applications (ACM TOMM)Call for Papers Special Issue On Trust
Management for Multimedia Big Data (D Daisy)

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

Message: 1
Date: Tue, 29 Sep 2015 17:21:41 +0200
From: Christian Schulz <christian.schulz@kit.edu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] KaDraw -- Karlsruhe Graph Drawing
Message-ID: <560AAC85.3000009@kit.edu>
Content-Type: text/plain; charset=utf-8; format=flowed

Release of KaDraw v1.0
-----------------------------------

We are pleased to announce the release of our graph drawing framework
KaDraw (Karlsruhe Graph Drawing). So far, it contains MulMent which is a
multilevel algorithm to optimize maxent-stress on large networks. Its
main drawing routine is a local optimizer suggested by Gansner et al.,
which we accelerated in practice. The speed of the local optimizer stems
from (i) shared-memory parallelism and (ii) approximation of long-range
forces by using coarser representatives stored in the multilevel hierarchy.

The software is released under the GPL 2.0 License.

* open source implementation / website
http://algo2.iti.kit.edu/kadraw/

We are glad for any comments and error reports (or even bug fixes) that
you send us.

Henning Meyerhenke, Martin Nöllenburg and Christian Schulz,
Karlsruhe Institute of Technology (KIT) and TU Wien (TUW)

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

Message: 2
Date: Tue, 29 Sep 2015 16:05:36 +0000
From: Gionis Aristides <aristides.gionis@aalto.fi>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Internet Mathematics special issue on "Algorithms
for evolving networks"
Message-ID: <EE23BEBE-901A-47D9-A162-C86FBEA3A456@aalto.fi>
Content-Type: text/plain; charset="utf-8"

Internet Mathematics special issue on "Algorithms for evolving networks"

https://evolvingnetworks2015.wordpress.com/2015/05/10/cfp/

The widespread adoption of digitization has opened the way to gathering large amounts of data that record detailed information for many systems of interest. Examples include telecommunication networks, online social-media platforms, and biological systems. Many of these systems are typically represented as networks, and graph-theoretic techniques are used to analyze the available data. Furthermore, as our data-gathering capacity has increased, it is now possible to collect data the record not only a static aggregate view of the underlying network, but a continuous stream of events that captures the full dynamic behavior of the network. Such events may take the form of structural changes, or they may encode different types of actions and interactions performed by the network entities. This view of time-evolving networks poses new challenges and opens new research directions. The objective is to develop the theoretical foundations and to design the algorithmic principles that will allow to efficiently manage and analyze such evolving networks. This special issue of Internet Mathematics invites original research papers on algorithmic and mathematical methods for modeling, processing, and analyzing evolving networks. The topics of interest include but are not limited to

Models and novel computational paradigms for evolving networks
Graph stream algorithms
Monitoring and mining evolving networks
Spectral analysis of evolving networks
Detecting events, trends, and change points
Inferring structure from network activity
Applications in social media, web graphs, citation networks, biological networks, and other domains

Papers that have previously appeared in peer-reviewed conferences may be submitted, provided that significant extensions and additional non-trivial contributions are presented. In the latter case, submissions should be accompanied by a cover letter summarizing the additional contributions with respect to the earlier conference version.

The papers should be prepared and submitted according to the general guidelines for authors of Internet Mathematics. Please indicate in your submission that the paper is submitted for the special issue.

Submission deadline: Oct 15, 2015

Submission at the website of Internet Mathematics: http://www.tandfonline.com/toc/uinm20/current

Guest editors

Aristides Gionis, Aalto University
Suresh Venkatasubramanian, University of Utah

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

Message: 3
Date: Tue, 29 Sep 2015 09:18:27 -0700
From: Alistair Sinclair <sinclair@berkeley.edu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Simons-Berkeley Research Fellowships 2016-17
Message-ID: <E0E706E0-2224-4361-8496-31C56405E032@berkeley.edu>
Content-Type: text/plain; charset=us-ascii

The Simons Institute for the Theory of Computing at UC Berkeley invites applications for Research Fellowships for academic year 2016-17.

Simons-Berkeley Research Fellowships are an opportunity for outstanding junior scientists (at most 6 years from PhD by Fall 2016) to spend one or both semesters at the Institute in connection with one or more of its programs. The programs for 2016-17 are as follows:

* Algorithms and Uncertainty (Fall 2016)
* Logical Structures in Computation (Fall 2016)
* Foundations of Machine Learning (Spring 2017)
* Pseudorandomness (Spring 2017)

Applicants who already hold junior faculty or postdoctoral positions are welcome to apply. In particular, applicants who hold, or expect to hold, postdoctoral appointments at other institutions are encouraged to apply to spend one semester as a Simons-Berkeley Fellow subject to the approval of the postdoctoral institution.

Further details and application instructions can be found at http://simons.berkeley.edu/fellows2016. Information about the Institute and the above programs can be found at http://simons.berkeley.edu.

Deadline for applications: 15 December, 2015.

Alistair Sinclair
Associate Director, Simons Institute for the Theory of Computing

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

Message: 4
Date: Thu, 1 Oct 2015 16:27:23 +0200
From: José Francisco Chicano García <chicano@lcc.uma.es>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] 2nd CfP: EvoCOP 2016 (submission deadline: November
1, 2015)
Message-ID: <49A12166-A598-4E21-B84A-C4551C42C864@lcc.uma.es>
Content-Type: text/plain; charset=us-ascii

** Apologies for multiple copies **

*********************************************************************************************
EvoCOP 2016 - The 16th European Conference on
Evolutionary Computation in Combinatorial Optimisation
http://www.evostar.org/2016/cfp_evocop.php

March 30 - April 01, 2016
Porto, Portugal

Part of Evo* 2016 (http://www.evostar.org)
*********************************************************************************************

The 16th European Conference on Evolutionary Computation in Combinatorial Optimisation is a multidisciplinary conference that brings together researchers working on metaheuristics for solving difficult combinatorial optimisation problems appearing in various industrial, economic, and scientific domains. Prominent examples of metaheuristics include: evolutionary algorithms, simulated annealing, tabu search, scatter search and path relinking, memetic algorithms, ant colony and bee colony optimisation, particle swarm optimisation, variable neighbourhood search, iterated local search, greedy randomized adaptive search procedures, estimation of distribution algorithms, and hyperheuristics. Successfully solved problems include scheduling, timetabling, network design, transportation and distribution problems, vehicle routing, travelling salesman, graph problems, satisfiability, energy optimisation problems, packing problems, and planning problems.

The EvoCOP 2016 conference will be held in the city of Porto, Portugal. It will be held in conjunction with EuroGP (the 19th European Conference on Genetic Programming), EvoMUSART (5th European conference on evolutionary and biologically inspired music, sound, art and design) and EvoApplications (specialist events on a range of evolutionary computation topics and applications), in a joint event collectively known as Evo*.

**** Areas of Interest and Contributions ****

Topics of interest include, but are not limited to:

Applications of metaheuristics to combinatorial optimisation problems
Novel application domains for metaheuristic optimisation methods
Representation techniques
Neighbourhoods and efficient algorithms for searching them
Variation operators for stochastic search methods
Constraint-handling techniques
Hybrid methods and hybridization techniques
Parallelization
Theoretical developments
Search space and landscape analyses
Comparisons between different (also exact) techniques
Metaheuristics and machine learning
Ant colony optimisation
Artificial immune systems
Genetic programming and Genetic algorithms
(Meta-)heuristics
Scatter search
Particle swarm optimisation
Tabu search, iterated local search and variable neighbourhood search
Memetic algorithms
Hyper-heuristics and autonomous search
Estimation of distribution algorithms
String processing
Scheduling and timetabling
Network design
Vehicle routing
Graph problems
Satisfiability
Packing and cutting problems
Energy optimisation problems
Practical solving of NP-hard problems
Mixed integer programming
Multi-objective optimisation
Grid computing
Combinatorial optimisation
Nature and Bio-inspired methods
Quantum computing and quantum annealing
Optimisation in Cloud computing
Search-based software engineering

**** Publication Details ****

All accepted papers will be presented orally at the conference and printed in the proceedings published by Springer in the LNCS series (see LNCS volumes 2037, 2279, 2611, 3004, 3448, 3906, 4446, 4972, 5482, 6022, 6622, 7245, 7832, 8600 and 9026 for the previous proceedings).

**** Submission Details ****

Submissions must be original and not published elsewhere. The submissions will be peer reviewed by members of the program committee. The authors of accepted papers will have to improve their paper on the basis of the reviewers comments and will be asked to send a camera ready version of their manuscripts. At least one author of each accepted work has to register for the conference, attend the conference and present the work.

The reviewing process will be double-blind, please omit information about the authors in the submitted paper. Submit your manuscript in Springer LNCS format.

* Page limit: 16 pages
* Submission link: http://myreview.csregistry.org/evocop16/

**** Special Issue ****

We are working to have an Special Issue where we will invite selected papers published in the conference. Please check the EvoCOP 2016 web page to have the latests news on this.

**** Important Dates ****

Submission deadline: November 1, 2015
EVO* event: March 30 - April 01, 2016

**** EvoCOP Programme Chairs ****

Francisco Chicano
University of Malaga, Spain
chicano(at)lcc.uma.es

Bin Hu
Austrian Institute of Technology, Austria
bin.hu(at)ait.ac.at

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

Message: 5
Date: Thu, 1 Oct 2015 17:26:28 +0200
From: Timo Kötzing <timo.koetzing@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] PhD Position in Computability Theory
Message-ID:
<CAExfAyACFpDXzkvCYBDrbGCo9HJ7xT5O+n+4EzKt+yLaspi_Hg@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

Applications are invited for a

Ph.D. Position in Computatability Theory

at the newly founded research group Algorithm Engineering headed by Tobias
Friedrich at the Hasso Plattner Institute (HPI) of University of Potsdam,
Germany [1]. The HPI is a unique research and teaching institute in
Germany, which was founded in 1999 as an institute of the University of
Potsdam. HPI carries out internationally acclaimed research and offers
innovative academic majors in the field of IT Systems Engineering. The
institute offers a vibrant scientific environment at the beautiful Campus
Griebnitzsee, which is located at the border to Berlin.

The position is full-time and can be started as soon as possible for the
applicant. The successful applicant is awarded a competitive stipend and
generous travel support.

Applicants should have a strong theoretical/mathematical background and an
interest in the topic of computability theory. The successful applicant
will join a project headed by Dr. Timo Kötzing in the area of Computational
Learning Theory, which relies heavily on the methods of computability
theory.

All applicants should have an excellent Master degree (or equivalent) in
mathematics, computer science or a related discipline. Applications should
include a detailed CV, a copy of master thesis and a list of courses and
grades. Please also mention names and contact details of one or two
references -- preferably one from the thesis advisor.

Interested candidates should direct their questions to Timo Kötzing [2].
Applications must be sent via email, preferably as a single PDF, to
jobs-friedrich(at)hpi.de by November 1, 2015.

[1] http://hpi.de/friedrich/home.html
[2] http://hpi.de/friedrich/people/timo-koetzing.html

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

Message: 6
Date: Fri, 2 Oct 2015 07:16:10 +0800
From: D Daisy <wxding89@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CFP: ACM Transactions on Multimedia Computing,
Communications and Applications (ACM TOMM)Call for Papers Special
Issue On Trust Management for Multimedia Big Data
Message-ID:
<CAJhhpvMuEKSw4-ffFnNsQKv-ceB86-M3P=uYeza07MR4vdO0Rw@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

[Please accept our apologies if you receive multiple copies of this email]

*ACM Transactions on Multimedia Computing, Communications and Applications
(ACM TOMM) Call for Papers*

*Special Issue On*

*Trust Management for Multimedia Big Data*

With the rapid growth of Cyber Physical and Social Computing (CPSC) and
cloud computing, huge volumes of multimedia data collected by various
devices through different communication channels are being processed,
analyzed and mined in order to support many promising services. However,
analysis and mining of multimedia data introduce a number of issues related
to its trust management, especially for multimedia big data. Privacy,
security and trust in multimedia data perception, transmission,
communications, fusion, mining, storage and usage attract special
attentions. In particular, big volumes of multimedia data introduce special
requirements on efficiency, availability and dependability of its trust
management. Trust management for multimedia big data becomes a key issue
that impacts the success of multimedia computing, communications and
applications.

Existing solutions of trust management for multimedia big data are
imperfect or incomprehensive. Multimedia big data brings additional
challenges to trust management research with regard to the security and
privacy of multimedia, the efficiency and accuracy of multimedia process
and the dependability and quality of processing results.

This special issue aims to bring together researchers and practitioners to
discuss various aspects of trust management for multimedia big data,
explore key theories, investigate technology enablers, develop significant
applications and innovate new solutions for overcoming major challenges in
this research area.

Topics of interest include, but are not limited to:

• Multimedia perturbation technologies

• Secure multimedia transmission

• Multimedia big data anonymization and fusion

• Multimedia provenance trust

• Secure multi-party computation for big multimedia

• Privacy-preserving multimedia fusion and analytics

• Multimedia source reliability estimation and assurance

• Trust management for big multimedia

• Verifiable multimedia computing

• Multimedia trust and reputation

• Privacy protection in CPSC multimedia

• Multimedia applications with trust management

• MapReduce for big multimedia

• Secure multimedia search and collection

• Multimedia security and privacy in cloud computing and social networking

• Digital rights management of multimedia

*Instructions for Manuscripts*

Papers will be evaluated based on their originality, presentation,
relevance and contributions, as well as their suitability to the special
issue. The submitted papers must be written in excellent English and
describe original research that has not been published nor currently under
review by other venues. Previously published conference papers should be
clearly identified by the authors at the submission stage and an
explanation should be provided about how such papers have been extended to
be considered for this special issue. Extended conference contributions
must have at least 50% difference from the original works (the authors must
indicate the conference name and make a reference to the base conference
paper). Guest editors will make an initial determination on the suitability
and scope of all submissions. Papers that either lack originality, clarity
in presentation or fall outside the scope of the special issue will not be
sent for review and the authors will be promptly informed in such cases.

The submitted papers will be reviewed by at least three independent
reviewers. Final decisions on accepted papers will be based on their
qualities and their relevance to the theme of this special issue and should
be approved by the journal editors. Manuscripts must be prepared for
publication according to the journal's Author Guidelines available at:
http://tomm.acm.org/. Submissions must conform to the layout, format and
page limit in the guidelines. The authors must select "SI: TM-BigData" when
they reach the "Article Type" step in the submission process.

*Important Dates*

Paper submission due: October 1st, 2015 Extended to
October 15th, 2015

Notification of decision: December 15th, 2015

Revision due: February 15th, 2016

Acceptance notification: April 15th, 2016

Camera ready: May 1st, 2016

Approximate publication date: August 2016

*Guest Editors*

Zheng Yan (corresponding editor)

Xidian University, China & Aalto University, Finland

Email: zhengyan.pz@gmail.com

Jun Liu