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. TCS 2014 cfp (Rossella Petreschi)
2. [CFP] SWANSITY 2014- Self-organizing Wireless Access Networks
for Smart cITY (in conjunction with SECON) (Valeria Loscri)
3. NetworKit 3.0 released (Henning Meyerhenke)
4. PhD position, "Phylogenetic incongruence at the limits of
algorithmic graph theory" (Kelk Steven (DKE))
5. Call for Participation: Symposium on Discrete Mathematics
2014, Frankfurt, May 9-10, 2014 (Thorsten Theobald)
6. Last CfP --- EUROPT 2014 --- Extension of deadline for
abstract submission: March 28 (Gerhard-Wilhelm Weber)
----------------------------------------------------------------------
Message: 1
Date: Mon, 17 Mar 2014 14:22:30 +0100
From: Rossella Petreschi <petreschi@di.uniroma1.it>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] TCS 2014 cfp
Message-ID:
<CAKSnJVfqRATu41qRXBGaKJGb_aZXbCzTP_uNhU8ZYLfYzeeu3Q@mail.gmail.com>
Content-Type: text/plain; charset=ISO-8859-1
TCS 2014
8th IFIP International Conference on Theoretical Computer Science
September 1-3, 2014 Rome, Italy
http://www.cyprusconferences.org/tcs2014/
Held in conjunction with the 25th Conference on Concurrency Theory (CONCUR 2014)
We apologize if you receive multiple copies of this message.
AIM AND SCOPE OF THE CONFERENCE:
Under the patronage of the International Federation of Information
Processing (IFIP), since year 2000 the IFIP Technical Committee 1
(Foundations of Computer Science) has organized a series of biannual
international conferences in Theoretical Computer Science. After
Sendai (2000), Montreal (2002), Toulouse (2004), Santiago (2006),
Milano (2008), Brisbane (2010), and Amsterdam (2012), the 8th edition
will be held in Rome in September 2014, in cooperation with the IFIP
Working Group 2.2 (Formal Description of Programming Concepts) and in
conjunction with the 25th Conference on Concurrency Theory. We call
for papers in all areas of Theoretical Computer Science: they will be
evaluated by two committees:
Track A: Algorithms, Complexity and Models of Computation
Track B: Logic, Semantics, Specification and Verification
TOPICS:
Suggested, but not exclusive, topics of interest include:
Track A - analysis and design of algorithms; automata and formal
languages; cellular automata and systems; combinatorial, graph and
optimization algorithms; computational learning theory; computational
complexity; computational geometry; cryptography; descriptive
complexity; evolutionary and genetic computing; experimental
algorithms; mobile computing; molecular computing and algorithmic
aspects of bioinformatics; network computing; neural computing;
parallel and distributed algorithms; probabilistic and randomized
algorithms; quantum computing; structural information and
communication complexity.
Track B - automata theory; automated deduction; constructive and
non-standard logics in computer science; concurrency theory and
foundations of distributed and mobile computing; database theory;
finite model theory; formal aspects of program analysis, foundations
of hybrid and real-time systems; lambda and combinatory calculi;
logical aspects of computational complexity; modal and temporal
logics; model checking and verification; probabilistic systems; logics
and semantics of programs; foundations of security; term rewriting;
specifications; type, proof and category theory in computer science.
INVITED SPEAKERS:
Track A - Giuseppe F. Italiano Universit? di Roma Tor Vergata
Track B - Jane Hillstone University of Edinburgh
SUBMISSION GUIDELINES:
Authors are invited to submit an extended abstract of at most 15 pages
(LNCS style with at least 11-point font size) to arrive before April
27, 2014. If more space is needed, a clearly marked appendix, to be
read at the discretion of the program committee, may be included if
desired. Submission will be handled by EasyChair. Further information
and submission details can be found on the Conference web page.
Simultaneous submissions to other conferences with published
proceedings are not allowed.
PROCEEDINGS:
The conference proceedings will be published by Springer-Verlag in
Lecture Notes in Computer Science (LNCS) series. Selected papers from
TCS 2014 will be invited to a special issue of the Journal Theoretical
Computer Science.
IMPORTANT DATES:
Deadline for submission: April 27, 2014.
Notification of acceptance: June 25, 2014.
Final manuscript due: July 6, 2014.
Conference: September 1-3, 2014.
STEERING COMMITTEE:
- Giorgio Ausiello, Sapienza Univ. di Roma
- Jos Baeten, CWI Amsterdam
- Jacques Sakarovitch, CNRS/T el ecom ParisTech
CONFERENCE CO-CHAIRS:
- Daniele Gorla, Sapienza Univ. di Roma
- Rossella Petreschi, Sapienza Univ. di Roma
PROGRAM COMMITTEES:
Track A
- Cristian Calude, University of Auckland
- Josep Diaz (Chair), UPC Barcelona
- Irene Finocchi, Sapienza Univ. di Roma
- Paola Flocchini, University of Ottawa
- Aristides Gionis, Aalto University Helsinki
- Mordecai Golin, Hong Kong University of Tech.
- Juhani Karhum aki, Turku University
- Massimo Melucci, Univ. di Padova
- Elvira Mayordomo, Universidad de Zaragoza
- Friedhelm Meyer auf der Heide, Univ. of Paderborn
- Pekka Orponen, Aalto University Helsinki
- Giuseppe Persiano, Univ. di Salerno
- G eraud S enizergues, Universit e Bordeaux 1
- Olivier Serre, CNRS / Universit e Paris 7
- Paul Spirakis, University of Liverpool
- Osamu Watanabe, Tokyo Inst. of Technology
- Peter Widmayer, ETH Zurich
Track B
- Jos Baeten, CWI Amsterdam
- Lars Birkedal, Aarhus University
- Andrei Bulatov, Simon Fraser University
- James Cheney, University of Edinburgh
- Ugo Dal Lago, Univ. di Bologna
- Jos ee Desharnais, Universit e Laval
- J org Endrullis, Vrije Universiteit Amsterdam
- J erome Feret, ENS Paris
- Marcelo Fiore, University of Cambridge
- Silvio Ghilardi, Univ. di Milano
- Benjamin Gr egoire, INRIA Sophia
- Ichiro Hasuo, University of Tokyo
- Marieke Huisman, University of Twente
- Jean Krivine, CNRS / Universit e Paris 7
- Radha Jagadeesan, DePaul University, Chicago
- Ivan Lanese, Univ. di Bologna
- Grigore Rosu, University of Illinois at U-C
- Davide Sangiorgi (Chair), Univ. di Bologna
- Vladimiro Sassone, University of Southampton
- Igor Walukiewicz, CNRS / Universit e Bordeaux 1
------------------------------
Message: 2
Date: Mon, 17 Mar 2014 15:58:28 +0100 (CET)
From: Valeria Loscri <valeria.loscri@inria.fr>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] [CFP] SWANSITY 2014- Self-organizing Wireless Access
Networks for Smart cITY (in conjunction with SECON)
Message-ID: <420086846.9157275.1395068308137.JavaMail.zimbra@inria.fr>
Content-Type: text/plain; charset=utf-8
============================================
CFP: SWANSITY 2014- Self-organizing Wireless
Access Networks for Smart cITY
>>>>> In conjuction with SECON 2014 <<<<<
============================================
June 30th, 2014
Singapore
https://sites.google.com/site/swansity2014
Important dates
Submission deadline: March 31st, 2014
Notification of acceptance:April 30th, 2014
Camera Ready: May 12th, 2014
Program: June 1st, 2014
Scope
The SWANSITY workshop aims to solicit contributions on novel algorithms, methodological studies and experimentations on how to make a city-wide network infrastructure able to self-adapt to the dynamic requirements posed by the users and by the applications, to manage the complexity of heterogeneous devices and access technologies, and to guarantee robust, ubiquitous, and secure connectivity over the urban environments. At the same time, beside studying the issues of the city-wide infrastructure deployment, the workshop aims to investigate the potential provided by the end-users devices (e.g. smartphones, tablets) when augmented with self-organization capabilities, in order to turn them into active components of the smart-city network, instead of mere connection end-points. Such a potential includes the possibility to extend the network access in a pervasive way, to provide ubiquitous computing services, and to favor the emergence of ?collectivity intelligence behaviors? !
through collaboration and direct communication among devices.
In line with such objectives, original contributions are solicited in topics of interest including, but not limited to, the following:
- Models of network components? interactions on a smart-city
- Techniques and tools for modeling self-organizing wireless networks on large-scale urban environments
- Self-organizing wireless networks for pervasive urban access
- Self-organizing and self-repairing wireless networks for disaster recovery
- Dynamic resource allocation schemes for urban environments
- Evolutionary design of wireless network components and devices
- Enabling technologies and algorithms for self-configuring wireless nodes
- Self-organizing femtocell and cognitive radio networks
- Cooperative Smart Objects supporting Wireless Networks Interoperability
- Decision making strategies for software defined radio devices
- Emerging collective intelligence in self-organizing wireless networks
- Network virtualization for heterogeneous wireless networks
- Bio-inspired models for self-organizing wireless networks
- Controlled mobility algorithms for self-placing wireless networks
- Self-organizing networks through Device-2-Device technology (D2D)
- Business model to promote users collaboration and resources sharing
- Security, Privacy and Trust issues in Self-organizing wireless networks
Prospective authors are invited to submit original technical paper by the deadline of 31 March 2014. Submissions will be accepted through EDAS ( http://edas.info/N16973 ). All submissions must be written in English and be at most six (6) printed pages in length, including figures. For full details, please visit the following website: https://sites.google.com/site/swansity2014
TPC Co-Chairs
Gianluca ALOI, University of Calabria, Italy
Marco DI FELICE, Univesity of Bologna,Italy
Valeria LOSCRI', Inria Lille-Nord Europe, FUN, France
Pasquale PACE, University of Calabria, Italy
Giuseppe RUGGERI, University of Reggio Calabria, Italy
Steering Committee
Emanuele VITERBO, MONASH University
Giancarlo FORTINO, UNICAL- Italy
TPC Members
Kaushik Roy Chowdhury, Northeastern University, USA
Claudia Campolo, University of Reggio Calabria, Italy
Yue Gao (Frank), Queen Mary University of London, UK
Yi Hong, Monash University, Australia
Antonio Iera, University of Reggio Calabria, Italy
Wenfeng Li, Wuhan University of Technology, China
Antonio Liotta, TU/e, Netherlands
Karnouskos Stamatis, SAP, Germany
Pietro Manzoni, UPV -Valencia, Spain
Pedro Jose Marron, University of Duisburg-Essen, Germany
Nathalie Mitton, Inria Lille-Nord Europe, FUN, France
Antonella Molinaro, University of Reggio Calabria, Italy
Enrico Natalizio, Compiegne,Technology, University, France
Tahiry Razafindralambo, Inria Lille-Nord Europe, FUN, France
Anna Maria Vegni, University of Roma Tre, Italy
Mengchu Zhou, New Jersey Institute of Technology, USA
Valeria Loscri
Research Scientist FUN Team
Inria Lille-Nord Europe .
Parc scientifique de la Haute Borne
40, avenue Halley - B?t A - Park Plaza
59650 Villeneuve d'Ascq - France
www.inria.fr
Follow us
Twitter ? twitter.com/inria
YouTube? youtube.com/inriachannel
------------------------------
Message: 3
Date: Mon, 17 Mar 2014 16:48:50 +0100
From: Henning Meyerhenke <meyerhenke@kit.edu>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] NetworKit 3.0 released
Message-ID: <53271962.50602@kit.edu>
Content-Type: text/plain; charset="ISO-8859-15"; format=flowed
We announce NetworKit 3.0 [1], the next major release of our open-source
tookit for high-performance network analysis. NetworKit is a hybrid
which provides C++/OpenMP kernels through a Python interface. Since the
last release in November, NetworKit has received several improvements
under the hood as well as an extension of the feature set.
More detailed information can be found in the accompanying publication
[2]. This being an open-source project, we are very interested in
incorporating feedback from data analysts and algorithm engineers.
Christian L. Staudt and Henning Meyerhenke
[1]: http://parco.iti.kit.edu/software/networkit.shtml
[2]: http://arxiv.org/abs/1403.3005
------------------------------
Message: 4
Date: Mon, 17 Mar 2014 18:05:56 +0100
From: "Kelk Steven (DKE)" <steven.kelk@maastrichtuniversity.nl>
To: "DMANET@zpr.uni-koeln.de" <DMANET@zpr.uni-koeln.de>
Subject: [DMANET] PhD position, "Phylogenetic incongruence at the
limits of algorithmic graph theory"
Message-ID:
<684E81CC4CD94440876E40F24BFE085E05E7B962F9@UM-MAIL4109.unimaas.nl>
Content-Type: text/plain; charset="us-ascii"
Dear DMANET colleagues,
Please feel free to forward this to anyone you think might be interested. The PhD position will be based at the Department of Knowledge Engineering (DKE) at Maastricht University, in the Netherlands. It
is funded by an NWO TOP grant.
Kind regards,
Steven Kelk
-----------------------------------------------------------------------------
* PhD position: Phylogenetic incongruence at the limits of algorithmic graph theory
https://www.academictransfer.com/employer/UM/vacancy/22172/lang/en/
Phylogenetics is the science of inferring plausible evolutionary histories, often modelled as trees but also (increasingly) as directed acyclic graphs, from partial data. This gives rise to formidable combinatorial optimization problems. Due to their fundamental character, successfully resolving these problems is likely to have a wider impact in algorithmic graph theory. The research will include themes such as approximation algorithms, fixed parameter tractability and exponential-time algorithms.
The PhD fellow should have a strong MSc-level background in mathematics, computer science, operations research or a related discipline. Candidates with expertise in any/all of the following topics are particularly welcome: combinatorial optimization, (algorithmic) graph theory, discrete mathematics, theoretical computer science. Knowledge of computational biology is not necessary, although affinity with this field will be appreciated. Candidates must be comfortable with writing and speaking in English.
For full instructions on how to apply, and on conditions, please follow the Academic Transfer link shown above.
Deadline is April 7th.
------------------------------
Message: 5
Date: Mon, 17 Mar 2014 22:15:52 +0100 (CET)
From: Thorsten Theobald <theobald@math.uni-frankfurt.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Call for Participation: Symposium on Discrete
Mathematics 2014, Frankfurt, May 9-10, 2014
Message-ID:
<alpine.DEB.2.00.1403172208480.23470@dmz.math.uni-frankfurt.de>
Content-Type: TEXT/PLAIN; format=flowed; charset=US-ASCII
Call for participation (Program now available!):
Symposium on Discrete Mathematics 2014
Goethe University Frankfurt, May 9-10, 2014
http://www.math.uni-frankfurt.de/dm2014/
The Symposium on Discrete Mathematics, the biennial meeting of the
Discrete Mathematics Section of the DMV (German Mathematical Society),
will take place on May 9-10, 2014 at Goethe University Frankfurt.
Main speakers:
- Karen Aardal (TU Delft and CWI Amsterdam)
- Michael Drmota (TU Wien)
- Jacob Fox (MIT)
- Jiri Matousek (Prague and ETH Zurich)
- Francisco Santos (Santander)
On the occasion of the symposium, the Richard-Rado-Prize 2014 for a
dissertation in Discrete Mathematics will be awarded. The prize is
funded by a donation of Springer-Verlag.
Executive committee of the Discrete Mathematics Section:
Christian Krattenthaler, Martin Skutella, Tibor Szabo, Thorsten Theobald
Local organization: Martina Juhnke-Kubitzke, Thorsten Theobald
------------------------------
Message: 6
Date: Tue, 18 Mar 2014 08:47:07 +0200
From: Gerhard-Wilhelm Weber <gweber@metu.edu.tr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Last CfP --- EUROPT 2014 --- Extension of deadline
for abstract submission: March 28
Message-ID: <20140318084707.10086o6xw5ehhecr@horde.metu.edu.tr>
Content-Type: text/plain; charset=ISO-8859-1; DelSp="Yes";
format="flowed"
==========================================
Last Announcement
Extension of deadline for submission of abstract: March 28, 2014
------------------------------------------------------------------
EUROPT 2014
Joint event with IFORS 2014
Date: July 10-12, 2014
Venue: Perpignan, France (1h30 to/from Barcelona by train)
Second Call for Papers
We invite all researchers from the optimization
community to take part in the EUROPT2014, to be held
in Perpignan, France, July 10-12, 2014.
EUROPT2014 is the annual event of the "EUROPT group",
the Continuous Optimization Working Group of EURO
(The Association of European Operational Research
Societies). EUROPT2014 is the 12th Workshop on advances
in continuous optimization. EUROPT2014 is a joint event of
the EURO/IFORS 2014 conference to be held in Barcelona,
July 13-18, 2014.
The academic program will consist in plenary talks and
parallel sessions covering several aspects of continuous
optimization.
Conference website:
http://europt2014.univ-perp.fr/index.html
Plenary speakers:
- Miguel F. Anjos, Polytechnique Montr?al Canada
- Jean-Baptiste Hiriart-Urruty, Universit? Paul Sabatier,
Toulouse, France
- Daniel Ralph, Cambridge UK
EUROPT Fellow Lecture by Immanuel Bomze, Vienna, Austria
Special Issue
A post-conference special issue of the journal Optimization
will be published.
Important Dates
January 1, 2014 Paper/abstract submission begins.
March 28, 2014 Paper submission deadline. (Extended deadline)
April 15, 2014 Paper acceptance/rejection notification.
January 1, 2014 Early registration begins.
May 15, 2014 Late registration begins.
Conference Topics
Classical topics developed in this series of
conferences are, but are not limited to:
- convex optimization and generalized convexity;
- local nonlinear optimization;
- global nonlinear optimization;
- optimal control - theory and applications;
- multiobjective optimization;
- conic optimization and semidefinite programming;
- semiinfinite optimization;
- robust optimization;
- stochastic optimization;
- large-scale methods in global search;
- optimization in data mining;
- data visualization for optimal decisions;
- applications of continuous optimization to combinatorial problems;
- optimization in industry, business and finance;
- supply chain management;
- analysis and engineering of algorithms;
- software development.
Didier Aussel and J.-N. Corvellec
(on behalf of the organizing committee)
=======================================================
------------------------------
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 73, Issue 17
**************************************
No comments:
Post a Comment