Tuesday, May 31, 2011

[DMANET] Call for site pre-proposals ISMP 2015

The Symposium Advisory Committee of the Mathematical Optimization
Society issues a call for pre-proposals to organize and host ISMP
2015, the triennial International Symposium on Mathematical
Programming.

ISMP is the flagship event of our society, regularly gathering over a
thousand scientists from around the world. The conference will be
held in or around the month of August, 2015. Hosting ISMP provides a
vital service to the mathematical optimization community and often has
a lasting effect on the visibility of the hosting institution. It
also presents a significant challenge. This call for pre-proposals is
addressed at local groups willing to take up that challenge.

Preliminary bids will be examined by the Symposium Advisory Committee
(SAC), which will then issue invitations for detailed bids. The final
decision will be made and announced during ISMP 2012 in Berlin.
Member of the SAC are
Jeff Linderoth, Chair <linderoth@wisc.edu>
Shabbir Ahmed, <sahmed@isye.gatech.edu>
Kurt Anstreicher <kurt-anstreicher@uiowa.edu>
Anders Forsgren, <andersf@kth.se>
Martine Labbe, <mlabbe@ulb.ac.be>
Philippe Toint <philippe.toint@fundp.ac.be>
Rüdiger Schultz <ruediger.schultz@uni-due.de>
Shuzhong Zhang, <zhangs@umn.edu>.

Preliminary bids should be brief and contain information pertaining to
the

1) Location,
2) Facilities: Campus? Hotel? Convention Center?,
3) Logistics: Accommodation and transportation, and
4) Likely local organizers.


Further information can be obtained from any member of the advisory
committee. Please address your preliminary bids until September 15,
2011 to Jeff Linderoth <linderoth@wisc.edu>.
--
Jeff Linderoth, Associate Professor
Dept. of Industrial and Systems Engineering
University of Wisconsin-Madison
O: 608-890-1931
http://www.engr.wisc.edu/ie/faculty/linderoth_jeffrey.html
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] [MobiWac 2011] ACM MobiWac || 10 days left for paper registration (fwd)

-----------------------
Call for Papers
ACM MobiWac 2011
-----------------------

The 9th ACM* International Symposium on Mobility Management and Wireless
Access (MobiWac 2011) will be held in conjunction with MSWiM 2011 (the
14th ACM International Symposium on Modeling, Analysis and Simulation of
Wireless and Mobile Systems) from October 31 to November 4, 2011 at Miami
Beach, FL, USA.

The MOBIWAC series of events are intended to provide an international
forum for the discussion and presentation of original ideas, recent
results and achievements by researchers, students, and systems developers
on issues and challenges related to mobility management and wireless
access protocols.

Authors are encouraged to submit both theoretical and practical results of
significance on all aspects of wireless and mobile access technologies,
with an emphasis on mobility management and wireless access. Authors are
invited to submit full papers describing original research. Submitted
papers must neither have been published elsewhere nor currently be under
review by another conference or journal.

TOPICS OF INTEREST include, but are not limited to:

- Wireless/Mobile Access Protocols
- Wireless/Mobile Web Access
- Wireless Internet and All-IP integration
- Next Generation Wireless systems
- Mobile Broadband Wireless Access
- Pervasive Communication and Computing
- Ubiquitous and mobile access
- Wireless Applications and testbeds
- Multi-Homing and Vertical Handoff
- Multi-Channel Multi-Radio MAC / network layer management
- Channels and resources allocation algorithms
- Energy and power management algorithms
- Multi-technology switching using Software Defined Radios
- Context-aware services and applications
- Context-aware protocols and protocol architectures
- Interactive applications
- Mobile database management
- Wireless Multimedia Protocols
- Mobile and Wireless Entertainment
- Mobile Info-services
- QoS management
- Mobility Control and Management
- Localization and tracking
- Mobile/Vehicular environment access
- Wireless ad hoc and sensor networks
- Security,Trust management and Privacy issues
- Fault Tolerance solutions
- Wireless Systems' Design
- Analysis/Simulation of wireless mobile systems
- Testbeds for experimental and simulation analysis

FOR MORE INFORMATION about the conference, organizing committee,
submission instructions, and venue please see the conference website
(http://www.mobiwac.org/).

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

ORGANIZING COMMITTEE:

General Chair

Jose Rolim, University of Geneva, Switzerland

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

Paper Submission, Publication and Important Dates:

High-quality original papers are solicited. Papers must be unpublished and
must not be submitted for publication elsewhere. All papers will be
reviewed by Technical Program Committee members and other experts active
in the field to ensure high quality and relevance to the Symposium. The
symposium will Have a single track for regular papers and in addition, a
separate interwoven track with short papers / posters. A paper should be
no more than 10 pages, double column, ACM style including tables and
figures. Only PDF format is accepted. All accepted papers will appear in
the Symposium proceedings published by ACM press.

- Paper registration due: June 10, 2011 (11:59PM EST)

- Submission Deadline: June 17, 2011 (11:59PM EST)

- Notification of Acceptance: July 25, 2011

- Camera Ready version due: August 10, 2011

- Speaker Author Registration deadline: September 6, 2011

- Regular Early Registration deadline: September 20,
2011----------------------------------------------------------------------------

You are receiving this call-for-papers from EDAS, based on your user
profile. To unsubscribe from call-for-paper messages such as this one, go
to "My profile" and update your areas of interest (link at top of page -
http://edas.info/editAreaInterest.php ).

--
Constantinos Marios Angelopoulos

Phd student
Department of Computer Engineering & Informatics
University of Patras & CTI
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Workshop "Data Mining in Agriculture" (DMA11) deadline extended

Workshop "Data Mining in Agriculture" (DMA'2011)

http://dma-workshop.de/

co-hosted with ICDM'2011, Aug 30th - Sep 3rd, 2011, NYC, USA

The deadline has been extended until June 11th, 2011!

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

Data mining, the art and science of intelligent analysis of (usually
large) data sets for meaningful (and previously unknown) insights, is
nowadays actively applied in a wide range of disciplines related to
agriculture. Due to the emerging importance of data mining techniques
and methodologies in the area of agriculture, this workshop aims to
bring together practitioners and researchers in this field. It creates
a community of people who are actively using data mining tools and
techniques and apply them to agriculture data.

Date/Location: September 2nd, 2011, New York City, USA
Workshop Chair: Georg Ruß, Otto-von-Guericke-Universität Magdeburg, Germany
Organisational Chair: Maria Patrunky, Universität Leipzig, Germany
Workshop Committee:
* Alexander Brenning, University of Waterloo, Waterloo, Canada
* Warwick Graco, Australian Taxation Office, Canberra, Australia
* Ernesto W. De Luca, TU Berlin, Germany
* Gonzalo Pajares Martinsanz, University Complutense of Madrid, Spain
* Antonio Mucherino, CERFACS, Toulouse, France, author of "Data Mining
in Agriculture"
* Allan Tucker, Brunel University, London, UK
Fees: EUR 220 per participant (workshop only, subject to change).
Different fees apply if also attending ICDM'2011. Please see the ICDM
website for details.
Workshop website: http://dma-workshop.de/
ICDM website: http://www.data-mining-forum.de/

Topics of interest include (but are not limited to):
* Data Mining on Sensor and Spatial Data from Agricultural Applications
* Analysis of Remote Sensor Data
* Feature Selection on Agricultural Data
* Evaluation of Data Mining Experiments
* Spatial Autocorrelation in Agricultural Data
* Information Extraction from Species Databases
* Data-Based Approaches to Tackling Plant Diseases

Submissions and Publications

Workshop papers will be published in the workshop proceedings by IBaI
publishing. PostScript (compressed and unencoded) or PDF paper
submissions should be formatted according to Springer LNCS format,
with a maximum of ten pages. Author's instructions along with LaTeX
and Word macro files are available on the web at Springer.
Papers will be submitted via an on-line reviewing system. The
reviewing system can be found at
http://www.data-mining-forum.de/cms-dma

Important Dates

Submission Deadline: May 27th, 2011
Notification Date: June 24th, 2011
Camera-Ready Date: July 8th, 2011
Workshop Date: September 2nd, 2011

----------------------------------------------------------------------------
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

GandALF 2011: call for partecipation

[We apologize if you have received multiple copies of this message]


********************************************************************************
 ---------------------               GandALF 2011                                  --------------------
********************************************************************************

Second International Symposium on Games, Automata, Logics, and Formal Verification
               Minori, Amalfi Coast, Italy, June 15-17, 2011

                        http://gandalf.dia.unisa.it/

                 ************************************************
                 |         CALL   FOR  PARTECIPATION                |
                 ************************************************

OBJECTIVES

The aim of the symposium is to bring together researchers from academia and industry
which are actively working in the fields of Games, Automata, Logics, and Formal 
Verification. The idea is to cover an ample spectrum of themes, ranging from theory 
to concrete applications, and to stimulate cross-fertilization.  
 
INVITED SPEAKERS

Thomas Colcombet  (CNRS, Paris FRANCE):  
The monadic theory of linear orders

Erich Graedel            (RWTH Aachen University, GERMANY):
Dependence, Independence, and Incomplete Information

Moshe Vardi              (Rice University, Houston USA):
The Rise and Fall of LTL

PROGRAMME 

REGISTRATION
The registration fee for GandALF 2011 amounts to 250 euro and includes: conference participation, 
proceedings, coffee-breaks, conference banquet, and excursion. Extra banquet tickets will be available 
on site at 50 euro each. 
To register, go to

 http://gandalf.dia.unisa.it/2011/index,php?page=registration.inc 


and follow  the instructions. 



The  social event  is scheduled for June 16th. Participants will enjoy a boat trip to Amalfi,
 where an official guide will lead the GandALF 2011 "gang" through a tour of the Amalfi Cathedral 
and Diocesan Museum. The social dinner will be held at the end of the tour in a typical Amalfitan
 restaurant.   After the dinner, return to Minori by coach. 



Please visit the conference website (http://gandalf.dia.unisa.it) for more
information.


 

Call for Papers: MACIS 2011

[Apologies if you receive multiple copies]

MACIS 2011 - Fourth International Conference on
Mathematical Aspects of Computer and Information Sciences
Beijing, China, October 19-21, 2011

http://macis2011.cc4cm.org/

CALL FOR PAPERS

MACIS is a series of conferences where foundational research on
theoretical and practical problems of mathematics for computing and
information processing may be presented and discussed. MACIS also
addresses experimental and case studies, scientific and engineering
computation, design and implementation of algorithms and software
systems, and applications of mathematical methods and tools to
outstanding and emerging problems in applied computer and information
sciences. Each conference focuses on two or three themes.

The themes for MACIS 2011 are:

- Design and Analysis of Complex Systems
- Numeric and Symbolic Constraint Solving
- Cryptography and Coding Theory

see the end of this call for a detailed list of topics.

SUBMISSION

Potential participants of MACIS 2011 are invited to submit extended
abstracts (3-4 pages) or full papers describing their work to be
presented at the conference. The submitted extended abstracts and full
papers will be reviewed by members of the Program Committee (PC) for
soundness and relevance to the conference. Submission of original
research papers is encouraged, while published material and work in
progress will also be considered for presentation at the conference.
Electronic submissions are strongly preferred using EasyChair

http://www.easychair.org/conferences/?conf=macis2011

or should be sent by e-mail as .pdf attachments to the PC Co-chair:

Dr. Ilias S. Kotsireas
Wilfrid Laurier University
Waterloo ON, CANADA
e-mail: ikotsire@wlu.ca

Accepted extended abstracts and full papers will be printed for
distribution at the conference. Authors of the extended abstracts and
full papers accepted for presentation at the conference will be
invited to submit their full and/or revised papers for publication in
special issues of Mathematics in Computer Science
(MCS - http://www.cc4cm.org/mcs) by Birkhaeuser/Springer after the
meeting. The submitted papers will be formally reviewed by PC members
and external referees according to the refereeing procedure of MCS.

IMPORTANT DATES

Submission of papers/extended abstracts: July 31, 2011
Notification of acceptance or rejection: September 5, 2011
Conference taking place: October 19-21, 2011
Deadline for full paper submission: December 15, 2011

GENERAL CHAIRS
Dongming Wang (Université Pierre et Marie Curie - CNRS, France)
Zhiming Zheng (Beihang University, China)

LOCAL COMMITTEE CHAIR
Meng Zhou (Beihang University, China)

PROGRAM COMMITTEE
Hirokazu Anai (Fujitsu Laboratories Ltd / Kyushu University, Japan)
Hoon Hong (North Carolina State University, U.S.A.)
Deepak Kapur (University of New Mexico, U.S.A.)
Ilias Kotsireas (Wilfrid Laurier University, Canada), Co-chair
Laura Kovacs (Vienna University of Technology, Austria)
Dongdai Lin (Institute of Software, Chinese Academy of Sciences, China)
Edgar Martinez Moro (University of Valladolid, Spain)
Stefan Ratschan (Czech Academy of Sciences, Czech Republic), Co-chair
Nathalie Revol (INRIA, France)
Enric Rodríguez-Carbonell (Technical University of Catalonia, Spain)
Sriram Sankaranarayanan (University of Colorado Boulder, U.S.A.)
Thomas Sturm (Max Planck Institute for Computer Science, Germany)
Bican Xia (Peking University, China)
Lihong Zhi (Institute of Systems Science,
Chinese Academy of Sciences, China)

PUBLICITY CHAIR
Georg Regensburger (INRIA Saclay, France)

TOPICS OF INTEREST INCLUDE

- Design and Analysis of Complex Systems

Software systems; hardware systems; control systems; biological
systems; physical systems; dynamical systems; hybrid
(e.g. cyber-physical) systems; nondeterminism/uncertainty;
mathematical modeling; simulation; formal verification;
systems/controller synthesis; computational techniques and tools

- Numeric and Symbolic Constraint Solving

Systems of equations; quantifier elimination and decision procedures;
(global) optimization; differential equations; numeric, symbolic,
interval and hybrid solution techniques; application, especially in
systems analysis and design; proof obligations in formal verification

- Cryptography and Coding Theory

Error-correcting codes; decoding algorithms; related combinatorial and
complexity problems; algorithmic aspects of cryptology; symmetric
cryptology; public-key cryptography; cryptanalysis; computational
and algebraic paradigms in postquantum cryptology; discrete
mathematics and algorithmic tools related to coding and cryptography;
boolean functions; sequences; computation in finite fields and
related algebraic systems.

Monday, May 30, 2011

Turan 100 Conference

Dear Colleague:

Some time ago we informed many mathematicians about the Paul Turan
Memorial Conference in Budapest. Upon inspecting our list of
addresses, we realized that the news might not have reached a good
number of potential participants. To remedy this, we are sending our
original announcement to a new list that we compiled recently. In
addition, we extended the deadline for paying the discounted early
registration fee. We apologize if you are already aware of the
information below.

Paul Turan, one of the greatest Hungarian mathematicians was born 100
years ago, on August 18, 1910. To celebrate this occasion we plan to
organize a conference (due to some technical reasons) in the summer of
2011, devoted to the main areas of his interest: number theory,
selected branches of analysis, and selected branches of combinatorics.

The conference will be held in Budapest, August 22-26, 2011 (arrival
date Sunday, August 21, departure date Saturday, August 27).

Some of the invited lectures will review different aspects of Paul
Turan's work and influence. Most of the lectures will allow
participants to report about their own work in the above mentioned
areas of mathematics.

You can register online at the homepage of the conference:
http://www.renyi.hu/~turan100/. You can pay the registration fee
online and make a hotel reservation at special discounted rates. If
you plan to give a lecture, please indicate the title in the Comments
box (under Registration) by June 15. In addition, we encourage you to
pay the early registration fee by June 15, as the normal fee starting
June 16 will be higher. Detailed information about how to pay is
available on the homepage.

Please address all correspondence to: turan100@renyi.hu

Looking forward to seeing in you Budapest.

In the name of the organizers: Janos Pintz (chairman), Andras Biro,
Kalman Gyory, Gergely Harcos, Miklos Simonovits, Jozsef Szabados,
Endre Szemeredi


CALCO 2011: First Call for Participation

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

CALL FOR PARTICIPATION: CALCO 2011

4th International Conference on Algebra and Coalgebra in Computer Science

August 29 - September 2, 2011

Winchester, UK

http://calco2011.ecs.soton.ac.uk/

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

!! REGISTRATION NOW OPEN !!

Early registration deadline: July 15, 2011

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


CALCO aims to bring together researchers and practitioners with
interests in foundational aspects, and both traditional and emerging
uses of algebras and coalgebras in computer science.

This is a high-level, bi-annual conference formed by joining the
forces and reputations of CMCS (the International Workshop on
Coalgebraic Methods in Computer Science), and WADT (the Workshop on
Algebraic Development Techniques). Previous CALCO editions took place
in Swansea (Wales, 2005), Bergen (Norway, 2007) and Udine (Italy,
2009). The fourth edition will be held in the city of Winchester
(UK), a historic cathedral city and the ancient capital of Wessex
and the Kingdom of England.

CALCO 2011 will be preceded by the CALCO Young Researchers Workshop,
CALCO-Jnr, dedicated to presentations by PhD students and by those who
completed their doctoral studies within the past few years.

The programme of CALCO will also comprise presentations of tools based on
algebraic and/or coalgebraic principles, that have been selected in the context
of a dedicated workshop, CALCO-Tools.

-- INVITED SPEAKERS --

* Vincent Danos (UK): Energy as Syntax
* Javier Esparza (Germany): Solving Fixed-Point Equations by Derivation Tree Analysis
* Philippa Gardner (UK): Abstract Local Reasoning about Program Modules
* Gopal Gupta (USA): Infinite Computation, Coinduction and Computational Logic

-- CALCO ACCEPTED PAPERS --

* Clement Fumex, Neil Ghani and Patricia Johann. Indexed Induction and Coinduction, Fibrationally
* Jort Bergfeld and Yde Venema. Model constructions for Moss' coalgebraic logic
* Jiri Adamek, Mahdie Haddadi and Stefan Milius. From Corecursive Algebras to Corecursive Monads
* Sergey Goncharov and Lutz Schroeder. A Counterexample to Tensorability of Effects
* Camilo Rocha and Jose Meseguer. Proving Safety Properties of Rewrite Theories
* Ekaterina Komendantskaya and John Power. Coalgebraic semantics for derivations in logic programming
* Adriana Balan and Alexander Kurz. Finitary Functors: from Set to Preord and Poset
* Joost Winter, Marcello Bonsangue and Jan Rutten. Context-Free Languages, Coalgebraically
* Marta Bilkova, Alexander Kurz, Daniela Petrisan and Jiri Velebil. Relation Liftings on Preorders
* Murdoch Gabbay, Tadeusz Litak and Daniela Petrisan. Stone duality for nominal Boolean algebras with `new': topologising Banonas
* Bart Jacobs. Bases as Coalgebras
* Thorsten Altenkirch, Peter Morris, Fredrik Nordvall Forsberg and Anton Setzer. A categorical semantics for inductive-inductive definitions
* Jun Kohjina, Toshimitsu Ushio and Yoshiki Kinoshita. Coalgebraic Approach to Supervisory Control of Partially Observed Mealy Automata
* Ichiro Hasuo. The Microcosm Principle and Compositionality of GSOS-Based Component Calculi
* Mihai Codescu and Till Mossakowski. Refinement trees: calculi, tools and applications
* Baltasar Trancon Y Widemann and Hauhs Michael. Distributive-Law Semantics for Cellular Automata and Agent-Based Models
* Corina Cirstea. Model Checking Linear Coalgebraic Temporal Logics: an Automata-Theoretic Approach
* Katsuhiko Sano. Generalized Product of Coalgebraic Hybrid Logics
* Rasmus Ejlers Mogelberg and Sam Staton. Linearly-used state in models of call-by-value
* Fredrik Dahlqvist and Dirk Pattinson. On the fusion of coalgebraic modal logics
* Manuel A. Martins, Alexandre Madeira, Razvan Diaconescu and Luis Barbosa. Hybridization of Institutions

-- CALCO-Tools ACCEPTED PAPERS --

* Luca Aceto, Georgiana Caltais, Eugen-Ioan Goriac and Anna Ingolfsdottir. PREG Axiomatizer - A Ground Bisimilarity Checker for GSOS with Predicates
* Pawel Sobocinski and Jennifer Lantair. WiCcA: LTS generation tool for wire calculus
* Francisco Duran, Camilo Rocha and Jose Maria Alvarez. Tool Interoperability in the Maude Formal Environment
* Andre Martins, Luis Barbosa and Nuno Rodrigues. SHACC: A functional animator for a component calculus
* Ulrich Berger, Kenji Miyamoto, Helmut Schwichtenberg and Monika Seisenberger. Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras
* Musab Alturki and Jose Meseguer. PVeStA: A Parallel Statistical Model Checking and Quantitative Analysis Tool

-- LOCATION --

Winchester is a beautiful historic city in southern England, known for
its 11th-century cathedral and 12th-century castle. It is located just
under an hour by rail from London Waterloo, and 15 minutes by road or
rail from Southampton Airport. London Heathrow is 50 miles away and
London Gatwick 72 miles away.

-- GRANTS --

CALCO has limited funds to support the attendance of PhD students.
Details on how to apply are available on the CALCO 2011 website.

-- FURTHER INFORMATION --

Queries should be emailed to calco2011@ecs.soton.ac.uk


.

[DMANET] CFP: 3rd ExtremeCom 2011 *** EXTENDED DEADLINE ****

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

*****************************************************************************
CALL FOR PAPERS AND DEMOS
3rd Extreme Conference on Communication - The Amazon Expedition
EXTREMECOM 2011
http://extremecom.org/
*****************************************************************************

Important dates
---------------
*******Submission deadline: extended to June 20, 2011********
Notification of acceptance: July 15, 2011

Conference dates: September 26-30, 2011
Field experience and network deployment: September 26-28
Technical sessions: September 29-30

*****************************************************************************
Scope
-----
The Extreme Conference on Communication (ExtremeCom) brings together
researchers and practitioners in areas related to communications in
rural and remote environments, in order to gain experience and insight
into the challenges that such environments pose for the network and
the users. We welcome a broad range of topics concerning both
technical and economical aspects, for example delay tolerant networks
and other networking paradigms, business and services models, low
power devices and protocols, user experiences and web applications.

Following on from the success of ExtremeCom 2009 - The Midnight Sun
Expedition in Laponia, Sweden, and ExtremeCom 2010 - The Himalayan
Expedition in Dharamsala, India, we now offer ExtremeCom 2011 - The
Amazon Expedition. In this edition, we aim to explore the challenges
of the deep Amazon Rainforest in Brazil. The chosen spot, which is
located 21 miles (34 km) from Manaus, is known as Praia do Tupé (Tupé
beach), a beautiful and remote beach accessed only by boat through the
waters of the Black River. The population is composed by natives
living in little communities spread around the jungle and also on the
river shore. These people experience constant communication
interruptions and most of them do not have any access to the Internet,
which makes this area a great field of experiments for extreme and
rural communications.

Hosted by the Federal University Of Amazonas (UFAM) the conference will
start with 3 days of immersion into the jungle where the conference
participants will aid in setting up and deploying an extension of a
DTN system in this area in order to provide connectivity to a new
community. During this time the participants will have the chance to
hike around the trails, interact with the locals and also know some
natural phenomenons like the "meeting of the waters", where the black
waters of the Negro River meet the brown waters of the Solimões River,
flowing side by side without mixing for about 9 km.

The immersion will not only give a better idea of both the technical
and user requirements of such a system, but it will also give many
opportunities for informal research discussions between the
participants. Participants that have their own software for scenarios
like this will also, to as great an extent as possible, be encouraged
to test and demonstrate it within this environment.

Upon reaching the end of the "field experience", there will be two
days of paper presentations and demos in a more traditional conference
venue at UFAM's facilities in Manaus. Focus will still be on informal
research discussions, with the hope that the field experience will
give participants the ability to discuss the topics in a new light.

Participants should submit 6 page papers about ideas and visions about
the topics of the conference or demo proposals to be shown during the
conference. Visionary and thought-provoking papers that are likely to
generate much discussion during the conference are especially
solicited. The aim of the conference is to maintain an informal
environment, where new research ideas can be discussed and
developed. We also hope to have a demo session where participants
can show their implementations and systems. If you want to show a demo,
please submit a 2 page demo proposal using the same submission system
as for conference papers. Accepted papers will be published in the ACM
Digital Library.

Topics for the conference include, but are not limited to:
* Testbeds for large-scale sustainable testing of DTN systems
* Real deployments of networks in extreme environments
* Business and service models for networks in rural, remote, and other
challenging environments
* User experience research
* Delay tolerant networking
* Low-power and intermittent-power protocols
* Mechanisms for emergency and urgent communications
* Networked applications and services

Due to logistics and the need to conduct the conference in harmony with
the local population and the environment, the number of participants
will be limited. Priority will be given to authors of papers and those
who register first.

*****************************************************************************
Organizers
----------
General co-chairs:
Anders Lindgren, Swedish Institute of Computer Science, Sweden
Pan Hui, Deutsche Telekom Laboratories and TU Berlin, Germany

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

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] ICALP 2011 - Final Call for Participation

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

ICALP 2011
38th International Colloquium on Automata, Languages and Programming

July 4-8, 2011
Zurich, Switzerland
http://icalp11.inf.ethz.ch/

Early registration deadline: June 5, 2011

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

The 38th International Colloquium on Automata, Languages and
Programming, the main conference and annual meeting of the European
Association for Theoretical Computer Science (EATCS), will take place
July 4-8, 2011 in Zurich, Switzerland.

ICALP 2011 comprises three tracks:

Track A: Algorithms, Complexity and Games (chaired by Jiri Sgall),
in which 68 out of 240 submissions were selected for presentation at
the conference;

Track B: Logic, Semantics, Automata and Theory of Programming
(chaired by Luca Aceto), in which 29 out of 103 submissions were
selected for presentation at the conference; and

Track C: Foundations of Networked Computation: Models, Algorithms
and Information Management (chaired by Monika Henzinger), in which
17 out of 52 submissions were selected for presentation at the
conference.

>From each track the program committees selected both a best paper and
a best student paper (all authors are students), all of which will be
presented within plenary sessions.

Beyond the 114 contributed talks there will be invited lectures by

Rajeev Alur, University of Pennsylvania
Thore Husfeldt, IT University of Copenhagen
Catuscia Palamidessi, INRIA Saclay and LIX
Ronen Shaltiel, University of Haifa
Eva Tardos, Cornell University

Finally, there will be an award ceremony devoted to the presentation
of the EATCS award and the Presburger award to young scientists.

For more information, please refer to the detailed program at
http://icalp11.inf.ethz.ch/program

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

On Sunday, July 3, 2011, the day before the main conference starts,
there will be four workshops:

GA - Graph algorithms and Applications
-> http://icalp11.inf.ethz.ch/workshops/ga-graph-algorithms-and-applications

GT - Group Testing -> http://sites.google.com/site/icalp2011gt/

DCM - 7th International Workshop on Developments of ComputationalModels
-> http://www.pps.jussieu.fr/~jkrivine/conferences/DCM2011/

SDKB - 5th International Workshop on Semantics in Data and Knowledge Bases
-> http://www.is.informatik.uni-kiel.de/events/sdkb_2011/

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

ICALP 2011 is supported by the European Association for Theoretical
Computer Science (EATCS), the Swiss National Science Foundation and
Google Inc. and it is organized by the Institute of Theoretical
Computer Science, ETH Zurich, represented by the conference chairs
Michael Hoffmann, Juraj Hromkovic, Ueli Maurer, Angelika Steger, Emo
Welzl and Peter Widmayer.

Contact:
ICALP 2011
Institute of Theoretical Computer Science
ETH Zurich, CAB G19.1
Universitaetsstrasse 6
CH-8092 Zurich
Switzerland
email: <icalp11@inf.ethz.ch>

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Call for Papers for the 4th IEEE International Workshop on Wireless Sensor, Actuator and Robot Networks (WiSARN-FALL 2011)

------------------------------------------------------------------------
Call for Papers for the 4th IEEE International Workshop on
Wireless Sensor, Actuator and Robot Networks (WiSARN-FALL 2011)
http://researchers.lille.inria.fr/~mitton/WiSARN-fall2011/

To be held in conjunction with the 8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems
(IEEE MASS 2011)
October 17-22, 2011, Valencia, Spain.

Wireless sensor and actor networks (WSAN) are the confluence point where the traditional
fields of wireless sensor networks (WSN), robot networks and control theory meet. In WSAN,
nodes collaborate to accomplish distributed sensing and actuation tasks. Leveraged by the
control and mobility of actors, the networking process and applications embrace a whole new
set of possibilities. Actors may deploy, repair and relocate sensors to improve coverage, build
routes and fix network partition to ensure data communication, change network topology to
shape routing patterns and balance energy consumption, and respond to reported events in a
timely and effective manner. The benefits are limited only by imagination. As an emerging
field, WSAN are in need of new networking techniques, by which they can fully exploit their
particularities and potentials. WiSARN aims to bring together state-of-the-art contributions on
the design, specification and implementation of architectures, algorithms and protocols for
current and future applications of WSAN. Original, unpublished contributions are solicited in
ALL aspects of WSAN, WSN, robot networks, and robotics and automation. Possible topics
include, but are not limited to:
・ Autonomous sensor networks
・ Emergent behavior in WSAN
・ Modeling and simulation of WSAN
・ WSAN architectural and operational models
・ Autonomic and self-organizing coordination and communication
・ Sensor-/actor (robot)- actor coordination and actor task assignment
・ Biologically inspired communication
・ Energy-efficient and real-time communication protocols
・ Bandwidth-efficient and delay-tolerant communication protocols
・ Communication protocols for swarms of mobile actors (robots)
・ Data management, gathering, aggregation and query processing
・ Distributed control and management in WSAN
・ Neighborhood discovery and mobility management
・ Map exploration and pattern formation of mobile robots
・ Localization and time synchronization and in WSAN
・ Quality of Service, security and robustness issues
・ Architectures and topology control
・ Probabilistic integration in WSAN
・ Hybrid networks and wireless Internet
・ Ecological systems
・ Applications and prototypes
Accepted papers with a FULL registration to the main conference will be included in the
conference proceedings. No-shows of accepted papers at the workshop will result in those
papers NOT being included in the IEEE CPS and included in MASS proceedings. Thus, all
papers will be EI-indexed, and be found by IEEE Explore. Selected best papers will be invited
to a special issue of Ad Hoc & Sensor Wireless Networks (SCIE-indexed).


IMPORTANT DATES:
Paper submission: June 26th, 2011
Author notification: July 22th, 2011
Final manuscript due: August 12th, 2011

General Chair:
Ivan Stojmenovic, University of Ottawa, Canada
Program Co-Chairs:
Jiming Chen, Zhejiang University, China
Hannes Frey, Univerity of Paderburn, Germany
Nathalie Mitton, INRIA, France
Submission Chair:
Rafael Falcon, University of Ottawa, Canada
Publicity Co-Chairs:
Mianxiong Dong, University of Aizu, Japan
Antoine Gallais, University of Strasbourg, France
Hangguan Shan, Zhejiang University, China


For further information, please refer to the above WiSARN-Fall 2011 website,
or contact the program co-chairs:
Dr. Jiming Chen at jmchen.zju@gmail.com
Dr. Hannes Frey at hannes.frey@uni-paderborn.de
Dr. Xu Li at easylix@gmail.com

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Friday, May 27, 2011

[DMANET] WADS 2011 --- CALL FOR PARTICIPATION

WADS 2011
Algorithms and Data Structures Symposium
August 15-17, 2011
Polytechnic Institute of New York University
Brooklyn, New York, USA
http://www.wads.org

Invited Speakers:
* János Pach
* Mihai Patrascu
* Robert E. Tarjan

Accepted Papers:
http://papers.wads.org/

Early registration ends June 15. Early registration fees are $159 for
students and $299 for non-students. To register for WADS, please go
to http://registration.wads.org

A block of rooms has been reserved at the Aloft Hotel Brooklyn, a new
hotel very close to the NYU:Poly campus. The rate is $135 per
night+tax for up to two people. Reservations for the hotel open in
June; reservations can not be made before June 1 as the hotel is not
yet open. More information is at http://accomodation.wads.org/

For travel information, please go to http://travel.wads.org

We look forward to seeing you in Brooklyn.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

WADS 2011 --- CALL FOR PARTICIPATION

WADS 2011
Algorithms and Data Structures Symposium
August 15-17, 2011
Polytechnic Institute of New York University
Brooklyn, New York, USA
http://www.wads.org

Invited Speakers:
* János Pach
* Mihai Patrascu
* Robert E. Tarjan

Accepted Papers:
http://papers.wads.org/

Early registration ends June 15. Early registration fees are $159 for
students and $299 for non-students. To register for WADS, please go
to http://registration.wads.org

A block of rooms has been reserved at the Aloft Hotel Brooklyn, a new
hotel very close to the NYU:Poly campus. The rate is $135 per
night+tax for up to two people. Reservations for the hotel open in
June; reservations can not be made before June 1 as the hotel is not
yet open. More information is at http://accomodation.wads.org/

For travel information, please go to http://travel.wads.org

We look forward to seeing you in Brooklyn.

Thursday, May 26, 2011

[DMANET] CFP: JCM Special Issue on Security and Privacy in Communication Systems and Networks

CALL FOR PAPERS

Journal of Communications
Special Issue on
Security and Privacy in Communication Systems and Networks

The rapid advancement of communication technologies has revolutionized human's
lifestyles by providing the best convenience and flexibility ever in accessing the Internet
services and various types of personal communication applications. For instance, with the
emerging wireless communication technologies, healthcare industry now is offering high
quality services to patients with low costs through a variety of applications enabled by
wireless and information technologies. This is because these wireless-equipped healthcare
systems enable remote and continuous monitoring of patients' health status in both
residential settings and outdoor settings, where patients feel more comfortable and their
activities are less restricted. Early detection of emergency situations via wireless
communications makes it possible to provide timely first-aid and access patient's health
information in a pervasive manner, thereby improving reliability and efficiency of our health
care system. Although huge potential benefits are widely recognized, there are many
challenges especially with respect to security and privacy issues.

The objective of this special issue is to bring together state-of-the-art contributions on the
modeling, designing, implementation, deployment, and management of computer/network
security systems, architectures and protocols. We solicit contributions to the evaluation,
optimization, and/or enhancement of security mechanisms for current technologies as well
as new designs for efficient security and privacy solutions of emerging technologies, e.g.,
M2M Communications. High quality and original research papers are solicited in all related
areas of emerging communication systems and network technologies. Topics of interest
include, but are not limited to:
* Security design for cognitive radio networks
* Security and privacy in M2M and its applications
* Key distribution and management
* Security design for sensor/Ad Hoc networks
* Security and privacy in VANETs
* Security and privacy in Healthcare
* RFID security
* Cross layer approach to security
* Secure cooperation in wireless networks
* Network coding security
* Social network security
* Mobile code security
* Distributed system security
* Forensic applications and techniques in communication systems and networks

IMPORTANT DATES

Paper Submission Deadline    August 15, 2011
Acceptance Notification          November 30, 2011
Final Manuscript Due             January 1, 2012
Tentative Publication Date       Q2, 2012

SUBMISSION

The submitted papers must be written in English and describe original research which is
not published nor currently under review by other journals or conferences. Submissions
should follow the author guidelines of Journal of Communications and the complete
instructions for prospective authors can be found at
http://www.academypublisher.com/jcm/authorguide.html.

For further questions or inquiries, please contact Dr. Xiaodong Lin at xiaodong.lin@uoit.ca.

GUEST EDITORS

Xiaodong Lin, University of Ontario Institute of Technology, Canada
E-mail: xiaodong.lin@uoit.ca

Joel Rodrigues, Institute of Telecommunications, University of Beira Interior, Portugal
E-mail: joeljr@ieee.org

Xu Li, INRIA Lille – Nord Europe, France
E-mail: xu.li@inria.fr
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] CFP: The 2011 IEEE International Conference on Internet of Things

[Please accept our apologies if you received multiple copies of this call]
Please circulate this CFP among your colleagues and students.

[Proceedings will be published by IEEE Computer Society (EI indexed)]
[Extended versions of selected papers will be published in SCI-indexed journals]

[Call for Papers]

----------------------------------------------------------------------------
                                iThings 2011
          The 2011 IEEE International Conference on Internet of Things
                         Dalian, China, October 19-22, 2011
                            http://www.ieee-iot.org/

                         in conjunction with
CPSCom 2011: The 4th IEEE International Conference on Cyber, Physical, and Social Computing
----------------------------------------------------------------------------
                   
             Smarter Internet, Better Life

***************
1.Introduction
***************

The Internet of Things (iThings) is a network of Internet-enabled objects,
which aims at increasing the ubiquity of the Internet by integrating every
object for interaction via embedded systems and leads to the highly distributed
network of devices communicating with human beings as well as other devices.
Combining with the infrastructures of the every heterogeneous networks
including Internet and mobile networks, these objects can communicate
with humans, and enable peoples to monitor and control them and enjoy
their intelligent services in anytime and anywhere.

The 2011 IEEE International Conference on Internet of Things (iThings 2011)
will provide a high-profile, leading-edge forum for researchers, engineers,
and practitioners to present state-of-art advances and innovations in
theoretical foundations, systems, infrastructure, tools, testbeds,
and applications for the Internet of Things, as well as to identify
emerging research topics and define the future. iThings 2011 is the
next edition of the successful series, previously held as IOTS 2010
(Hangzhou, China, December 2010), EPS 2009 (Vancouver, Canada, August 2009),
MINES 2009 (Hangzhou, China, May 2009), and MINES 2008 (Chengdu, China, July 2008).


**********
2. Topics
**********

The focus of iThings 2011 is on bringing together relevant researchers to
explore Internet of Things technologies and applications. The scope of the
conference includes, but not limited to, the following areas:

Track 1: Architecture and Infrastructure
Track 2: System Design, Modeling and Evaluation
Track 3: Intelligent Data Processing
Track 4: Networks and Communications
Track 5: Reliability, Security, Privacy and Trust
Track 6: Applications, Business and Social Issues

*****************
3.Important Dates
*****************

Paper Submission Due: June 15, 2011     
Notification of Acceptance: July 15, 2011     
Camera-ready Paper Due: August 15, 2011

*************************
4.Submission Information
*************************

AAuthors are invited to submit original papers that MUST NOT have been
submitted to or published in any other workshop, conference, or journal.
Full Papers (up to 10 pages) and Short Papers (up to 4 pages) are solicited.
Detailed submission instructions could be found on the conference website
http://ieee-iot.org. All papers will be reviewed by the Program Committee
for significance, originality, accuracy, and clarity.

**************
5.Publications
**************

Each submission should be regarded as an undertaking that, if the paper
is accepted, at least one of the authors must attend the conference to
present the work in order for the paper to be included in the IEEE
Digital Library. Accepted papers will be published in the proceedings of
iThings 2011 by IEEE Computer Society (EI indexed). Extended versions of
selected papers will be considered for publication in several SCI-index
international journals (check the website for details)


**********************
7.Organizing Committee
**********************

Honorary Chairs
Yaoxue Zhang, Tsinghua University, China
Junliang Chen, Beijing University of Posts and Telecommunications, China
Jingping Ou, Dalian University of Technology, China

General Chairs
Huadong Ma, Beijing University of Posts and Telecommunications, China
Mohammad S. Obaidat, Monmouth University, USA
Zhongxuan Luo, Dalian University of Technology, China

General Executive Chair
Zhikui Chen, Dalian University of Technology, China

Program Chairs
Feng Xia, Dalian University of Technology, China
Isaac Woungang, Ryerson University, Canada
Georgios Papadimitriou, Aristotle University, Greece

Program Vice-Chairs
Petros Nicopolitidis, Aristotle University, Greece
Wei Wang, State University of New York, USA
Helen Karatza, Aristotle University, Greece
Sozo Inoue, Kyushu Institute of Technology, Japan

Workshop Chairs
Huajun Chen, Zhejiang University, China
Huansheng Ning, Beihang University, China
Min Chen, Seoul National University, Korea

Demo/Exhibition Chairs
Zhiming Ding, Software Institute, Chinese Academy of Sciences, China
Yu Zhu, China Mobile, China

Summit Chairs
Zhong Chen, Peking University, China
Benxiong Huang, Huazhong University of Science and Technology, China
Zhongfei Zhang, Zhejiang University, China


Steering Chairs
Jianhua Ma, Hosei University, Japan
Laurence T. Yang, St Francis Xavier University, Canada

Sponsorship Chair
Fengqi Li, Dalian University of Technology, China

Program Committee
See the conference website: http://ieee-iot.org/

***********
8.Contact
***********
ithings2011@googlegroups.com
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Summer School on High-dimensional Geometric Computing

MADALGO & CTIC Summer School on

HIGH-DIMENSIONAL GEOMETRIC COMPUTING

August 8-11, 2011, Aarhus University,
Denmark

www.madalgo.au.dk/highdimgeo2011


OVERVIEW AND GOAL
Many computational tasks can be naturally modeled as geometric problems
in high-dimensional
spaces. Data sets in areas such as optimization, computer vision,
machine learning or statistics
often live in spaces of dimensionality in the order of thousands or
millions. However, geometric
algorithms and data structures often require time or space that is
exponential in the dimension.
Overcoming this "curse of dimensionality" has been a subject of
extensive research over the last few
decades.

The goal of the summer school is to provide an in-depth introduction to
some of the key problems and
techniques in high-dimensional geometric computing. The school will
cover topics such as linear
programming, algorithms for spaces with low intrinsic dimension,
high-dimensional combinatorics and
similarity search. A number of interesting open problems in the area
will also be highlighted.

LECTURES
The school will be taught by experts in the area of high-dimensional
geometric computing. The
lecturers will include:
* Piotr Indyk (MIT)
* Ken Clarkson (IBM Research)
* Nati Linial (Hebrew University)
* Thomas Dueholm Hansen (Aarhus University)

PARTICIPATION
The summer school will take place on August 8-11, 2011 at Center for
Massive Data Algorithmics
(MADALGO) and Center for the Theory of Interactive Computation (CTIC) in
the Department of
Computer Science, Aarhus University, Denmark.

The school is targeted at graduate students, as well as researchers
interested in an in-depth
introduction to high-dimensional geometric computing.

The capacity of the summer school is limited. Prospective participants
should register using the online
registration form available at www.madalgo.au.dk/highdimgeo2011 as soon
as possible. Registering
graduate students must also have their supervisor send a letter
confirming their graduate student status
directly to Gerth Brodal at gerth@madalgo.au.dk; the subject line of the
email should be
'student_last_name/SS_2011/confirming'. Registration is on a
first-come-first-serve basis and will
close on Monday June 27, 2011.

Registration is free; handouts, coffee breaks, lunches and a dinner will
be provided by MADALGO,
CTIC and Aarhus University.

ORGANIZING COMMITTEE
* Lars Arge (MADALGO, Aarhus University)
* Gerth S. Brodal (MADALGO, Aarhus University)
* Piotr Indyk (MADALGO, MIT)
* Else Magard (MADALGO, Aarhus University
* Peter Bro Miltersen (CTIC, Aarhus University)
* Dorthe Haagen Nielsen (CTIC, Aarhus University)

ABOUT MADALGO
Center for Massive Data Algorithmics is a major basic research center
funded by the Danish National
Research Foundation. The center is located at the Department of Computer
Science, Aarhus
University, Denmark, but also includes researchers at CSAIL,
Massachusetts Institute of Technology in
the US, and at the Max Planck Institute for Informatics and at Frankfurt
University in Germany. The
center covers all areas of the design, analysis and implementation of
algorithms and data structures
for processing massive data (interpreted broadly to cover computations
where data is large
compared to the computational resources), but with a main focus on
I/O-efficient, cache-oblivious and
data stream algorithms.

ABOUT CTIC
Center for the Theory of Interactive Computation is a Sino-Danish
research center funded by the
Danish National Research Foundation and by the Chinese National Natural
Science Foundation of
China (NFSC). The center is a tight collaboration between the Computer
Science Department at
Aarhus University, Denmark and IIIS, Tsinghua University, Beijing,
China. Research within the center
focuses on four related areas of theoretical computer science:
Computational Complexity Theory,
Cryptography, Quantum Informatics, and Algorithmic Game Theory.

[DMANET] Postdoc Positions in Telecommunications/Combinatorial Algorithms/...

The School of Electrical Engineering and the Department of Communications
and Networking at Aalto University, Helsinki, Finland, have several open

Postdoctoral Positions

with various themes (see the links below for further details).
The theme of "Information Theory and Computational Coding Theory"
should be interpreted broadly and with an emphasis on the computational
part: combinatorial algorithms, discrete mathematics,... Inquiries
regarding this position can be sent to Prof. Patric Ostergard
(patric.ostergard@tkk.fi, http://users.tkk.fi/u/pat/). If necessary,
the deadline (of June 17, 2011) will be extended until the position is
filled.

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

Aalto University, School of Electrical Engineering, conducts academic
research in the fields of electronics and electrical engineering,
automation and systems technology, radio science and engineering, signal
processing and acoustics, communications and networking, and micro- and
nanosciences. Moreover, the school hosts the Metsähovi Radio
Observatory. The School of Electrical Engineering builds on the
160-year history of the Helsinki University of Technology, now as one of
the four independent engineering schools of the newly formed Aalto
University.

Aalto University School of Electrical Engineering
(http://elec.aalto.fi/en) has two sets of post-doc openings:

* The Department of Communication and Networking offers post-doc
positions in Internet technologies, Information theory and
computational coding theory, cognitive radio, and Techno-economics of
Mobile Internet services and networks. For details see
http://comnet.tkk.fi/en/current/news/view/postdoc2011/

For inquiries contact Jörg Ott <jo@comnet.tkk.fi>

* The School of Electrical Engineering offers post-doc positions to
applicants across a diverse range of research fields as defined by
the departments above. For details see


http://www.aalto.fi/fi/current/jobs/teaching_and_research/postdoctoral_researcher-scho
ol_of_electrical_engineering/

For inquiries contact: Riikka Mäki-Ontto <riikka.maki-ontto@aalto.fi>

Note that the application guidelines differ.

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

Patric Ostergard
Professor

Dept. of Communications & Networking
Aalto University School of Electrical Engineering
P.O. Box 13000, 00076 Aalto, FINLAND
Tel: +358 9 470 22341
Fax: +358 9 470 22474
Email: patric.ostergard@tkk.fi
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Call for Papers : Declarative Pattern Mining Workshop@ICDM2011

[Our apologies if you receive multiple copies of this message]

**************************************************************
* CALL FOR PAPERS *
* *
* WDPM@ICDM 2011 *
* Workshop on Declarative Pattern Mining *
* Dec. 10, 2011, Vancouver (Canada) *
* http://liris.cnrs.fr/wdpm2011/ *
* *
* Held in conjunction with ICDM 2011 *
* http://icdm2011.cs.ualberta.ca/ *
* *
* *
**************************************************************

AIM

State of the art systems and prototypes for data mining offer a quite limited support – if any – for enumeration problems. Their main weakness is at the declarative level; they do not try to push "declarativity" as a first class citizen and then offer some specialized implementations without any possibility:

To easily add (or remove) constraints or
To support even slight modifications of the problem statement.
This lack of flexibility and genericity is clearly problematic and induce important efforts on the design and maintenance of data mining systems. The need for declarative and expressive modeling languages with associated generic and efficient solving techniques is clearly an important research agenda.

This workshop aims to explore the cross-fertilization between data mining, artificial intelligence, combinatorial algorithmic and databases to bring original solutions to fundamental data mining problems.

Issues to be addressed include (but are not limited to):

High-level declarative languages (logical or algebraic) for expressing interesting complex patterns enumeration problems
Complexity and algorithms for complex patterns enumeration problems
Modeling complex patterns with itemsets
Use cases of complex patterns mining
Mining complex patterns using constraint (logic) programming, Satisfiability (modulo theory), Integer Linear programming, …
Classification of complex patterns mining problems
Coupling Database systems with pattern mining

PAPER SUBMISSION

All submissions will be handled electronically via EasyChair. Paper sub- missions should be limited to a maximum of 8 pages in the IEEE 2-column format. All papers will be reviewed by the program committee on the basis of technical quality, relevance to the workshop topics, originality, significance, and clarity. Papers that do not comply with the Submission Guidelines will be rejected without review.

For paper submission, please use submission system on the website of the workshop: http://liris.cnrs.fr/wdpm2011/


IMPORTANT DATES

July 23, 2011: Due date for full workshop papers
September 20, 2011: Notification of paper acceptance to authors
October 11, 2011: Camera-ready of accepted papers
December 10, 2011: Workshop date


ORGANIZERS

Hiroki Arimura (Hokkaido University, Japan)
Raoul Medina (Université Blaise Pascal, Clermont-Ferrand, France)
Jean-Marc Petit (INSA/Université de Lyon, France)

PROGRAM COMMITTEE

Franz Baader, TU Dresden (Germany)
Jean-François Boulicaut, INSA/Université de Lyon (France)
Bruno Crémilleux, Université de Caen (France)
Luc de Raedt, Katholieke Universiteit Leuven (Belgium)
Khaled Elbassioni, Max-Planck-Institut für Informatik (Germany)
Alain Gely, Université Paul Verlaine (France)
Bart Goetals, University of Antwerp (Belgium)
Sergei Kuznetsov, State University Higher School of Economics (Russia)
Dominique Laurent, Université Cergy-Pontoise (France)
Hong-Cheu Liu, Taiwan Shoufu University (Taiwan)
Rokia Missaoui, Université du Québec en Outaouais (Canada)
Siegfried Nijssen, Katholieke Universiteit Leuven (Belgium)
Lhouari Nourine, Université Blaise Pascal (France)
Marie-Christine Rousset, Université de Grenoble (France)
Lakdhar Sais, Université d'Artois (France)
Jef Wijsen, Université de Mons (Belgium)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Wednesday, May 25, 2011

[DMANET] IWOCA Schedule and registration now available

IWOCA 2011 (International Workshop on Combinatorial Algorithms)
is scheduled for June 19-22 in Victoria, BC.
http://webhome.cs.uvic.ca/~wendym/IWOCA/IWOCA_2011.html

A draft schedule and the abstracts of the accepted talks
have been posted:
http://webhome.cs.uvic.ca/~wendym/IWOCA/sched.html

If you would like info about the conference, please join our listserv:
http://mailman.csc.uvic.ca/mailman/listinfo/iwoca_list
Dorm rooms are available for participants desiring
inexpensive accomodation. Please book them soon.

The registration is now open:
http://webhome.cs.uvic.ca/~wendym/IWOCA/register.html
We hope that everyone who is coming will register as soon
as possible because it will help us to know how much
food to order. The early bird registration rate is
available until midnight (in Victoria) of June 6.

Two of our grad students are leading a walk up Mount Tolmie
starting at 3:30pm on Sunday June 19. For more information:
http://webhome.cs.uvic.ca/~wendym/IWOCA/tolmie.html
There is a pre-conference reception starting at 5pm on June 19
at the Halpern Center for Graduate Studies.
The conference start at 9:00am on Monday June 20.

Both a poster session and an open problems session are
scheduled for Tuesday afternoon. Please think about some
problems you might like to pose for the problem session.
The problems from past conferences are here:
http://www.iwoca.org/main_iwocaproblems.php

Wendy Myrvold
Local arrangements co-chair for IWOCA 2011

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Final Call for Abstracts: Metaheuristics Stream at OR53

[Please circulate to all those who might be interested, and accept our
apologies if you received multiple copies of this announcement]
--------------------------------------------------------------------------
The 53rd Conference of the UK Operational Research Society (OR53)

http://www.orsoc.org.uk/orshop/orcontent.aspx?inc=or53_main.htm

Nottingham, September 6-8, 2011

Call for Abstracts for the METAHEURISTICS stream

http://www.orsoc.org.uk/orshop/orcontent.aspx?inc=or53_Metaheuristics.htm
--------------------------------------------------------------------------


We invite abstracts and presentations on metaheuristics, either theory or
practice-oriented (preferably on real world applications).

We are open to all contributions on metaheuristics, but we are particularly
interested in those that lead to some general insight or are potentially
relevant to more than one application area.

We take a very broad definition of metaheuristics, for example simulated
annealing, tabu search, but also evolutionary algorithms, multi-meme
algorithms, adaptive operator selection, dynamic algorithm portfolios,
reactive search, particle swarm and others.

Topics of interest include (but are not limited to):
* metaheuristics for combinatorial optimisation problems
* metaheuristics for multi-objective, discrete and continuous optimisation
* metaheuristics to generate (create) heuristics
* metaheuristics to choose heuristics
* self adaptive metaheuristics
* metaheuristics based on machine learning
* hybrids of metaheuristics with exact methods such as mathematical or
constraint programming
* (automated) parameter tuning in metaheuristics
* applications of metaheuristics to new challenging domains
* analytical or semi-empirical studies of metaheuristics
* performance prediction
* performance robustness
* scalability issues
* classifications of metaheuristics
* barriers to uptake of metaheuristics in industry

The stream will provide an opportunity for the constructive exchange of
ideas and will include a keynote presentation.

If you would like to give a talk in this stream, please submit a title and
abstract of no more than 300 words via

http://www.orsoc.org.uk/orshop/orcontent.aspx?inc=or53_main.htm

by selecting 'Metaheuristics' as the stream.

The submission deadline is June 13.

(For those who are not familiar with the OR conferences, the usual Procedure
is to submit a title and an abstract, and then if accepted, to give a talk
of 20-25 minutes. A full paper or extended abstract is not required.)

If you have any questions, please do not hesitate to contact us.

Best wishes,
Stream Organisers
Ender Ozcan and Andrew J. Parkes
{exo, ajp} @ cs.nott.ac.uk

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Tuesday, May 24, 2011

[DMANET] ADHOCNETS 2011: Deadline extended to June 3, 2011

[Our apologies if you receive multiple copies of this message]

**************************************************************
* CALL FOR PAPERS *
* *
* ADHOCNETS 2011 *
* Third International Conference on Ad Hoc Networks *
* Sep. 20-23, 2011, Paris, France *
*http://www.adhocnets.org/2011 *
* *
**************************************************************
Sponsored by ICST
NEW PAPER SUBMISSION DEADLINE: June 3, 2011

OVERVIEW:

Ad hoc networks, which cover a variety of network paradigms for
specific purposes, such as mobile ad hoc networks, sensor networks,
vehicular networks, underwater networks, underground networks,
personal area networks, and home networks, promise a broad range of
applications in civilian, commercial, and military areas. The aim of
the annual International Conference on Ad Hoc Networks (AdHocNets)
is to provide a forum that brings together researchers from academia
as well as practitioners from industry to meet and exchange ideas
and recent research work on all aspects of ad hoc networks. With the
great success of AdHocNets'09 held in Niagara Falls, Canada, on
Sept. 23-25, 2009 and the second edition of the event, AdHocNets'10,
held in Victoria, Canada, on August 18-20, 2010, we are happy to
launch the third edition to be held in Paris, France, on September
20-23, 2011. The conference will consist of technical sessions and
a tutorial given by a renowned researcher. The different sessions
will present original, fundamental and applied research advances
in such a hot field.


HIGHLIGHTS:

* All accepted papers will be published in Springer LNICST and
will be considered for indexing by Engineering Information (EI).
* The best papers (after extension) will be recommended for
consideration of publication in ICST Transactions on Mobile
Communications and Applications.


TOPICS:

The conference solicits original technical papers that were not
previously published and are not currently under review for
publication elsewhere. Topics of interest include but are not
limited to:

* Mobile Ad Hoc networks
* Sensor networks
* Vehicular networks
* Airborne networks
* Underwater networks
* Underground networks
* Local area networks
* Personal area networks
* Body area networks
* Home networks
* Network architectural design
* Network protocol design
* Cross-layer design
* MAC, routing, and transport protocols
* Resource allocation and management
* Network control and management
* Power control and management
* Topology control and management
* Quality of service provisioning
* OFDM techniques
* MIMO techniques
* Service discovery techniques
* Node localization techniques
* Data aggregation techniques
* Time synchronization techniques
* Network scalability issues
* Reliability and fault tolerance issues
* Security and privacy issues
* Applications for ad hoc networks
* Performance modeling and analysis
* Experimental prototypes and testbeds


PAPER SUBMISSION:

Please visit the conference website
(http://www.adhocnets.org/2011) for detailed instructions.


PAPER PUBLICATION:

All submitted papers will go through a peer-review process.
All accepted papers will be published by Springer in the
ICST Lecture Notes (LNICST) series and will be considered
for indexing by Information Engineering (EI). The best papers
(after extension) will be recommended for consideration of
publication in ICST Transactions on Mobile Communications and
Applications.


IMPORTANT DATES:

Paper submission due June 3, 2011
Notification of acceptance July 15, 2011
Final manuscripts due July 30, 2011

CONFERENCE ORGANIZING COMMITTEE

* Conference General Co-Chairs
David Simplot-Ryl, INRIA, France
Marcelo Dias de Amorim, CNRS/LIP6, France

* Technical Program Co-Chairs
Silvia Giordano, SUPSI, Switzerland
Ahmed Helmy, University of Florida, USA

* Local Chair
Hakima Chaouchi, Telecom SudParis, France

* Publications Chair
Aline Carneiro Viana, TU Berlin, Germany

* Publicity Co-Chairs
Tahiry Razafindralambo, INRIA, France
Romain Kuntz, Toyota ITC, USA

* Web Chair
Antoine Gallais, Université de Strasbourg, France

* Tutorials Chair
David Simplot-Ryl, INRIA, France
Marcelo Dias de Amorim, CNRS/LIP6, France

* Technical Program Committee
Dharma P. Agrawal, University of Cincinnati, USA
Chadi Assi, Concordia University, Canada
Stefano Basagni, Northeastern University, USA
Chiara Boldrini, CNR, Italy
Stefano Chessa, University of Pisa, Italy
John Daigle, University of Mississippi, USA
Anna Förster, Univ. of Applied Science – SUPSI, Switzerland
Antoine Gallais, Université de Strasbourg, France
Laura Gallucio, Universita di Catania, Italy
Deyun Gao, Beijing Jiaotong University, China
Guang Gong, University of Waterloo, Canada
Leenta Groble, North-West University, South Africa
Mesut Günes, Freie Universität Berlin, Germany
Wendi Heinzelman, University of Rochester, USA
Luigi Iannone, Deutsche Telekom, Germany
François Ingelrest, EPFL, Switzerland
Shengming Jiang, South China University of Technology, China
Abdelmajid Khelil, Technical University of Darmstadt, Germany
Anis Koubâa, Al-Imam University, Saudi Arabia
Franck Legendre, ETH Zurich, Switzerland
Jun Li, Communications Research Centre, Canada
Jun Luo, Nanyang Technological University, Singapore
Josep Mangues-Bafalluy, CTTC, Spain
Tommaso Melodia, SUNY at Buffalo, USA
Pascale Minet, INRIA Rocquencourt, France
Nathalie Mitton, INRIA Lille - Nord Europe, France
Tamer Abdel Mottalib ElBatt, Nile University, Egypt
Yuanzhu Peter Chen, Memorial University of Newfoundland, Canada
Chengkan Pan, China Mobile, China
Daniele Puccinelli, Univ. of Applied Science – SUPSI, Switzerland
Martin Reisslein, Arizona State University, USA
Pedro Ruiz, University of Murcia, Spain
Loren Schwiebert, Wayne State University, USA
Michael Segal, Ben-Gurion University, Israel
Fikret Sivrikaya, Technische Universitaet Berlin, Germany
Aaron Striegel, University of Notre Dame, USA
Damla Turgut, University of Central Florida, USA
Takashi Watanabe, Shizuoka University, Japan
Kui Wu, University of Victoria, Canada
Taieb (Ty) Znati, University of Pittsburgh, USA


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Open Position: Scientific Assistant (TV-L 13), University of Paderborn

The department of Large Scale Wireless Networks of the Faculty of
Electrical Engineering, Computer Science and Mathematics seeks for
applicants to fill the open position of a

Scientific Assistant
(Tariff 13 TV-L)

The position is limited to three years and covers 100% regular working
time of a full time employee.

The prospective scientific assistant will theoretically study an energy
efficient combination of topology control and routing for wireless
ad-hoc and sensor networks. Currently unused parts of the wireless
network will be left completely unstructured: network nodes will even
don't know their neighboring nodes. By disclaiming proactive network
structure, periodical control messages are obsolete and energy is saved.
Energy is consumed only there where a message is currently transmitted.
In those network parts a local view on a Euclidean or topological
spanner without intersecting links is to be constructed. With a local
view on such graph, localized efficient routing will then be carried
out, i.e., the next routing step will be based on the neighbor nodes and
the destination position.

Condition of employment is an above-average completed scientific
university study, preferably in the area of computer science or
mathematics. You have demonstrated the ability to carry out independent
scientific work, are dedicated, and strive to deepen your knowledge and
skills, and successfully finish the project with a PhD. You have the
skills to mathematically proof theoretical claims, and are interested to
do research in the area of algorithms and graphs. Very good proficiency
in written and spoken English are compulsory.

The university of Paderborn is awarded the TOTAL E-QUALITY predicate for
an exemplary equal opportunities oriented university and employee
policy, and as well the certificate „audit familiengerechte hochschule
der berufundfamilie gGmbH" for the successful implementation of
compatibility of studies, family and career.

The University of Paderborn aims to increase the percentage of female
employees. Thus, we particularly encourage women to apply. According to
§ 7 LGG, women with the same eligibility, qualification and professional
accomplishments will preferably be considered.
Severely handicapped persons and equal persons in the sense of
"Sozialgesetzbuches Neuntes Buch (SGB IX)" will receive priority in case
of equal qualification.
By request of the applicant, the "Personalrat der wissenschaftlichen und
künstlerischen Beschäftigten (WPR)" will be involved in the employment.

We request your complete application documents until but not later than
Jul 15, 2011. Please indicate the ID: ReactiveSpanner in your
application. Documents are requested to:

Jun.-Prof. Dr. Hannes Frey
Institut für Informatik
Universität Paderborn
Pohlweg 47 – 49
33098 Paderborn
Germany.

In case you prefer an application by email, please send your documents to:
hannes.frey@upb.de


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Postdoc positions at Masaryk University in Brno, Czech Republic

Up to four post-doc positions in computer science are available at the Faculty of Informatics, Masaryk University, Brno.

Applicants should have (by the starting date) a PhD in computer science or a closely related discipline and ideally will have a strong background in one of the research activities carried out at the Faculty of Informatics, namely formal methods, computer graphics and image processing, data management, large scale distributed systems and networks, security and cryptography, embedded systems, enterprise systems and services and natural language processing, for details see:
http://www.fi.muni.cz/research/index.xhtml.en

More information about the positions and how to apply can be found at:
http://www.muni.cz/fi/general/employment_offers/5863

Applications (as well as any questions) should be sent preferably before 31st May 2011 to research@fi.muni.cz. The positions are available from 1st September 2011, however the date is negotiable.

Best regards,
Robert Ganian
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************