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. Second call for papers: APAL special issue on games for logic
and programming languages (Guy McCusker)
2. 36 month postdoc position at Bath (Guy McCusker)
3. Postdoctoral position - UWA (Perth, Australia) (Gordon Royle)
4. School on Parameterized Algorithms and Complexity (second
announcement, and application details) (Marcin Pilipczuk)
5. PhD Thesis proposal: belief functions in optimization
(Daniel Porumbel)
6. PCCR 2014: 2nd Workshop on the Parameterized Complexity of
Computational Reasoning (sergeg@cse.unsw.edu.au)
7. ACM CHANTS 2014 (co-located with ACM MobiCom): initial
announcement and call for papers (Elisabetta Biondi)
----------------------------------------------------------------------
Message: 1
Date: Tue, 8 Apr 2014 07:12:29 +0100
From: Guy McCusker <G.A.McCusker@bath.ac.uk>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Second call for papers: APAL special issue on games
for logic and programming languages
Message-ID: <40FBCB43-0346-4106-BBDD-7F96118F80F5@bath.ac.uk>
Content-Type: text/plain; charset=us-ascii
ANNALS OF PURE AND APPLIED LOGIC (APAL)
SPECIAL ISSUE ON GAMES FOR LOGIC AND PROGRAMMING LANGUAGES
CALL FOR PAPERS
TOPIC
Game semantics has emerged as a new and successful paradigm in the field of semantics of logics and programming languages. Game semantics made its breakthrough in computer science in the early 90s, providing an innovative set of methods and techniques for the analysis of logical
systems. Subsequently, game-semantic techniques led to the development of the first syntax-independent fully-abstract models for a variety of programming languages, ranging from the purely functional to languages effects such as control, references or concurrency. Nowadays, game semantics has expanded to a variety of fields in theory and analysis of computation, such as theories of concurrency, semantics of lambda calculi and proofs, program analysis, model checking and hardware synthesis.
This special issue, based on the GALOP workshop held at Queen Mary University of London in 2013 (see http://www.gamesemantics.org/galop-viii), aims to reflect new developments in this area.
Topics of interest for contributions to the journal issue include, but are not limited to game semantics and its applications to:
- Game theory and interaction models in semantics
- Games-based program analysis and verification
- Logics for games and games for logics
- Algorithmic aspects of games
- Categorical aspects
- Programming languages and full abstraction
- Higher-order automata and Petri nets
- Geometry of Interaction
- Ludics
- Epistemic game theory
- Logics of dependence and independence
- Computational linguistics
SUBMISSIONS
Submissions must be original work, which has not been previously published in a full form and is not currently under review for publication elsewhere.
Please submit submissions following APAL's style
(http://authors.elsevier.com/JournalDetail.html?PubID=505603)
on the following easychair link: https://www.easychair.org/conferences/?conf=apalgalop2013
The deadline for submission is May 31st, 2014.
GUEST EDITORS
Martin Hyland (University of Cambridge)
Guy McCusker (University of Bath)
Nikos Tzevelekos (Queen Mary University of London)
------------------------------
Message: 2
Date: Tue, 8 Apr 2014 07:13:18 +0100
From: Guy McCusker <G.A.McCusker@bath.ac.uk>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] 36 month postdoc position at Bath
Message-ID: <5F2120D2-EEC6-4C6F-8618-BAC7D1043A44@bath.ac.uk>
Content-Type: text/plain; charset=iso-8859-1
A 36-month postdoctoral research position is available at the University of Bath, to work on the EPSRC-funded project "Algebra and Logic for Policy and Utility in Information Security (ALPUIS)."
Please send informal enquiries to Guy McCusker -- G.A.McCusker@bath.ac.uk -- and make applications viahttps://www.bath.ac.uk/jobs/Vacancy.aspx?ref=XVH2268
All the best,
Guy McCusker.
---
Research Associate - Computer Science (fixed-term) https://www.bath.ac.uk/jobs/Vacancy.aspx?ref=XVH2268
Salary: Starting from ?30,728, rising to ?31,664
Closing Date: Tuesday 15 April 2014
Reference: XVH2268
Applications are invited for a postdoctoral position at the University of Bath as part of the EPSRC-funded projectAlgebra and Logic for Policy and Utility in Information Security (ALPUIS).
As an integral member of the ALPUIS team, you will contribute to an interdisciplinary project combining techniques from theoretical computer science (process algebra, logic) with ideas from economics (utility theory) to develop new methodologies for modeling, analyzing and making decisions about information security policy. The ALPUIS consortium comprises mathematicians, economists and policy experts from the University of Bath, University College London, the University of Aberdeen and the University of Exeter. The ideal candidate will bridge between the mathematical theory and realistic examples, producing models that reflect the theoretical development and can scale to describe and address questions of significance in security policy.
Candidates should have, or shortly be expected to complete, a PhD in an area of relevance to the project. Expertise in the use of logical methods to describe and reason about the behaviour of processes or agents would be particularly desirable.
Interviews will be held in April
This is a fixed term post for 36 months
------------------------------
Message: 3
Date: Tue, 8 Apr 2014 14:50:10 +0800
From: Gordon Royle <gordon.royle@uwa.edu.au>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Postdoctoral position - UWA (Perth, Australia)
Message-ID: <E50E6972-BCEE-4E70-A26C-B09EB58D951B@uwa.edu.au>
Content-Type: text/plain; charset="us-ascii"
I am seeking a research associate (aka postdoc) who should ideally be someone just completed or with a few years post-PhD research expereience.
The project is studying the real chromatic roots of graphs and matroids, so experience with
- graph polynomials (Tutte, chromatic etc), and/or partition function of the q-state Potts model
- the roots of these polynomials, basic complex analysis
- relationship between graphs and matroids, role of minor-closed classes etc
would be well-received.
Details of rhe application procedure can be found here:
http://external.jobs.uwa.edu.au/cw/en/job/492887/research-associate-ref-492887
Starting date is flexible, and depends on availability of candidate, but sometime in 2014 would be best.
Professor Gordon Royle
School of Mathematics and Statistics
University of Western Australia
Gordon.Royle@uwa.edu.au
------------------------------
Message: 4
Date: Tue, 8 Apr 2014 09:45:20 +0200 (CEST)
From: Marcin Pilipczuk <malcin@mimuw.edu.pl>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] School on Parameterized Algorithms and Complexity
(second announcement, and application details)
Message-ID: <alpine.LNX.2.00.1404080944001.30317@duch.mimuw.edu.pl>
Content-Type: TEXT/PLAIN; format=flowed; charset=US-ASCII
School on Parameterized Algorithms and Complexity
when: 17-22 August 2014
where: Conference Center in Bedlewo, Poland.
The school program will contain basic introductory courses as well as an
overview of very recent developments, including many exercises and open
problems. We target at interested excellent master students, grad students
and young researchers willing to join the research in parameterized
algorithms and complexity. However, even a more experienced participant
will find many of the presentations interesting and fruitful.
Please apply by 30 April 2014, through the form at
http://fptschool.mimuw.edu.pl/index.php/application
More info at http://fptschool.mimuw.edu.pl
------------------------------
Message: 5
Date: Tue, 8 Apr 2014 10:58:00 +0200
From: Daniel Porumbel <daniel.porumbel@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] PhD Thesis proposal: belief functions in
optimization
Message-ID:
<CADVGAp-bShjoeKExyLXy5-_Ps6sqLSryJHwd87ZEuHoMVA5KXg@mail.gmail.com>
Content-Type: text/plain; charset=ISO-8859-1
(Our apologies if you receive multiple copies of this message)
Hello,
Please find below a PhD proposal. We encourage interested
candidates to apply relatively *soon*.
http://www.lgi2a.univ-artois.fr/~porumbel/phd2014.pdf
Best regards,
Daniel Porumbel
Artois University (part of Univ. Lille Nord de France)
------------------------------
Message: 6
Date: Tue, 8 Apr 2014 23:07:48 +1000
From: sergeg@cse.unsw.edu.au
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] PCCR 2014: 2nd Workshop on the Parameterized
Complexity of Computational Reasoning
Message-ID:
<070f23495e666c21901cd1a30a0c8c33.squirrel@webmail.cse.unsw.edu.au>
Content-Type: text/plain;charset=iso-8859-1
Call for papers and participation
PCCR 2014
2nd Workshop on the Parameterized Complexity of Computational Reasoning
July 17-18, 2014, Vienna, Austria
http://vsl2014.at/pccr/
It is our pleasure to announce PCCR 2014. It will be held during the
Vienna Summer of Logic 2014, the largest logic event in history with an
expected 2500 participants.
*Important Dates*
Submission deadline: 9 May 2014
Notification: 16 May 2014
Camera-ready deadline: 23 May 2014
*Aims and Scope*
PCCR 2014 aims to support a fruitful exchange of ideas between the
research on parameterized complexity on one side and the research on
various forms of computational reasoning (such as nonmonotonic,
probabilistic, and constraint-based reasoning) on the other.
Topics of interest include but are not limited to: multivariate analysis
of reasoning problems, kernelization and preprocessing, fixed-parameter
tractability and hardness, backdoors and decompositions.
The workshop will feature invited and contributed talks with surveys and
new technical results, an open problem session, and a panel discussion on
future research directions. Apart from talks on parameterized complexity
we are also interested in presentations that highlight structural
parameters that have not been studied within the framework of
parameterized complexity so far.
*Invited speakers*
- Georg Gottlob (University of Oxford, UK),
- D?niel Marx (Hungarian Academy of Sciences (MTA SZTAKI), Hungary), and
- Stefan Szeider (Vienna University of Technology, Austria).
*Submission Instructions*
If you would like to give a talk at the workshop, please submit a 1-2 page
PDF abstract of your talk via Easychair
https://www.easychair.org/conferences/?conf=pccr2014
by the submission deadline. This abstract will be included in the
non-archival FLoC/VSL 2014 proceedings which will be distributed to all
FLoc/VSL 2014 participants on a USB drive. The abstract and talk can be
based on published and unpublished results, and we welcome overview and
survey talks, besides regular technical talks. Contributed talks are
expected to be around 30 minutes each.
See you at PCCR 2014,
Michael R. Fellows, Serge Gaspers, and Toby Walsh (organisers)
------------------------------
Message: 7
Date: Tue, 08 Apr 2014 16:08:01 +0200
From: Elisabetta Biondi<chants14_publicity@iit.cnr.it>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] ACM CHANTS 2014 (co-located with ACM MobiCom):
initial announcement and call for papers
Message-ID: <534402c1.6X/qQAhje7v66gsw%chants14_publicity@iit.cnr.it>
Content-Type: text/plain; charset=us-ascii
*************************************
[Our sincere apologies if you receive multiple copies of this message]
*************************************
______________________________________________________________________
ACM CHANTS 2014 - 9th Workshop on Challenged Networks
co-located with ACM MobiCom 2014
7 September 2014, Maui, Hawaii, USA
www.acm-chants.org/14
Supported by the FP7 EU MOTO project
http://www.fp7-moto.eu
______________________________________________________________________
SCOPE AND OVERVIEW
__________________
Challenged networks comprise those situations where communication is desired,
but traditional Internet architectures fail to provide it effectively.
Such networks may be characterized by intermittent connectivity, a heterogeneous
mix of nodes, nodal churn, and widely varying network conditions. Traditional
examples of challenged networks include inter-planetary networks, sensor and
wildlife monitoring networks, underwater networks, rural and remote areas,
and military battlefields. Recently, challenged networking has also found
applications in everyday settings, for which they were not initially conceived,
such as opportunistic networking supporting data-centric communications,
traffic offloading from cellular networks, mobile cloud computing,
opportunistic and participatory sensing. Inter-disciplinary approaches to
challenged networking protocols are also successfully explored, exploiting,
for example, findings in the area of social networking.
The availability of enabling technologies in mobile devices, such as
WiFi direct in Android and D2D communication in latest LTE releases, will
further push towards practical developments of challenged networking solutions.
This workshop builds on the success of the eight previous CHANTS workshops,
and WDTN 2005, to stimulate research on the most novel and challenging topics
of challenged network research. CHANTS provides an ideal venue for researchers
and engineers to present cutting-edge work and results, as research papers or demos,
in the following topics:
- Delay/disruption-tolerant networks (DTNs)
- Opportunistic communication and computing
- Architecture, design, and implementation of communication systems for challenged networks
- Modeling, analysis and characterization of challenged networks and protocols
- Network Coding in Challenged Networks
- Information Centric and Content-centric Networking in Challenged Networks
- Security/Trust/Privacy concerns and solutions in challenged networks
- Case studies involving real challenged network solutions in various stages of development or use
- Applications of challenged networks in disrupted scenarios (e.g. disaster relief and emergency management)
and in daily use (e.g., vehicular networks, mobile social networking, censorship evasion,
crowdsourcing, sensor networks)
- Green and energy-efficient communication using challenged networks
- Real-world mobility trace collection, analysis, and modeling for challenged environments
- Network science methods for challenged networks
- Mobile data offloading via challenged networks
- Test and simulation tools for evaluating challenged network systems
- Configuration, management, and monitoring of challenged networks
- Challenged networking techniques for mobile cloud
- Challenged networking techniques for participatory and opportunistic sensing
Selected papers will be forward-looking, will describe their relationship to existing work,
and will have impact and implications for ongoing or future research. We aim to have a
highly interactive workshop, also including demos, which have been an integral part of CHANTS.
Paper authors who can also run a demo of their work will be encouraged to do so.
In exceptional cases, where live demos are simply not practical to present, poster or video
presentations of practical results are acceptable.
PAPER FORMAT AND SUBMISSION INSTRUCTIONS
________________________________________
Papers should neither have been published elsewhere nor being currently under review by another
conference or journal. Submitted papers must be no more than 6 pages long, and should adhere to
the standard ACM conference proceedings format. Demo proposals (to be published as part of the
proceedings) must not be longer than 3 pages plus 1 page description of the precise setup and
requirements (the 1-page setup description will not be published in the proceedings).
Papers will be reviewed single blind.
Please follow the submission link at: http://www.acm-chants.org
EDITORIAL FOLLOW-UPS
_____________________
Extended versions of the selected workshop papers will be considered for
possible fast track publication on the Computer Communications Journal (Elsevier),
in a special section on Challenged Networks.
IMPORTANT DATES
_______________
Abstract Registration: 1 June 2014
Submission Deadline: 8 June 2014
Authors Notification: 20 July 2014
Camera Ready Due: 27 July 2014
Workshop: 7 September 2014
ORGANIZING COMMITTEE
____________________
Program Committee Chairs
- Mario Gerla (UCLA, USA)
- Andrea Passarella (IIT-CNR, Italy)
Technical Program Committee
- Mostafa Ammar (Georgia Institute of Technology, USA)
- Aruna Balasubramanian (University of Washington, USA)
- Fehmi Ben Abdesslem (SICS Swedish ICT, Sweden)
- Chiara Boldrini (IIT-CNR, Italy)
- Scott Burleigh (Jet Propulsion Laboratory, California Institute of Technology, USA)
- Guohong Cao (Penn State University, USA)
- Vania Conan (Thales Communications & Security, France)
- Marco Conti (IIT-CNR, Italy)
- Marcelo Dias de Amorin (UPMC, France)
- Roberto Di Pietro (Roma Tre University of Rome, Italy)
- Do Young Eun (North Carolina State University, USA)
- Stephen Farrell (Trinity College Dublin, Ireland)
- Ahmed Helmy (University of Florida, USA)
- Tristan Henderson (University of St Andrews, UK)
- Pan Hui (Deutsche Telekom Laboratories/Hong Kong Univ. of Science and Technology, Hong Kong)
- Karin Anna Hummel (ETH Zurich, Switzerland)
- Mohan Kumar (Rochester Institute of Technology, USA)
- Kyunghan Lee, (UNIST Ulsan National Institute of Science and Technology, Korea)
- Uichin Lee (KAIST-KSE, Korea Advanced Institute of Science and Technology, Korea)
- Anders Lindgren (SICS Swedish ICT, Sweden)
- Giovanni Neglia (INRIA Sophia-Antipolis, France)
- Melek Onen (EURECOM, France)
- Joerg Ott (Aalto University, Finland)
- Elena Pagani (University of Milan, Italy)
- Andreea Hossmann-Picu (ETH Zurich, Switzerland)
- Thrasyvoulos Spyropoulos (EURECOM, France)
- Stavros Toumpis (Athens University of Economics and Business, Greece)
- Eiko Yoneki (University of Cambridge, UK)
Steering Committee
- Kevin Almeroth, UC-Santa Barbara, USA
- Mostafa Ammar, Georgia Tech, USA
- Christophe Diot, Technicolor, France
- Deborah Estrin, UC-Los Angeles, USA
- Kevin Fall, Carnegie Mellon University, USA
- Jorg Ott, Aalto University, Finland
- James Scott, Microsoft Research Cambridge, UK
Publicity Co-Chairs
- Elisabetta Biondi (IIT-CNR, Italy)
- Sungwon Yang (UCLA, USA)
Web Chair
- Fehmi Ben Abdesslem (SICS Swedish ICT, Sweden)
For more information, please check out www.acm-chants.org or write to
the workshop co-chairs at chants2014@iit.cnr.it
------------------------------
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 74, Issue 10
**************************************
No comments:
Post a Comment