DMANET: DISCRETE MATHEMATICS AND ALGORITHMS: October 2014

Friday, October 31, 2014

dmanet Digest, Vol 80, Issue 23

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. Research grant (BI-D) - BacHBerry project (Susana Vinga)
2. 25th British Combinatorial Conference at the University of
Warwick, 5 July - 10 July 2015 (Viktor Zamaraev)
3. Tractable special cases of hard combinatorial optimization
problems (deadline extended) (Eranda Dragoti-Cela)
4. Special issue in TCS on ??Theory and Applications of Graph
Searching Problems?? (GRASTA) (Nicolas Nisse)
5. Postdoc positions in Budapest (parameterized complexity &
algorithms) (Daniel MARX)
6. [Deadline Extension] CFP COMCOM, Elsevier: SI on Security and
Privacy in Unified Communications: Challenges and Solutions,
Manuscript Due November 21, 2014 (Georgios Karopoulos)

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

Message: 1
Date: Thu, 30 Oct 2014 15:05:04 +0000
From: Susana Vinga <susanavinga@tecnico.ulisboa.pt>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Research grant (BI-D) - BacHBerry project
Message-ID:
<CAOTdZdejUmxbUZrb1GDxLcG4dZN0vXxgCQjyUo6=C-t00sUCpA@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

Dear colleague,
Please distribute widely and sorry for crossposting. Thank you.
Best regards,
Susana Vinga

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

1 Research Grant ? Post-doc (BI-D)

We are seeking one postdoc candidate in the context of a FP7 KBBE
European Project, BacHBerry - ?BACterial Hosts for production of
Bioactive phenolics from bERRY fruits, www.bachberry.eu (European
Union FP7- 613793).

Scientific Area: Optimization and Operations Research.

Required education Level and research experience: PhD in one of the
following areas: optimization, operations research, machine learning,
computer science, mathematics, statistics or related, with a taste for
inter-disciplinary research, and with very good interpersonal skills.
Ideally, the person will have a long experience with optimization
techniques, machine learning and graphical models. Unusual CVs are
welcome.

Workplan: With the development of genetic and metabolic engineering is
it now possible to increase the cells' production of given substances
by manipulating the corresponding metabolic networks, which can be
defined as hypergraphs (nodes are compounds, edges are chemical
reactions). BachBerry is interested in the generation of bacterial
platforms for sustainable bio-based production of phenolic compounds
found in berry fruits. This is accomplished by maximizing the fluxes
in the network, a problem similar to those occurring in transportation
and logistics optimization. The candidate will work on the development
and application of optimization methods and algorithms, in particular
expanding techniques based on linear programming (FBA), bi-level
mixed-integer (OptKnock) and multi-level optimization (OptCom). Also
sparse optimization might provide relevant solutions and will be
explored during the project.

Workplace and scientific supervision: The candidate will work in the
Center of Intelligent Systems at the IDMEC
(http://www.idmec.ist.utl.pt/), Instituto Superior T?cnico, Lisboa,
Portugal, under the supervision of Susana Vinga and in interaction
with the partners of BacHBerry, in particular the BAMBOO team at the
Inria-UCBL in Lyon, France (http://team.inria.fr/bamboo/) and
Marie-France Sagot. Both CSI and BAMBOO are methodological teams with
an expertise in computational and systems biology.

Duration: 12 months, from December 2014, and renewable for up to the
duration of the project.

Evaluation Criteria: The criteria for selection consists on the
academic record of the candidate (30%), publications in areas of the
grant (30%) and evidence of specialized knowledge in the area of the
grant, in particular in optimization (40%). The Jury may decide to
interview the candidates in order to perform a more objective
evaluation of some of the criteria.

Application Dates: From 10th November to 1st December 2014.

Documents to be submitted: Detailed curriculum vitae; motivation
letter; copy of academic study certificates; name of two personal
references. The applications should be submitted via email to
bachberry.wp8@gmail.com

For more details: http://web.ist.utl.pt/susanavinga/

--
_________________________
Susana Vinga, PhD
IDMEC/IST-UL
Av. Rovisco Pais, 1049-001 Lisboa, Portugal
Tel. (+351) 218 419 504 Fax: (+351) 218 498 097
Email: susanavinga@tecnico.ulisboa.pt

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

Message: 2
Date: Thu, 30 Oct 2014 15:25:05 +0000
From: Viktor Zamaraev <viktor.zamaraev@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] 25th British Combinatorial Conference at the
University of Warwick, 5 July - 10 July 2015
Message-ID:
<CADqKaUvguj8Y7araUQiADhYou+hWvo=JXApO5d2gjMF+sU3dgA@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

We are pleased to announce that the 25th British Combinatorial
Conference will take place in the Mathematics Institute at the
University of Warwick from Sunday 5 July (arrival date) to Friday 10
July 2015. The website for the conference is
http://warwick.ac.uk/25bcc where further information will be posted in
due course.

The invited speakers are:
- Manuel Bodirsky (?cole Polytechnique, Paris)
- Xing Chaoping (Nanyang Technological University)
- David Conlon (University of Oxford)
- Stefanie Gerke (Royal Holloway, University of London)
- Gil Kalai (Hebrew University of Jerusalem)
- Tomasz Luczak (Adam Mickiewicz University, Poznan)
- Gary McGuire (University College Dublin)
- Sergey Norin (McGill University, Montreal)
- Nik Ruskuc (University of St Andrews)

There will be an opportunity for participants to contribute talks, and
details of this will be announced in due course.

The local organisation is being handled by

Artur Czumaj
Agelos Georgakopoulos
Dan Kral
Vadim Lozin (chair)
Oleg Pikhurko.

A further announcement will be made when registration opens (beginning
of February 2015). In the meantime, email queries can be sent to
25bcc[at]warwick.ac.uk.

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

Message: 3
Date: Thu, 30 Oct 2014 17:38:34 +0100
From: Eranda Dragoti-Cela <cela@math.tugraz.at>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Tractable special cases of hard combinatorial
optimization problems (deadline extended)
Message-ID: <5452698A.1090503@math.tugraz.at>
Content-Type: text/plain; charset=utf-8

This is a reminder of the workshop

"Tractable special cases of hard combinatorial optimization problems",
www.opt.math.tu-graz.ac.at/scco14

we will be hosting at the Department of Optimization and Discrete
Mathematics of the Graz University of Technology
from December 15 to December 16, 2014.

This will be a two-day, single stream event focussing at polynomially
solvable or approximable special cases of provably hard combinatorial
optimization problems.
This line of research deals with NP-hard combinatorial optimization
problems which become polynomially tractable if specific structural
properties are imposed on their input.
The identification of the sometimes thin boarderline between hard and
tractable cases is often a hard and interesting challenge.

The workshop will host invited talks in the mornings as well as
contributed talks and discussions or working sessions in the afternoons.

Confirmed invited speakers are:

* Vladimir Deineko, Warwick Business School, UK
* Martin Milanic, University of Primorska, Slovenia
* Frits Spieksma, KU Leuven, Belgium
* Gerhard Woeginger, Eindhoven University of Technology, The Netherlands

We herewith invite you to participate in the workshop and submit a
contribution related to the workshop topic.

The workshop venue is the building of the Department of Optimization and
Discrete Mathematics, Graz University of Technology,
Steyrergasse 30, 8010 Graz, Austria.

There will be a small participation fee payable on site. This will
cover the lunches on December 15 and 16 and the refreshments during the
workshop breaks. The participants will be responsable for their own travel
and accomodation expenses.

Important Dates:

* November 15, 2014: Deadline for the submission of contributed talks
* November 15, 2014: Registration deadline
* December 15-16, 2014: Workshop

We are looking forward to meeting you in Graz. Please do not hesitate to
contact us for any additional information.

Best regards,
Eranda Cela and Bettina Klinz

--
Eranda Dragoti-Cela, PhD, Associate Professor (ao. Univ.-Prof.)

Department of Optimization and Discrete Mathematics,
Graz University of Technology,
Steyrergasse 30, A-8010 Graz, Austria
Tel. ++43 316 873 5366, Fax: ++43 316 873105366,
Email: cela@math.tugraz.at

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

Message: 4
Date: Fri, 31 Oct 2014 13:43:52 +0100
From: Nicolas Nisse <nicolas.nisse@inria.fr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Special issue in TCS on ??Theory and Applications of
Graph Searching Problems?? (GRASTA)
Message-ID: <3C43785D-4049-418D-9C2A-F0B3746FAAAC@inria.fr>
Content-Type: text/plain; charset=us-ascii

Call for Papers
Theoretical Computer Science (TCS)

Special Issue:
GRASTA'14, 6th Workshop on GRAph Searching, Theory and Applications
Cargese, Corsica, France, 2014
http://www-sop.inria.fr/coati/events/grasta2014/

Manuscripts are solicited for a special issue in the journal "Theoretical Computer Science" (TCS) on "Theory and Applications of Graph Searching Problems".

Graph searching is often referred to, in a more playful language, as a pursuit-evasion game. This is a kind of game where one part is a set of evaders, that hide in a graph representing a network, and the other part is a team of pursuers, that move systematically in the graph. The game may vary significantly according to the capabilities of the evaders and the pursuers. The objective of the game is to capture the evaders in an optimal way, where the notion of optimality itself admits several interpretations. The area of Graph Searching has become a very active research area in theoretical computer science and discrete mathematics, with impact and applications in various domains.

With this Special Issue, we wish to foster research in the area by exposing new results and directions for further research.
The purpose of the issue is to put together various recent results related to Graph Searching both from the applied and the theoretical point of view.

Potential topics include (but are not limited to) the following:
* Graph Searching and Logic
* Graph Parameters Related to Graph Searching
* Graph searching and Robotics
* Conquest and Expansion Games
* Database Theory and Robber and Marshals Games
* Probabilistic Techniques in Graph Searching
* Monotonicity and Connectivity in Graph Searching
* New Variants of Graph Searching
* Graph Searching and Distributed Computing
* Graph Searching and Network Security

Submissions should be made in PDF format using the standard TCS submission system at http://ees.elsevier.com/tcs/ (submissions will be possible from December 2014)
Papers will be refereed according to the standards of TCS.

Submissions must be received before March 31, 2015.

Please contact the guest editors for additional information.

We are looking forward to receiving your contribution.

The Guest Editors,

Pierre Fraigniaud
Fedor V. Fomin
Nicolas Nisse
Dimitrios Thilikos

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

Message: 5
Date: Fri, 31 Oct 2014 19:14:24 +0100
From: Daniel MARX <dmarx@cs.bme.hu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Postdoc positions in Budapest (parameterized
complexity & algorithms)
Message-ID: <5453D180.9030107@cs.bme.hu>
Content-Type: text/plain; charset=UTF-8; format=flowed

Postdoc positions are available at the Institute for Computer Science
and Control (Hungarian Academy of Sciences), Budapest, Hungary,
supported by the European Research Council (ERC) Starting Grant
PARAMTIGHT: "Parameterized complexity and the search for tight
complexity results" held by D?niel Marx. The goal of the project is to
systematically push the boundaries of algorithmic and hardness results,
mostly in the framework of parameterized complexity, with the aim of
obtaining tight results that give an optimal understanding of the
complexity of a problem.

The candidates should have (or expect to have shortly) a PhD degree in
Computer Science or related area; research experience at postdoctoral
level is of advantage. A successful candidate should have excellent
knowledge of algorithms and/or complexity, preferably in the setting of
parameterized complexity and fixed-parameter tractability. Strong
background in graph theory, combinatorics, constraint satisfaction,
approximation, or kernelization is of advantage.

The review of applicants will begin immediately and continue until the
positions are filled. Applications received by 15 November 2014 will
receive full consideration. Informal inquires by email (D?niel Marx,
dmarx@cs.bme.hu) are welcome.

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

Message: 6
Date: Fri, 31 Oct 2014 09:50:06 +0100
From: Georgios Karopoulos <georgios.karopoulos@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] [Deadline Extension] CFP COMCOM, Elsevier: SI on
Security and Privacy in Unified Communications: Challenges and
Solutions, Manuscript Due November 21, 2014
Message-ID:
<CALTy4CQKbovuJBEwxJobkbx7SE3id0ntLt7GVWggHs_auamWTQ@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

[Apologies if you receive multiple copies of this message]

Manuscript submission: extended to November 21, 2014

========================================================================

*Call for Papers*

Computer Communications Journal, Elsevier
(Current Impact Factor: 1.352)

Special Issue on:
Security and Privacy in Unified Communications: Challenges and Solutions

Direct Link:
http://www.journals.elsevier.com/computer-communications/call-for-papers/special-issue-on-security-and-privacy-in-unified-communicati/

========================================================================

Unified Communications (UC) merge different communication
technologies, types of products, and services, from various
manufacturers, operators, and countries, following diverse policies
and standards. Specifically, in the context of UC, a range of
communication tools are integrated in a way that both corporations and
individuals are able to manage all their communications in one entity
instead of doing it disjointly. It is therefore said that UC bridges
the opening between the various computer related communication
technologies and Voice over IP (VoIP). However, this high level of
heterogeneity expands the risks related to security and privacy that
stakeholders should deal with. To eliminate or even prevent the
increasing threats to end-users and operators, it is important to
explore this growing and timely research topic.
This feature topic will benefit the research community towards
identifying challenges and disseminating the latest methodologies and
solutions to UC security and privacy issues. Its objective is to
publish high-quality articles presenting open issues, algorithms,
protocols, policies, frameworks, standards, and solutions for UC
related to security and privacy. Only technical papers describing
previously unpublished, original, state-of-the-art research, and not
currently under review by a conference or a journal will be
considered. Reviews and case studies which address state-of-art
research and state-of-practice industry experiences are also welcomed.
We solicit papers in a variety of topics related to unified
communications security and privacy, including, but not limited to:

- Authorization and access control for UC services
- Denial of service prevention schemes for UC
- Reliability and availability issues on UC
- Penetration testing, intrusion detection and prevention
- End-to-end security solutions
- Cryptographic protocols for UC
- Voice security
- Signaling security and privacy
- Multimedia application security and privacy analysis
- Multimedia communication platforms vulnerabilities and attacks
- Security and privacy in mobile communication services
- Smartphone multimedia apps security and privacy
- Social networking security and privacy
- Testbed and case studies for secure and private UC services
- Trust establishment in UC
- IP Multimedia Subsystem (IMS) security
- Privacy and identity management
- Privacy enhancing technologies for UC
- Privacy models for UC
- Security and privacy assessment for UC
- Security policies
- Auditing, verification, and validation of UC services
- Risk analysis and management
- Cyber-security issues affecting UC
- Protection of UC as a Critical Information Infrastructure
- VoIP peering security issues

All received submissions will be sent out for peer review by at least
two experts in the field and evaluated with respect to relevance to
the special issue, level of innovation, depth of contributions, and
quality of presentation. Guest editors will make an initial
determination of 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. Submitted papers must
not be under consideration by any other journal or publication.

Schedule

Manuscript submission deadline: November 21, 2014
Pre-notification (first round): January 30, 2015
Final-notification (second round): April 3, 2015
Publication of special issue: 2015 (Tentative)

Submission Details

Authors should follow the instructions available at
http://ees.elsevier.com/comcom - kindly click the ?Guide for Authors?
link in the top box on the right side. When submitting the article,
select ?UC Security and Privacy? in the ?Select an Article Type? box
in the submission process.

Guest Editors

Georgios Karopoulos
Joint Research Centre (JRC), Italy
e-mail: georgios.karopoulos@jrc.ec.europa.eu

Georgios Portokalidis
Stevens Institute of Technology, USA
e-mail: gportoka@stevens.edu

Josep Domingo-Ferrer
Universitat Rovira i Virgili, Catalonia
e-mail: josep.domingo@urv.cat

Ying-Dar Lin
National Chiao Tung University (NCTU), Taiwan
e-mail: ydlin@cs.nctu.edu.tw

Dimitris Geneiatakis
Joint Research Centre (JRC), Italy
e-mail: dimitrios.geneiatakis@jrc.ec.europa.eu

Georgios Kambourakis
University of the Aegean, Greece
e-mail: gkamb@aegean.gr

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

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 80, Issue 23
**************************************

dmanet Digest, Vol 80, Issue 22

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. Frontiers of Algorithmics Workshop First Call for Papers --
deadline Feb. 1, 2015 (Yixin Cao)
2. PhD scholarships at SUTD (Giacomo Nannicini)
3. CFP IEEE SECON 2015 (Deadline - December 5, 2014)
(Aline Carneiro Viana)
4. CIAC 2015: SUBMISSION DEADLINE EXTENDED TO NOVEMBER 9, 2014
(Vangelis Paschos)

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

Message: 1
Date: Mon, 27 Oct 2014 23:11:14 +0800
From: Yixin Cao <comp.unix.solaris@gmail.com>
To: DMANET@zpr.uni-koeln.de
Subject: [DMANET] Frontiers of Algorithmics Workshop First Call for
Papers -- deadline Feb. 1, 2015
Message-ID:
<CAK72vCh4vAE9C1JQcKq28UwTukx0eJ1+wYe+JK9Ts3XRiZp-Sg@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

The 9th International Frontiers of Algorithmics Workshop
Guilin, China, July 3-5, 2015

Important Dates
Submission deadline: February 1, 2015
Notification of acceptance: March 10, 2015
Final version due: April 10, 2015

The 9th International Frontiers of Algorithmics Workshop (FAW 2015)
will provide a focused forum on current trends of research on
algorithms, discrete structures, operation research, combinatorial
optimization and their applications, and will bring together
international experts at the research frontiers in these areas to
exchange ideas and to present significant new results.

Interesting new results in all areas of algorithmics, operation
research and combinatorial optimization and their applications are
welcome. In addition to theoretical work, we are also interested in
results that report on experimental and applied research of general
algorithmic interest. Special considerations will be given to
algorithmic research that is motivated by real-world applications.

Typical, but not exclusive, topics of interest include:
Algorithms and data structures;
Algorithmic game theory and incentive analysis;
Approximation algorithms and online algorithms;
Automata, languages, logic, and computability;
Bioinformatics, computational biology and medicine, and biomedical
applications;
Biomedical imaging algorithms;
Combinatorial optimization;
Combinatorics and discrete structures related to algorithms and complexity;
Communication networks and optimization;
Complexity theory;
Computational algebra, geometry, number theory, and statistics;
Computational learning theory, knowledge discovery, and data mining;
Cryptography, reliability, and security;
Database theory, large databases, and natural language processing;
Experimental algorithmic methodologies;
Geometric information processing and communication;
Graph algorithms and theory;
Graph drawing and information visualization;
Internet algorithms and protocols;
Large graph algorithms and social network analysis;
Optimization algorithms in economic and operations research;
Parallel and distributed computing and multicore algorithms;
Parameterized algorithms, heuristics, and analysis;
Pattern recognition algorithms;
Trustworthy algorithms and trustworthy software.

Submission Guidelines and Publication Information
The submission deadline is February 1, 2015 (anywhere on Earth). FAW
2015 will only accept electronic (PS or PDF) submissions. The
submission webpage for FAW 2015 is:
https://easychair.org/conferences/?conf=faw2015

Only previously unpublished new results will be considered for
publication. Papers that have already been published at another
journal or conference with proceedings, or simultaneously submitted or
accepted to another conference with proceedings will not be
considered. A submission should not exceed 10 pages, excluding
bibliography and appendices, formatted for letter-size paper using 11
point or larger font.

The proceedings of the Conference will be published by Springer-Verlag
in the Lecture Notes in Computer Science (LNCS) series, and will be
available for distribution at the conference.
Selected high quality papers will be invited to a special issue in the
journal of Theoretical Computer Science and in the Journal of
Combinatorial Optimization, respectively. The invited papers will go
through the normal reviewing process.

General Conference Chairs
John Hopcroft (Cornell University, USA)
Shichao Zhang (Guangxi Normal University, China)

Program Chairs
Chee Yap (New York University, USA)
Jianxin Wang (Central South University, China)

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

Message: 2
Date: Tue, 28 Oct 2014 12:45:20 +0800
From: Giacomo Nannicini <giacomo.n@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] PhD scholarships at SUTD
Message-ID:
<CAFy=0d1UjLJzcx6+U+zaLM0E3MFMyBmC1u3e6FNKwZ2QifeuVQ@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

Multiple scholarships are available for bright and motivated students
who want to pursue a PhD in Singapore, starting September 2015, in a
number of areas broadly related to operations research such as: supply
chain, transportation and logistics, telecommunication systems and the
Internet, energy (renewables, environment, electricity markets),
service systems, financial engineering, critical infrastructure and
security, social networks, healthcare.

Students will be attached to the Engineering Systems and Design
pillar, a multidisciplinary department in SUTD with faculty from the
best universities in the world, including MIT, Cambridge, UC Berkeley,
Caltech, and Cornell. The faculty is engaged in numerous research
projects using tools from optimization, operations management, game
theory and mechanism design, applied probability, economics, and more.
SUTD is a research-intensive university, recently established in
collaboration with MIT, and its president is Tom Magnanti, former Dean
of Engineering at MIT and former President of INFORMS. Singapore is a
prime location to engage in research with real practical impact, and
is a meeting point of different cultures, providing an enriching life
experience for students.

The ESD PhD program comprises coursework, research, teaching, and
overseas research or industry experiences, with a flexible mentoring
structure. We offer highly attractive financial packages for qualified
PhD applicants who are selected for a scholarship.

More information about the program, and a link to the application
portal, can be found at: http://esd.sutd.edu.sg/academics/phd-program/

Feel free to get in touch with phd@esd.sutd.edu.sg or
nannicini@sutd.edu.sg for questions and clarifications.

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

Message: 3
Date: Wed, 29 Oct 2014 10:14:13 +0100
From: Aline Carneiro Viana <aline.viana@inria.fr>
To: dmanet <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] CFP IEEE SECON 2015 (Deadline - December 5, 2014)
Message-ID: <5450AFE5.2030100@inria.fr>
Content-Type: text/plain; charset=ISO-8859-1; format=flowed

[Please accept our apologies if you receive multiple copies of this Call
for Papers (CFP).]

***********************************************************************************

CALL FOR PAPERS

IEEE SECON 2015
12th Annual IEEE International Conference on
Sensing, Communications and Networking
http://www.ieee-secon.org/

June 22-25, 2015 - Seattle, USA

***********************************************************************************
IMPORTANT DATES

Abstract Registration: 4:00pm PST on December 5, 2014
Paper Submission Deadline: 4:00pm PST on December 12, 2014
Acceptance Notification: March 13, 2015
Camera Ready: April 10, 2015

SCOPE

The twelfth annual IEEE SECON conference will provide a unique forum to
exchange innovative research ideas, recent results, and share
experiences among researchers and practitioners in wireless networks and
mobile systems. The focus of IEEE SECON is novel communication
technologies and emerging applications and services, involving mobile
sensing and communication, and ubiquitous and pervasive computing.

In addition to the traditional topics published in SECON, this year the
conference would like to especially encourage papers in emerging
applications and services in areas related to Internet of Things, 5G,
small cells, wearable computing, and Software Defined Networking for
mobile and wireless networks.

TOPICS OF INTEREST

Papers describing original, previously unpublished research work,
experimental efforts, practical experiences, and industrial and
commercial developments in all aspects of sensor networks, mobile
devices, and wireless communication are solicited. Within this domain,
particular topics of interest include, but are not limited to:

* Experience with deployment of mobile apps, networks and systems
* Software Defined Networking for mobile and wireless networks
* Wearable computing
* White space, cooperative and cognitive communications
* Network management for mobile devices, including data consumption,
energy consumption, and performance
* Novel smartphone-based sensing systems, tools, applications and
experiences
* Novel applications: cyber-physical systems, Internet of Things,
distributed mobile computing
* New communication technologies, such as NFC, visible light, underwater
communication
* Low power and energy limited sensing and communications, including
energy-harvesting
* Cellular communications and data networks, such as cellular small
cells and 5G
* Measurement of wireless and sensor systems, and novel experimental
testbeds
* Security, privacy, and trustworthiness of mobile, wireless and sensor
systems
* Survivability, network management, and fault tolerance
* Application protocols and cross-layer design

PAPER SUBMISSION AND PUBLICATION

Papers should neither have been published elsewhere nor currently under
review by another venue. All papers for IEEE SECON 2015 must be
submitted via EDAS at https://edas.info/newPaper.php?c=18611 . Papers
must be no longer than 9 pages and in font size no smaller than 10
points. Additional paper submission instructions will be made available
on the IEEE SECON website http://ieee-secon.org . Papers that violate
the format guidelines will be rejected without review.

To be published in the IEEE SECON 2015 Conference Proceedings and to be
eligible for publication in IEEE Xplore, an author of an accepted paper
is required to register for the conference at the full (member or
non-member) rate and the paper must be presented by an author of that
paper at the conference unless the TPC Chair grants permission for a
substitute presenter arranged in advance of the event and who is
qualified both to present and answer questions. Non-refundable
registration fees must be paid prior to uploading the final IEEE
formatted, publication-ready version of the paper. For authors with
multiple accepted papers, one full registration is valid for up to 3
papers. Accepted and presented papers will be published in the IEEE
SECON 2015 Conference Proceedings and submitted to IEEE Xplore.

The organizers of IEEE SECON 2015 as well as our attendees expect
accepted papers to be presented at the conference. IEEE reserves the
right to exclude a paper from distribution after the conference (e.g.,
removal from IEEE Xplore) if the paper is not presented at the conference.

***********************************************************************************
EXECUTIVE COMMITTEE

General Chair:
Suresh Singh, Portland State University, singh@cs.pdx.edu

TPC Co-Chairs:
Sharad Agarwal, Microsoft Research, Sharad.Agarwal@microsoft.com
Song Chong, KAIST, songchong@kaist.edu

Technical Program Vice Chair for Information Systems
Kyunghan Lee, UNIST, khlee@unist.ac.kr

Publicity Co-Chairs:
Aline Carneiro Viana, INRIA, aline.viana@inria.fr
Jungmin So, Hallym University, jso1@hallym.ac.kr

Demo Chair:
Srihari Nelakuditi, U of S. Carolina, srihari@cse.sc.edu

Poster Chair:
Thanh Dang, WSU Vancover, thanh.dang@vancouver.wsu.edu

Panel Chair:
Raju Pandey, UC Davis and Synapsense Inc., pandey@synapsense.com

Web Chair:
Tian Lan, George Washington University, tlan@email.gwu.edu

Publications Chair:
Guiling Wang, NJIT, guiling.wang@njit.edu

Travel Grants Co-Chairs:
Ranga Rao Venkata Prasad, TU Delft, Netherlands,
R.R.VenkateshaPrasad@tudelft.nl
Joseph Camp, SMU, camp@lyle.smu.edu

Workshop Chairs:
Ehsan Aryafar, Intel/Princeton, earyafar@gmail.com
Xinyu Zhang, U. Wisconsin, Madison, xyzhang@ece.wisc.edu

Local Arrangements/Finance Chair:
Eduardo Cuervo Laffaye, MSR, cuervo@microsoft.com

**********************************************************************

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

Message: 4
Date: Wed, 29 Oct 2014 15:16:34 +0100
From: Vangelis Paschos <paschos@lamsade.dauphine.fr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CIAC 2015: SUBMISSION DEADLINE EXTENDED TO NOVEMBER
9, 2014
Message-ID:
<CAAvNmXo6H06Yfj8xWmX19-ckxho9Tm0e2bihoLchxiVhWtcizA@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

CIAC 2015: SUBMISSION DEADLINE EXTENDED TO NOVEMBER 9, 2014

9th International Conference on Algorithms and Complexity (CIAC)
May 20-22, 2015, Paris, France

http://www.lamsade.dauphine.fr/~ciac2015/cfp.php

The 9th International Conference on Algorithms and Complexity is
intended to provide a forum for researchers working in all aspects of
computational complexity and the use, design, analysis and
experimentation of efficient algorithms and data structures.

Papers presenting original research in the areas of algorithms and
complexity are sought, including (but not limited to):

sequential, parallel and distributed algorithms and data structures;
approximation and randomized algorithms;
graph algorithms and graph drawing;
on-line and streaming algorithms;
analysis of algorithms and computational complexity;
algorithm engineering;
web algorithms;
algorithmic game theory;
computational biology;
communication networks;
computational geometry;
discrete optimization.

The conference proceedings will be published by Springer-Verlag in
its Lecture Notes in Computer Science (LNCS) series.

Deadline for submission: November 02, 2014.
Notification of acceptance: December 22, 2014.
Final manuscript, camera ready: January 31, 2015.
Conference: May 20-22, 2015.

Invited Speakers
Elias Koutsoupias, St Anne's College, Oxford University, UK
Haim Kaplan, School of Computer Science, Tel Aviv University, Israel
Bernard Chazelle, Department of Computer Science, Princeton University, USA
Mikkel Thorup, Department of Computer Science, University of
Copenhagen, Denmark

Steering Committee
Giorgio Ausiello, Sapienza University of Rome, Italy
Josep Diaz, TU Catalonia, Spain
Rossella Petreschi, Sapienza University of Rome, Italy
Maria Serna, TU Catalonia, Spain
Paul Spirakis, University of Liverpool, UK and CTI, Greece

Program Committee
Hannah Bast, University of Freiburg, Germany
Vincenzo Bonifaci, IASI-CNR, Rome, Italy
J?r?mie Chalopin, CNRS and Universit? d'Aix-Marseille, France
Victor Chepoi, University of Aix-Marseille, France
Marek Chrobak, University of California, Riverside, USA
Pierluigi Crescenzi, University of Florence, Italy
Jurek Czyzowicz, University of Qu?bec in Outaouais, Canada
Yann Disser, TU Berlin, Germany
Thomas Erlebach, University of Leicester, UK
Bruno Escoffier, UPMC, France
Irene Finocchi, Sapienza University of Rome, Italy
Fedor Fomin, University of Bergen, Norway
Pierre Fraigniaud, CNRS and University Paris Diderot, France
Herman Haverkort, TU Eindhoven, Netherlands
Mat?? Mihal?k, ETH Zurich, Switzerland
Luca Moscardelli, University of Chieti-Pescara, Italy
Yoshio Okamoto, University of Electro-Communications, Japan
Vangelis Th. Paschos, University Paris-Dauphine, France
David Peleg, Weizmann Institute of Science, Israel
Marie-France Sagot, Inria & University Lyon 1, France
Piotr Sankowski, University of Warsaw, Poland
Maria Serna, TU Catalonia, Spain
Paul Spirakis, University of Liverpool, UK and CTI, Greece
Dimitrios M. Thilikos, CNRS, LIRMM, France and UoA, Greece
Roger Wattenhofer, ETH Zurich, Switzerland
Peter Widmayer (Chair), ETH Zurich, Switzerland
Gerhard J. Woeginger, TU Eindhoven, Netherlands

Organizing Committee
Katerina Kinta, University Paris-Dauphine, France
Cecile Murat, University Paris-Dauphine, France
Eleni Palaiologou, University Paris-Dauphine, France
Vangelis Th. Paschos (Chair), University Paris-Dauphine, France
Olivier Rouyer, University Paris-Dauphine, France
Florian Sikora, University Paris-Dauphine, France
Georgios Stamoulis, University Paris-Dauphine, France

--
Vangelis Th. Paschos
LAMSADE, University Paris-Dauphine, CNRS and IUF
http://www.lamsade.dauphine.fr/~paschos/

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

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 80, Issue 22
**************************************

Tuesday, October 28, 2014

dmanet Digest, Vol 80, Issue 21

Friday, October 24, 2014

dmanet Digest, Vol 80, Issue 20

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. CiE 2015: Evolving Computability, Bucharest, June 29 - July
3, 2015 (S B Cooper)
2. TU Graz: One Postdoctoral Position in Combinatorics (Mihyun Kang)
3. Call for papers for the conference MEGA 2015 (Monique Laurent)
4. CFP SEA 2015 (Evripidis Bampis)

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

Message: 1
Date: Wed, 22 Oct 2014 21:42:37 +0100 (BST)
From: S B Cooper <pmt6sbc@maths.leeds.ac.uk>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CiE 2015: Evolving Computability, Bucharest, June 29
- July 3, 2015
Message-ID: <201410222042.s9MKgbaf025758@maths.leeds.ac.uk>

1st CALL FOR PAPERS:
COMPUTABILITY IN EUROPE 2015: Evolving Computability
Bucharest, Romania
June 29 - July 3
http://fmi.unibuc.ro/CiE2015/

IMPORTANT DATES:

Submission Deadline for LNCS: 11 January 2015
Notification of authors: 9 March 2015
Deadline for final revisions: 6 April 2015

CiE 2015 is the 11th conference organized by CiE (Computability
in Europe), a European association of mathematicians, logicians,
computer scientists, philosophers, physicists and others
interested in new developments in computability and their
underlying significance for the real world. Previous meetings
have taken place in Amsterdam (2005), Swansea (2006), Siena
(2007), Athens (2008), Heidelberg (2009), Ponta Delgada (2010),
Sofia (2011), Cambridge (2012), Milan (2013) and Budapest (2014).

Evolution of the universe, and us within it, invite a parallel
evolution in understanding. The CiE agenda - fundamental and
engaged - targets the extracting and developing of computational
models basic to current challenges. From the origins of life, to
the understanding of human mentality, to the characterising of
quantum randomness - computability theoretic questions arise in
many guises. The CiE community, this coming year meeting for the
first time in Bucharest, carries forward the search for
coherence, depth and new thinking across this rich and vital
field of research.

In all cases we are looking for fundamental and theoretical
submissions. In line with other conferences in this series, CiE
2015 has a broad scope and provides a forum for the discussion of
theoretical and practical issues in Computability with an
emphasis on new paradigms of computation and the development of
their mathematical theory.

We particularly invite papers that build bridges between
different parts of the research community.

For topics covered by the conference, please visit
http://fmi.unibuc.ro/CiE2015/topics.html

TUTORIAL SPEAKERS

* John Reif (Duke Unversity)
* Steve Simpson (Pennsylvania State University)

CONFIRMED PLENARY SPEAKERS

* Ann Copestake (University of Cambridge)
* Mircea Dumitru (University of Bucharest, Public Lecture)
* Pawel Gawrychowski (Max-Planck-Institut fuer Informatik)
* Julia Knight (University of Notre Dame)
* Anca Muscholl (Universite Bordeaux)
* Gheorghe Paun (Romanian Academy)
* Alexander Razborov (University of Chicago
and Steklov Mathematical Institute)
* Vlatko Vedral (University of Oxford)

SPECIAL SESSIONS on

* Representing streams
(Organizers: Joerg Endrullis and Dimtri Hendriks)
* Automata, logic and infinite games
(Organizers: Dietmar Berwanger and Ioana Leustean)
* Reverse mathematics
(Organizers: Damir Dzhafarov and Alberto Marcone)
* Classical computability theory
(Organizers: Marat Arslanov and Steffen Lempp)
* Bio-inspired computation
(Organizers: Andrei Paun and Petr Sosik)
* History and philosophy of computing
(Organizers: Christine Proust and Marco Benini)

The PROGRAMME COMMITTEE consists of:

* Marat Arslanov (Kazan) * Jeremy Avigad (Pittsburgh)
* Veronica Becher (Buenos Aires) * Arnold Beckmann (Swansea)
* Laurent Bienvenu (Paris) * Alessandra Carbone (Paris)
* Gabriel Ciobanu (Iasi) * S Barry Cooper (Leeds)
* Laura Crosilla (Leeds) * Liesbeth De Mol (Ghent)
* Walter Dean (Warwick) * Volker Diekert (Stuttgart)
* Damir Dzhafarov (Storrs, Connecticut)
* Peter van Emde Boas (Amsterdam) * Rachel Epstein (Harvard)
* Johanna Franklin (Hempstead, NY) * Neil Ghani (Glasgow)
* Joel David Hamkins (New York) * Rosalie Iemhoff (Utrecht)
* Emmanuel Jeandel (LORIA) * Natasha Jonoska (Tampa, FL)
* Antonina Kolokolova (St.John's, NL)
* Antonin Kucera (Prague) * Oliver Kutz (Magdeburg)
* Benedikt Loewe (Hamburg & Amsterdam)
* Jack Lutz (Ames, IA) * Florin Manea (Kiel)
* Alberto Marcone (Udine) * Radu Mardare (Aalborg)
* Joe Miller (Madison, WI)
* Russell Miller (Flushing, NY) * Mia Minnes (La Jolla, CA)
* Victor Mitrana (Bucharest, co-chair)
* Ian Pratt-Hartmann (Manchester) * Dag Normann (Oslo)
* Mehrnoosh Sadrzadeh (London) * Anne Smith (St Andrews)
* Mariya Soskova (Sofia, co-chair) * Susan Stepney (York)
* Paul Spirakis (Patras & Liverpool)
* Jacobo Toran (Ulm) * Marius Zimand (Towson, MD)

The PROGRAMME COMMITTEE cordially invites all researchers
(European and non-European) in computability related areas to
submit their papers (in PDF format, max 10 pages using the LNCS
style) for presentation at CiE 2015.

The submission site
https://www.easychair.org/conferences/?conf=cie2015
is open.

For submission instructions consult
http://fmi.unibuc.ro/CiE2015/submission.html

The CONFERENCE PROCEEDINGS will be published by LNCS, Springer
Verlag.

____________________________________________________________________

CiE 2015 http://fmi.unibuc.ro/CiE2015/

ASSOCIATION COMPUTABILITY IN EUROPE http://www.computability.org.uk
CiE Conference Series http://www.illc.uva.nl/CiE
CiE Membership Application Form http://www.lix.polytechnique.fr/CIE
Computability (Journal of CiE) http://www.computability.de/journal/
CiE on FaceBook https://www.facebook.com/AssnCiE
Association CiE on Twitter https://twitter.com/AssociationCiE

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

Message: 2
Date: Fri, 24 Oct 2014 09:47:52 +0200
From: Mihyun Kang <kang@math.tugraz.at>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] TU Graz: One Postdoctoral Position in Combinatorics
Message-ID: <544A0428.8070901@math.tugraz.at>
Content-Type: text/plain; charset=utf-8; format=flowed

------------------------------------------------------------------------------
TU Graz: One Postdoctoral Position in Combinatorics
------------------------------------------------------------------------------

We are seeking outstanding candidates with expertise and proficiency in
analytic and enumerative combinatorics, singularity analysis,
saddle-point methods, cycle index sums, Boltzmann sampler, probabilistic
and structural graph theory.

The successful candidate will be employed as a Postdoctoral Researcher
for one year with a possibility of extension for a further period of
maximum two years within the Austrian Science Fund (FWF) Research
Project on

"Asymptotic Properties of Graphs on a Surface"

at the Institute of Optimisation and Discrete Mathematics at Graz
University of Technology (TU Graz), Austria,
http://www.math.tugraz.at/mathb/.

This is a research position and does not carry any teaching
responsibilities. There is however a possibility to teach if one wishes
to do so. The preferred starting date is 1 March 2015, but negotiable.

The basic salary is specified in the FWF standard personnel costs and
salaries https://www.fwf.ac.at/en/research-funding/personnel-costs/.
There are extra salary payments, the so-called 13th- and 14th-month
salaries which are favourably taxed.

There are very active research groups working on Discrete Mathematics
and Combinatorics at TU Graz. For example, TU Graz hosts a doctoral
school "Discrete Mathematics" (funded by FWF)
https://www.math.tugraz.at/discrete/.

Further information about the mathematical institutes at TU Graz is
available at https://www.math.tugraz.at/

Condition of employment:
- Qualified candidates must hold a PhD degree in mathematics or
theoretical computer science before the time of appointment

Application documents:
- Cover letter of application
- Curriculum vitae including the list of publications
- A short statement of research interests
- A list of full contact information of two references who can submit
letters of recommendation

All application documents with reference number P27290 (Kennzahl:
P27290) should be electronically submitted in a PDF file by 15 December
2014 to Ms Sandra Wissler, sandra.wissler@tugraz.at.

For further details concerning the content of the research project or to
make an informal inquiry, please contact

Mihyun Kang or Philipp Spr?ssel
Graz University of Technology
Institute of Optimization and Discrete Mathematics (Math B)
Steyrergasse 30
8010 Graz, Austria
Email: kang@math.tugraz.at
spruessel@math.tugraz.at

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

Message: 3
Date: Fri, 24 Oct 2014 12:56:13 +0200 (CEST)
From: Monique Laurent <M.Laurent@cwi.nl>
To: dmanet <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Call for papers for the conference MEGA 2015
Message-ID: <458014700.3208386.1414148173911.JavaMail.zimbra@cwi.nl>
Content-Type: text/plain; charset=utf-8

***************************************************************

Second announcement and call for papers / computations / posters

***************************************************************

MEGA 2015

Effective Methods in Algebraic Geometry
University of Trento, Department of Mathematics,
Povo (Trento) Italy
June 15-19, 2015

This is the 25th anniversary of MEGA. During the conference we will
celebrate this anniversary with a special afternoon programme at a small
lake surrounded by the hills near Trento.

Further information: http://mega2015.science.unitn.it/
Submission page: https://easychair.org/conferences/?conf=mega2015

***************************************************************

MEGA is the acronym for Effective Methods in Algebraic Geometry (and
its equivalent in many other languages). This series of biennial
international conferences, with a tradition dating back to 1990, is
devoted to computational and application aspects of Algebraic Geometry
and related topics.

The conference will comprise invited talks, regular contributed talks,
presentations of computations, and a poster session; the latter three
are subject to a competitive submission process.

Invited speakers:

Carlos Beltran (University of Cantabria, Spain)
Alessandra Bernardi (University of Bologna, Italy)
Petter Br?nd?n (KTH Royal Institute of Technology, Sweden)
Elisa Gorla (University of Neuch?tel, Switzerland)
Hans-Christian Graf von Bothmer (Georg-August University G?ttingen, Germany)
Anders Jensen (Aarhus University, Denmark)
Michael Joswig (Technical University of Berlin, Germany)
Frank Sottile (Texas A&M University, USA)
Caroline Uhler (Institute of Science and Technology, Austria)

Special invited talk during the special afternoon:

Daniel Lazard (Paris 6) on the history of MEGA and
related groups

Important dates:

Deadline for submissions of papers/extended abstracts:
1 December 2014
Notification of acceptance of papers/extended abstracts:
15 February 2015

Deadline for submission of posters/computation presentatations:
15 March 2015
Notification of acceptence of posters/computation presentations:
15 April 2015

Deadline for registration and fee payment: TBD

Submissions: Submissions should contain recent original research relevant
to effective methods in algebraic geometry (in a broad sense), including
their foundations, analysis, complexity, computational aspects, practical
issues and applications. On this occasion we especially encourage
submissions related to finite fields, cryptography and coding theory,
as we would like to have a session specifically devoted to these topics.

There are three types of submissions, distributed over the two deadlines
above:

- Regular papers: for these, authors can choose to submit
either an extended abstract of at least four pages (not counting
bibliography) that should contain full results, an outline of the proofs
and all of the main ideas; or else a full paper with complete proofs.

- Computation presentations: these can concern new software packages,
but also experiments with (combinations) existing software that have
led to new computational approaches to mathematical proofs/applications
relevant to MEGA. Submission should be in the form of a short paper
describing the software or computations.

- Posters: to be printed on A1, the posters will be exhibited
during most of the conference, and during a poster session the authors
will have the opportunity to discuss their work with the conference
participants.

All submissions should clearly state the contributions and achievements,
with sufficient detail to understand their significance.

Submissions may contain material already submitted elsewhere, but this
fact has to be stated explicitly in the abstract. Acceptance of such
submissions depends on their special significance for the community.

Papers are to be submitted online through the Easy Chair interface,
available at
https://easychair.org/conferences/?conf=mega2015

Acceptance of a submitted contribution means acceptance for oral or
poster presentation only. A special issue of a journal is planned to
which authors of accepted original papers will be invited to submit the
full version after the conference. Only original research contributions
will be considered for publication in the journal special issue.

Executive committee: Jan Draisma (Eindhoven, Netherlands, Chair),
Willem de Graaf (Trento, Italy), Julia Hartmann (Aachen, Germany),
Monique Laurent (Amsterdam, Netherlands), Anton Leykin (Atlanta, GA,
USA), Teo Mora (Genova, Italy), Giorgio Ottaviani (Firenze, Italy),
Tomas Recio (Santander, Spain), Fabrice Rouillier (Paris, France),
Josef Schicho (Linz, Austria)

Local committee: Anna Bigatti (Genova, Italy), Willem De Graaf (Trento,
Italy), Patrizia Gianni (Pisa, Italy), Giorgio Ottaviani (Firenze,
Italy), Margherita Roggero (Torino, Italy), Massimiliano Sala (Trento,
Italy, Chair)
:

Carlos Beltran (University of Cantabria, Spain)
Alessandra Bernardi (University of Bologna, Italy)
Petter Br?nd?n (KTH Royal Institute of Technology, Sweden)
Elisa Gorla (University of Neuch?tel, Switzerland)
Hans-Christian Graf von Bothmer (Georg-August University G?ttingen, Germany)
Anders Jensen (Aarhus University, Denmark)
Michael Joswig (Technical University of Berlin, Germany)
Frank Sottile (Texas A&M University, USA)
Caroline Uhler (Institute of Science and Technology, Austria)

Special invited talk during the special afternoon:

Daniel Lazard (Paris 6) on the history of MEGA and
related groups

Important dates:

Deadline for submissions of papers/extended abstracts:
1 December 2014
Notification of acceptance of papers/extended abstracts:
15 February 2015

Deadline for submission of posters/computation presentatations:
15 March 2015
Notification of acceptence of posters/computation presentations:
15 April 2015

Deadline for registration and fee payment: TBD

Submissions: Submissions should contain recent original research relevant
to effective methods in algebraic geometry (in a broad sense), including
their foundations, analysis, complexity, computational aspects, practical
issues and applications. On this occasion we especially encourage
submissions related to finite fields, cryptography and coding theory,
as we would like to have a session specifically devoted to these topics.

There are three types of submissions, distributed over the two deadlines
above:

- Regular papers: for these, authors can choose to submit
either an extended abstract of at least four pages (not counting
bibliography) that should contain full results, an outline of the proofs
and all of the main ideas; or else a full paper with complete proofs.

- Computation presentations: these can concern new software packages,
but also experiments with (combinations) existing software that have
led to new computational approaches to mathematical proofs/applications
relevant to MEGA. Submission should be in the form of a short paper
describing the software or computations.

- Posters: to be printed on A1, the posters will be exhibited
during most of the conference, and during a poster session the authors
will have the opportunity to discuss their work with the conference
participants.

All submissions should clearly state the contributions and achievements,
with sufficient detail to understand their significance.

Submissions may contain material already submitted elsewhere, but this
fact has to be stated explicitly in the abstract. Acceptance of such
submissions depends on their special significance for the community.

Papers are to be submitted online through the Easy Chair interface,
available at
https://easychair.org/conferences/?conf=mega2015

Acceptance of a submitted contribution means acceptance for oral or
poster presentation only. A special issue of a journal is planned to
which authors of accepted original papers will be invited to submit the
full version after the conference. Only original research contributions
will be considered for publication in the journal special issue.

Executive committee: Jan Draisma (Eindhoven, Netherlands, Chair),
Willem de Graaf (Trento, Italy), Julia Hartmann (Aachen, Germany),
Monique Laurent (Amsterdam, Netherlands), Anton Leykin (Atlanta, GA,
USA), Teo Mora (Genova, Italy), Giorgio Ottaviani (Firenze, Italy),
Tomas Recio (Santander, Spain), Fabrice Rouillier (Paris, France),
Josef Schicho (Linz, Austria)

Local committee: Anna Bigatti (Genova, Italy), Willem De Graaf (Trento,
Italy), Patrizia Gianni (Pisa, Italy), Giorgio Ottaviani (Firenze,
Italy), Margherita Roggero (Torino, Italy), Massimiliano Sala (Trento,
Italy, Chair)

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

Message: 4
Date: Fri, 24 Oct 2014 14:10:19 +0200
From: Evripidis Bampis <Evripidis.Bampis@lip6.fr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CFP SEA 2015
Message-ID: <f3284f9cc08005ad5d3bb2f0cde55573@newmail.lip6.fr>
Content-Type: text/plain; charset=UTF-8; format=flowed

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

14th International Symposium on Experimental Algorithms

http://sea2015.lip6.fr
June 29 - July 1, 2015
Paris, France

Call for Papers

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

IMPORTANT DATES

Submission deadline: February 6, 2015
Author notification: March 16, 2015
Camera-ready submission: April 3, 2015

AIMS & SCOPE

SEA is an international forum for researchers in the area of design,
analysis, and experimental evaluation and engineering of algorithms,
as well as in various aspects of computational optimization and
its applications. The preceding symposia were held in Riga, Monte
Verita, Rio de Janeiro, Santorini, Menorca Island, Rome, Cape Cod,
Dortmund, Ischia Island, Crete, Bordeaux, Rome and Copenhagen.

The main theme of the symposium is the role of experimentation and
of algorithm-engineering techniques in the design and evaluation of
algorithms and data structures. Submissions should present
significant contributions supported by experimental evaluation,
methodological issues in the design and interpretation of
experiments, the use of (meta-)heuristics, or application-driven
case studies that deepen the understanding of the complexity of a
problem.

Topics of interest include, but are not limited to:

- Algorithm Engineering
- Algorithmic Libraries
- Algorithmic Mechanism Design
- Analysis of Algorithms
- Algorithms for Memory Hierarchies
- Approximation Techniques
- Bioinformatics
- Branch-and-Bound Algorithms
- Combinatorial and Irregular Problems
- Combinatorial Structures and Graphs
- Communication Networks
- Complex Networks
- Computational Geometry
- Computational Learning Theory
- Computational Optimization
- Computer Systems
- Cryptography and Security
- Data Streams
- Data Structures
- Distributed and Parallel Algorithms
- Evaluation of Algorithms for Realistic Environments
- Experimental Techniques and Statistics
- Graph Drawing
- Heuristics for Combinatorial Optimization
- Implementation, Testing, Evaluation and Fine-tuning
- Information Retrieval
- Integer Programming
- Logistics and Operations Management
- Machine Learning and Data Mining
- Mathematical Programming
- Metaheuristic Methodologies
- Multiple Criteria Decision Making
- Network Analysis
- Novel Applications of Algorithms in Other Disciplines
- Online Problems
- Parallel Algorithms and Computing
- Railway Optimization using Algorithmic Methods
- Randomized Techniques
- Robotics
- Semidefinite Programming
- Simulation
- Software Repositories and Platforms for using Algorithms
- Telecommunications and Networking
- World-Wide-Web Algorithms

PROGRAM COMMITTEE

Eric Angel, Evry
Evripidis Bampis, Paris (chair)
Vincenzo Bonifaci, Rome
David Coudert, Sophia Antipolis
Christoph D?rr, Paris
Thomas Erlebach, Leicester
Loukas Georgiadis, Ioannina
Leo Liberti, Yorktown Heights
Giorgio Lucarelli, Grenoble
Alberto Marchetti-Spaccamela, Rome
Sotiris Nikoletseas, Patras
Aris Pagourtzis, Athens
Marina Papatriantafylou, G?teborg
Vijaya Ramachandran, Austin
Nicolas Schabanel, Paris
Maria Serna, Barcelona
Frits Spieksma, Leuven
Clifford Stein, New York
Dorothea Wagner, Karlsruhe
Renato Werneck, San Francisco
Christos Zaroliagis, Patras
Norbert Zeh, Halifax

SUBMISSIONS

Authors are invited to submit high-quality manuscripts reporting
original unpublished research and recent developments in the topics
related to the symposium. Simultaneous submission to other
conferences or workshops with published proceedings is not allowed.

Submissions must not exceed 12 pages formatted according to LNCS
style plus an optional, clearly marked appendix of reasonable
length (to be read at the program committee's discretion). All papers
will be peer reviewed and comments will be provided to the authors.

PROCEEDINGS

Accepted papers will appear in the SEA 2015 proceedings published
by Springer in the LNCS series.

CONTACT

For further information, please send an e-mail to
evripidis.bampis@lip6.fr.

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

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 80, Issue 20
**************************************

dmanet Digest, Vol 80, Issue 19

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. CNSM 2014 -- Call for Participation (Giovane C. M. Moura)
2. 2nd Call for Papers: CP-AI-OR 2015 (David Bergman)
3. APPROX/RANDOM'14 Proceedings published open access (LIPIcs,
Vol.28) (Marc Herbstritt (Dagstuhl))
4. TU Graz: Professor Position in Computational Topology and
Geometry (Mihyun Kang)
5. CFP (IndiaCom 2015 special session) (Viktor Toldov)

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

Message: 1
Date: Thu, 23 Oct 2014 13:00:35 +0200
From: "Giovane C. M. Moura" <g.c.moreiramoura@tudelft.nl>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CNSM 2014 -- Call for Participation
Message-ID: <5448DFD3.1040903@tudelft.nl>
Content-Type: text/plain; charset=utf-8

(Apologies if you receive multiple copies of the Call for Participation)

-----------------------------------------------------------------------------------------------------
CALL FOR PARTICIPATION

CNSM 2014
International Conference on Network and Service Management

November 17-21, 2014
Rio de Janeiro, Brazil

http://www.cnsm-conf.org/2014/

************************************************************************************************
*** Standard registration fees expire in one week - October 27th!
***
*** REGISTER NOW AT http://www.cnsm-conf.org/2014/registration.html ***
************************************************************************************************

Follow us on the social networks for all the latest news:
- Facebook: https://www.facebook.com/pages/CNSM-2014/1428943997353010
- Twitter: https://twitter.com/cnsm2014
- Google+: https://plus.google.com/105546746070456492345
- LinkedIn: http://www.linkedin.com/groups/CNSM-2014-6683605

-----------------------------------------------------------------------------------------------------
The organizing committee is delighted to invite you to the 10th
International Conference on Network and Service Management (CNSM 2014),
to be held in Rio de Janeiro, Brazil, November 17-21, 2014. CNSM is the
premier annual conference in the general area of network and services
management. It has become a premier venue for the presentation of novel
results and experience reports in all aspects of management of networks,
pervasive systems, enterprises, and cloud computing environments. The
conference is technically co-sponsored by IFIP, IEEE Communications
Society and IEEE Computer Society.

CONFIRMED KEYNOTE SPEAKERS
- Randy Katz, U.C. Berkeley, USA
- Deep Medhi, UMKC, USA
- Danny Raz, Bell Labs and Technion, Israel (ManSDN/NVF workshop)
- Scott Shenker, U.C. Berkeley/ICSI, USA

PRELIMINARY PROGRAM
- Program at a glance: http://www.cnsm-conf.org/2014/program.html
- Technical program: http://www.cnsm-conf.org/2014/program-detail.html

WORKSHOPS AND CO-LOCATED EVENTS
- 1st International Workshop on Management of SDN and NFV Systems
(ManSDN/NFV): http://www.cnsm-conf.org/2014/sdnnfv2014.html
- Technical program:
http://www.cnsm-conf.org/2014/mansdn-program-detail.html
- 35th IRTF's Network Management Research Group (NMRG) meeting:
http://www.cnsm-conf.org/2014/nmrg.html

-----------------------------------------------------------------------------------------------------
PATRONS

- Gold: CGI.br/NIC.br, CAPES, DMTF, EMC
- Bronze: Google Brasil, HP, Globo.com, IEEE Software-Defined Networks
Initiative

-----------------------------------------------------------------------------------------------------
ORGANIZING COMMITTEE

General Co-Chairs
- Lisandro Zambenedetti Granville, Federal University of Rio Grande do
Sul, Brazil
- Luciano Paschoal Gaspary, Federal University of Rio Grande do Sul, Brazil

Technical Program Co-Chairs
- Danny Raz, Bell Labs Israel and Technion, Israel
- Michele Nogueira, Federal University of Paran?, Brazil

Workshops Co-Chairs
- Filip De Turck, Ghent University - iMinds, Belgium
- Jos? Marcos Silva Nogueira, Federal University of Minas Gerais, Brazil

Publication Co-Chairs
- Brendan Jennings, EMC? and Waterford Institute of Technology, Ireland
- Edmundo Roberto Mauro Madeira, State University of Campinas, Brazil

Steering Committee
- Raouf Boutaba, University of Waterloo, Canada
- Marcus Brunner, Swisscom, Switzerland
- Prosper Chemouil, Orange Labs, France
- James Hong, POSTECH, Korea
- Deep Medhi, University of Missouri-Kansas City, USA
- Aiko Pras, University of Twente, The Netherlands
- Doug Zuckerman, Applied Communication Sciences, USA

More info at http://www.cnsm-conf.org/2014/

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

Message: 2
Date: Thu, 23 Oct 2014 19:24:14 +0000
From: David Bergman <David.Bergman@business.uconn.edu>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] 2nd Call for Papers: CP-AI-OR 2015
Message-ID:
<A0DD85776DE5794F9A5234FAFCCA98B36A4DC1@SB1-EX10DAG-1C.business.uconn.edu>

Content-Type: text/plain; charset="Windows-1252"

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

** 2nd Call for Papers: CP-AI-OR 2015 **

The Twelfth International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming will be held in Barcelona, Spain, May 18-22, 2015 with Workshops on May 18th, a Master Class on Verification and Constraint Programming on May 19, and the Main Conference on May 20-22, 2015.

Conference Location: Barcelona, Spain
Conference Dates: May 18 ? May 22, 2015
Conference Website: http://www.cpaior2015.uconn.edu/
Conference Series: http://www.andrew.cmu.edu/user/vanhoeve/cpaior/
Contact: cpaior2015@gmail.com

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

** Deadlines **

Paper Deadlines (for long and short papers):

Abstract due: November 14, 2014 11.59 P.M. EDT
Paper due: November 21, 2014 11.59 P.M. EDT
Rebuttal Phase: December 20-23, 2014
Final Notification: January 9, 2015
Camera-ready version due: February 20, 2015

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

** Conference Details **

The aim of the conference is to bring together interested researchers from Constraint Programming (CP), Artificial Intelligence (AI), and Operations Research (OR) to present new techniques or applications in combinatorial optimization and to provide an opportunity for researchers in one area to learn about techniques in the others. A main objective of this conference series is also to give these researchers the opportunity to show how the integration of techniques from different fields can lead to interesting results on large and complex problems. Therefore papers that actively combine, integrate, or contrast approaches from more than one of the areas are especially solicited. High quality papers from a single area are also welcome, provided that they are of interest to other communities involved. Application papers showcasing CP/AI/OR techniques on novel and challenging applications or experience reports on such applications are strongly encouraged.

The program committee invites submissions that include but are not limited to the following topics:

? Inference and relaxation methods: constraint propagation, cutting planes, global constraints, graph algorithms, dynamic programming, Lagrangean and convex relaxations, heuristic functions based on constraint relaxation.
? Search methods: branch and bound, intelligent backtracking, incomplete search, randomized search, portfolios, column generation, Benders decompositions or any other decomposition methods, local search, meta-heuristics.
? Integration methods: solver communication, model transformations and solver selection, parallel and distributed resolution techniques, models, and solvers.
? Modeling methods: comparison of models, symmetry breaking, uncertainty, dominance relationships.
? Innovative Applications of CP/AI/OR techniques.
? Implementation of CP/AI/OR techniques and optimization systems.

Paper submissions are of two types: long and short papers. Additionally, a new Fast Track journal publication track is being introduced.

The schedule for submissions is as follows:

Abstract due: November 14, 2014 11.59 P.M. EDT
Paper due: November 21, 2014 11.59 P.M. EDT
Rebuttal Phase: December 20-23, 2014
Final Notification: January 9, 2015
Camera-ready version due: February 20, 2015

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

** Instructions for Long Papers **

Long papers should present original unpublished work and be at most 15 pages plus references in length, and should be prepared in the format used for the Springer Lecture Notes in Computer Science (http://www.springer.de/comp/lncs/authors.html). These papers will undergo rigorous review. The proceedings will be published in the Springer Lecture Notes in Computer Science series.

Note: Unlike previous CP-AI-OR conferences the page limit for long papers is 15 LNCS pages *plus references*.

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

** Instructions for Short Papers **

Short papers are also encouraged, limited to 8 LNCS pages plus references and should be prepared with the same format as long papers (http://www.springer.de/comp/lncs/authors.html). Although containing less material, short papers should describe original unpublished work and will be reviewed to the same criteria of quality as long papers. It is also encouraged to submit short papers about work in progress on ideas that are interesting but for which the practical or theoretical relevance is not yet fully identified. Short papers will be presented at the conference and published in the conference proceedings.

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

** NEW! Instructions for Journal Fast Track **

Outstanding submissions to the technical program will be offered the opportunity to be published exclusively through a `fast track' process in the Constraints Journal (http://www.springer.com/computer/ai/journal/10601). Authors of these papers can opt to extend their paper from 15 to 20 pages plus references (subject to a minor second round of review) and be accepted directly in the Journal by the time of the conference. Invited authors who select to fast track their paper will receive a 1 page extended abstract in the conference proceedings and will be invited to present at the conference on the same ground as any other accepted submission. Fast Track Journal papers should be formatted according to the journal?s guidelines: (http://www.springer.com/computer/ai/journal/10601).

The important dates for fast track papers are:

Author Opt-in decision: January 16, 2015
Extended submission due for 2nd review: January 30, 2015
Journal Fast Track Decision: February 13th, 2015
Camera-ready extended abstract (or standard paper): February 20th, 2015
Camera-ready for Journal Fast Track: March 6th, 2015

Authors who decline to fast track their submission revert to a standard conference submission and are subject to the default formatting, length and date requirements. Papers that do not clear the 2nd review round also revert to conference paper status and their authors are expected to deliver the camera-ready version of the initial submission by February 20, 2015.

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

** Submission Process **

All papers are to be submitted electronically in PDF format by following the instructions at the URL http://www.easychair.org/conferences/?conf=cpaior2015.

For any queries on the submission process, please contact the Program Chairs using the email cpaior2015@gmail.com.

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

** Organizers **

Program Chair: Laurent Michel
Conference Chair: Carlos Ansotegui
Local Organizing Committee: Maria Bonet, Jordi Levy, Mateu Villaret

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

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

Message: 3
Date: Fri, 24 Oct 2014 08:44:49 +0200
From: "Marc Herbstritt (Dagstuhl)" <publishing@dagstuhl.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] APPROX/RANDOM'14 Proceedings published open access
(LIPIcs, Vol.28)
Message-ID: <5449F561.3050704@dagstuhl.de>
Content-Type: text/plain; charset=utf-8

= Book Announcement =

Title: Approximation, Randomization, and Combinatorial Optimization.
Algorithms and Techniques (APPROX/RANDOM 2014)
Editors: Klaus Jansen, Jos? D. P. Rolim, Nikhil R. Devanur, Cristopher
Moore
Series: LIPIcs (Leibniz International Proceedings in Informatics)
Volume: 28
Publisher: Schloss Dagstuhl - Dagstuhl Publishing
ISBN: 978-3-939897-74-3

== Access ==

Open access (online & free of charge; CC-BY license) at

http://www.dagstuhl.de/dagpub/978-3-939897-74-3

You may also check the dblp page at

http://dblp.uni-trier.de/db/conf/approx/approx2014.html

== About the Proceedings ==

This volume contains the papers presented at the 17th International
Workshop on Approximation Algorithms for Combinatorial Optimization
Problems (APPROX 2014) and the 18th International Workshop on
Randomization and Computation (RANDOM 2014), which took place
concurrently in Universitat Polite?cnica de Catalunya Barcelona, Spain,
during September 4?6, 2014.

See also:
* Frontmatter incl. table of contents and preface:
http://dx.doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.i
* http://cui.unige.ch/tcs/random-approx/2014/index.php

== About the APROX/RANDOM Workshops ==

APPROX focuses on algorithmic and complexity issues surrounding the
development of efficient approximate solutions to computationally
difficult problems. RANDOM is concerned with applications of randomness
to computational and combinatorial problems

== About the LIPIcs Series ==

"LIPIcs: Leibniz International Proceedings in Informatics" is a series
of high-quality conference proceedings across all fields in informatics
established in cooperation with "Schloss Dagstuhl--Leibniz Center of
Informatics". LIPIcs volumes are published according to the principle
of OpenAccess, i.e., they are available online and free of charge for
the reader.

See also:
* http://www.dagstuhl.de/lipics (editorial setup)
* http://drops.dagstuhl.de/lipics (all volumes)

--
Dr. Marc Herbstritt
Schloss Dagstuhl - Leibniz-Zentrum f?r Informatik
\\\/ Dagstuhl Publishing | LIPIcs Editorial Office
Email: publishing@dagstuhl.de
http://www.dagstuhl.de/lipics

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

Message: 4
Date: Fri, 24 Oct 2014 11:45:50 +0200
From: Mihyun Kang <kang@math.tugraz.at>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] TU Graz: Professor Position in Computational
Topology and Geometry
Message-ID: <544A1FCE.4070008@math.tugraz.at>
Content-Type: text/plain; charset=utf-8; format=flowed

Dear colleagues,

TU Graz is offering a professor position in Computational Topology and
Geometry. The deadline for applications is October 31, 2014.

For details see http://www.geometrie.tugraz.at/comp_top_geom/

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

Message: 5
Date: Fri, 24 Oct 2014 12:09:07 +0200 (CEST)
From: Viktor Toldov <viktor.toldov@inria.fr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CFP (IndiaCom 2015 special session)
Message-ID:
<205969904.15510979.1414145347698.JavaMail.zimbra@inria.fr>
Content-Type: text/plain; charset=utf-8

[We apologize if you receive multiple copies of this message.]

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

CALL FOR PAPERS

---------------
We invite you to contribute to the special session of the Indiacom 2015 conference. Please, find the details below.

Session Title:
Wireless Sensor Networks for sustainable development
>From low layer communications to Software Oriented Architecture

Special Issue at IndiaCom 2015 (http://www.bvicam.ac.in/indiacom/)

With the recent advances in many fields of technologies, wireless sensor networks have gained in attention and are more and more envisioned for a large set of purposes ranging from environment monitoring to rescue operation ranging from health assistance or factory monitoring. For many of these applications, the use of this new technology allows more energy saving and sustainability.
The main focus of this special session ?Wireless Sensor Networks for sustainable development ? From low layer communications to Software Oriented Architecture? in IndiaCom 2015 is to review and assess all the research done in the wireless sensor network area for sustainability.

Topics of particular interest include, but are not limited to:
- WSN-based paradigms and architectures for sustainable applications and technologies
- WSN Software oriented architectures
- Tools for developing sustainable WSN applications
- WSN cloud vs distributed computing
- Security and privacy control mechanisms
- Performance assessment and management (QoS, scalability, reliability, etc)
- PHY layer, Spectrum management for energy-efficiency
- MAC protocols (e.g., scheduling, power control etc.) for energy-efficiency
- Mobility management
- Object, device and service management
- Sustainable design and technologies (e.g. energy-efficiency)
- Test-beds and field trials
- Standardization and regulatory issues?

General chairs:
- Dr Nathalie Mitton, Inria, France
- Prof.Dr.O.P.Vyas, Indian Institute of Information Technology Allaha, India

Program committee members (tentative):
- Dr Milan Erdelj, UTC, France
- Dr Ibrahim Amadou, Universit? de Valenciennes, France
- Dr Nicola Zema, Mediterranean University of Reggio Calabria, Italy
- Dr. D.S.Kushwaha , Motilal Nehru National Institute of Technology, Allahabad (UP), India
- Akhilendra Pratap Singh, Department of Computer Science & Engineering, National Institute of Technology, Meghalaya, India
- Anuj Kumar Dwivedi, School of Computer Science & I.T., Pt.R.S.University Raipur (CG), India

Publicity chairs:
- Viktor Toldov, Universit? Lille 1, Inria, France
- Anuj Dwivedi, Indian Institute of Information Technology Allaha, India

Submission guidelines :
Authors are invited to submit original unpublished manuscripts by using the following link: https://easychair.org/conferences/?conf=indiacom15sustainabl
Papers should demonstrate current research. Paper submissions should be no longer than 6 pages with a font size of 10 using the IEEE conference template. Papers must be submitted electronically as PDF files. All submitted papers will be subject to peer reviews by Technical Program Committee members and other experts in the field. Please, note that at least one author of each accepted paper must register and attend the workshop to present the paper. Failure to present the paper at the workshop will result in the withdrawal of the paper from the Proceedings.

Important dates :
Submission Deadline: November 10, 2014
Acceptance Notification: January 12, 2015
Camera Ready Due: January 22, 2015
Registration deadline : January 22, 2015
Conference Dates: March 11-13, 2015

All information about the special issue :
http://www.bvicam.ac.in/indiacom/splSessionDetails.asp?sessionRequestID=18
All information about IndiaCom:
http://www.bvicam.ac.in/indiacom/

Contacts:
Nathalie.mitton@inria.fr
dropvyas@gmail.com

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

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 80, Issue 19
**************************************