Friday, October 8, 2010

[DMANET] PhD vacancy Ghent University: Industrial Engineering and Operations Research

***PhD position in Industrial Engineering and Operations Research***

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

The Department of Industrial Management of the Faculty of Engineering of
Ghent University has a vacancy for a doctoral student in Industrial
Engineering and Operations Research.

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

(If you are interested in a PhD in Industrial Engineering or Operations
Research (production planning, logistics, metaheuristics, linear/integer
programming, simulation, etc.), but not in one of the presented topics, do
not hesitate to contact us (elhoussaine.aghezzaf@ugent.be;
pieter.vansteenwegen@ugent.be; hendrik.vanlandeghem@ugent.be) and discuss
other possible topics.)

----------

Possible topics

-----------

. Applying metaheuristics to deal with complex vehicle routing problems

. Integrated and robust production planning

. Time-dependent vehicle routing problems (taking congestion issues
into account)

. Robust logistics planning

. Internal logistics planning

. Complex inventory routing

. Automated planning of personalised tourist trips

. ...

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

Position

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

. a four year doctoral research position at Ghent University;

. (70%) scientific research in the field of operations research;

. (30%) educational tasks: seminars, workshops, thesis coaching, etc.;

. attending conferences, visiting international partners, etc.

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

Practical

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

The starting date of this research position is as soon as possible. The
candidate should be able to write and teach in English (understanding Dutch
is an advantage). He/She should have a master degree in engineering,
business engineering, computer science, informatics or applied mathematics
and have an interest in quantitative techniques and operations research.
He/She should have (at least basic) programming skills (Java or C# or...).

For administrative questions about this vacancy, contact Veerle Van
Beversluys (Veerle.VanBeversluys@UGent.be). If you are interested, please
send your application (CV and a motivation letter) as soon as possible to
Veerle.VanBeversluys@UGent.be .
**********************************************************
*
* 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/
*
**********************************************************

Thursday, October 7, 2010

[DMANET] Lectureship in Combinatorics, University of Birmingham

Lectureship in Combinatorics, University of Birmingham

The University invites applications for a number of Lectureship
opportunities in Pure Mathematics with effect from 1^st January 2011.

The successful applicants will have a strong research track record,
international research profile in Pure Mathematics and an ability to win
peer-reviewed funding. Applications from individuals with research strength in
algebra, analysis or combinatorics are especially welcome.

A strong commitment to research and enthusiasm for teaching undergraduate
and postgraduate students is required.

Informal enquiries about this position may be made to Professor Stephen
Decent, Tel: +44-(0)121-41-47566 or via e-mail: s.p.decent@bham.ac.uk , or
Professor Sergey Shpectorov,
Tel: +44(0)121-41-46604 or via e-mail: s.shpectorov@bham.ac.uk
<mailto:s.shpectorov@bham.ac.uk>

*Salary from 36,715 to 49,342 a year*

*Closing date: * 12^th November 2010 *Reference: 43606*

Further information about the School is available on
http://www.mat.bham.ac.uk <http://www.mat.bham.ac.uk/>

Further details of the post, together with information on application
procedures, can be found via: <http://www.hr.bham.ac.uk/jobs>

**********************************************************
*
* 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] EuroGP 2011 - call for papers

* Our apologies if you receive multiple copies of this announcement *

Dear colleagues,

We would like to invite you to submit a paper to EuroGP 2011, the 14th
European Conference on Genetic Programming, and we kindly ask you to
circulate this call in your institution, among your colleagues and
students. Thank you!

The EuroGP 2011 chairs
James A. Foster
Sara Silva


***********************************
EuroGP 2011
(call for papers)
***********************************

14th European Conference on Genetic Programming
27-29 April 2010, Torino - Italy
www.evostar.org

Submission deadline:
November 22, 2010

EuroGP is the premier annual conference on Genetic Programming. EuroGP
is always a very enjoyable event, held together with the other main
european events on Evolutionary Computation, collectively designated as
EvoStar (Evo*). EvoStar 2011 takes place in Torino, Italy, which
celebrates the 150th anniversary of its unification. Torino, as the
first Italian capital, will be the center of all the celebrations, and
an ideal location to host international events.

EuroGP 2011 seeks high quality papers on topics strongly related to the
evolution of computer programs, including but not limited to:
* Theoretical developments;
* Empirical studies of GP performance and behaviour;
* Algorithms, representations and operators;
* Applications of GP to real-life problems;
* Hybrid architectures including GP components;
* Unconventional evolvable computation;
* Evolutionary design;
* Evolutionary robotics;
* Grammar-based GP;
* Evolvable hardware;
* Linear GP;
* Self-reproducing programs;
* Evolution of tree or graph structures;
* Evolution of various classes of automata or machine (e.g. cellular
automata, finite state machines, pushdown automata, Turing machines);
* Object-oriented GP.

The submissions will be peer reviewed by at least three members of the
program committee. The reviewing process will be double-blind, so please
omit information about the authors in the submitted paper. Accepted
papers will be presented orally or as posters at the conference and will
be published by Springer in the LNCS series. The papers which receive
the best reviews will be nominated for the Best Paper Award. Authors
of selected papers will be invited to submit extended descriptions of
their work to the Springer journal Genetic Programming and Evolvable
Machines (http://www.springer.com/10710).

Submission link:
http://myreview.csregistry.org/eurogp11/
Page limit: 12 pages in Springer LNCS format.

Important Dates:
* Submission deadline: 22 November 2010
* Notification to authors: 7 January 2011
* Camera-ready deadline: 1 February 2011
* Conference: 27-29 April 2011

Program Chairs:
* James A. Foster, University of Idaho, USA
http://people.ibest.uidaho.edu/~foster/
foster(at)uidaho.edu
* Sara Silva, INESC-ID Lisboa, Portugal
http://kdbio.inesc-id.pt/~sara/
sara(at)kdbio.inesc-id.pt
**********************************************************
*
* 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 Call for Workshop Proposals

======================================
ICALP 2011 Call for Workshop Proposals
======================================

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

July 4-8, 2011, Zurich, Switzerland Supported by the European
Association for Theoretical Computer Science (EATCS)

http://icalp11.inf.ethz.ch/

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
from the 4th to the 8th of July 2011 at ETH Zurich, Switzerland.

The main conference will be preceded by a series of Workshops, taking
place on Sunday, July 3rd, 2011 (i.e., one day before ICALP).

Workshop proposals are invited for workshops on topics related to all
aspects of theoretical computer science. (A workshop may relate to any
of the three tracks of ICALP, but also workshop proposals related to
other aspects of theoretical computer science will be considered.)
Typically, ICALP workshops feature a number of invited speakers and a
number of contributed presentations. ICALP workshops do not
necessarily produce formal proceedings. However, in the past there
have been, e.g., LNCS proceedings or special issues of journals based
in part on some ICALP workshops. Workshop proposals should include:

* Title of the workshop

* Person responsible for the workshop (name + email address)

* A short scientific summary and justification of the proposed
topic. This should include a discussion of the particular benefits
of the topic to the ICALP community.

* A discussion of the proposed format and agenda.

* The proposed duration (how many hours of program)

* Procedures for selecting participants and papers.

* Expected number of participants.

* If the workshop has taken place before, please provide the
following information:

- How often has the workshop taken place so far?
- Which conference(s) has the workshop been collocated with so far?
- Please provide the web address of the last workshop, if available.
- How many participants took part in the last workshop?

* Potential invited speakers.

* Plans for dissemination (for example, special issues of journals).

Proposals are due November 4, 2010, and should be submitted
electronically to the Conference Chairs via <icalp11@inf.ethz.ch>.
Notifications will be sent by November 30, 2010.

Further information:
-------------------

In accordance with EATCS policies, any workshop collocated with ICALP
is expected to be financially independent. However, the registration
fee should be as low as possible.

We provide the following aspects of the workshop organisation:
- registration
- wireless access, conference rooms, booklet, ... (as for ICALP)
- a link to the web page of the workshop
- on request: organization of coffee breaks

We do NOT provide:
- hotel reservation
- All scientific aspects of the program of the workshop
(e.g., call for papers, notification, program, workshop webpage, ...)
are managed by the responsible of the workshop.
- Call for Papers, Call for Participation
- publicity for the workshop

ICALP 2011 is organised by the Institute of Theoretical Computer
Science, ETH Zurich.
**********************************************************
*
* 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 Call for Papers

============================
ICALP 2011 - Call for Papers
============================

The 38th International Colloquium on Automata, Languages and
Programming (ICALP), the main conference and annual meeting of the
European Association for Theoretical Computer Science (EATCS), will
take place from the 4th to the 8th of July 2011 in Zurich,
Switzerland. The main conference will be preceded by a series of
workshops, taking place on Sunday, July 3rd, 2011 (i.e., one day
before ICALP).

URL: http://icalp11.inf.ethz.ch/

Topics
------
Papers presenting original research on all aspects of theoretical
computer science are sought. Typical but not exclusive topics of
interest are:

Track A: Algorithms, Complexity and Games

Algorithmic Game Theory, Approximation Algorithms, Combinatorial
Optimization, Combinatorics in Computer Science, Computational
Biology, Computational Complexity, Computational Geometry,
Cryptography, Data Structures, Design and Analysis of Algorithms,
Machine Learning, Parallel, Distributed and External Memory Computing,
Randomness in Computation, Quantum Computing

Track B: Logic, Semantics, Automata and Theory of Programming

Algebraic and Categorical Models, Automata Theory, Formal Languages,
Emerging and Non-standard Models of Computation, Databases,
Semi-Structured Data and Finite Model Theory, Principles of
Programming Languages, Logics, Formal Methods and Model Checking,
Models of Concurrent, Distributed, and Mobile Systems, Models of
Reactive, Hybrid and Stochastic Systems, Program Analysis and
Transformation, Specification, Refinement and Verification, Type
Systems and Theory, Typed Calculi

Track C: Foundations of Networked Computation: Models, Algorithms and
Information Management

Algorithmic Aspects of Networks, E-commerce, Privacy, Spam, Formal
Methods for Network Information Management, Foundations of Trust and
Reputation in Networks, Algorithms and Models for Mobile and Wireless
Networks and Computation, Models of Complex Networks, Models and
Algorithms for Global Computing, Network Economics and Incentive-Based
Computing Related to Networks, Models and Algorithms for Networks of
Low Capability Devices, Overlay Networks and P2P Systems, Social
Networks, Specification, Semantics, Synchronization of Networked
Systems, Theory of Security in Networks and Distributed Computing, Web
Searching and Ranking, Web Mining and Analysis

Important Dates
---------------
* Submission Deadline: Feb 15, 2011
* Author Notification: Apr 12, 2011
* Final Manuscript Due: April 28, 2011

Submission Guidelines
---------------------
Authors are invited to submit an extended abstract of no more than 12
pages in LNCS style presenting original research on the theory of
Computer Science. Submissions should indicate to which track (A, B, or
C) the paper is submitted. No prior publication or simultaneous
submission to other publication outlets (either a conference or a
journal) is allowed. The proceedings will be published in the Lecture
Notes in Computer Science Series by Springer-Verlag.

It is strongly recommended that submissions adhere to the specified
format and length. Submissions that are clearly too long may be
rejected immediately. Material other than the abstract, references and
the first 12 pages may be considered as supplementary and will be read
at the committee's discretion.

Best Paper Awards
-----------------
As in previous editions of ICALP, there will be best paper and best
student paper awards for each track of the conference. In order to be
eligible for a best student paper award, a paper should be authored
only by students and should be marked as such upon submission.

Invited Speakers
----------------
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

Conference Chairs
-----------------
Michael Hoffmann, Juraj Hromkovic, Ueli Maurer, Angelika Steger, Emo
Welzl, Peter Widmayer, all ETH Zurich
Contact: <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] Post-Doc Position Math/CS/OR, RWTH Aachen University

The Chair of Operations Research and Supply Chain Management
at RWTH Aachen University, Germany, invites applications for

1 POST-DOC POSITION IN OPERATIONS RESEARCH (5 yrs)
(Akademische Raetin/Akademischer Rat auf Zeit, A 13)

We are building an interdisciplinary working group with research and
teaching interests in operations research, discrete mathematics, and
theoretical computer science. Welcomed topics are integer programming,
combinatorial optimization, algorithmic graph theory and graph
algorithms, scheduling, game theory, algorithm engineering, and any
other methodological field of operations research. Basic research goes
hand in hand with practical applications.


The successful candidate will engage her/himself in the group's
research activities, and is invited to sharpen her/his own academic
profile by pursuing independent research. As the position comes with a
(small) teaching load, proficiency with, or the will to learn the
German language within a reasonable period of time is indispensable.


You hold (or are close to the completion of) an excellent Ph.D. in
discrete mathematics, computer science, operations research, or a
related discipline? You have a profound knowledge in at least one of
the above listed research topics? Theory matters as much as
applications to you? You are eager to work on your academic career in
an excellent environment in a city at the heart of Europe? Then it
seems you are our ideal candidate.


The candidate will be employed as a civil servant, and must meet
required personal qualifications.

The position is to be filled as soon as possible and is for a fixed
term of 2 years. a prolongation for 3 years is possible, subject to a
positive evaluation. This is a full-time vacancy.

RWTH Aachen University has been certified as a "Family Friendly University".

RWTH is committed to promoting the careers of women and therefore
looks forward to receiving applications by female candidates.

For positions in organisational units where women are
underrepresented, in cases of equal qualification, ability and
professional achievement, preference will be given to female
applicants unless reasons specific to an individual candidate tilt the
balance in his favour.

The University positively welcomes applications from suitably
qualified disabled people.


Please send your application in a *single* PDF file containing an
academic CV, list of publications, letter of motivation, research
statement, the names of two references, and any other supporting
material no later than

October 31, 2010

to

Prof. Dr. Marco Luebbecke
marco.luebbecke@rwth-aachen.de
www.or.rwth-aachen.de

Applications reaching us by the above date will receive full
consideration, however, the search remains open until the position is
filled.

Questions can be directed to the same address anytime.


**********************************************************
*
* 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] Promotionsstelle

An der Technische Universitaet Hamburg-Harburg (TUHH) ist im Institut fuer
Telematik ab dem 15.11.2010 folgende - zunaechst auf 24 Monate -
befristete Stelle zu besetzen
Wissenschaftliche Mitarbeiterin / Wissenschaftlicher Mitarbeiter
EGr. 13 TV-L, Kenn-Nr.: D-10-125.4
(siehe auch http://www.ti5.tu-harburg.de/jobs/)
Die TUHH foerdert die Einstellung von Frauen. Sie begruesst es, wenn sich
der Anteil von Frauen - vor allem in technischen Bereichen - erhoeht und
fordert deshalb qualifizierte Bewerberinnen nachdruecklich auf, sich zu
bewerben.

Aufgabengebiet:
Durchfuehrung von wissenschaftlichen Aufgaben im Rahmen des vom BMBF
gefoerderten Projektes "iEZMesh" - Vernetzung intelligenter
Elektrizitaetszaehler ueber drahtlose selbstorganisierende Mesh-Technologien.

- Konzeptentwicklung (Architektur, Datensicherheit, Netzwerkmanagement)
- Entwicklung und Validation drahtloser Protokolle fuer Mikrocontroller
mit Funk-Transceivern
- Projektabwicklung (Kommunikation mit Industriepartner, Erstellen von
Projektberichten,...)
- Anfertigung einer Doktorarbeit
- Das Projekt fuehren Sie in unserem Institut in Kooperation mit einem
Industriepartner durch.

Voraussetzungen:
Abgeschlossenes wissenschaftliches Hochschulstudium, insbesondere der
Fachrichtung(en) Informatik, Mathematik oder einem angrenzenden Fach.
Erwuenscht sind Vorkenntnisse in mind. einem der Gebiete: Drahtlose
Sensortechnik, Protokollentwicklung,Entwurf von Software fuer
Mikrocontroller, Verteilte Systeme. Weiterhin erwarten wir von Ihnen
Organisationsgeschick, Teamfaehigkeit, Kreativitaet und
Kommunikationsfreudigkeit. Sie sollten einen systematischen und gut
organisierten Arbeitsstil haben und gute Englischkenntnisse besitzen.
Wir bieten ein angenehmes Arbeitsklima in einem dynamischen Team,
vielfaeltige fachliche und persoenliche Entwicklungsmoeglichkeiten, sehr
gute Industriekontakte, intensive Unterstuetzung und Betreuung bei der
Promotion.

Weitere Auskuenfte erteilt Ihnen Prof. Dr. V. Turau unter der Rufnummer
040 42878 3530. Schwerbehinderte werden bei gleicher Eignung bevorzugt.
Bewerbungen mit tabellarischem Lebenslauf und den ueblichen Unterlagen
sind bis zum 19.10.2010 unter Angabe der Kenn-Nr. D-10-125.4 zu richten an:

Technische Universitaet Hamburg-Harburg
- Personalreferat V32 -
Schlossmuehlendamm 32
D-21073 Hamburg
**********************************************************
*
* 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, October 6, 2010

[DMANET] Call for Participation: New York Computer Science and Economics day (NYCE)

We invite participants to the third New York Computer Science and
Economics Day (NYCE Day), October 15 2010, at the New York Academy of
Sciences, 7 World Trade Center. Details at:

www.nyas.org/nyce2010

NYCE Day is a gathering for people in the larger New York City
metropolitan area with interests in computer science, economics,
marketing and finance to discuss common research problems and topics in
a relaxed environment. The aim is to foster collaboration and the
exchange of ideas.

The program features invited speakers Robert Almgren (NYU and
Quantitative Brokers), Sham Kakade (Wharton), Robert Kleinberg
(Cornell), Hal Varian (Google), and Mihalis Yannakakis (Columbia), and a
rump session with short contributed presentations.

Registration is $10 (lunch included). Prior registration is strongly encouraged.

Your participation and suggestions are greatly welcome. Please pass this
information on to people who may be interested.

Thanks,
NYCE Organizers
Christian Borgs, Microsoft
Michael Kearns, University of Pennsylvania
Sebastien Lahaie, Yahoo!
Vahab Mirrokni, Google
**********************************************************
*
* 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] LSSC'11 conference CFP

Dear Colleague,

On behalf of the Organizing Committee, we invite you to participate in the
special session (workshop) on "APPLICATIONS OF METAHEURISTICS TO LARGE-SCALE
PROBLEMS" at the 7th International Conference on Large Scale Scientific
Computation - LSSC'11, June 6 - 10, 2011, Sozopol, Bulgaria, with arrival:
June 5 and departure: noon June 10.

The session is organized by:
Assoc. Prof. Stefka Fidanova (stefka@parallel.bas.bg)
from the Institut of Information and Communication Technologies (former
Institute for Parallel Processing), Bulgarian Academy of Sciences and
Gabriel Luque (gabriel@lcc.uma.es) from University of Malaga, Spain.

Proceedings
We plan to continue publishing the proceedings of only refereed and
presented papers as a special volume of Springer Lecture Notes in Computer
Science (LNCS).

Important deadlines
Deadline for submission of abstracts
January 15, 2011
Notification of acceptance of the talks on the basis of the submitted
abstract
January 31, 2011
Deadline for submission of full papers
March 15, 2011
Notification of acceptance of full papers
April 30, 2011


Abstracts and contributed papers
The abstracts (up to 1 page stating clearly the originality of the results)
are to be written in standard LaTeX. The length of the contributed papers is
limited up to 8 pages. It is assumed that one participant will present not
more than one talk.

Send the abstracts and papers to special session organizers and conference
organizers, indicating the name of the special session. After sending the
abstract go to the conference web page and fill in the registration form
(personal data of the participants, minimum one per paper, and the name of
the special session).

Information about abstract and paper preparation, accommodation,
transportation, registration form and conference location you can find at
the conference web page http://parallel.bas.bg/Conferences/SciCom11.html

Special session organizers
Assoc. Prof. Stefka Fidanova
Assist. Prof. Gabriel Luque
**********************************************************
*
* 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, October 5, 2010

[DMANET] FW: ICIAM 2011 eNewsletter - October 2010

After many years of planning, we are now less than a year away from
ICIAM 2011! Here are some highlights and updates:

-Thematic minisymposia to be presented at ICIAM 2011, encompassing over
20 areas in applied and industrial mathematics, have been announced.
Check out the entire list (http://tinyurl.com/2ez4zr7)!

-Submissions for contributed minisymposia are due October 18th with
decisions to be expected by November 8. Make sure to check the ICIAM
2011 website (http://www.iciam2011.com/) often to learn more about the
speakers and minisymposia taking place. Abstracts are being added daily.


-We now have ICIAM 2011 travel subsidies available for students and
early career researchers in the US, mathematical sciences students in
Canada, and delegates from developing nations. Please check the travel
subsidies page ( http://tinyurl.com/36vdvef) for further information.

-If you have questions about visas to attend ICIAM-including whether or
not you need one-visit the travel subsidies and visas section of the
website (http://tinyurl.com/3y29h5c). There you will find links to
important information about visa applications, processing times, and
locations of Canadian visa offices around the world.

-Keep checking the ICIAM 2011 website (http://www.iciam2011.com/) for
new information, and be sure to check your mailbox! Over the past month,
ICIAM 2011 posters have gone out to member societies and scientists
around the world. If you haven't already received one, you can request a
copy at info@iciam2011.com.

-Keep up to date with ICIAM deadlines, announcements and reminders by
signing up for e-lerts (http://tinyurl.com/2d3cy7k), or by following
ICIAM 2011 on Twitter (http://twitter.com/iciam2011).

We look forward to seeing you in Vancouver!

Arvind Gupta, President, ICIAM 2011, CEO & Scientific Director, MITACS
**********************************************************
*
* 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/
*
**********************************************************

Announcement and Call for Papers: IPCO XV, June 15รข€“17, 2011

***Call for Papers for IPCO XV, June 15 - 17, 2011 ***

(Conference on Integer Programming and Combinatorial Optimization)
at the IBM T.J. Watson Research Center in Yorktown Heights, New York, USA.

The IPCO conference is held every year, except for those years in
which the 'International Symposium on Mathematical Programming takes
place. The conference is a forum for researchers and practitioners
working on various aspects of integer programming and combinatorial
optimization. The aim is to present recent developments in theory,
computation, and applications. The scope of IPCO is viewed in a broad
sense, to include algorithmic and structural results in integer
programming and combinatorial optimization as well as revealing
computational studies and novel applications of discrete optimization
to practical problems.

Authors are invited to submit extended abstracts of their recent work
by November 15, 2010; see the conference website for more information.
The program committee will select the papers to be presented on the
basis of the submitted extended abstracts. Contributions are expected
to be original, unpublished and not submitted to journals or conferences
with proceedings before the notification date (January 31, 2011). Papers
violating these requirements will not be considered by the Program
Committee.

During the conference, approximately 30-35 papers will be presented
in single-track sessions. Each lecture will be 30 minutes long.
The proceedings will be published as a volume of Springer Lecture Notes
in Computer Science. They will contain full texts of all presented
papers. Each participant will receive a copy at the conference.


Conference website: http://ipco2011.uai.cl

Submission website: https://www.easychair.org/conferences/?conf=ipco2011

Program Committee:
------------------------------------------------------
Nikhil Bansal (IBM)
Michele Conforti (Padova)
Bertrand Guenin (Waterloo)
Oktay Guenluek (IBM)
Tibor Jordan (ELTE Budapest)
Jochen Koenemann (Waterloo)
Andrea Lodi (Bologna)
Franz Rendl (Klagenfurt)
Giovanni Rinaldi (Roma)
Guenter Rote (FU Berlin)
Cliff Stein (Columbia)
Frank Vallentin (Delft)
Jens Vygen (Bonn)
Gerhard Woeginger (Eindhoven, chair)

Organizing Committee:
------------------------------------------------------
Sanjeeb Dash (IBM)
Oktay Guenluek (IBM)
Jon Lee (IBM)
Maxim Sviridenko (IBM)


Important Dates:
------------------------------------------------------
Abstract submission: Nov 15, 2010
Notification: Jan 31, 2011
Conference: June 15-17, 2011

IPCO 2011 organization committee
*ipco2011help@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/
*
**********************************************************

18 openings at IMT-Lucca ITALY

IMT - Institute for Advanced Studies, Lucca, Italy
PhD School in Computer Science and Engineering
Call for applications:
12 PhD positions, deadline October 28
5  assistant professor positions, deadline November 15
1  full professor position, deadline October 7

IMT - Institute for Advanced Studies
IIMT (http://www.imtlucca.it/) is located in Lucca (Italy). It aims at pushing the frontiers of knowledge and at contributing to the formation of international professional elites for business and institutions. Ph.D. programs are taught exclusively in English.
The PhD School in Computer Science and Engineering aims at preparing researchers and professionals with broad training in the foundations of informatics as well as in applications to a variety of cutting-edge systems and disciplines.
Within IMT there is a research area on Computer Science and Applications that currently includes senior visiting professors (Rocco De Nicola, Luciano Lenzini, Ugo Montanari) and a number of young assistant professors. Many scientists from Italy and abroad visit for advanced seminars and research collaborations. The research area is closely connected with the doctoral program.

PhD Positions
12 PhD Positions in Computer Science and Engineering.
Research topics: architectures and languages for global and grid computing, web systems and services, in particular for business applications, embedded systems, web data mining, wired and wireless networks, mobile systems.
6 scholarships (about ± 13.638 EUR gross yearly) plus accommodation and full board.
6 positions to be funded with internal projects or third-party scholarships all those come with a research budget of 3.000 EUR and free meals (lunch and dinner).
Program Board: Marco Ajmone Marsan, Paolo Ciancarini, Rocco De Nicola, Carlo Ghezzi, Luciano Lenzini, Ugo Montanari (coordinator), Antonio Prete.
Deadline for application is October 28, 2010.

Assistant Professor Positions
5 Assistant Professor Positions.
Research topics:
* Global Computing
* Networking Systems Engineering
* Computer Science Applications to Cultural Heritage Sites
* Complex Data and Image Analysis
* Industrial Energy Efficiency
The remuneration package is competitive at an international level and includes generous research funds. The duration of the contract is of 3 years, renewable for additional 3 years. Specific terms of appointment are negotiated individually.
Deadline for application is Nov 15, 2010. Short visits at Lucca are possible, and welcomed.

Full Professor Positions
Tenured Full Professor position in Computer Science (only transferring from another Italian University - Italian SSD: INF-01)
Profile: Software Systems for Global Computing. Candidates should be actively involved in the fields of foundations and process description languages for distributed systems, and in particular regarding software systems for global computing, with applications to service oriented computing.
Deadline for application is October 7, 2010.
http://www.imtlucca.it/faculty/positions/professors_positions.php#tenured_professor.

For further information please contact rpo@imtlucca.it.

-- 

@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
Prof. Ugo Montanari                Phone: +39 050 2212721
Dipartimento di Informatica        Fax:   +39 050 2212726
Universita' di Pisa                Email: ugo@di.unipi.it
Largo Bruno Pontecorvo, 3          Address changed recently
I-56127 Pisa, Italy                http://www.di.unipi.it/~ugo/ugo.html
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@

Monday, October 4, 2010

[DMANET] Call for Participation: ISAAC 2010

CALL FOR PARTICIPATION

21st International Symposium on Algorithms and Computation (ISAAC 2010)

December 15-17, 2010

Jeju Island, South Korea

The 21st International Symposium on Algorithms and Computation (ISAAC 2010)
will

be held in Jeju Island, South Korea on December 15-17, 2010. Registration
for

the symposium is now available on the ISSAC home page:

http://tclab.kaist.ac.kr/~isaac10

**** Please note that early registration for ISAAC ends October 15, 2010
****

The list of accepted papers to ISAAC is available at :

http://tclab.kaist.ac.kr/~isaac10/accepted.html

Joonsoo Choi

ISAAC Organizing Committee Chair

-------------- Short Summary of ISAAC 2010 ---------------------------------
----

The symposium is intended to provide a forum for researchers working in
algorithms

and theory of computation. Papers presenting original research in the areas
of

algorithms and theory of computation are sought. Papers in relevant applied
areas

are also welcome.

Conference topics

- Algorithms and data structures

- Approximation algorithms

- Combinatorial optimization

- Computational biology

- Computational complexity

- Computational geometry

- Cryptography

- Experimental algorithms

- Graph drawing and graph algorithms

- Internet algorithms

- Online algorithms

- Parallel and distributed algorithms

- Quantum computing

- Randomized algorithms
**********************************************************
*
* 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/
*
**********************************************************

ICLP 2011 - Call for Papers

======================================================================
CALL FOR PAPERS

27th International Conference on Logic Programming (ICLP 2011)
Theory and Practice of Logic Programming
Lexington, Kentucky, USA, July 6-10, 2011
Submission deadline: Jan 10/17, 2011

http://www.cs.uky.edu/iclp2011/
======================================================================

CONFERENCE SCOPE

Since the first conference held in Marseille in 1982, ICLP has been the
premier international conference for presenting research in logic programming.
Contributions are sought in all areas of logic programming including but not
restricted to:

Theory:
Semantic Foundations, Formalisms, Non- monotonic Reasoning, Knowledge
Representation.

Implementation:
Compilation, Memory Management, Virtual Machines, Parallelism.

Environments:
Program Analysis, Transformation, Validation, Verification, Debugging,
Profiling, Testing.

Language Issues:
Concurrency, Objects, Coordination, Mobility, Higher Order, Types, Modes,
Assertions, Programming Techniques.

Related Paradigms:
Abductive Logic Programming, Inductive Logic Programming, Constraint
Logic Programming, Answer-Set Programming.

Applications:
Databases, Data Integration and Federation, Software Engineering, Natural
Language Processing, Web and Semantic Web, Agents, Artificial Intelligence,
Bioinformatics.

SUBMISSION DETAILS

The four broad categories for submissions are: (1) technical papers for
describing technically sound, innovative ideas that can advance the state of
the art of logic programming; (2) application papers, where the emphasis will
be on their impact on the application domain; (3) system and tool papers, where
the emphasis will be on the novelty, practicality, usability and general
availability of the systems and tools described; and (4) technical
communications, aimed at describing recent developments, new projects, and
other materials that are not ready for main publication as standard papers.

All papers must describe original, previously unpublished research, and must
not simultaneously be submitted for publication elsewhere. They must be written
in English. Technical papers, application papers, and system and tool papers
must not exceed 15 pages plus bibliography. The limit for technical
communications is 10 pages. Submissions must be made in TPLP format
(ftp://ftp.cup.cam.ac.uk/pub/texarchive/journals/latex/tlp-cls/) via the
Easychair submission system, available at
http://www.easychair.org/conferences/?conf=iclp2011.

IMPORTANT DATES
Paper registration (abstract): Jan 10, 2011
Submission deadline: Jan 17, 2011
Notification to authors: Mar 11, 2011
Camera-ready copy due: Apr 15, 2011
Conference: Jul 6-10, 2011

PAPER PUBLICATION

All accepted long papers will be published in the journal Theory and Practice
of Logic Programming (TPLP), Cambridge U. Press (CUP), in one or more special
issues. In order to ensure the quality of the final version, papers may be
subject to more than one round of refereeing (within the decision period)
and/or "shepherding." The program committee may also recommend standard papers
to be published as technical communications.

At the time of the conference CUP will make the web page for this(ese) TPLP
issue(s) available including volume and issue numbers, table of contents, page
numbers, and the papers themselves. All registered attendants at the conference
will get a password for on-line access to this web page during the conference
and indefinitely from then on ("lifetime access"), which can be used to read
papers on line, download them, or print them for personal use. Attendants will
also receive all the papers in a memory stick at the conference.

It is planned that the collection of technical communications will appear as a
volume of the LIPIcs (Leibniz International Proceedings in Informatics) series,
and published online through the Dagstuhl Research Online Publication Server
(DROPS). All technical communications will also get space in the program for
presentation. The journal issue(s) will also include a listing of the technical
communications, with pointers to the LIPIcs/DROPS volume.

ICLP'2011 ORGANIZATION

General Chair:
Mirek Truszczynski (University of Kentucky)
Victor Marek (University of Kentucky)
Program Co-chairs:
John Gallagher (Roskilde University, Denmark and IMDEA, Spain)
Michael Gelfond (Texas Tech University, USA)
Workshops Chair:
Joohyung Lee (Arizona State University)
Publicity Chair:
Yuliya Lierler (University of Kentucky)
Doctoral Consortium:
Alessandro Dal Palù (Universit degli Studi di Parma)
Stefan Woltran (Vienna University of Technology)
Prolog Programming Contest:
Tom Schrijvers (K.U. Leuven, Belgium)

SPONSOR

The conference is sponsored by the Association for Logic Programming (ALP).

FINANCIAL ASSISTANCE

The Association for Logic Programming has funds to assist financially
disadvantaged participants and, specially, students in order to be able to
attend the conference.

WORKSHOPS

The ICLP 2011 program will include several workshops, held before and after the
main conference. They are perhaps the best places for the presentation of
preliminary work, undeveloped novel ideas, and new open problems to a wide and
interested audience with opportunities for intensive discussions and project
collaboration.

DOCTORAL CONSORTIUM

The 7th Doctoral Consortium (DC) on Logic Programming provides research
students with the opportunity to present and discuss their research directions,
and to obtain feedback from both peers and world-renowned experts in the field.
Accepted participants will receive partial financial support to attend the
event and the main conference. The best paper and presentation from the DC will
be given the opportunity to present in a special session of the main ICLP
conference.

CONFERENCE VENUE

Lexington is a medium size, pleasant and quiet university town. It is located
in the heart of the so-called Bluegrass Region in Central Kentucky. The city is
surrounded by beautiful horse farms on green pastures dotted with ponds and
traditional architecture stables, ponds and small race tracks, and bordered by
white or black fences. The Horse Museum is as beautifully located as it is
interesting. Overall, the city has a nice feel that mixes well old and new.

Traveling to Lexington is easy. The local airport has frequent direct flights
to Cincinnati, Atlanta, Detroit, and Chicago. It has also direct but less
frequent flights (one or two a day) to several other large US cities such as
Dallas-Ft. Worth, Houston and Newark. Thus, it can be reached easily from any
place in the world.

AIT: Study Abroad for Spring 2011

This note is just a quick reminder that the application deadline for AIT's Spring 2011 semester is October 15:
http://ait-budapest.com/

[DMANET] CFP: WASA-NGI 2011 (co-located with KiVS 2011)

(Apologies if you receive multiple copies)

CALL FOR PAPERS:
WASA-NGI 2011 -
Workshop on Architectures, Services and Applications
for the Next Generation Internet: Global Sensing

Collocated with KiVS 2011 in Kiel, Germany
March 11th, 2011
http://ipvs.informatik.uni-stuttgart.de/vs/wasa-ngi11/


WORKSHOP SCOPE

The focus of WASA-NGI 2011 is on the impact of global sensing on
architectures, services, and applications for the Next Generation
Internet. In particular, geosensor networks and public sensing have
evolved as novel and important research fields. They offer applications
easy and efficient access to sensor data at the scale of billions of
sensing devices. This data is of high relevance to a wide spectrum of
applications, for instance in the field of environmental monitoring,
traffic control, and smart energy grids.

It is of high importance that communication architectures and services
for enabling such systems are highly scalable and able to cope with
massive amounts of sensor data in order to meet the requirements of
emerging applications. These requirements range from hard performance
and quality demands to ensuring security and privacy for the provided
data. They are particularly difficult to meet in the face of the
heterogeneity of sensors, sensor networks, and communication
architectures. Coping with these challenges requires an integrated
research effort involving researchers from a wide spectrum of different
research fields.

This workshop aims at bringing researchers and practitioners together
that are working in areas such as sensor networks, architectures and
services for the Future Internet, P2P overlays, complex event and stream
processing, pervasive computing, and novel communication paradigms like
opportunistic and delay tolerant networking. You are invited to present
your current work in the area of global sensing, to discuss and identify
main challenges, and to foster new cooperation in the field.

WORKSHOP TOPICS

The workshop is seeking contributions related but not limited to the
following list of topics in the domain of architectures, applications,
and services for global sensing:

- Sensor networks
- Public Sensing
- Geosensor networks
- Middleware for global sensing
- Services and service provisioning for global sensing
- Communication architectures for global sensing
- Delay tolerant and opportunistic networking for global sensing
- Complex event and stream processing
- P2P overlays for global sensing
- Quality for global sensing
- Security aspects in global sensing

SUBMISSION GUIDELINES

Papers should be submitted in PDF format via the workshop page.
Contributions may present
i) novel and possibly preliminary research results (10 pages),
ii) position papers describing major challenges (10 pages),
iii) new trends from the industry (2 pages).

Each submission will be reviewed by three members of the program
committee. Papers are selected according to their originality, quality,
and relevance to the workshop topics. Accepted papers will appear in the
KIVS Workshop proceedings. For accepted papers, at least one author must
register with the workshop and give a presentation at the workshop.
Submissions must follow the KiVS formatting guidelines and must not
exceed the given page limits.


IMPORTANT DATES

Submission deadline: 31/10/2010
Author notification: 28/11/2010
Camera-ready version: 19/12/2010


ORGANIZATION

Co-Chairs
Klaus Herrmann (Universität Stuttgart)
Boris Koldehofe (Universität Stuttgart)
Oliver Waldhorst (Karlsruhe Institute of Technology)
**********************************************************
*
* 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] WoWMoM 2011: Call for Workshop proposals

Our apologies if you receive duplicates of this posting.

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

CALL FOR WORKSHOP PROPOSALS

WoWMoM 2011
Twelfth International Symposium on a
World of Wireless, Mobile and Multimedia Networks

http://wowmom2011.imtlucca.it/

sponsored by
IEEE Computer Society,
University of Texas at Arlington,
IEEE Computer Society TC on Computer Communications (TCCC)

June 20-24, 2011
Lucca, Tuscany, Italy

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

The next IEEE International Symposium on a World of Wireless, Mobile
and Multimedia Networks (IEEE WoWMoM 2011) will be the 12-th event in
its series. This symposium intends to provide a definitive forum
for networking, software systems and multimedia research in the
wireless/mobile area involving both computer science and
electrical engineering communities.

The WoWMoM Organizing Committee invites proposals for *one-day*
workshops affiliated with the conference. The purpose of these
workshops is to provide a platform for presenting novel ideas in
a less formal and possibly more focused way than at the
conference itself. Affiliated workshops will be held prior to
the main conference. All papers included in the WoWMoM 2011 Workshops
will appear in the conference proceedings published by IEEE.
We expect all selected workshops to adhere to a common paper
submission and reviewing schedule as outlined in the dates indicated
below.

Workshops Proposals are solicited in all areas and topics pertaining to
wireless mobile and multimedia networking.
Workshops addressing emerging research directions in these areas
are highly welcome.

Each workshop proposal must include:
- The name of the workshop.
- The names, addresses, and a short bio of the organizers.
- A brief description (up to 1 page) of the technical issues
that the workshop will address, and the reasons why the
workshop is of interest at this time.
- The names of potential program committee members.
- The planned format of the workshop, including a strategy to
facilitate lively discussions and attendees involvement.
- If applicable, a description of past versions of the workshop,
including dates, organizers, number of submitted and accepted
papers, number of attendees.
- If the workshop does not have any past editions,
an estimate of the expected number of submitted and accepted
papers, and of the expected number of attendees.
- A tentative call for papers.
- A description of the plans for publicity and workshop web site.

Workshop proposals should be submitted, no later than October 20, 2010,
by e-mail (in PDF format) with "WoWMoM 2011 Workshop Proposal" in the
subject, to *both* WoWMoM 2011 Workshop Co-Chairs (WSCC) at the address
wowmom2011WSCC@cs.unibo.it.

For any additional information please refer to us at the address above.

Luciano Bononi
Department of Computer Science, University of Bologna
Bologna, Italy

and

Albert Banchs
Department of telematics Engineering, University Carlos III of Madrid
Madrid, Spain

----------------
IMPORTANT DATES
----------------

Workshop proposals submission deadline: October 20, 2010
Notification: November 5, 2010

suggested dates for the workshops schedule:
Papers due by: February 4, 2011
Paper selections due by: April 4, 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/
*
**********************************************************

TAPAS 2011, Call for Papers

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

Call for Papers

TAPAS 2011
Theory and Practice of Algorithms in Computer Systems

April 18-20, 2011, Rome, Italy

http://tapasconference.org/
=======================================================================

SCOPE
-----

In the light of continuously increasing interaction between communication
and computing, there arise a number of interesting, and difficult
algorithmic issues in diverse areas including coverage, mobility, routing,
cooperation, capacity planning, scheduling, and power control. The aim of
TAPAS is to provide a forum for presentation of original research in the
design, implementation and evaluation of algorithms. TAPAS is dedicated
to the use, design and evaluation of algorithms for combinatorial
optimization problems (either efficient optimal or efficient approximation
algorithms) and to real-world applications, engineering and experimental
analysis of algorithms. It aims, in particular, at fostering the
cooperation among researchers in computer science, networking, discrete
mathematics, mathematical programming and operations research.

PAPERS
------

The conference will focus on the design, engineering, theoretical and
experimental performance analysis of algorithms for problems arising in
different areas of computation. We invite submissions that present
significant case studies in theoretical and experimental analysis and
evaluation of algorithms with specific areas including communications
networks, combinatorial optimization and approximation, parallel and
distributed computing, computer systems and architecture, economics, game
theory, social networks and the world wide web. Novel uses of discrete
algorithms in all disciplines and the evaluation of algorithms for
realistic environments are particularly welcome.

Submitted papers will consider a succinct summary of the problem and of
the results obtained (emphasizing the significance and potential impact
of the research), and a clear comparison with related work, all accessible
to non-specialist readers. The remainder of the extended abstract should
provide sufficient detail to allow the program committee to evaluate the
validity, quality, and relevance of the contribution.

* The maximum length of the paper (excluding the optional appendix) is 12
pages.

* Proofs and any other material omitted due to space constraints must be
placed in an appendix to be read by the program committee members at
their discretion.

The proceeding will be published by Springer (Lecture Notes in Computer
Science).

IMPORTANT DATES
---------------

* Paper submission due: October 24, 2010
* Notification of acceptance: December 17, 2010

PROGRAM COMMITTEE CO-CHAIRS
---------------------------

Alberto Marchetti-Spaccamela
(Sapienza University of Rome, Italy)
alberto@dis.uniroma1.it

Michael Segal
(Ben-Gurion University of the Negev, Israel)
segal@cse.bgu.ac.il

PROGRAM COMMITTEE
-----------------

Stefano Basagni (Northeastern University, USA)
Alex Kesselman (Google Inc., USA)
Peng-Jun Wan (Illinois Institute of Technology, USA)
Peter Widmayer (ETH, Switzerland)
Stefan Funke (Universit?t Stuttgart, Germany)
Alessandro Mei (Sapienza University of Rome, Italy)
Leen Stougie (VU University, Amsterdam, Netherlands)
Alon Efrat (University of Arizona, USA)
Jack Snoeyink (University of North Carolina at Chapel Hill, USA)
Andrei Broder (Yahoo Inc., USA)
Gerhard Woeginger (Eindhoven University of Technology, Netherlands)
Michael Juenger (Universit?t K?ln, Germany)
Hanan Shpungin (University of Calgary, Canada)
Alberto Marchetti-Spaccamela (Sapienza University of Rome, Italy), co-Chair
Michael Segal (Ben-Gurion University of the Negev, Israel), co-Chair

STEERING COMMITTEE
------------------

David Peleg (Weizmann Institute, Israel)
Paul Spirakis (University of Patras, Greece))
Imrich Chlamtac (University of Trento, Italy)
Pankaj Agarwal (Duke University, USA)
Alberto Marchetti-Spaccamela (Sapienza University of Rome, Italy)
Michael Segal (BGU, Israel)
Roger Wattenhofer (ETH, Switzerland)

[DMANET] TAPAS 2011, Call for Papers

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

Call for Papers

TAPAS 2011
Theory and Practice of Algorithms in Computer Systems

April 18-20, 2011, Rome, Italy

http://tapasconference.org/
=======================================================================

SCOPE
-----

In the light of continuously increasing interaction between communication
and computing, there arise a number of interesting, and difficult
algorithmic issues in diverse areas including coverage, mobility, routing,
cooperation, capacity planning, scheduling, and power control. The aim of
TAPAS is to provide a forum for presentation of original research in the
design, implementation and evaluation of algorithms. TAPAS is dedicated
to the use, design and evaluation of algorithms for combinatorial
optimization problems (either efficient optimal or efficient approximation
algorithms) and to real-world applications, engineering and experimental
analysis of algorithms. It aims, in particular, at fostering the
cooperation among researchers in computer science, networking, discrete
mathematics, mathematical programming and operations research.

PAPERS
------

The conference will focus on the design, engineering, theoretical and
experimental performance analysis of algorithms for problems arising in
different areas of computation. We invite submissions that present
significant case studies in theoretical and experimental analysis and
evaluation of algorithms with specific areas including communications
networks, combinatorial optimization and approximation, parallel and
distributed computing, computer systems and architecture, economics, game
theory, social networks and the world wide web. Novel uses of discrete
algorithms in all disciplines and the evaluation of algorithms for
realistic environments are particularly welcome.

Submitted papers will consider a succinct summary of the problem and of
the results obtained (emphasizing the significance and potential impact
of the research), and a clear comparison with related work, all accessible
to non-specialist readers. The remainder of the extended abstract should
provide sufficient detail to allow the program committee to evaluate the
validity, quality, and relevance of the contribution.

* The maximum length of the paper (excluding the optional appendix) is 12
pages.

* Proofs and any other material omitted due to space constraints must be
placed in an appendix to be read by the program committee members at
their discretion.

The proceeding will be published by Springer (Lecture Notes in Computer
Science).

IMPORTANT DATES
---------------

* Paper submission due: October 24, 2010
* Notification of acceptance: December 17, 2010

PROGRAM COMMITTEE CO-CHAIRS
---------------------------

Alberto Marchetti-Spaccamela
(Sapienza University of Rome, Italy)
alberto@dis.uniroma1.it

Michael Segal
(Ben-Gurion University of the Negev, Israel)
segal@cse.bgu.ac.il

PROGRAM COMMITTEE
-----------------

Stefano Basagni (Northeastern University, USA)
Alex Kesselman (Google Inc., USA)
Peng-Jun Wan (Illinois Institute of Technology, USA)
Peter Widmayer (ETH, Switzerland)
Stefan Funke (Universit?t Stuttgart, Germany)
Alessandro Mei (Sapienza University of Rome, Italy)
Leen Stougie (VU University, Amsterdam, Netherlands)
Alon Efrat (University of Arizona, USA)
Jack Snoeyink (University of North Carolina at Chapel Hill, USA)
Andrei Broder (Yahoo Inc., USA)
Gerhard Woeginger (Eindhoven University of Technology, Netherlands)
Michael Juenger (Universit?t K?ln, Germany)
Hanan Shpungin (University of Calgary, Canada)
Alberto Marchetti-Spaccamela (Sapienza University of Rome, Italy), co-Chair
Michael Segal (Ben-Gurion University of the Negev, Israel), co-Chair

STEERING COMMITTEE
------------------

David Peleg (Weizmann Institute, Israel)
Paul Spirakis (University of Patras, Greece))
Imrich Chlamtac (University of Trento, Italy)
Pankaj Agarwal (Duke University, USA)
Alberto Marchetti-Spaccamela (Sapienza University of Rome, Italy)
Michael Segal (BGU, Israel)
Roger Wattenhofer (ETH, Switzerland)
**********************************************************
*
* 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] New versions of SCIP, SoPlex, and ZIMPL released

Dear all,

Version 2.0.0 of the ZIB Optimization Suite has been released.
It comprises the new versions SCIP 2.0.0, Soplex 1.5.0, and ZIMPL 3.1.0.
It provides many new features, including a global constraint (cumulative) and
copying functionality, many performance improvements and bug fixes.
It can be obtained via http://zibopt.zib.de. For detailed information and
documentation visit the project web sites http://{scip,soplex,zimpl}.zib.de.

Best regards,
the SCIP, SoPlex, and ZIMPL team

-------------
Release notes of the individual software packages:

SCIP 2.0.0: http://scip.zib.de/download/files/SCIP-release-notes-2.0
Soplex 1.5.0: http://soplex.zib.de/notes-150.txt
ZIMPL 3.1.0: http://zimpl.zib.de/download/CHANGELOG.txt
**********************************************************
*
* 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/
*
**********************************************************

[Goedel fellowship] Call for Submissions-Kurt Goedel Research Prize Fellowships

KURT GOEDEL RESEARCH PRIZE FELLOWSHIPS

The Kurt Goedel Society is proud to announce the commencement of the
second round of the
Kurt Goedel Research Prize Fellowships Program.

The research fellowship prize program is sponsored by the John Templeton
Foundation and will offer:

* two Ph.D. (pre-doctoral) fellowships of EUR 100,000
* two post-doctoral fellowships of EUR 100,000 and
* one unrestricted fellowship of EUR 100,000

One International Board of Jurors will be in charge of evaluating the
applications and determining up to
twenty finalists whose papers will be published in a special issue of the
Annals of Pure and Applied Logic,
and another international Board of Jurors will be in charge of determining
the winners. Both Boards will be chaired by Prof. Harvey Friedman, Ohio
State University (USA).


Board of Jurors for Determining the Finalists

* Jeremy AVIGAD, Carnegie Mellon University, (USA)
* Lenore BLUM, Carnegie Mellon University, (USA)
* Harvey FRIEDMAN, Ohio State University (USA) CHAIR
* John HARRISON, Intel Corporation, (USA)
* Kenneth KUNEN, University of Wisconsin, (USA)
* Angus MACINTYRE, Queen Mary, University of London and Royal Society,
(UK)
* Hiroakira ONO, JAIST Research Center for Integrated Science, (JAPAN)
* Pavel PUDLAK, Czech Academy of Sciences, (Czech Republic)
* Michael RATHJEN, University of Leeds, (UK)
* Frank STEPHAN, National University of Singapore, (SINGAPORE)
* William TAIT, University of Chicago, (USA)
* Simon THOMAS, Rutgers University, (USA)
* Albert VISSER, University of Utrecht (NL)
* Andreas WEIERMANN, Ghent University, (BELGIUM)
* Boris ZILBER, University of Oxford, (UK)

Board of Jurors for Determining the Winners

* Lev BEKLEMISHEV, Russian Academy of Sciences (RUS)
* Harvey FRIEDMAN, Ohio State University (USA) CHAIR
* Dov M. GABBAY, King's College London (UK)
* Warren D. GOLDFARB, Harvard University (USA)
* Howard Jerome KEISLER, University of Wisconsin (USA)

Goal and Criteria of Merit

The purpose of these fellowships is to support original research in, and
areas surrounding, the foundations of mathematics. (See Scope below for
more details.) These fellowships are intended to carry forward the legacy
of Kurt Gödel, whose works exemplify deep insights and breakthrough
discoveries in mathematical logic, with profound impact on the philosophy
and foundations of mathematics. In pursuit of similar insights and
discoveries, we adopt the following criteria of merit for evaluating
Fellowship applications:

1. Intellectual merit, scientific rigor and originality of the
submitted paper and work plan. The paper and research plans should combine
visionary thinking with academic and scientific excellence.
2. Potential for significant contribution to basic fundamental issues
of wide interest, and the likelihood for opening new, seminal lines of
inquiry that bear on such issues.
3. Impact of the Fellowship on the project and likelihood that the
Fellowship will make the proposed new lines of research possible.
4. The expectation that the proposed research will be successful.
5. Qualifications of the applicants will be evaluated on the basis of
all available information including CV, research paper, research plans,
research accomplishments, and letters of recommendation (recommendation
letters are not required for senior applications).


Winners' Model Projects:
http://fellowship.logic.at/2010/files/Bovykin_Project.pdf
http://fellowship.logic.at/2010/files/Koellner_Project.pdf
Model Questions
http://fellowship.logic.at/index.php?questions

Scope

Original fellowship proposals in the areas of

* set theory
* recursion theory
* proof theory/intuitionism
* model theory
* computer assisted reasoning
* philosophy of mathematics

All fellowship proposals, regardless of subject area, will be judged
according to

* the relevance and resemblance of the research (finished and
proposed) to the great insights and originality of Kurt Gödel
* its general interest and clarity of motivation
* its rigorous scientific quality and depth.

Submission Instructions

The three categories of fellowships are specified as follows:
*Ph.D.(pre-doctoral): being in the stage before finishing the thesis (or
equivalent achievements)
*Post-doctoral: being in the stage within 10 years after finishing the
thesis (or equivalent achievements)
*Unrestricted: also open to senior applicants


The submission must consist of:

- one document A in PDF format containing
. the CV
. the project description
. the recommendation letters
- one document B in PDF format containing the article
- one text abstract relating to B
Maximum allowed length of the abstract is 500 words.

Document A containing the CV, the project description, and the
recommendation letters must be prepared in the following way:
- minimum font size: 10pt
- paper size: A4
- maximum length of the CV: 3 pages
The CV must contain the list of all/most important publications.
The CV must clearly state to which category the application belongs.
- maximum length of project description: 4 pages
Project description should clearly state where and at which institution
the applicant intends to carry out the project.
- minimum 2(two)/maximum 3 (three) 1-page recommendation letters,in case
of applications belonging to the categories Ph.D.(pre-doctoral) and
post-doctoral fellowships.
(The recommendation letters should be scanned and included into the PDF
document)


The submission must be in English.

The Board and the Program Chair reserve the right:
.to consider only submissions with reasonable format
.to reassign a submission to another category as applied for.
The applicant will be informed about the reasons for such a
decision.

Submission Page

The EasyChair system is used for managing the submissions.

For submitting a proposal please go to
http://www.easychair.org/conferences/?conf=kgrpf10


Timeline

November 15, 2010. Submissions deadline
February 28, 2011. Jury decision on the papers for publication (at
most 20)
March 1, 2011. Final versions due
March 6, 2011. Jury decision on winners due
April 28-30, 2011. Conference and the Award Ceremony
June-October, 2011. Commencement of the Fellowships


Web:http://fellowship.logic.at

E-mail contact: goedel-fellowship@logic.at

[DMANET] PhD project on container transport networks

**********************************************************
*
* 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] ALENEX 2011 - submission deadline approaching (October 5, 11:59 EDT PM)

Dear Colleagues,

this is a gentle reminder that the submission deadline for ALENEX 2011
is on October 5, 11:59 EDT PM.

*****************************************************************
*
* Workshop on Algorithm Engineering and Experiments
* (ALENEX 2011)
*
* San Francisco, California USA
* January 22, 2011
*
* http://www.siam.org/meetings/alenex11/
*
*****************************************************************


*Description*

The Workshop on Algorithm Engineering and Experiments (ALENEX11) will
be held on January 22, 2011 at the Holiday Inn San Francisco Golden
Gateway, San Francisco, California, USA.

The aim of the ALENEX workshop is to provide a forum for presentation
of original research in the implementation and experimental evaluation
of algorithms and data structures. We invite submissions that present
significant case studies in experimental analysis (such studies may
tighten, extend, or otherwise improve current theoretical results) or
in the implementation, testing, and evaluation of algorithms for
realistic environments and scenarios, including specific applied areas
(for example, databases, networks, operations research, computational
biology and physics, computational geometry, and the world wide web)
that present unique challenges in their underlying algorithmic problems.
We also invite submissions that address methodological issues and
standards in the context of empirical research on algorithms and data
structures.

The scientific program will include time for discussion and debate of
topics in this rapidly evolving research area.

This workshop precedes the ACM-SIAM Symposium on Discrete Algorithms
(SODA11) <http://www.siam.org/meetings/da11/> being held January 23-2
5, 2011. The workshop will take place on the same day as the Analytic
Algorithmics and Combinatorics
(ANALCO11) <http://www.siam.org/meetings/analco11/>.

Since researchers in both fields are approaching the problem of learning
detailed information about the performance of particular algorithms,
we expect that interesting synergies will develop.

Registrants from either workshop will be cross-registered with the
other. Proceedings of ALENEX and ANALCO will be published openly and
electronically in January 2011. A special issue of the ACM Journal of
Experimental Algorithmics will be dedicated to selected papers from
ALENEX10.

A paper that has been reviewed and accepted for presentation at SODA
is not eligible for submission to ALENEX. We recognize, however, that so
me research projects spawn multiple papers that elaborate on different
aspects of the work, and are willing to respond to inquiries about
SODA, ALENEX, and ANALCO papers that may overlap. Papers of interest to
both the ALENEX and the ANALCO communities are particularly encouraged.
Such papers may be submitted to either workshop and will, as appropriate,
be presented in a joint session. Inquiries regarding ALENEX may be sent
to workshop organizers
Matthias Mueller-Hannemann (muellerh<at>informatik.uni-halle.de)
or
Renato Werneck (renatow<at>microsoft.com).

The ALENEX workshop is supported by SIAM (Society for Industrial and
Applied Mathematics) and SIGACT (ACM Special Interest Group on
Algorithms and Computation Theory).

*Important Deadlines*

*SUBMISSION DEADLINE*
Tuesday, October 5, 2010

*PRE-REGISTRATION DEADLINE*
December 20, 2010

*HOTEL RESERVATION DEADLINE*
December 20, 2010


*Workshop Co-chairs*

Matthias Mueller-Hannemann, Martin-Luther-Universitaet
Halle-Wittenberg,Germany
Renato Werneck, Microsoft Research Silicon Valley, USA


*Program Committee*

Glencora Borradaile, Oregon State University, USA
Rezaul Chowdhury, University of Texas at Austin, USA
Camil Demetrescu, University of Rome 93La Sapienza94, Italy
Marco E. LFCbbecke, Technische UniversitE4t Darmstadt, Germany
Rolf H. MF6hring, Technische UniversitE4t Berlin, Germany
Bernard Moret, Ecole Polytechnique FE9dE9rale de Lausanne,
Switzerland
David Mount, University of Maryland, USA
Kunihiko Sadakane, National Institute of Informatics, Japan
Roberto Tamassia, Brown University, USA
Laura Toma, Bowdoin College, USA
Anthony Wirth, University of Melbourne, Australia
Ke Yi, Hong Kong University of Science and Technology, Hong Kong
Christos Zaroliagis, University of Patras, Greece


**********************************************************
*
* 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/
*
**********************************************************

Sunday, October 3, 2010

[qest-announce] ETAPS 2011 Call for Papers

[We apologize for multiple copies.]

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

CALL FOR PAPERS: ETAPS 2011

European Joint Conferences on Theory And Practice of Software

March 26 - April 3, 2011

Saarbruecken, Germany

http://www.etaps.org

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

-- ABOUT ETAPS --

The European Joint Conferences on Theory and Practice of Software
(ETAPS) is the primary European forum for academic and industrial
researchers working on topics relating to Software Science. ETAPS,
established in 1998, is a confederation of five main annual confe-
rences, accompanied by satellite workshops and other events. ETAPS
2011 is already the fourteenth event in the series.


-- INVITED SPEAKERS --

* Ross Anderson (Cambridge, UK)
* Andrew Appel (Princeton, USA)
* Gerard J. Holzmann (NASA)
* Martin Odersky (EPFL, Switzerland)
* Marta Kwiatkowska (Oxford, UK)
* Prakash Panangaden (McGill, Canada)
* Andreas Podelski (Freiburg, Germany)


-- MAIN CONFERENCES --

- CC: International Conference on Compiler Construction
- ESOP: European Symposium on Programming
- FASE: Fundamental Approaches to Software Engineering
- FOSSACS: Foundations of Software Science and Computation Structures
- TACAS: Tools and Algorithms for the Construction and Analysis of Systems

-- IMPORTANT DATES --

* 1 October 2010: Submission deadline for abstracts (strict)
* 8 October 2010: Submission deadline for full papers (strict)
* 10 December 2010: Notification of acceptance
* 3 January 2011: Camera-ready versions due

-- GENERAL SUBMISSION INFORMATION --

ETAPS conferences accept two types of contributions: research papers
and tool demonstration papers. Both types will appear in the
proceedings and have presentations during the conference. A condition
of submission is that, if the submission is accepted, one of the
authors attends the conference to give the presentation. Submitted
papers must be in English presenting original research. They must be
unpublished and not submitted for publication elsewhere. In
particular, simultaneous submission of the same contribution to
multiple ETAPS conferences is forbidden. Papers should be submitted
electronically in PDF (preferably) or PS (using Type 1 fonts). The
proceedings will be published in the Advanced Research in Computing
and Software Science (ARCoSS) subline of the Springer-Verlag Lecture
Notes in Computer Science series. Final papers will be in the format
specified by Springer-Verlag at the URL:
http://www.springer.de/comp/lncs/authors.html .

It is recommended that submissions adhere to the specified format and
length. Submissions that are clearly too long may be rejected
immediately.


Research Papers

Different ETAPS conferences will have different page
limits. Specifically, FASE, FOSSACS and TACAS will have a page limit
of 15 pages, whereas CC and ESOP will have a page limit of 20
pages. Additional material intended for the referee but not for
publication in the final version - for example details of proofs - may
be placed in a clearly marked appendix that is not included in the
page limit. ETAPS referees are at liberty to ignore appendices, and
papers must be understandable without them.

Tool Demonstration Papers

Submissions should consist of two parts:

* The first part, at most four pages, should describe the tool
presented Please include the URL of the tool (if available) and
provide information that illustrates the maturity and robustness
of the tool (this part will be included in the proceedings). *

* The second part, at most six pages, should explain how the
demonstration will be carried out and what it will show,
including screen dumps and examples. (This part will be not be
included in the proceedings, but will be evaluated.)


Please note that FOSSACS does not accept tool demonstration papers.

-- SATELLITE EVENTS --

18 satellite workshops will take place before or after ETAPS 2011.

-- SAARBRUECKEN --

Saarbruecken is the capital of the Saarland, the smallest German
federal state. Saarbr¸cken has approximately 190,000 inhabitants and
hence is of pleasant size. Picturesque attractions and places of
historic interest are scattered around the city, and offer the perfect
destination for a hike or a daytrip. The cultural palette attracts
visitors from far and wide. Saarbruecken is located very close to the
French border, and half way on the high-speed railway connecting Paris
and Frankfurt. Both are in less than two hours distance.


-- FURTHER INFORMATION AND ENQUIRIES --

For further information, do not hesitate to contact the following
addresses.

* GENERAL INFORMATION
e-mail: etaps2011@cs.uni-saarland.de

Holger Hermanns
ETAPS 2011 Organising Committee Chair

* General Chair: Reinhard Wilhelm
* Workshop Chair: Bernd Finkbeiner

* Organising Committee: Bernd Finkbeiner, Holger Hermanns (Chair),
Reinhard Wilhelm, Stefanie Haupert-Betz, Christa Schäfer

* Web site: Hernán Baró Graf


_______________________________________________
qest-announce mailing list
qest-announce@iti.uiuc.edu
http://mailman.crhc.uiuc.edu/mailman/listinfo/qest-announce

Department of Computer Science, University of Haifa, Israel - Faculty Positions

University of Haifa, Israel
Department of Computer Science
url: http://hevra.haifa.ac.il/~cs

The Department of Computer Science at the University of Haifa invites
applications for faculty positions at all levels. Candidates should
have a Ph.D. in Computer Science or in a closely related field, and a
strong research record.

In addition to excellence in fundamental research and education, the
department intends to develop close interaction with the advanced
technology industry in Haifa, which includes advanced research centers
of IBM, Intel and Microsoft, Google and Yahoo.

Candidates interested in being considered for positions starting in
October 2011 are encouraged to apply before November 15, 2010.

Qualified applicants should send their curriculum vitae along with a
list of 3-4 references to:

Dr. Ronen Shaltiel
Head of hiring committee,
Department of Computer Science,
University of Haifa, Haifa 31905,
e-mail: ronen@cs.haifa.ac.il

Saturday, October 2, 2010

[DMANET] [Summer School on Cognitive Radio ] On-line Registration is Open

Dear all colleagues:

The on-line registration of the York-Zhejiang Summer School on Cognitive
Communications (http://www.summerschool2010.org/) is open for all
applications.

You are suggested to finish your on-line registration by accessing:
http://www.summerschool2010.org/registration.html.

We are looking forward to seeing you in Hangzhou!

Best regards,

York-Zhejiang Summer School Lecturers Team

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

York - Zhejiang Summer School on Cognitive Communications

Registration is open for all applications!!

25 - 31 October 2010, www.summerschool2010.org

Thanks to funding from Research Councils UK in China and Worldwide
Universities Network, the first York-Zhejiang 'Summer School' on Cognitive
Communications will take place from 25 - 31 October 2010 at Zhejiang
University in Hangzhou, China. The central aim is to bring together 100
like-minded research active individuals to explore the ever-growing field of
Cognitive Communications, which encompasses cognitive radio, cognitive
networks, and application of cognition to other aspects of communications
systems.

Supported by a team of ten expert lecturers, five from the UK and five from
China, the programme includes tutorials, providing an in-depth introduction
to key topics, lectures dealing with more specialist techniques, workshops,
one centred on a mini-project "a tech-fest" to be undertaken during the
week, the other giving delegates hands on experience of tools and
implementation. There will also be time for a short seminar and poster
session, to allow delegates to display their current research in the area.
Briefings of various relevant projects from around the world will also be
given. A visit to a local wireless communications company (or industrial
research lab such as Huawei Lab in Hangzhou) will provide further interest
and diversity. The evenings will be more devoted to cultural aspects, with a
welcome reception and banquet, and also themed events from the UK (pub quiz)
and China.

The School is designed for Masters students, PhD students, postdoctoral
researchers and junior Lecturers with interests in Cognitive Communications.
Courses will be comparable to first year graduate courses.

For more information and how to apply please see: www.summerschool2010.org

Lecturing Team:

Dr David Grace (University of York, dg@ohm.york.ac.uk),

Dr Paul Mitchell (University of York)

Mr. Tim Clarke (University of York)

Dr Oliver Holland (King's College London)

Dr Maziar Nekovee (BT/University College London)

Dr. Honggang Zhang (Zhejiang University, honggangzhang@zju.edu.cn)

Dr Wei Wang (Zhejiang University)

Dr. Lingyang Song (Peking University)

Dr Wei Chen (Tsinghua University)

Dr Xinbing Wang (Shanghai Jiaotong University)

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

Honggang ZHANG, Professor, Ph.D.

Department of Information Science & Electronic Engineering

Co-Director

York-Zhejiang Lab for Cognitive Radio & Green Communications

Zhejiang University

Zheda Road 38, Hangzhou 310027, CHINA

Tel: +86-571-87952022 Fax: +86-571-87952022

Email: <mailto:honggangzhang@zju.edu.cn> honggangzhang@zju.edu.cn

Website 1: <http://mypage.zju.edu.cn/en/honggangzhang>
http://mypage.zju.edu.cn/en/honggangzhang

Website 2: <http://sites.google.com/site/honggangzhanglabs>
http://sites.google.com/site/honggangzhanglabs

=====================================================
**********************************************************
*
* 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, October 1, 2010

Professor position

REMINDER: Deadline on October 15, 2010.

Please pass this job offer on to people you consider qualified and interested.

(the attached text is both in German and in English)