Monday, July 20, 2015

dmanet Digest, Vol 89, Issue 15

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. PhD scholarship in Algorithms and Complexity at Leeds (UK)
(Haiko Muller)
2. FINAL CFP: WINE 2015 - The 11th Conference on Web and
Internet Economics (Guido Schaefer)
3. TPNC 2015: extended submission deadline 27 July (GRLMC - URV)
4. QPLIB2014 -- beta version (Fabio Furini)
5. WCTA 2015 Call for Presentation Abstracts (Travis Gagie)


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

Message: 1
Date: Fri, 17 Jul 2015 17:05:47 +0100 (BST)
From: Haiko Muller <scshm@leeds.ac.uk>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] PhD scholarship in Algorithms and Complexity at
Leeds (UK)
Message-ID:
<alpine.LRH.2.11.1507171645080.3158@cslin164.csunix.comp.leeds.ac.uk>
Content-Type: TEXT/PLAIN; format=flowed; charset=ISO-8859-7

The School of Computing welcomes applications for a fully funded PhD
scholarship within the research theme of Algorithms and Complexity:

Graph algorithms: We tackle computationally hard problems on graphs by
restricting the inputs to special classes of graphs, develop fast
exponential time algorithms, fixed parameter algorithms and approximation
algorithms. We aim for combinatorial optimization algorithms by structural
analysis of graphs that leads to decompositions and reduction rules. The
same methods support hardness proofs that provide the evidence that the
desired algorithms do not exist or are fundamentally different from known
algorithms.

Train vehicle scheduling optimisation: Opportunity to work alongside an
EPSRC project (2015-18), which is in collaboration with First Rail and
Tracsis Plc. Whereas the EPSRC project is mainly focussed on a
mathematical network flow approach, this PhD project will investigate
other (meta-)heuristics approaches.

Closing Date: 30 August 2015

Contact Details: School of Computing, University of Leeds, Leeds LS2 9JT,
UK. T: +44 113 3438000, E: phd@engineering.leeds.ac.uk

Further Information: The School of Computing, ranked in the top 10 for
research impact in REF2014, is making a substantial investment in new PhD
Scholarships. This is an exciting opportunity for prospective UK/EU PhD
students to engage in world class research from theoretical foundations of
computer science through to highly applied computational modelling and
systems engineering.
The available fully funded UK/EU PhD scholarships are each worth over £65k
covering fees, stipend and RTSG. The scholarships are fully supported by
School and EPSRC funding; however, requests for part-funding will also be
considered where the balance is covered from elsewhere.

How to apply: Formal applications for research degree study should be made
on-line through www.leeds.ac.uk/info/125187/applying_for_research_degrees
Please state clearly on the funding section of the application form that
you wish to be considered for scholarship 'PhD scholarship Computing (FAO
Dr Raymond Kwan)'. See also www.leeds.ac.uk/students/apply_research.htm

School of Computing Web Address: www.comp.leeds.ac.uk

Minimum Academic Requirements: UK 2.1 Bachelor (or equivalent) or MSc with
merit. If English is not your first language, then you must also meet the
University's English language requirements.

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

Message: 2
Date: Fri, 17 Jul 2015 23:10:26 +0200
From: Guido Schaefer <G.Schaefer@cwi.nl>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] FINAL CFP: WINE 2015 - The 11th Conference on Web
and Internet Economics
Message-ID: <AC4A4E15-D390-472A-B508-2F341BB04D7A@cwi.nl>
Content-Type: text/plain; charset=utf-8

NOTE: WINE 2015 will feature a poster session for the presentation of results published elsewhere and work in progress that are relevant to the WINE community. Each presenter will be given the opportunity to give a lightning talk. The intention is to encourage PhD students and people on the job market to present their work. There will also be some limited travel support for students. A separate call for posters will be sent at a later stage.

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

FINAL CALL FOR PAPERS

WINE 2015: The 11th Conference on Web and Internet Economics

Centrum Wiskunde & Informatica (CWI), Amsterdam, The Netherlands
December 9-12, 2015, with tutorial program on December 9, 2015
http://event.cwi.nl/wine2015

---------------------------------------------------------------------------------------------------------------------------
IMPORTANT DATES
* Paper submission deadline: July 24, 2015, 11:59pm anywhere on Earth (UTC-12)
* Tutorial proposal submission deadline: July 31, 2015
* Author notification: September 18, 2015
* Camera-ready copy: October 2, 2015
---------------------------------------------------------------------------------------------------------------------------

Over the past decade, research in theoretical computer science, artificial intelligence, and microeconomics has joined forces to tackle problems involving incentives and computation. These problems are of particular importance in application areas like the Web and the Internet that involve large and diverse populations. The Conference on Web and Internet Economics (WINE) is an interdisciplinary forum for the exchange of ideas and results on incentives and computation arising from these various fields. WINE 2015 builds on the success of the Conference on Web and Internet Economics (named Workshop on Internet & Network Economics until 2013), which was held annually from 2005 to 2014.

WINE 2015 will take place at CWI in December 2015. The program will feature invited talks, tutorials, paper presentations, and a poster session. All paper submissions will be peer-reviewed and evaluated on the basis of the quality of their contribution, originality, soundness, and significance. Industrial applications and position papers presenting novel ideas, issues, challenges and directions are also welcome. Submissions are invited in, but not limited to, the following topics:

* Algorithmic game theory
* Algorithmic mechanism design
* Auction algorithms and analysis
* Computational advertising
* Computational aspects of equilibria
* Computational social choice
* Convergence and learning in games
* Coalitions, coordination and collective action
* Economic aspects of security and privacy
* Economic aspects of distributed computing
* Network games
* Price differentiation and price dynamics
* Social networks

SUBMISSION FORMAT
Authors are invited to submit extended abstracts presenting original research on any of the research fields related to WINE 2015.

An extended abstract submitted to WINE 2015 should start with the title of the paper, each author's name, affiliation and e-mail address, followed by a one-paragraph summary of the results to be presented. This should then be followed by a technical exposition of the main ideas and techniques used to achieve these results, including motivation and a clear comparison with related work.

The extended abstract should not exceed 14 single-spaced pages (excluding references) using reasonable margins (at least one-inch margins all around) and at least 11-point font. If the authors believe that more details are essential to substantiate the claims of the paper, they may include a clearly marked appendix (with no space limit) that will be read at the discretion of the Program Committee. It is strongly recommended that submissions adhere to the specified format and length. Submissions that are clearly too long may be rejected immediately. The above specifications are meant to provide more freedom to the authors at the time of submission. Note that accepted papers will be allocated 14 pages (including references) in the LNCS format in the proceedings (see below).

The proceedings of the conference will be published by Springer-Verlag in the ARCoSS/LNCS series, and will be available for distribution at the conference. Accepted papers will be allocated 14 pages total in the LNCS format in the proceedings. Submissions are encouraged, though not required, to follow the LNCS format. More information about the LNCS format can be found on the author instructions page of Springer-Verlag, see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0.

In cooperation with the ACM Transactions on Economics and Computation (TEAC), WINE 2015 will invite selected authors to submit their extended papers to appear in a special section of a TEAC issue. These submissions will still go through the TEAC review process.

IMPORTANT NOTICE
To accommodate the publishing traditions of different fields, authors of accepted papers can ask that only a one-page abstract of the paper appear in the proceedings, along with a URL pointing to the full paper. Authors should guarantee the link to be reliable for at least two years. This option is available to accommodate subsequent publication in journals that would not consider results that have been published in preliminary form in a conference proceedings. Such papers must be submitted and formatted just like papers submitted for full-text publication.

Simultaneous submission of results to another conference with published proceedings is not allowed. Results previously published or presented at another archival conference prior to WINE 2015, or published (or accepted for publication) at a journal prior to the submission deadline of WINE 2015, will not be considered. Simultaneous submission of results to a journal is allowed only if the authors intend to publish the paper as a one-page abstract in WINE 2015. Papers that are accepted and appear as a one-page abstract can be subsequently submitted for publication in a journal but may not be submitted to any other conference that has a published proceedings.

TUTORIAL PROPOSALS
WINE 2015 is soliciting proposals for tutorials to be held on December 9, 2015. Tutorial proposals should be no more than 2 pages long and contain the title of the tutorial, a description of the topic matter, the names of the tutor(s), and dates/venues where earlier versions of the tutorial were given (if any). In addition, short biographies of the tutor(s) should be attached to the proposal. Informal suggestions of tutorial ideas can also be sent without a full proposal to the program chairs at any time. Tutorial proposals should be submitted by email to wine2015@cwi.nl.

IMPORTANT DATES
* Paper submission deadline: July 24, 2015, 11:59pm anywhere on Earth (UTC-12)
* Tutorial proposal submission deadline: July 31, 2015
* Author notification: September 18, 2015
* Camera-ready copy: October 2, 2015

SUBMISSION LINK
Papers must be submitted electronically through https://www.easychair.org/conferences/?conf=wine2015.
Tutorial proposals should be sent to wine2015@cwi.nl.


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

Message: 3
Date: Sat, 18 Jul 2015 11:23:03 +0200
From: "GRLMC - URV" <grlmc@urv.cat>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] TPNC 2015: extended submission deadline 27 July
Message-ID: <004b01d0c13b$5ad6c440$6500a8c0@GRLMC.local>
Content-Type: text/plain; charset="iso-8859-2"

----------------------------------------------------------------------------
***** SUBMISSION DEADLINE EXTENDED: July 27 *****
----------------------------------------------------------------------------

****************************************************************************
************
4th INTERNATIONAL CONFERENCE ON THE THEORY AND PRACTICE OF NATURAL COMPUTING

TPNC 2015

Mieres, Spain

December 15-17, 2015

Organized by:

European Centre for Soft Computing

Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University

http://grammars.grlmc.com/TPNC2015/
****************************************************************************
************

AIMS:

TPNC is a conference series intending to cover the wide spectrum of
computational principles, models and techniques inspired by information
processing in nature. TPNC 2015 will reserve significant room for young
scholars at the beginning of their career and particular focus will be put
on methodology. The conference aims at attracting contributions to
nature-inspired models of computation, synthesizing nature by means of
computation, nature-inspired materials, and information processing in
nature.

VENUE:

TPNC 2015 will take place in Mieres, in the north of Spain. The city is the
heart of the coal mining industry in the country, today declining. The venue
will be the European Centre for Soft Computing:

http://www.softcomputing.es/

SCOPE:

Topics include, but are not limited to:

- Theoretical contributions to:

amorphous computing
bacterial foraging
cellular automata
chaos and dynamical systems based computing
evolutionary computing
membrane computing
neural computing
optical computing
swarm intelligence

artificial chemistry
artificial immune systems
artificial life
complex adaptive systems
self-organizing systems

computing with DNA
nanocomputing
physarum computing
quantum computing and quantum information
reaction-diffusion computing

computing with words
developmental systems
fractal geometry
gene assembly in unicellular organisms
granular computation
intelligent systems
rough/fuzzy computing in nature
synthetic biology

- Applications of natural computing to:

algorithms
bioinformatics
control
cryptography
design
economics
graphics
hardware
human-computer interaction
knowledge discovery
learning
logistics
medicine
natural language processing
optimization
pattern recognition
planning and scheduling
programming
robotics
telecommunications
web intelligence

A flexible "theory to/from practice" approach would be the perfect focus for
the expected contributions.

STRUCTURE:

TPNC 2015 will consist of:

- invited talks
- invited tutorials
- peer-reviewed contributions

INVITED SPEAKERS:

(to be completed)

John A. Smolin (IBM T.J. Watson Research Center, Yorktown Heights), tba

Guy Theraulaz (Paul Sabatier University, Toulouse), Stigmergic Interactions
and 3D Nest Construction in Ant Colonies

PROGRAMME COMMITTEE:

Hussein Abbass (University of New South Wales, Canberra, Australia)
Andrew Adamatzky (University of the West of England, Bristol, UK)
Humberto Bustince (Public University of Navarra, Pamplona, Spain)
Pei-Chann Chang (Yuan Ze University, Taoyuan, Taiwan)
Shyi-Ming Chen (National Taiwan University of Science and Technology,
Taipei, Taiwan)
Óscar Cordón (University of Granada, Spain)
Swagatam Das (Indian Statistical Institute, Kolkata, India)
Gianni Di Caro (Dalle Molle Institute for Artificial Intelligence, Lugano,
Switzerland)
Tharam Dillon (La Trobe University, Melbourne, Australia)
Agoston E. Eiben (VU University Amsterdam, The Netherlands)
János Fodor (Óbuda University, Budapest, Hungary)
Fernando Gomide (University of Campinas, Brazil)
Maoguo Gong (Xidian University, Xi'an, China)
Salvatore Greco (Universiy of Catania, Italy)
Jin-Kao Hao (University of Angers, France)
Francisco Herrera (University of Granada, Spain)
Robert John (University of Nottingham, UK)
Fakhri Karray (University of Waterloo, Canada)
László T. Kóczy (Budapest University of Technology and Economics, Hungary)
Rudolf Kruse (University of Magdeburg, Germany)
José A. Lozano (University of the Basque Country, Donostia, Spain)
Jianquan Lu (Southeast University, Nanjing, China)
Vittorio Maniezzo (University of Bologna, Italy)
Carlos Martín-Vide (Rovira i Virgili University, Tarragona, Spain, chair)
Ujjwal Maulik (Jadavpur University, Kolkata, India)
Marjan Mernik (University of Maribor, Slovenia)
Radko Mesiar (Slovak University of Technology, Bratislava, Slovakia)
Risto Miikkulainen (University of Texas, Austin, USA)
Tal Mor (Technion, Haifa, Israel)
Vilém Novák (University of Ostrava, Czech Republic)
Sankar K. Pal (Indian Statistical Institute, Kolkata, India)
Günther Palm (Ulm University, Germany)
Linqiang Pan (Huazhong University of Science and Technology, Wuhan, China)
Lech Polkowski (Polish-Japanese Academy of Information Technology, Warsaw,
Poland)
Dan Ralescu (University of Cincinnati, USA)
Friedrich Simmel (Technical University of Munich, Germany)
Guy Theraulaz (Paul Sabatier University, Toulouse, France)
Vicenç Torra (University of Skövde, Sweden)
José Luis Verdegay (University of Granada, Spain)
David Wolpert (Santa Fe Institute, USA)
Ronald R. Yager (Iona College, New Rochelle, USA)
Shengxiang Yang (De Montfort University, Leicester, UK)
Xin-She Yang (Middlesex University, London, UK)
Hao Ying (Wayne State University, Detroit, USA)
Mingsheng Ying (University of Technology, Sydney, Australia)
Mengjie Zhang (Victoria University of Wellington, New Zealand)
Qingfu Zhang (City University of Hong Kong, China)
William Zhu (Minnan Normal University, Zhangzhou, China)
Marek Żukowski (University of Gdansk, Poland)

ORGANIZING COMMITTEE:

Adrian Horia Dediu (Tarragona)
Luis Magdalena (Mieres, co-chair)
Carlos Martín-Vide (Tarragona, co-chair)
Florentina Lilica Voicu (Tarragona)

SUBMISSIONS:

Authors are invited to submit non-anonymized papers in English presenting
original and unpublished research. Papers should not exceed 12 single-spaced
pages (including eventual appendices, references, proofs, etc.) and should
be prepared according to the standard format for Springer Verlag's LNCS
series (see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0).

Submissions have to be uploaded to:

https://www.easychair.org/conferences/?conf=tpnc2015

PUBLICATIONS:

A volume of proceedings published by Springer in the LNCS series will be
available by the time of the conference.

A special issue of a major journal will be later published containing
peer-reviewed substantially extended versions of some of the papers
contributed to the conference. Submissions to it will be by invitation.

REGISTRATION:

The registration form can be found at:

http://grammars.grlmc.com/TPNC2015/Registration.php

DEADLINES:

Paper submission: July 27, 2015 (23:59h, CET) - EXTENDED -
Notification of paper acceptance or rejection: August 28, 2015
Final version of the paper for the LNCS proceedings: September 4, 2015
Early registration: September 4, 2015
Late registration: December 1, 2015
Submission to the post-conference journal special issue: March 17, 2016

QUESTIONS AND FURTHER INFORMATION:

florentinalilica.voicu@urv.cat

POSTAL ADDRESS:

TPNC 2015
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain

Phone: +34 977 559 543
Fax: +34 977 558 386

ACKNOWLEDGEMENTS:

European Centre for Soft Computing
Universitat Rovira i Virgili


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

Message: 4
Date: Sat, 18 Jul 2015 19:22:18 -0400
From: Fabio Furini <fabio.furini@dauphine.fr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] QPLIB2014 -- beta version
Message-ID:
<CAFGxrqGA5+mZ-pahPMG7BXcpZC71=1jrs280hKRgkuY8R7psiQ@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

QPLIB2014 -- beta version

We are pleased to inform you that the beta version of the QPLIB2014 is now
online and it can be downloaded here:

http://www.lamsade.dauphine.fr/QPlib2014

The beta version contains: 410 discrete instances and 138 continuous
instances with different characteristics.

The idea behind this beta version is to spread the instances gathered in
order to have a round of feedbacks before the final release of the library.
All comments or suggestions should be send to the following email address:
qplib2014@gmail.com

The QPLIB2014 has been presented at the conference ISMP 2015 and the slides
of the talk, containing some additional information about the selected
instances, can be found here:

http://www.lamsade.dauphine.fr/QPlib2014/doku.php?id=instances

Please feel free to contact us for any questions, doubts or additional
information.

The QPlib2014 Committee:

* Alper Atamturk
* Pietro Belotti
* Pierre Bonami
* Samuel Burer
* Sourour Elloumi
* Antonio Frangioni
* Fabio Furini
* Ambros Gleixner
* Nick Gould
* Leo Liberti
* Andrea Lodi
* Ruth Misener
* Nick Sahinidis
* Frederic Roupin
* Emiliano Traversi
* Angelika Wiegele

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

Message: 5
Date: Sun, 19 Jul 2015 11:55:49 +0100
From: Travis Gagie <travis.gagie@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] WCTA 2015 Call for Presentation Abstracts
Message-ID:
<CAKLg2Nxi3UP1LFWFT=evJWC8q8hYN0E=6XqxHkbGo+27r5ihHQ@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

Dear Colleague,

The 2015 Workshop on Compression, Text and Algorithms (WCTA,
http://www.dcs.kcl.ac.uk/events/spire2015/workshops.html) will take place
at King's College, London, the day after the Symposium on String Processing
and Information Retrieval (SPIRE), i.e., September 4.

We invite abstracts for presentations (15--25 minutes) of recent results
and surveys of interest to the string-processing community. We
particularly encourage submissions from junior members of our community.
Since WCTA has no proceedings, presenting results there should not preclude
submitting them to other conferences or publishing them in journals.
Please submit abstracts by emailing copies (preferably PDF) to *both* WCTA
co-chairs (addresses below).

Submission deadline: August 7th, 2015 (anywhere on Earth)
Notification: August 21st, 2015

WCTA will feature an invited talk on "Using Suffix Array Based Data
Structures in Computational Genomics" by Richard Durbin, FRS, from the
Wellcome Trust Sanger Institute, and a tutorial on "Compact and Succinct
Data Structures -- From Theory to Practice" by Simon Gog from the Karlsruhe
Institute of Technology (abstracts below). WCTA will be free for SPIRE
attendees; there may be a small fee for those attending only the workshop.

Best regards,

Travis Gagie,
University of Helsinki
<travis.gagie@gmail.com>

Tatiana Starikovskaya,
University of Bristol
<tat.lastname@gmail.com>

(WCTA co-chairs)

==========

Title:
Using Suffix Array Based Data Structures in Computational Genomics

Abstract:
This talk will describe how the BWT and FM-indexes are used in read mapping
(e.g., with BWA), sequence assembly (e.g., with SGA and Fermi), and
haplotype matching and storage (with the Positional BWT).

BWA: http://www.ncbi.nlm.nih.gov/pubmed/19451168
http://www.ncbi.nlm.nih.gov/pubmed/20080505 http://bio-bwa.sourceforge.net/
SGA: http://www.ncbi.nlm.nih.gov/pubmed/22156294 https://github.com/jts/sga
Fermi: http://bioinformatics.oxfordjournals.org/content/28/14/1838
https://github.com/lh3/fermi
PBWT: http://www.ncbi.nlm.nih.gov/pubmed/24413527 https://github.com/
richarddurbin/pbwt

Bio:
Richard Durbin, FRS, is Acting Head of Computational Genomics at the
Wellcome Trust Sanger Institute and leader of the Genome Informatics group.
He studied mathematics at Cambridge and earned a PhD on the development and
organization of the nervous system in C. elegans. He has developed numerous
methods for computational sequence analysis, co-authored a textbook on this
subject, and co-leads the international 1000 Genomes Project. He was a
joint winner of the Mullard Award of the Royal Society in 1994 (for work on
the confocal microscope), won the Lord Lloyd of Kilgerran Award of the
Foundation for Science and Technology in 2004, and was elected a Fellow of
the Royal Society in 2004 (for contributions to computational biology) and
a member of the European Molecular Biology Organization (EMBO) in 2009.

==========

Title:
Compact and Succinct Data Structures -- From Theory to Practice

Abstract:
For decades index structures where build on top of the data to enable users
to efficiently carry out queries. For instance suffix trees or arrays were
built on top of a text to answer pattern matching queries in a time
complexity which is independent from the text length.

Unfortunately, these traditional pointer-based index structures often take
significantly more space than the original data and therefore can not be
used in scenarios where the data itself is not much smaller than the
available main memory. In the last 25 years researches invented
space-efficient counterparts for many index structures which use not much
more space than the original data and have the same query complexity in
theory. In this talk we will review popular examples of compact and
succinct structures -- ranging from bit vectors over wavelet trees to
compressed suffix trees -- and show how they can be easily used in
applications by employing the Succinct Data Structure Library (SDSL). We
will further show how to use the library's facilities to analyse, measure,
and monitor time and space requirements of structures. Finally, we will
learn how more complex structures can be composed and integrated in the
existing framework.

SDSL: https://github.com/simongog/sdsl-lite

Bio:
Simon Gog obtained his PhD from Ulm University where he was working on
space-efficient index data structures with applications in Bioinformatics.
The Succinct Data Structure Library project was started in Ulm and
continued at the University of Melbourne, where he was working as a PostDoc
on compressed external index structures. Currently, Simon is working at the
Karlsruhe Institute of Technology on compact index structures for
applications in the area of Information Retrieval.

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

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 89, Issue 15
**************************************

No comments:

Post a Comment