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. Last CfP: UNIF 2014 (Temur Kutsia)
2. Deadline extension: IEEE SenseApp 2014 (in conjunction with
LCN 2014) (Andreas Reinhardt)
3. PhD positions in complexity at Charles University in Prague
(Michal Koucky) (Michal Koucky)
4. SAGT 2014 - Call for Papers (Martin Hoefer)
5. Postdoctoral position in Algorithms/Lower Bounds at Bristol
University, UK (Ashley Montanaro)
6. Postdoctoral position in Algorithms/Lower Bounds at Bristol
University, UK (Raphael C)
----------------------------------------------------------------------
Message: 1
Date: Thu, 03 Apr 2014 22:43:18 +0200
From: Temur Kutsia <kutsia@risc.jku.at>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Last CfP: UNIF 2014
Message-ID: <533DC7E6.2030205@risc.jku.at>
Content-Type: text/plain; charset=windows-1252; format=flowed
====================================================
Call for Papers
UNIF 2014
The 28th International Workshop on Unification
July 13, 2014. Vienna, Austria
a FLoC workshop hosted by RTA-TLCA and IJCAR
http://vsl2014.at/unif
====================================================
UNIF 2014 is the 28th event in a series of international meetings
devoted to
unification theory and its applications. Unification is concerned with the
problem of identifying terms, finding solutions for equations, or making
formulas equivalent. It is a fundamental process used in a number of fields
of computer science, including automated reasoning, term rewriting, logic
programming, natural language processing, program analysis, types, etc.
The International Workshop on Unification (UNIF) is a yearly forum for
researchers in unification theory and related fields to meet old and new
colleagues, to present recent (even unfinished) work, and to discuss new
ideas
and trends. It is also a good opportunity for young researchers and
scientists
working in related areas to get an overview of the current state of the
art in
unification theory.
Topics
------
A non-exhaustive list of topics of interest includes:
* syntactic and equational unification
* matching
* constraint solving
* unification in modal, temporal, and description logics
* narrowing
* disunification
* anti-unification
* semi-unification
* higher-order unification
* complexity issues
* implementation techniques
* applications
Submission
----------
Short papers or extended abstracts, up to 5 pages in EasyChair style,
should be
submitted electronically as PDF files through the EasyChair submission site:
https://www.easychair.org/conferences/?conf=unif2014
Accepted abstracts will be presented at the workshop and included in the
preliminary proceedings, available in the electronic form at the
workshop and
also at the UNIF web page:
http://www.pps.jussieu.fr/~treinen/unif/
Important Dates
----------------
* Paper Submission: April 16, 2014
* Notification of Acceptance: May 21, 2014
* Final version: May 28, 2014
* Conference: July 13, 2014
Invited Speakers
----------------
* Jordi Levy, IIIA, CSIC, Barcelona, Spain
* Jose Meseguer, University of Illinois at Urbana-Champaign, USA
Programme Committee
-------------------
* Franz Baader, TU Dresden, Germany
* Mnacho Echenim, University of Grenoble, France
* Santiago Escobar, Universitat Politecnica de Valencia, Spain
* Maribel Fernandez, King's College London, UK
* Temur Kutsia, RISC, Johannes Kepler University Linz, Austria (chair)
* Christopher Lynch, Clarkson University, USA
* Mircea Marin, West University of Timisoara, Romania
* Barbara Morawska, TU Dresden, Germany
* Paliath Narendran, University at Albany?SUNY, USA
* Jan Otop, IST Austria
* Christophe Ringeissen, LORIA-INRIA Lorraine, France (chair)
* Manfred Schmidt-Schauss, Goethe-University Frankfurt, Germany
* Ralf Treinen, PPS, Universit? Paris Diderot, France
* Mateu Villaret, Universitat de Girona, Spain
------------------------------
Message: 2
Date: Fri, 4 Apr 2014 15:07:35 +1100
From: Andreas Reinhardt <andreasr@cse.unsw.edu.au>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Deadline extension: IEEE SenseApp 2014 (in
conjunction with LCN 2014)
Message-ID: <0051B7C2-BD54-4012-9DF6-62AB74D66DC5@cse.unsw.edu.au>
Content-Type: text/plain; charset=iso-8859-1
My apologies if you receive multiple copies of this call for papers.
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
== Deadline extended to 21 April 2014 ==
SENSEAPP 2014
NINTH IEEE INTERNATIONAL WORKSHOP ON PRACTICAL ISSUES
IN BUILDING SENSOR NETWORK APPLICATIONS
(in conjunction with IEEE LCN 2014)
Chateau Lacombe Hotel
Edmonton, Canada
8-11 September 2014
http://www.senseapp.org
CALL FOR PAPERS
The Internet of Things is happening! Wireless sensors and actuators are increasingly networked and continually narrow the gap between the physical world and cyberspace. Domain-specific sensing deployments in industrial or home automation scenarios are becoming more and more common, particularly with the advent of novel sensing platforms such as smartphones, which allow for interfacing with or extending dedicated sensor networks. Nevertheless, insights gathered from real-world sensor network deployments are still scarce and many practical issues in building sensor network applications persist. A thorough understanding from a practical/systems perspective is still necessary, including the hardware platforms of sensor and actor nodes, their operating systems, the networking of nodes and fresh perspectives from field trials and applications.
This workshop aims at bringing together researchers from both academia and industry to showcase their work and obtain feedback. It serves as a forum for the sensor network research community to discuss open issues, novel solutions and the future development of wireless sensor networks in general. We encourage contributions describing innovative work in the realm of wireless sensor networks. Topics of interest include, but are not limited to:
- Experiences from real-world sensor network deployment and applications
- Innovative sensor network applications
- Mobile and participatory sensing applications and deployments
- Integrating sensor networks and the internet of things
- Middleware support for sensor networks
- Programming and debugging sensor networks
- Security, availability and dependability issues in sensor networks
- Experiences with new sensor hardware
- Practical problems in implementing localization and time synchronization
- Experiences with communication protocols
- Practical medium access control protocols (MACs)
- Topology control and routing protocols in existing sensor network deployments
- Fault-tolerance and troubleshooting sensor networks
- Antenna design and experiences with signal propagation
- Experiences regarding energy management and network lifetime
- Configuration and installation support
- Management of large-scale sensor networks and sensing campaigns
- Interconnection between IP and sensor networks
- Interfacing with sensor networks using mobile computing devices
- Large-scale open sensor data sets from real deployments
Submitted papers will be reviewed by three independent experts in the field. Proceedings of the workshop will be published together with those of IEEE LCN, and will be available in digital format from the IEEE Xplore Digital Library.
SUBMISSION INSTRUCTIONS:
Authors are invited to submit original unpublished work, not currently under review by another conference, workshop or journal. Full papers should be restricted to 8 camera-ready pages (in 10 pt font, double column, US letter size, 8.5 x 11 inches, IEEE format), including text, figures and references. Authors should use only standard fonts, i.e. Times Roman, Courier, Symbol, Helvetica or equivalent. Papers must be submitted electronically via EDAS at:
<https://edas.info/N17169>
All papers must include title, complete contact information of all authors, abstract and up to 5 keywords on the cover page.
Further information can be found at http://www.senseapp.org
IMPORTANT DATES:
(Extended) Submission Deadline: 21 April 2014
Notification of Acceptance: 30 May 2014
Camera Ready Copy Due: 30 June 2014
PROGRAM COMMITTEE CO-CHAIRS:
Matthias Hollick, Technische Universit?t Darmstadt, Germany
Salil Kanhere, The University of New South Wales, Sydney, Australia
PUBLICITY CHAIR:
Andreas Reinhardt, The University of New South Wales, Sydney, Australia
STEERING COMMITTEE:
Sanjay Jha, The University of New South Wales, Sydney, Australia
Cormac Sreenan, University College, Cork, Ireland
TPC MEMBERS:
Zinaida Benenson, University of Erlangen-Nuremberg
Neil Bergmann, University of Queensland
Fernando Boavida, University of Coimbra
James Brown, Lancaster University
Felix B?sching, Technische Universit?t Braunschweig
Rachel Cardell-Oliver, The University of Western Australia
Delphine Christin, University of Bonn and Fraunhofer FKIE
Simon Duquennoy, Swedish Institute of Computer Science (SICS)
Wendi Heinzelman, University of Rochester
Matthias Hollick, Technische Universit?t Darmstadt
Raja Jurdak, Commonwealth Scientific and Industrial Research Organisation (CSIRO)
Vana Kalogeraki, Athens University of Economics and Business
Salil Kanhere, The University of New South Wales
Csaba Kiraly, University of Trento
Vinay Kolar, IBM Research
Olaf Landsiedel, Chalmers University of Technology
Yee Wei Law, The University of Melbourne
Chieh-Jan Mike Liang, Microsoft Research
Hock Beng Lim, Nanyang Technological University
Tie Luo, Institute for Infocomm Research
Enzo Mingozzi, University of Pisa
Prasant Misra, Indian Institute of Science, Bangalore
Edith Ngai, Uppsala University
Neal Patwari, University of Utah
Gian Pietro Picco, University of Trento
Rajib Rana, Commonwealth Scientific and Industrial Research Organisation (CSIRO)
Andreas Reinhardt, The University of New South Wales
Christian Renner, University of L?beck
Kay R?mer, ETH Zurich
Olga Saukh, ETH Zurich
Corinna Schmitt, University of Zurich
Philipp Sommer, Commonwealth Scientific and Industrial Research Organisation (CSIRO)
Kristof Van Laerhoven, TU Darmstadt
Klaus Wehrle, RWTH Aachen University
Dingwen Yuan, Technische Universit?t Darmstadt
------------------------------
Message: 3
Date: Fri, 4 Apr 2014 09:55:02 +0200 (CEST)
From: Michal Koucky <koucky@iuuk.mff.cuni.cz>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] PhD positions in complexity at Charles University in
Prague (Michal Koucky)
Message-ID:
<alpine.DEB.2.02.1404040950560.2533@kambrium.kam.mff.cuni.cz>
Content-Type: TEXT/PLAIN; charset=US-ASCII; format=flowed
Positions for PhD students are available at the Computer Science Institute
of Charles University in Prague within the framework of the ERC project
"Lower bounds for combinatorial algorithms and dynamic problems" with
funding for four years. Applications are invited from candidates who have
strong background in theoretical computer science or discrete mathematics,
and who have completed their undergraduate studies or will complete it by
Fall 2014.
Application deadline is April 17, 2014. Starting date is in Fall 2014.
Informal inquires by email are welcome.
More information is available at: http://iuuk.mff.cuni.cz/~koucky/LBCAD/
------------------------------
Message: 4
Date: Fri, 04 Apr 2014 10:38:27 +0200
From: Martin Hoefer <mhoefer@mpi-inf.mpg.de>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] SAGT 2014 - Call for Papers
Message-ID: <533E6F83.30909@mpi-inf.mpg.de>
Content-Type: text/plain; charset=UTF-8; format=flowed
[Apologies for multiple copies]
-------------------------------
7th INTERNATIONAL SYMPOSIUM ON ALGORITHMIC GAME THEORY
SAGT 2014
http://sagt-2014.iew.technion.ac.il/
Haifa, Israel, Sep. 30 - Oct. 2, 2014
--------------------------------------------------
IMPORTANT DATES
- Submission: May 1, 2014.
- Notification: July 1, 2014.
--------------------------------------------------
The 7th International Symposium on Algorithmic Game Theory (SAGT) will
take place in Haifa, Israel, from September 30 to October 2. The purpose
of SAGT is to bring together researchers from Computer Science,
Economics, Physics, Biology and Mathematics to present and discuss
original research at the intersection of Algorithms and Game Theory.
The program of SAGT will include both invited lectures and presentations
for refereed submissions. Confirmed invited speakers are
- Ron Holtzman, Technion
- Matthew Jackson, Stanford
- Moshe Tennenholtz, Technion and Microsoft Research
In addition to the usual competitive track there will be an "economics"
track consisting of a small number of solicited papers to increase
engagement among game theorists with different background than computer
science.
SUBMISSIONS
-----------
Authors are invited to submit previously unpublished work for possible
presentation at the conference. Foundational work is solicited on topics
including but not limited to:
- Solution Concepts in Game Theory
- Efficiency of Equilibria and Price of Anarchy
- Complexity Classes in Game Theory
- Computational Aspects of Equilibria
- Computational Aspects of Fixed-Point Theorems
- Algorithmic Mechanism Design
- Computing with Incentives
- Computational Social Choice
- Decision Theory, and Pricing
- Auction Algorithms and Analysis
- Repeated Games
- Evolution and Learning in Games
- Convergence of Dynamics
- Coalitions, Coordination and Collective Action
- Reputation, Recommendation and Trust Systems
- Network Games and Graph-Theoretic Aspects of Social Networks
- Cost-Sharing Algorithms and Analysis
- Economic Aspects of Distributed Computing
- Internet Economics and Computational Advertising
Industrial application works and position papers presenting novel ideas,
issues, challenges and directions are also welcome. It is expected that
every accepted paper will be presented at the symposium by one of the
authors.
Submissions must be prepared in LNCS-style and limited to at most 12
pages. Additional material can be added in a clearly marked appendix.
Accepted papers are presented in at most 12 pages in the proceedings.
Alternatively, authors of accepted papers can publish only a one page
abstract in the proceedings, along with a URL pointing to the full paper.
For more detailed submission guidelines and instructions see the
conference webpage at http://sagt-2014.iew.technion.ac.il
Submission is done via Easychair:
https://www.easychair.org/conferences/?conf=sagt2014
CS PROGRAM COMMITTEE
--------------------
- Itai Ashlagi, MIT
- Yang Cai, UC Berkeley / McGill U.
- Shahar Dobzinski, Weizmann Institute
- Arpita Ghosh, Cornell U.
- Paul Goldberg, U. Oxford
- Bruce Hajek, U. Illinois Urbana-Champaign
- Martin Hoefer, MPI Informatik
- Patrick Hummel, Google
- Ron Lavi, Technion (chair)
- Stefano Leonardi, Sapienza U. Rome
- Brendan Lucier, MSR New England
- Mohammad Mahdian, Google
- Evangelos Markakis, AUEB Athens
- Aranyak Mehta, Google
- Seffi Naor, Technion
- Ilan Newman, U. Haifa
- Sigal Oren, Hebrew U. / MSR Herzliya
- Mallesh Pai, U. Pennsylvania
- Maria Polukarov, U. Southampton
- Chaitanya Swamy, U. Waterloo
- Chris Wilkens, Yahoo! Labs
ECON PROGRAM COMMITTEE
----------------------
- Gabriel Carroll, Stanford U.
- Federico Echenique, CalTech
- Scott Duke Kominers, Harvard U.
- Jacob Leshno, Colombia U.
- Rann Smorodinsky, Technion (chair)
STEERING COMMITTEE
------------------
- Elias Koutsoupias, U. Oxford
- Marios Mavronicolas, U. Cyprus
- Dov Monderer, Technion
- Burkhard Monien, Paderborn U.
- Christos Papadimitriou, UC Berkeley
- Giuseppe Persiano, U. Salerno
- Paul Spirakis, U. Liverpool (chair)
- Berthold V?cking, RWTH Aachen U.
ORGANIZING COMMITTEE
--------------------
- Mili Harari, Technion
- Martin Hoefer, MPI Informatik
- Ron Lavi, Technion
- Dov Monderer, Technion
- Igal Shprincis, Technion
- Rann Smorodinsky, Technion
------------------------------
Message: 5
Date: Fri, 4 Apr 2014 09:53:00 +0100
From: Ashley Montanaro <ashley@cs.bris.ac.uk>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Postdoctoral position in Algorithms/Lower Bounds at
Bristol University, UK
Message-ID: <991CD4BE-BC7C-4908-BE36-BB34EDAFA38F@cs.bris.ac.uk>
Content-Type: text/plain; charset=us-ascii
POSTDOCTORAL POSITION IN ALGORITHMS RESEARCH AND/OR LOWER BOUNDS
Application deadline April 30, 2014. Start date negotiable but ideally by September 2014.
The Algorithms team in the Department of Computer Science at Bristol University is looking to hire a postdoctoral researcher in the areas of algorithms research and/or lower bounds. The post will require a high level of expertise in areas which may include but not be limited to data structures/algorithms, discrete probability, discrete mathematics and combinatorics.
If your previous track record is not directly in the areas of SODA/STOC/FOCS style algorithms research or provable lower bounds or is in general far from the work currently being carried out in the Algorithms team at Bristol, please give a full explanation in your application both why you wish to change research area and how you will be able rapidly to retrain.
A PhD in mathematics, computer science, operations research or a related field is required.
Please see http://www.cs.bris.ac.uk/Research/Algorithms/ for full details both of the post and the application process. For informal enquiries, please contact Raphael Clifford ( clifford@cs.bris.ac.uk ).
--
Ashley Montanaro
ashley@cs.bris.ac.uk
------------------------------
Message: 6
Date: Fri, 4 Apr 2014 09:53:49 +0100
From: Raphael C <drraph@gmail.com>
To: dmanet <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Postdoctoral position in Algorithms/Lower Bounds at
Bristol University, UK
Message-ID:
<CAFHc1QbqeHv+uf-+i6WyWVB20p+owk20BGajfKeuVZADckkVTQ@mail.gmail.com>
Content-Type: text/plain; charset=ISO-8859-1
POSTDOCTORAL POSITION IN ALGORITHMS RESEARCH AND/OR LOWER BOUNDS
Application deadline April 30, 2014. Start date negotiable but
ideally by September 2014.
The Algorithms team in the Department of Computer Science at Bristol
University is looking to hire a postdoctoral researcher in the areas
of algorithms research and/or lower bounds. The post will require a
high level of expertise in areas which may include but not be limited
to data structures/algorithms, discrete probability, discrete
mathematics and combinatorics.
If your previous track record is not directly in the areas of
SODA/STOC/FOCS style algorithms research or provable lower bounds or
is in general far from the work currently being carried out in the
Algorithms team at Bristol, please give a full explanation in your
application both why you wish to change research area and how you will
be able rapidly to retrain.
A PhD in mathematics, computer science, operations research or a
related field is required.
Please see http://www.cs.bris.ac.uk/Research/Algorithms/ for full
details both of the post and the application process. For informal
enquiries, please contact Raphael Clifford ( clifford@cs.bris.ac.uk).
------------------------------
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 5
*************************************
No comments:
Post a Comment