dmanet Digest, Vol 79, Issue 2

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. Fully funded Ph.D./Postdoc Position in Cryptography at
University of Trier, Germany (Ralf Kuesters)
2. Book Announcement: Positional Games (Milos Stojakovic)
3. Call for Papers: Quantitative Models and Weighted Automata
(Szabolcs IVAN)
4. Elsevier ComCom Special Issue on Online Social Networks
(Valerio Arnaboldi)
5. CfP: Reachability Problems, Oxford, 22 - 24 September 2014
(Potapov, Igor)
6. 20 fully funded PhD student positions in Helsinki (Pekka Orponen)
7. CfP: JSAT Special Issue on SAT 2014 Competitions and
Evaluations (Matti Jarvisalo)


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

Message: 1
Date: Tue, 2 Sep 2014 13:51:22 +0200
From: Ralf Kuesters <kuesters@uni-trier.de>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Fully funded Ph.D./Postdoc Position in Cryptography
at University of Trier, Germany
Message-ID: <5405AF3A.8030604@uni-trier.de>
Content-Type: text/plain; charset="utf-8"

The Chair for Information Security and Cryptography at University of
Trier, Germany, headed by Prof. Ralf Kuesters, offers a full-time
PhD/Postdoc position.

The position involves both research and teaching in the area of
cryptography/information security. The successful candidate is
expected to contribute to research in cryptographic protocols and/or
electronic voting.

The position is available immediately and is fully funded, with an
internationally competitive salary.

Contracts are initially offered for two years. An extension to a total
duration of up to six years is possible.

He or she is given the possibility to carry out a Ph.D. or, for
Postdocs, a Habilitation.

The successful candidate should have a Master's degree or a Ph.D. (or
should be very close to completion thereof) in Computer Science,
Mathematics, Information Security, or a related field, with strong
analytical and mathematical skills. Knowledge in cryptography is an
asset. Since teaching is mostly done in German, sufficient knowledge
of German is required.

The deadline for applications is October 5th, 2014. However, late
applications will be considered until the position is filled.

See http://infsec.uni-trier.de/job-openings.html for the official job
announcement (in German).


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

Message: 2
Date: Tue, 2 Sep 2014 19:21:49 +0200
From: Milos Stojakovic <milosst@gmail.com>
To: DMANET@zpr.uni-koeln.de
Subject: [DMANET] Book Announcement: Positional Games
Message-ID:
<CAJzoGRSPdT9EZfE-ZoMdxUfsOrm+iJ_+ipqA5=ZEbM+4SnQmPw@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

*** Book Announcement ***

Title: Positional Games
Authors: Hefetz, D., Krivelevich, M., Stojakovic, M., Szabo, T.
Series: Oberwolfach Seminars, Vol. 44
Publisher: Birkh?user Basel (Springer Basel)
Year: 2014
Pages: 146

More details:
http://www.springer.com/book/978-3-0348-0824-8
(current price: 24,99 EUR)

>From the preface:
Positional Games Theory is a branch of Combinatorics, the goal of
which is to provide a solid mathematical footing for a variety of
two-player games of perfect information, usually played on discrete
objects, ranging from such popular recreational games as Tic-Tac-Toe
and Hex to purely abstract games played on graphs and hypergraphs. The
field has experienced tremendous growth in recent years.
The aim of this text is two-fold: to serve as a leisurely introduction
to this fascinating subject and to treat recent exciting developments
in the field. We strove to make our presentation relatively
accessible, even for a reader with only basic prior knowledge of
combinatorics. Each chapter is accompanied by a fair number of
exercises, varying in difficulty. As the theory of Positional Games is
obviously too extensive and diverse to be comprehensively covered in
such a relatively short text, we settled on an admittedly subjective
but hopefully representative selection of topics and results. We trust
that this monograph will be suitable to provide the basis for a
graduate or advanced undergraduate course in Positional Games.

TOC (list of chapters):
1 Introduction
2 Maker-Breaker Games
3 Biased Games
4 Avoider-Enforcer Games
5 The Connectivity Game
6 The Hamiltonicity Game
7 Fast and Strong
8 Random Boards
9 The Neighborhood Conjecture



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

Message: 3
Date: Tue, 02 Sep 2014 21:08:24 +0200
From: Szabolcs IVAN <szabivan@inf.u-szeged.hu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Call for Papers: Quantitative Models and Weighted
Automata
Message-ID: <540615A8.3070400@inf.u-szeged.hu>
Content-Type: text/plain; charset=ISO-8859-1; format=flowed

Call for Papers on

"Quantitative Models and Weighted Automata"

in a special issue of Soft Computing (Springer).

Quantitative models and quantitative analysis in Computer Science
is receiving increased attention in order to meet challenges from
various application areas. What is aimed at is a revision of the
foundation of Computer Science where Boolean models and analyses
are replaced by quantitative models and analyses in order that
more detailed and practically useful answers can be provided.

There will be a special issue of Soft Computing (Springer) devoted
to the topic of quantitative models in automata theory,
weighted automata, and tightly related areas ranging from the theory
of quantitative automata and logics to applications in areas such as
real-time systems, natural language processing, biological systems.

We invite submissions to this issue which could be either original
research papers or surveys.

This was also the topic of the Dagstuhl seminar on

Quantitative Models: Expressiveness, Analysis, and New Applications
http://www.dagstuhl.de/en/program/calendar/semhp/?semnr=14041

and of the international workshop on

Weighted Automata: Theory and Applications (WATA 2014)
http://www.informatik.uni-leipzig.de/~weidner/wata2014/

Participation in these events is not a prerequisite for a submission.

Authors are asked to submit their paper electronically at
http://www.editorialmanager.com/soco/

and to choose as article type:
S.I.: Quantitative Models and Weighted Automata.

The deadline for submission is Nov 1, 2014.

All submissions will be refereed according to the usual high journal
standards. We intend to ensure a quick refereeing process.

Manfred Droste, Zoltan Esik, and Kim Larsen
(editors of the special issue)



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

Message: 4
Date: Wed, 03 Sep 2014 16:34:01 +0200
From: Valerio Arnaboldi<comcom_osn_special@iit.cnr.it>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Elsevier ComCom Special Issue on Online Social
Networks
Message-ID: <540726d9.6CPlkO8eZxQsFBN3%comcom_osn_special@iit.cnr.it>
Content-Type: text/plain; charset=us-ascii

CALL FOR PAPERS

Elsevier - Computer Communications Journal
Special Issue on
Online Social Networks
http://www.journals.elsevier.com/computer-communications/call-for-papers/special-issue-on-online-social-networks1/

Submission Deadline: 19 October 2014

Online Social Networks are a massively successful phenomenon, used by
billions of users to interact. Nowadays they are key platforms for,
among others, content dissemination, social and professional networking,
recommendation, scouting, alerting, and political campaigns. The
research interest in OSNs is multi-faceted, and exploits an unmatched
source of large-scale data about the human behavior. It spans a number
of disciplines, across numerous fields in and beyond computer science,
all the way up to the analysis of human social relationships and how
they evolve and mature over time. Moreover, the pervasive presence of
users' mobile devices (e.g., smartphones) has opened new avenues in the
design of mobile social networking services, and in the study of the
interplay between mobility and social interactions. Research in OSN is a
fertile ground also for industry, to develop innovative ideas fostering
the design of the new generation of communication platforms and their
services.

This special issue seeks contributions pushing the state of the art in
all facets of Online Social Networks highlighted above. We also
encourage original work based on an interdisciplinary research (at the
boundary between computer science and humanistic disciplines such as
sociology and anthropology) where quantitative evidence is available
demonstrating the mutual advantage of such an approach. Therefore,
purely methodological papers or papers that do not present quantitative
results with real Online or Mobile Social Networking technologies are
considered out of scope. Moreover, special attention is expected in
interpreting the proposed research results in order to shed light
towards what users may need and wish in terms of novel, practical
services and application.

Topics of interest include (but are not limited to) the following:
- Design of OSN platforms based on human behavioural models
- Analysis of OSN users' behaviour and its evolution over time
- Comparison of human social behaviour in Online and "offline" Social
Networks, and across OSNs
- Impact of Online Social Networks on human social behaviour
- Analysis of the use of social-networking sites in the urban context
- OSNs for supporting novel, social-oriented applications and services
- Mobile and Location-aware Online Social Networks
- OSN services enabled by the analysis of mobility and social behaviour
- Crowdsourcing for Online and Mobile Social Networks
- Dynamics of trends, information and opinion diffusion in OSN
- Smart recommendations and advertising in Online Social Networks
- Information extraction and search in Online Social Networks
- Privacy in management and analysis of Online and Mobile Social
Networks data
- Privacy, Security, Trust and Reputation in Online Social Networks
- Prevention of misbehaviours (spamming, phishing, ...) in Online Social
Networks
- Modelling of Online Social Networks characteristics and mechanisms
- Graph analysis applied to Online Social Networks
- Complex networks techniques applied to the investigation of OSN
- Data Mining and Machine Learning to gain novel insights on Online
Social Networks
- Novel distributed solutions for designing, supporting and operating
Online Social Networks
- Networking, computation and data infrastructure support for Online
Social Network systems


Schedule
Submission deadline: 19 October 2014
Author notification: 31 January 2015
Revised paper due: 15 March 2015
Final author notification: 15 April 2015
Publication (tentative): 3rd Quarter 2015

Guest Editors
Xiaoming Fu, Georg-August-University of Goettingen, Germany
Andrea Passarella, IIT-CNR, Italy
Daniele Quercia, Yahoo Labs, Spain
Alessandra Sala, Bell Labs, Ireland
Thorsten Strufe, TU Dresden, Germany

Instructions for submission
---------------------------
Manuscripts must not have been previously published nor currently under
review by other journals or conferences. If prior work was published in
a conference, the submitted manuscript should include a substantial
extension of at least 35% novel contributions. In this case, authors are
also required to submit their published conference articles and a
summary document explaining the enhancements made in the journal
version.

Papers must be submitted through the Computer Communications website at
http://ees.elsevier.com/comcom, where guidelines for manuscript
preparation can also be found
(http://www.elsevier.com/journals/computer-communications/0140-3664/guide-for-authors).
To ensure that all manuscripts are correctly identified for consideration
by the Special Issue, the authors should select "Special Issue: OSN"
when they reach the "Article Type" step in the submission process.

For further information, please contact the guest editors at
comcomsi_osn at iit.cnr.it


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

Message: 5
Date: Wed, 3 Sep 2014 15:48:38 +0000
From: "Potapov, Igor" <potapov@liverpool.ac.uk>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] CfP: Reachability Problems, Oxford, 22 - 24
September 2014
Message-ID:
<7ECE8E01AEB79A459E3F30C54E56CF7CBC8C2E17@CHEXMBX1.livad.liv.ac.uk>
Content-Type: text/plain; charset="iso-8859-1"

RP'14 Call for Participation
---------------------------------
The 8th International Workshop
on REACHABILITY PROBLEMS (RP2014)
Early registration : 12 September 2014 (?150)
http://www.cs.ox.ac.uk/RP2014/

The Department of Computer Science will organize the 8th International Workshop
on Reachability Problems (RP'2014). This event will take place at the
Department in the centre of Oxford, 22 - 24 September 2014.

The Reachability Workshop is specifically aimed at gathering together
scholars from diverse disciplines and backgrounds interested in
reachability problems that appear in
- Algebraic structures
- Computational models
- Hybrid systems
- Logic and Verification

Invited Speakers:
- Byron Cook, UCL and Microsoft Research, UK.
- Kousha Etessami, University of Edinburgh, UK.
- Anca Muscholl, LaBRI Bordeaux, France.
- Sylvain Schmitz, LSV and ENS-Cachan, France.

Accepted papers:
https://www.cs.ox.ac.uk/RP2014/accepted-papers/

Programme:
https://www.cs.ox.ac.uk/RP2014/programme/


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

Message: 6
Date: Thu, 04 Sep 2014 00:23:56 +0300
From: Pekka Orponen <pekka.orponen@aalto.fi>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] 20 fully funded PhD student positions in Helsinki
Message-ID: <540786EC.3060203@aalto.fi>
Content-Type: text/plain; charset=utf-8; format=flowed

The Helsinki Doctoral Education Network in Information and
Communications Technology (HICT) is a joint initiative by Aalto
University and the University of Helsinki, the two leading universities
within this area in Finland. The network involves at present 54
professors and over 200 doctoral students, and the participating units
graduate altogether more than 40 new doctors each year.

The activities of HICT are structured along six research area specific
tracks:
- Algorithms and machine learning
- Creative technologies
- Life science informatics
- Networks, networked systems and services
- Software and service engineering and systems
- User centered information technology

The quality of research and education in both HICT universities is
world-class, but the education is still practically free as there are no
tuition fees in the Finnish university system. Helsinki has been ranked
as the World's Most Livable City (Monocle, 2011), and is the capital
city of Finland, which is in the top 10 of the most highly educated
nations in the world (OECD, 2013), and has been selected as the world?s
best country to live in (Newsweek, 2010).

The participating units of HICT have currently 20 fully funded positions
available for exceptional doctoral students. The call closes on
September 30, 2014 at 16:00 EET (UTC+2). For more information and
application instructions, see "http://www.hict.fi/".


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

Message: 7
Date: Sat, 30 Aug 2014 13:22:39 +0300
From: Matti Jarvisalo <matti.jarvisalo@cs.helsinki.fi>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CfP: JSAT Special Issue on SAT 2014 Competitions and
Evaluations
Message-ID: <3a47471a0738edb6bfae0df28e1d9cc7@cs.helsinki.fi>
Content-Type: text/plain; charset=UTF-8; format=flowed

**************************** Call for Papers
*********************************
**
**
** Special Issue on
**
** SAT 2014 COMPETITIONS AND EVALUATIONS
**
**
**
** Journal on Satisfiability, Boolean Modeling and Computation
(JSAT) **
** http://satassociation.org/jsat/
**
** ISSN: 1574-0617, published by OIS Press
**
**
**
** Guest editors: Marijn Heule The University of Texas at Austin,
USA **
** Matti Jarvisalo University of Helsinki, Finland
**
**
**
******************************************************************************


IMPORTANT DATES

Submission to the special issue is now open.

Submission deadline: November 14, 2014
First round reviews: January 30, 2015
Revision deadline: March 30, 2015
Final notifications: May 30, 2015

Final versions of accepted articles will be published online
individually
as soon as received by the journal editors. The special issue will
appear
either as part of a regular volume or as a specific volume depending on
the
number of accepted papers.

MOTIVATION

Boolean satisfiability (SAT) and related solver competitions organized
during
the last two decades have been a stimulating force to improve SAT
solvers and
related technologies. These competitions have encouraged developing
novel
algorithms, optimized implementation-level techniques and data
structures to
increase the practical performance and robustness of solvers. The
competition
benchmark suites are commonly used by the research community as the
standard
test set to evaluate progress. Additionally, the competitions provide
large
amounts of openly available data on solver performance on a large
spectrum of
benchmark families that encode important real and artificial
combinatorial
problems.

A lot more can be learned from these solver competitions than merely
awarding
and publishing the best-performing solvers. This special issue provides
a venue
to go beyond this, and welcomes research articles offering in-depth
understanding
of different aspects of the 2014 SAT-related solver competitions,
inviting
submissions describing solver techniques, benchmark families,
competition reports,
and thorough analysis and insights into the data produced by the
competitions.


TOPICS OF INTEREST

Manuscripts addressing one or more of the following aspects of 2014
SAT-related
solver competitions are invited.

- Articles (full or system descriptions) presenting details on the
algorithmic
and implementation-level aspects of original solvers with remarkable
performance
during the SAT-related competitions within FLoC Olympic Games 2014:

* SAT Competition,
* Configurable SAT Solver Challenge,
* MaxSAT Evaluation,
* QBF Gallery,
* Satisfiability Modulo Theories Competition,

as well as other FLoC Olympic Games 2014 competitions tightly
connected
with Boolean satisfiability, such as the Hardware Model Checking
Competition.
Remarkable is to be interpreted broadly, from good overall
performance to
very good performance on a specific set of benchmarks.

- Full articles by competition organizers reporting on SAT-related
competitions
within FLoC Olympic Games 2014. The articles should describe the
competition,
its criteria, why it is interesting to the SAT research community,
execution
environment used, analysis of the results (including how they compare
to
previous instantiations, if appropriate), and give a summary of the
main
technical contributions to the field, as well as discussions on
lessons
learned and suggestions for improvements for future competitions.

- Full articles presenting non-trivial in-depth analysis of the data
produced
by SAT-related competitions within FLoC Olympic Games 2014. The
articles
should give novel insights into the competition data, analyzing for
example
the structure of competition benchmarks and their relation to the
effectiveness of different solver techniques in solving the
benchmarks,
scoring methods for ranking solvers, sensitivity of competition
results, etc.

- Full articles on new, relevant benchmark families submitted to the
competitions, and related analysis of the competition benchmarks.


SUBMISSION INFORMATION

Submissions should be written using the JSAT latex style files. System
description submissions are limited to six pages in the JSAT style.
Submission of manuscripts to the special issue are made via the JSAT
journal
website http://satassociation.org/jsat/
by following the link "INFORMATION -> For Authors".
After registering to the JSAT submission system, start a new
submission,
and select "Special Issue on SAT 2014 Competitions and Evaluations" in
the
Journal Section selection menu in Step 1 of the submission procedure.

Submitted manuscripts should not have been published previously, nor be
under review for publication elsewhere.

Please contact the special issue editors by email using
satcompetitions2014@gmail.com
in case you have any questions regarding the special issue.



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

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 79, Issue 2
*************************************