Theory Announcements: June 2010

Wednesday, June 30, 2010

Postdoc positions available

[ Apologies for multiple copies of this message ]

Post-Doc Positions Available

Embedded System Research Unit
Center for Information and Communication Technology
Fondazione Bruno Kessler
Trento, Italy

!!! Application Deadline Approaching !!!

The Embedded System Research Unit (http://es.fbk.eu) of the
Information and Communication Technology Center of the Bruno Kessler
Foundation, Trento, Italy, is seeking candidates for Post-Doc
positions, to be hosted according to the call of proposal "Trentino -
The Trentino programme of research, training and mobility of
post-doctoral researchers", to be funded by the Autonomous Province of
Trento, see:
http://www.uniricerca.provincia.tn.it/binary/pat_uniricerca/news/call_1_post_doc_2010_incoming_en.1273589322.pdf

Applications are invited in the broad field of formal verification
and planning. Topics of interest include:

- Model Checking
- Safety Analysis
- Schedulability
- Planning and Run-time Monitoring

Project proposals may have a duration of between two and three years.

Candidate Profile
=================

The ideal candidate should have a PhD degree in computer science,
mathematics or electronic engineering, combine solid theoretical
background and software development skills, and have some degree of
autonomy.

The candidate should be able to work in a collaborative environment,
with a strong commitment to reaching research excellence and achieving
assigned objectives.

In depth previous experience in at least one of the following areas
will be considered favorably:

- Symbolic Model Checking
- Propositional Satisfiability
- Satisfiability Modulo Theory
- Requirements Analysis
- Constraint Solving and Optimization
- Monitoring and Diagnosability
- Software Verification
- Safety Analysis (FTA, FMEA)

We draw attention on the following requirements stated in the call for
proposal.

(1) The proposing researcher must have a PhD, obtained in Italy or
abroad no more than three years before the deadline of this call.

(2) The proposing researcher must not have had any working
relationship (including any fellowship, scholarship, research
grant, contract, cooperation) with any research organizations
which have their registered office or operating centres inside
Trento Province, longer than 30 days on the whole, during the two
years before the deadline of this call.

Applications and Inquiries
==========================

Potential candidates should express their interest and/or inquire for
further information by sending email to <jobs[at]fbk[dot]eu>.

Applications should contain a statement of interest, with a Curriculum
Vitae, and the names of three reference persons. PDF format is
strongly encouraged.

Emails will be automatically processed and should have

'RIF: ES/postdoc'

as subject.

Potential candidates will be interviewed in order to define the
objectives of the research activities and to obtain the endorsement of
the hosting institution. If successful, they will be required to
complete the application through the PAT site by July 13th, 2010.

The applications will be evaluated by an independent team of experts.

The Embedded System Research Unit
=================================

The Embedded Systems Unit consists of about 15 persons, including
researchers, post-Doc, PhD students, and programmers. The
Unit carries out research, tool development and technology transfer in
the fields of design and verification of embedded systems.

Current research directions include:

* Satisfiability Modulo Theory, and its application to the
verification of hardware, embedded critical software, and hybrid
systems (Verilog, SystemC, C/C++, StateFlow/Simulink)

* Formal Requirements Analysis based on techniques for temporal logics
(consistency checking, vacuity detection, input determinism,
cause-effect analysis, realizability and synthesis)

* Model-based engineering and formal verification of aerospace systems
using model checking techniques, on-board reasoning systems for autonomous
vehicles using planning techniques

* Formal Safety Analysis, based on the integration of traditional
techniques (e.g. Fault-tree analysis, FMEA) with symbolic
verification techniques

The unit develops and maintains several tools:

* the NuSMV symbolic model checker (http://nusmv.fbk.eu)

* the MathSAT SMT solver (http://mathsat.fbk.eu)

* the Formal Safety Analysis Platform FSAP (http://fsap.fbk.eu)

* the Requirements Analysis Tool RAT (http://rat.fbk.eu)

The unit is currently involved in several research projects, funded by
the European Union, the European Space Agency, the European Railway
Agency, as well as in industrial technology transfer projects. The
projects aim at applying research results to key application domains
such as space, avionics, railways, hardware design and mobile embedded
applications.

A list of past and present projects, the unit has been involved in,
include:

- MISSA (http://es.fbk.eu/index.php?n=Projects.MISSA)
- COCONUT (http://es.fbk.eu/index.php?n=Projects.COCONUT)
- EURAILCHECK (https://es.fbk.eu/projects/eurailcheck/)
- OMC-ARE (https://es.fbk.eu/index.php?n=Projects.OMCARE)
- COMPASS (http://compass.informatik.rwth-aachen.de)

The Embedded Systems (ES) Unit is part of the Information and
Communication Technology (ICT) Center of Fondazione Bruno Kessler
(FBK), formerly Istituto Trentino di Cultura, a private non-profit
research centre established by the government of Autonomous Province
of Trento (PAT) in 1976. The institute, through its ICT Center, is
active in the areas of Information Technology, Microsystems, and
Physical Chemistry of Surfaces and Interfaces. Today, FBK is an
internationally recognized research institute, collaborating with
industries, universities, and public and private laboratories in Italy
and abroad. The institute's applied and basic research activities aim
at resolving real-world problems, driven by the need for technological
innovation in society and industry.

Location
========

Trento is a lively town of about 100.000 inhabitants, located 130 km
south of the border between Italy and Austria. It is well known for
the beauty of its mountains and lakes, and it offers the possibility
to practice a wide range of sports. Trento enjoys a rich cultural and
historical heritage, and it is the ideal starting point for day trips
to famous towns such as Venice or Verona, as well as to enjoy great
naturalistic journeys. Detailed information about Trento and its
region can be found at http://www.trentino.to/home/index.html?_lang=en.

Links
=====

Autonomous Province of Trento, University and Scientific Research:
http://www.uniricerca.provincia.tn.it/

Call for applications:
http://www.uniricerca.provincia.tn.it/binary/pat_uniricerca/news/call_1_post_doc_2010_incoming_en.1273589322.pdf

Fondazione Bruno Kessler: http://www.fbk.eu/
Center for Information Technology: http://cit.fbk.eu/
Embedded Systems Research Unit: https://es.fbk.eu/

Contact Persons
===============

* Alessandro Cimatti
mailto: <cimatti[at]fbk[dot]eu>
http://es.fbk.eu/people/cimatti

* Marco Bozzano
mailto: <bozzano[at]fbk[dot]eu>
http://es.fbk.eu/people/bozzano

[DMANET] PhD / Postdoc Position at the University of Kiel

A PhD or postdoc position is available in the research group "Theory of
Parallelism" (Prof. Klaus Jansen) at the Department of Computer Science of
the Christian-Albrechts-University of Kiel, Germany, within the research
project

"Efficient polynomial time approximation schemes (EPTAS) for scheduling
and related optimization problems"

funded by the Deutsche Forschungsgemeinschaft (DFG). The position is for
three years (TV-L E 13) starting 1st October 2010 (exact date is
negotiable).

Applicants are required to have completed a diploma, master's degree, or
an equivalent degree in Computer Science or Mathematics and have a strong
interest in Theoretical Computer Science, particularly in algorithms and
complexity.

The position focuses on research in the following subjects:

- efficient approximation schemes for scheduling and knapsack problems

- approximation algorithms for linear and integer linear programming

- implementation of efficient polynomial time approximation schemes

- open questions regarding the bin packing problem

The university strives to increase the number of women in research and
teaching and would like to explicitly encourage women to apply for this
position. Female applicants will be given preference when qualifications
and suitability are equal or similar.

The university supports the employment of handicapped people. Hence,
handicapped applicants will be employed preferentially if they are
suitably qualified.

Please send your application including a detailed curriculum vitae, a list
of three references with email addresses as well as a statement of
research interests (at most one page) and copies of academic diplomas
before the deadline on the 30th July 2010 to:

Prof. Dr. Klaus Jansen
Department of Computer Science
University of Kiel
Christian-Albrechts-Platz 4
24118 Kiel, Germany

More information:
Prof. Klaus Jansen (kj@informatik.uni-kiel.de)
http://www.informatik.uni-kiel.de/en/theory-of-parallelism/

**********************************************************
*
* 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, June 29, 2010

[DMANET] Stellenausschreibung

Stellenausschreibung

Ab dem 1. Oktober 2010 (ggf. auch zu einem frueheren Zeitpunkt) ist im
Rahmen zukuenftiger Forschungsprojekte die Stelle eine(r/s)

wissenschaftlichen Mitarbeiter(in/s) (TV-L 13)

am Lehrstuhl fuer Verkehrssysteme und -logistik (VSL) der Technischen
Universitaet Dortmund zu besetzen. Moegliche Aufgabenschwerpunkte
liegen in der Erforschung von Algorithmen zur Optimierung und Loesung
von Gueterflussproblemen (z. B. Verkehrsstroeme im
Schienengueterverkehr), Reihenfolge- und Ablaufplanungen (z. B.
Scheduling in der Hoflogistik) oder der verbesserten Routenplanung
(innerbetrieblich oder fuer ganze Fahrzeugflotten). Das Vorhaben ist
auf die vorgesehene Laufzeit des Foerderprogramms von ca. 36 Monaten
befristet. Es besteht die Option zur Weiterbeschaeftigung am Lehrstuhl
VSL.
Hierzu suchen wir Bewerber/innen mit ueberdurchschnittlichem Abschluss
in den Studiengaengen

Informatik, (Wirtschafts-)Mathematik oder (Wirtschafts-)Ingenieurwesen

sowie fundierten Kenntnissen in mathematischer, insbesondere diskreter,
Optimierung oder Metaheuristiken und Softwareentwicklung.
Die/der wissenschaftliche Mitarbeiter/in sollte sich darueber hinaus
fuer logistische Fragestellungen interessieren. Neben der Entwicklung
von mathematischen Modellen und Algorithmen stehen der Kontakt zu
Unternehmen, die Aufnahme logistischer Prozesse und relevanter Daten
sowie die Implementierung von Verfahren und deren Anwendung auf reale
Praxisszenarien im Vordergrund.
Die Stelle erfordert die zielorientierte und selbstaendige Bearbeitung
von wissenschaftlich anspruchsvollen Fragestellungen. Erwartet werden
darueber hinaus teamorientiertes Arbeiten, gute kommunikative
Faehigkeiten sowie ein hohes Mass an Engagement und
Kooperationsbereitschaft. Zusaetzlich sind gute Englischkenntnisse und
Programmierkenntnisse in einer objektorientierten Programmiersprache (z.
B. Java oder C#) wuenschenswert. Erfahrungen im Umgang mit einer
Modellierungssprache (Gams, Aimms, etc.) sind von weiterem Interesse.
Im Rahmen der Taetigkeit besteht die Moeglichkeit zur Promotion.
Schriftliche Bewerbungen unter Angabe eines moeglichen Eintrittstermins
sowie mit allen wichtigen Unterlagen sind bis zum 1. August 2010
einzureichen.

Die Technische Universitaet Dortmund will den Anteil von Frauen in der
Wissenschaft erhoehen und bittet daher insbesondere Frauen um ihre
Bewerbung. Es wird darauf hingewiesen, dass die Bewerbung geeigneter
Schwerbehinderter erwuenscht ist.

Technische Universitaet Dortmund
Lehrstuhl fuer Verkehrssysteme und -logistik (VSL)
Univ.-Prof. Dr.-Ing. Uwe Clausen
Leonhard-Euler-Strasse 2
44227 Dortmund

PhD position (Graph Algorithms) - University of Bergen, Norway

A 3 year PhD position is available at the Algorithms Research Group of
the University of Bergen, Norway. The successful candidate will be a
part of the project "Exploiting Structure to Cope with Hard Problems",
funded by the Research Council of Norway.

Annual salary: approximately 45,000 EUR before tax.
Application deadline: August 15, 2010.
Preferred starting time: October 2010.

More details are available and the application procedure is explained at
http://www.ii.uib.no/~pinar/PhD-SCOPE.html

Please do not hesitate to contact Pinar Heggernes with questions if you
are interested in the position.

Please forward to your graduating students.

http://www.uib.no/rg/algo/

[DMANET] PhD position (Graph Algorithms) - University of Bergen, Norway

A PhD position is available within the project

"Exploiting Structure to Cope with Hard Problems"

at the Algorithms Group of the University of Bergen, Norway.

Please see http://www.ii.uib.no/~pinar/PhD-SCOPE.html for details.

Please forward to your graduating students.

[DMANET] Post-doc at Oxford University in Combinatorial Optimization

Applications are invited for a Postdoctoral Research Assistant in
Spreading Processes on Networks and Applied Combinatorial Optimization.
We also have a one year appointment on network inference (see
www.physics.ox.ac.uk/jobs/)

The post is available initially for a fixed-term duration of 2 years. We
will consider candidates either from Applied Combinatorial Optimization
or from Network Science.

Candidates with a background in combinatorial optimization will
investigate a spectrum of computational methods from applied
combinatorial optimization as applied to a set of canonical problems
constrained by real data. The aim will be to reach across methods from
the many ways in which combinatorial optimization is performed in
practice, making sure that we consider a good representation of typical
heuristics. One of our objectives will be to use these methods as a way
of investigating the nature of the data as well as the nature of the
algorithms. Our benchmarked methods will be turned to improved
approaches to detecting clusters in graphs and methods for controlling
rumour propagation on social networks.

This is part of the EPSRC grant `Game theory and adaptive networks for
smart evacuations92. Part of this is to probe the way in which
information about a threat propagates around social networks and to ask
how this might be perturbed optimally. The candidate will meet with
social scientists to establish how to parameterize and motivate the
appropriate simple models. A parallel post on spatial agent based models
will be advertised in Manchester Physics with Dr Tobias Galla.

Necessary: (1) A background in applied combinatorics (both interpreted
in a broad sense) (2) Enthusiasm to work with researchers from different
backgrounds. (3) A strong, relevant, publication record and an ability
to work independently if required. (4) Experience with real data. (5) A
high level of programming skills and willingness to use them.

It will be desirable for candidates, depending on background, to have
some subset of the following skills. Familiarity with methods from:
network/graph analysis and complex systems; heuristics for combinatorial
optimization; methods for feature selection; statistical physics and
stochastic processes; statistical machine learning/ inference.

The candidate will likely work with another PDRA with practical
experience in Evolutionary Computation applied to topics in Evolution.
Since this appointment is interdisciplinary we will consider candidates
from across the disciplines: computer science, applied mathematics,
physics, statistics, systems biology, and engineering.

Please direct informal inquiries about this post to
Nick.Jones@physics.ox.ac.uk.

For further particulars of the post, and how to apply please visit
http://www.physics.ox.ac.uk/jobs/
Application Deadline: 09 July 2010
http://www.physics.ox.ac.uk/jobs/upload//dk10-005%20pdra%20jones1_further
_particulars.doc
**********************************************************
*
* 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] DYNAS 2010: Call for Participation (colocated with ICALP 2010)

*** Apologies for multiple copies ***
______________________________________________________________________

Call for participation

DYNAS 2010

2nd International Workshop on
DYnamic Networks - Algorithms and Security

July 5, 2010
Bordeaux, France

Colocated with ICALP 2010

http://dynas2010.labri.fr/
______________________________________________________________________

General information:
--------------------
The city of Bordeaux is known worldwide for its architecture (listed
on the UNESCO World Heritage), quality of life and of course its
wines. All informations can be found here:
http://www.bordeaux-tourisme.com

The workshop will be held at the Cite Mondiale
(http://www.citemondiale.com/) at the hearth of the city, next to the
river.

For more information about the venue, please visit:
http://icalp10.inria.fr/index.php?n=Main.Venue

Registration:
-------------
To register for DYNAS workshop, please visit:
http://icalp2010.dakini.fr/

Program:
--------
The program is available on the DYNAS website:
http://dynas2010.labri.fr/pmwiki.php?n=Main.Program

Invited speakers:
-----------------
* Serge Chaumette, University of Bordeaux, France
* Miroslaw Kutylowski, Wroclaw University of Technology, Poland
* Christian Scheideler, University of Paderborn, Germany

Workshop:
---------
DYNAS is about dynamic networks such as Peer-to-Peer, Sensor and
Ad-Hoc Networks. We gladly welcome descriptions of original, well
defined (possibly not yet completely solved) problems in the following
typical but not exclusive areas:
* Algorithms for construction and maintenance of Peer-to-Peer, Sensor
and Ad-Hoc Networks.
* Algorithms working on top of networks.
* Security and anonymity issues in systems of computationally weak
devices (like RFID-tags).

Program Committee:
------------------
* Asmaa Adnane, Polytech-Nantes, France
* Marcin Bienkowski, Wroclaw University, Poland
* Stefan Dziembowski, University of Rome "La Sapienza", Italy
* David Ilcinkas, CNRS & University of Bordeaux, France (chair)
* Marek Klonowski, Wroclaw Univ. of Technology, Poland
* Miroslaw Korzeniowski, Wroclaw Univ. of Technology, Poland (chair)
* Adrian Kosowski, Gdansk University of Technology, Poland
* Francois Lesueur, University Paris-Sud, France
* Stefan Schmid, TU Berlin / Deutsche Telekom Lab, Germany
* Filip Zagorski, Wroclaw University of Technology, Poland
**********************************************************
*
* 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/
*
**********************************************************

Monday, June 28, 2010

[DMANET] PhD Position at INRIA Grenoble

----------------------------
----------------------------
OPEN PhD POSITION
----------------------------
----------------------------

----------------------
TITLE
----------------------
Towards Scalable and Dependable Computing in the Cloud

----------------------
KEYWORDS
----------------------
Distributed systems, Cloud computing, QoS, SLA, Scalability, Dependability

----------------------
RESEARCH DESCRIPTION
----------------------
Cloud Computing is a paradigm for enabling remote, on-demand access to a
set of configurable computing resources. A Cloud may stand at different
levels of the hardware and software stack where: (i) an Infrastructure
as a Service (IaaS) cloud enables access to hardware resources such as
servers and storage devices, (ii) a Platform as a Service (PaaS) cloud
allows the access to software resources such as operating systems and
software development environment, and (iii) a Software as a Service
(SaaS) cloud is an alternative to classical software applications
running locally on personal computers which are, instead, provided
remotely by the cloud (e.g. messaging services, document editing
services, etc.). Although Cloud Computing provides a means to support
remote, on-demand access to computing resources, its ad-hoc management
poses significant challenges to the scalability, performance,
dependability and economical costs of cloud services.

A differentiating element between Cloud Computing environments will be
the quality-of service (QoS) and the service level agreement (SLA)
provided by the cloud. However, service composition and cloud elasticity
that underlie Cloud Computing make cloud management challenging. The
proposed PhD project aims at investigating novel protocols for scalabile
and efficient cloud provisioning, while guaranteeing dependability and
reducing costs. The project will study an innovative approach that
combines control theory techniques with distributed algorithms in order
to build self-elastic clouds. Novel models, control laws, and
distributed algorithms will be proposed for automated provisioning,
configuration and deployment of cloud services to meet SLA requirements,
while tackling scalability and dynamics issues.

----------------------
SKILLS
----------------------
Distributed computing systems, Distributed algorithms, Java programming

----------------------
LOCATION AND SALARY
----------------------
A PhD studentship for 3 years is available. The monthly gross salary is
1 947.80 € during the two first years and 2 048.60 € during the last year.
The successful candidate will join the SARDES Distributed Systems
Research Group at INRIA Grenoble:
http://www.inria.fr/grenoble/

INRIA
SARDES Research Group
655, avenue de l'Europe, Montbonnot
38334 St Ismier Cedex, France

----------------------
CONTACT
----------------------
Application materials (including CV and the names of two referees)
should be sent by email to Dr Sara Bouchenak.

Sara.Bouchenak@inria.fr

Phone: +33 (0)4 7661 53 82 | Fax: +33 (0)4 7661 52 52

Postdoctoral fellowship in Algorithms and Complexity (Computational complexity and finite model theory), University of Edinburgh

The Algorithms and Complexity group at the School of Informatics, University of
Edinburgh, is seeking a post-doctoral researcher to work on the EPSRC-funded
project "Hierarchies, Circuit Lower Bounds and Pseudorandomness" under the
supervision of Dr Rahul Santhanam. The position is open to researchers who
have, or soon expect to have, a PhD in computer science or a closely related
field. Skills in theoretical computer science, with an emphasis on
computational complexity and finite model theory, will be particularly
appreciated.

The post is available from 23rd July 2010 (flexible) for one year with a
possibility of extension.

Informal enquiries may be sent to Dr. Rahul Santhanam (mail to:
rsanthan@inf.ed.ac.uk).

For further details and the application procedure, please visit:
http://www.jobs.ed.ac.uk/vacancies/index.cfm?fuseaction=vacancies.detail&vacancy_ref=3013006&go=GO

-- Rahul Santhanam

--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.

[DMANET] Postdoctoral fellowship in Algorithms and Complexity (Computational complexity and finite model theory), University of Edinburgh

The Algorithms and Complexity group at the School of Informatics,
University of Edinburgh, is seeking a post-doctoral researcher to work on
the EPSRC-funded project "Hierarchies, Circuit Lower Bounds and
Pseudorandomness" under the supervision of Dr Rahul Santhanam. The
position is open to researchers who have, or soon expect to have, a PhD in
computer science or a closely related field. Skills in theoretical
computer science, with an emphasis on computational complexity and finite
model theory, will be particularly appreciated.

The post is available from 23rd July 2010 (flexible) for one year with a
possibility of extension.

Informal enquiries may be sent to Dr. Rahul Santhanam (mail to:
rsanthan@inf.ed.ac.uk).

For further details and the application procedure, please visit:
http://www.jobs.ed.ac.uk/vacancies/index.cfm?fuseaction=vacancies.detail&vacancy_ref=3013006&go=GO

-- Rahul Santhanam

--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.

[DMANET] Registration site open: COMSOC 2010, Duesseldorf, Germany, September 13-16

Dear colleagues,

Registration for COMSOC-2010 is now open (see below for details).
There is also information on accomodation/hotels. Please accept
our apologies if you receive multiple copies of this message.

Cheers,
Joerg & Vince

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

Call for Papers

Third International Workshop on Computational Social Choice
(COMSOC-2010)

Duesseldorf, Germany, September 13--16, 2010

URL: http://ccc.cs.uni-duesseldorf.de/COMSOC-2010/

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

Registration for COMSOC-2010 is now open. Please go to our website,
fill in the online registration form:

http://ccc.cs.uni-duesseldorf.de/COMSOC-2010/registration.shtml

and pay the registration fee within one week after registration.
Please register by 15 July 2010. Late registration is possible (at
the same price), but for registrations received after this date we
cannot promise to have enough copies of the workshop notes available,
and we may also be short of places for the social dinner. The
registration fee is 75 Euros (standard) and 30 Euros (students) and
the social dinner at "Guennewig Rheinturm Restaurant" costs an
additional amount of 30 Euros.

Accommodation: Due to many fairs in Düsseldorf in September we
recommend to book the hotel room early. Some hotels, which are close
to the workshop venue, offer special rates for COMSOC-2010 participants
(mention the keyword COMSOC when booking your room). However, these
offers end on 30 June 2010 or 1 July 2010. Check out the website:

http://ccc.cs.uni-duesseldorf.de/COMSOC-2010/travel.shtml

Best regards,

Vincent Conitzer & Joerg Rothe
(COMSOC-2010 Program Chairs)

[DMANET] five PhD scholarships available in Berlin

The Research Training Group (Graduiertenkolleg)

METHODS FOR DISCRETE STRUCTURES
http://www.math.tu-berlin.de/MDS/

funded by the German Science Foundation (DFG) at the three Berlin
Universities will in 2010 offer

five SCHOLARSHIPs

for Ph.D. Studies starting Oktober 15th, 2010 or later (subject to
further funding by DFG).

The scholarships are 1350 EUR (tax-free) per month - according to DFG
rules.
They are usually granted as 2-year fellowships, extendible by a third
year.

The MDS course program consists of the Monday Afternoon Colloquium
lectures, block courses, summer schools, regular predoc programs,
etc. - all this in a very lively Berlin discrete mathematics context,
which also includes the DFG Research Center MATHEON
(http://www.matheon.de).

The RTG "Methods for Discrete Structures" is also a registered unit for
the "Phase II" part of
BERLIN MATHEMATICAL SCHOOL (http://www.math-berlin.de),
the joint international graduate program of the three major Berlin
universities - which has a lot to offer!
Students of the MDS program may apply to be members of the BERLIN
MATHEMATICAL SCHOOL.

Applicants for Ph.D. scholarships are expected to have a
Diploma/Master's degree or equivalent, usually
in Mathematics or Computer Science. Applications for scholarships
starting in 2010
consisting of

- letter of application
- curriculum vitae
- Diplom/masters' thesis
- proposal for possible thesis topic
- recommendation letter by thesis advisor
(to be sent directly to us)

should be directed to

Prof. Martin Skutella, deputy Coordinator
RTG "Methods for Discrete Structures"
Inst. Mathematics, MA 5-2
TU Berlin
D-10623 Berlin, Germany

email: skutella@math.tu-berlin.de
http://www.math.tu-berlin.de/coga/people/skutella/
Tel.: +49 - 30 - 314-78654 / -28641
Fax: +49 - 30 - 314-25191

Applications by email are welcome.
If you have applied to BERLIN MATHEMATICAL SCHOOL Phase II,
then please just inform us about this - there is no need to
submit your materials again.
**********************************************************
*
* 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] PhD Scholarship

Sorry for multiple posting!
--------------------------------------------------------------------------

PhD scholarship to design and analyse algorithms for multicriteria
problems in Bioinformatics at University of Coimbra.

We are seeking candidates for a PhD position within an innovative
research project at the Centre for Informatics and Systems at the
University of Coimbra. The project is concerned with development of
algorithms for multicriteria combinatorial optimization problems that
arise in the Bioinformatics field. The research team involves computer
scientists, mathematicians, biochemists and practioneers.

The successuful candidate will receive a scholarship of 980 Euros per
month, tax free, for 2.5 years, and he/she should be enrolled in the
PhD program at the Department of Informatics Engineering (see
http://phd.dei.uc.pt). There is funding available for conference fees
and for travelling to conferences. There are no teaching obligations.

A suitable background for the applicant is a strong undergraduate
degree in Computer Science and Mathematics or related
fields. Candidates must have a strong background in algorithm design
and analysis techniques. The start of this position is planned for
September 1 2010.

The University of Coimbra is one of the oldest in Europe, one of the
highest-ranked universities in portuguese-speaking countries as well
as being one of the Portugal's most international universities. Coimbra
is a very lively city and it is well-known for its academic traditions
and historical monuments. Given the low cost of living in Portugal, the
scholarship is adequate to cover all living expenses.

In case you are interested in applying to this position, please, reach
me by e-mail (paquete@dei.uc.pt). The application must be sent until 2
August.

(further information will be posted at
http://eden.dei.uc.pt/~paquete/MOSAL/grant.txt)

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

Luis Paquete Department of Informatics Engineering Faculty of Science
and Technology University of Coimbra phone: +351 239 790 049 fax: +351
239 701 266 e-mail: paquete@dei.uc.pt www:
http://eden.dei.uc.pt/~paquete/

----------------------------------------------------------------
This message was sent using IMP, the Internet Messaging Program.

[DMANET] Vacancy (Ph.D. student) at University of Kiel, Germany

[Please find the english version below.]

Stellenausschreibung

Am Institut fuer Informatik in der Arbeitsgruppe "Theorie der Parallelitaet"
der Christian-Albrechts-Universitaet zu Kiel ist zum 01. Oktober 2010 die
Stelle einer/eines

wissenschaftlichen Mitarbeiterin/wissenschaftlichen Mitarbeiters

nach der Entgeltgruppe TV-L E13 zu besetzen. Die Stelle ist zunae�chst auf
zwei Jahre befristet.

Eingangsvoraussetzungen sind ein Ueberdurchschnittliches Diplom an einer
wissenschaftlichen Hochschule in Informatik oder ein vergleichbarer
Abschluss, Interesse an der Theoretischen Informatik, vor allem auf dem
Gebiet der Algorithmen, sowie Erfahrung in der universitaeren Lehre. Die
Gelegenheit zur Vorbereitung einer Promotion ist gegeben.

Aufgabengebiet:

Zum Aufgabenbereich gehoeren neben der Mitarbeit in der Lehre (4
Lehrveranstaltungsstunden) in Grund- und Hauptstudium vor allem die
Forschung in den folgenden Themengebieten:

- Approximative Algorithmen fuer Schedulingprobleme

- Lineare und ganzzahlige lineare Optimierung

- Offene Fragen zum Binpacking Problem

Die Universitaet ist bestrebt, den Anteil von Wissenschaftlerinnen in
Forschung und Lehre zu erhoehen und fordert deshalb entsprechend
qualifizierte Frauen nachdruecklich auf, sich zu bewerben. Frauen werden
bei gleichwertiger Eignung, Befaehigung und fachlicher Leistung vorrangig
beruecksichtigt.

Die Hochschule setzt sich fuer die Beschaeftigung schwerbehinderter Menschen
ein. Daher werden schwerbehinderte Bewerberinnen und Bewerber bei
entsprechender Eignung bevorzugt beruecksichtigt.

Bewerbungen mit den ueblichen Unterlagen sind bis zum 14.07.2010 zu richten
an:

Prof. Dr. Klaus Jansen

Institut fuer Informatik

Technische Fakultaet der
Christian-Albrechts-Universitaet zu Kiel

Christian-Albrechts-Platz 4 (Hochhaus, 10. Etage)

24118 Kiel

***Englische Version***

The research group 'Theory of Parallelism' at the Department of Computer
Science of the Christian-Albrechts-University of Kiel, Germany, is
looking for a

research assistant / Ph. D. student

beginning October 1st 2010. Employment is limited to 24 month, but can be
extended, and salary is set according to the German level TV-L E 13.

Applicants are required to have completed a diploma, master's degree, or
an equivalent

in Computer Science or Mathematics, have a strong interest in theoretical
Computer Science, in particular algorithmics, and some previous experience
in university level teaching.

In addition to a teaching obligation of 4 hours/ week in basic and
advanced courses, this position focuses on research in the following
subjects:

- approximative algorithms for scheduling problems

- linear and integer linear programming

- open questions regarding the bin packing problem

The university supports the employment of handicapped people. Hence,
handicapped applicants will be employed preferentially if they are
suitably qualified.

Prof. Dr. Klaus Jansen

Institut fuer Informatik

Technische Fakultaet der

Christian-Albrechts-Universitaet zu Kiel

Christian-Albrechts-Platz 4 (Hochhaus, 10. Etage)

24118 Kiel

Germany

[DMANET] IEEE MASS 2010: Call for Participation and Important Dates for Demos CFP

[We apologize in advance if you receive multiple copies of this message]

==========================================================================
CALL FOR PARTICIPATION

IEEE MASS 2010
7th IEEE International Conference on Mobile Ad-hoc
and Sensor Systems
https://mass2010.soe.ucsc.edu/

November 8-12, 2010 - San Francisco, CA, USA

Co-sponsored by the IEEE Computer Society Technical Commitee on
Distributed Processing and IEEE Computer Society Technical Commitee on
Simulation

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

CONFERENCE SITE:
----------------
The 7th IEEE International Conference on Mobile Ad-hoc and Sensor
Systems (IEEE MASS 2010) will be held in San Francisco, California, USA.

SCOPE:
------
Wireless ad-hoc communication has applications in a variety of
environments, such as conferences, hospitals, battlefields and
disaster-recovery/rescue operations, and is also being actively
investigated as an alternative paradigm for Internet connectivity in
both urban and rural areas. Wireless sensor and actuator networks are
also being deployed for enhancing industrial control processes and
supply-chains, and for various forms of environmental monitoring. The
IEEE MASS 2010 aims at addressing advances in research on multi-hop
ad-hoc and sensor networks, covering topics ranging from technology
issues to applications and test-bed development. Please keep checking
the IEEE MASS 2010 web-space for more information and regular updates.

REGISTRATION:
-------------
Registration to IEEE MASS is now available at the conference website.
Early registration ends on September 3rd.

WORKSHOPS:
----------
- The Third Workshop on Mobile Entity Localization and Tracking (MELT)
- The Second Workshop on SCEnarios for Network Evaluation Studies (SCENES)
- The Sixth Workshop on Wireless and Sensor Network Security (WSNS)
- The Fourth Workshop on Enabling Technologies and Standards for
Wireless Mesh Networking (MESHTECH)
- The First BioSense Workshop: Networking and Environmental Sensing meet
Epidemiology and Biology
- The Second International Workshop on Intelligent Vehicular Networks
(InVeNet)

CFP DEMOS – IMPORTANT DATES:
----------------------------
Abstract submission deadline: 30 July 2010
Acceptance notification: 27 August 2010
Camera-ready submission: 10 September 2010
IEEE MASS 2010: 8-12 November 2010

ORGANIZATION COMMITTEE:
-----------------------

GENERAL CO-CHAIRS
Mario Gerla, University of California, Los Angeles
Katia Obraczka, University of California, Santa Cruz

PROGRAM CO-CHAIRS
Guohong Cao, Pennsylvania State University
Prasant Mohapatra, University of California, Davis

TPC SUB-AREA CHAIRS
- Protocols and Cross-Layer Technologies
Ahmed Helmy, University of Florida

- Systems, and applications
Chenyang Lu, Washington Unviersity in St. Louis

- Algorithms and theory
Dong Xuan, Ohio State University

- Reliability, security and privacy
Radha Poovendran, University of Washington

WORKSHOP CO-CHAIRS
Cedric Westphal, DoCoMo Labs
Christine Pepin, DoCoMo Labs

DEMO CHAIR
Rajeev Koodli, Starent Networks
Marcelo Dias Amorim, LIP 6, Universite' Paris 6

WEB CHAIR
Venkatesh Rajendran, Wionics

FINANCE AND REGISTRATION CHAIR
Zhen Jiang, West Chester University

PUBLICATION CHAIR
Dajin Wang, Montclair State University

PUBLICITY CHAIR
Aline Carneiro Viana, INRIA

LOCAL ARRANGEMENTS CO-CHAIRS
Kumar Viswanath, NTT Labs
Ignacio Solis, PARC

STEERING COMMITTEE CHAIR
Dharma P. Agrawal, University of Cincinnati

CHAIR OF IEEE TC ON DISTRIBUTED PROCESSING
Jie Wu, US National Science Foundation

CHAIR OF IEEE TC ON SIMULATION
Dave Cavalcanti, Phillips Research
**********************************************************
*
* 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/
*
**********************************************************

Saturday, June 26, 2010

[DMANET] IPEC 2010 - Final Call for Papers

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

IPEC 2010 (Formerly IWPEC) Final Call for Papers

Submission deadline: July 5th, 2010

The 5th International Symposium on Parameterized and Exact
Computation, (IPEC 2010)

December 13-15, 2010, Chennai, India
http://www.imsc.res.in/ipec

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

The 5th International Symposium on Parameterized and Exact
Computation, (IPEC 2010), will be held in Chennai, India,
December 13-15, 2010. The symposium is intended to
provide a forum for researchers working in all aspects of
parameterized and exact algorithms and complexity.
In particular, studies on parameterized and exact
computations for real-world applications and algorithmic
engineering are especially encouraged.
Papers presenting original research in the areas of
parameterized and exact computations are sought.
Papers in relevant applied areas are also welcome.

Papers presenting original research in the area are sought, including
but not limited to:

* new techniques for the design and analysis of parameterized and
exact algorithms
* parameterized complexity theory
* relationship between parameterized complexity and traditional
complexity classifications
* applications of parameterized and exact computation
* implementation issues of parameterized and exact algorithms
* fixed-parameter approximation
* fast approximation in exponential time
* kernelization lower and upper bounds

Important dates:
Submission Deadline 5 July
Notification to Authors 23 August
Final Version due 10 September

Program Committee co-Chairs
Venkatesh Raman (IMSc, India)
Saket Saurabh (IMSc, India)

Organizing Committee Chair
Meena Mahajan (IMSc), chair

Venue
The conference will be held at the Institute of Mathematical Sciences,
Chennai, India.

Paper Submission

The submission should contain a scholarly exposition of ideas,
techniques, and results, including
motivation and a clear comparison with related work. The length of the
submission should not exceed
twelve pages with at least 11pt fonts and reasonable margins.
Submitted papers must describe work not
previously published. They must not be submitted simultaneously to
another conference with refereed
proceedings or to a journal. Submission will be electronic, via the
EasyChair site. Only electronic
submission (pdf) will be allowed via its easychair submission server.
Paper can be submitted at

https://www.easychair.org/account/signin.cgi?iid=19370

Publication

The symposium proceedings will be published by Springer-Verlag in
Lecture Notes in Computer Science (LNCS) series.
Submissions are limited to 12 pages

Awards

IPEC will have a Excellent Student Paper Award, starting with IPEC 2010.
Papers are eligible for the award, when all authors are students at the time
of submission, where a student is someone who has not been awarded a PhD.
To indicate that a submission is eligible, please add the phrase
"Eligible for best student paper"
as the last sentence in the "Abstract" field in the web form on the
submission server as well as
in the paper.

https://www.easychair.org/account/signin.cgi?iid=19370

Saket and Venkatesh
Program Committee co-Chairs

Contact: saket@imsc.res.in, vraman@imsc.res.in
**********************************************************
*
* 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/
*
**********************************************************

----------------------------------------------------------------
This message was sent using IMP, the Internet Messaging Program.

Friday, June 25, 2010

[DMANET] ORAHS 2010 Conference, 18-23 July 2010: news from the organizers

*** sorry for multiple posting ***

We are pleased to announce that the scientific program is now available
online:
http://www.diem.unige.it/orahs2010/docs/ORAHS2010-SessionSchedule.pdf

The program is rich and various and it is composed of 105 talks, 1 plenary
and two simposia. We would like to remark 3 high points of our scientific
program.

The conference will be open by the plenary of Gino Gumirato, currently
Direttore Amministrativo ASL Roma and Consultant of the Office of Management
and Budget, Executive Office of the President USA: Gumirato will give us
some insights about the US Healthcare Reform.

On Tuesday, there will be the symposium "Inside the healthcare in Italy" at
Gaslini Hospital in Genova: the symposium is proposed as a way to exchange
and to share opinions and experiences concerning the modelling and the
delivery of care for younger people.

On Wednesday, a second symposium will be held at the School of Economics.
The topics is "Modelling the care of older people" from a patient-centered
perspective.

Moreover, following a tradition lasting for more than thirty years, a very
rich and attractive social program is available especially for the
accompanying persons as depicted here:
http://www.diem.unige.it/orahs2010/docs/social_program_at_glance.pdf

The 36th ORAHS (Operational Research Applied to Health Services) conference
will take place in Genova, Italy, between July 18 and July 23. The
conference venue is the School of Economics, University of Genova.

All information are available on line at http://orahs2010.diem.unige.it

ORAHS 2010 Organizing Commitee: Angela, Elena, Enrico, Giuliana,
Roberto and Franco

*** Join to ORAHS 2010: http://orahs2010.diem.unige.it ***

Dr Roberto Aringhieri, Ph.D. - Assistant Professor
Dipartimento di Informatica, UniversitE0 degli Studi di Torino
Corso Svizzera 185, I-10149 Torino, Italy
Office: +39 011 6706755 - Mobile: +39 331 1239026
WWW: http://www.di.unito.it/~aringhie
LinkedIn: http://www.linkedin.com/in/robertoaringhieri
Facebook: http://www.facebook.com/roberto.aringhieri
**********************************************************
*
* 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] PCCR 2010 Call for Participation

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

CALL FOR PARTICIPATION

PCCR 2010

Parameterized Complexity of Computational Reasoning

Satellite Workshop of MFCS & CSL
Brno, Czech Republic, 28 August 2010

http://www.kr.tuwien.ac.at/drm/pccr2010

This workshop aims to support a fruitful exchange of ideas between the
research on parameterized complexity on one side and the research on various
forms of computational reasoning (such as nonmonotonic, probabilistic, and
constraint-based reasoning) on the other. The workshop will feature invited
and contributed talks and presentations of surveys and new technical results.
Apart from talks on parameterized complexity we are also interested in
presentations that highlight structural parameters that have not been studied
within the framework of parameterized complexity so far.

For proposing to give a presentation please contact the workshop chair.

Confirmed invited speakers are:

* Mike Fellows, Charles Darwin University
* Nicola Galesi, Sapienza University of Rome
* Gregory Gutin, University of London
* Petr Hlineny, Masaryk University Brno
* Reinhard Pichler, Vienna University of Technology

The workshop is organized by Igor Razgon, Marko Samer, Stefan Szeider (chair),
and Stefan Woltran.

For information on how to register and local information please consult the
MFCS-CSL 2010 web-site http://mfcsl2010.fi.muni.cz/

==============================================================================
**********************************************************
*
* 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, June 24, 2010

PhD funding in Algorithmic Network Theory, Imperial College London

Dear

I would be grateful if you could advertise the position below in both turing-jobs and math-jobs.

Many thanks

Moez

Studentship+fees to study for a PhD in Algorithmic Network Theory at Imperial College London

I am actively looking for an excellent PhD candidate to work with me on problems at the frontier
between graph theory, game theory and statistical physics, in particular

- Random graph theory and stochastic processes (random walks, percolation, games) on graphs
- Analysis of distributed Belief Propagation-type algorithms to solve combinatorial optimisation
problems (bargaining, network creation..)
- Distributed algorithms for computational problems on networks (control of epidemics, data
aggregation, dissemination of information)

The successful candidate will have a good 1st degree and ideally an MSc degree from a reputable
university in Theoretical Computer Science/Discrete Mathematics, and a strong background in
probability and stochastic processes. The funding covers stipend, and fees for EU/UK students
together with travel fund to conferences and summer schools for the duration of the PhD.

Please contact me with any questions at m.draief@imperial.ac.uk before formally applying to
Imperial College London.

[DMANET] ICNAAM - minisymposium "Graphs" - 2nd call

SECOND CALL FOR PARTICIPATION

Minisymposium GRAPHS (item 16), ICNAAM 2010 (International Conference of
Numerical Analysis and Applied Mathematics 2010), Rhodes (Greece),

19-25 September 2010.

Organizer: Vojislav Petrovic (DMI Novi Sad)

Topics:

- scores in graphs and digraphs

- Eulerian and Hamiltonian graphs and digraphs

- planar graphs

- graph factors and decompositions

- graph colorings

- extremal graphs

- graph spectra

- tournaments and hypertournaments

- graph algorithms

Please send an email to vojpet@dmi.uns.ac.rs or vojpet@gmail.com to
register.

For further information and details visit

<http://www.icnaam.org/> http://www.icnaam.org/

Vojislav Petrovic

[DMANET] PhD studentships - The LANCS Initiative

[Please circulate to all those who might be interested, and accept our
apologies if you received multiple copies of this PhD studentship
announcement]
- - - - - - - - - - - - - - - - - - - - - - - - - - -
The LANCS Initiative
Foundational Operational Research:
Building Theory for Practice

http://www.LANCS-Initiative.ac.uk/

PhD Studentships/Scholarships
(see Vacancies)

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

A considerable number of funded PhD positions will be available from
2010-2013 in four U.K. universities:

LAncaster, Nottingham, Cardiff and Southampton (LANCS).
The U.K.'s Engineering and Physical Sciences Research Council (EPSRC) has
awarded the LANCS initiative grants to a total of 5.4 million GBP to
support
the development of research capacity in Operational Research
(OR) at these four collaborating universities. This, together with
Additional support coming from the universities themselves, means that
during the period 2008-2013, a 13 million GBP investment will be made.
The principal aim of LANCS is to strengthen and grow theoretical OR in the
UK with a particular emphasis on deepening our theoretical understanding of
complex and uncertain real world problem solving environments. The
initiative focuses on the following research themes: green logistics and
transport, healthcare, discrete and nonlinear optimisation, systems to
build
systems and heuristic understanding. LANCS will also undertake an ambitious
and far reaching collaborative research programme of industrial, scientific
and public outreach to generate maximum academic, commercial and social
impact.
Full funding and fee grants that come from the participant universities
individually will be available to the students. The grants might vary
depending on the qualifications of an applicant. The required background
and
further details for each applicant will be announced with each available
position separately by the relevant university.
Please become a member of the announcement mailing list;

http://lists.cs.nott.ac.uk/mailman/listinfo/lancs-announce

to follow the available studentships and refer to the LANCS initiative
web-site for more details;

http://www.LANCS-Initiative.ac.uk/

The LANCS Initiative

[DMANET] DIALM-POMC 2010 Final Call for Papers (Deadline Extended!)

Dear all,

The submission deadline of DIALM-POMC 2010 is extended to July 3, so
as to better accommodate the DISC notification of acceptance deadline,
which is on June 28.

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

DIALM-POMC 2010 Final Call for Papers

The Sixth ACM SIGACT-SIGOPS International Workshop on
FOUNDATIONS OF MOBILE COMPUTING
(ACM SIGACT/SIGOPS approval pending)

Cambridge, Massachusetts, USA
September 16, 2010
http://dialm-pomc2010.engineering.asu.edu/

[Co-located with DISC 2010]

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

SCOPE:
Mobile computing and communications devices will have an enormous
impact on our lifestyle over the next several decades as the true
integration of personal computing, distributed computing, cellular
technologies and the Web becomes the reality. 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.

This workshop is devoted to cover contributions in both the design and
analysis of discrete and distributed algorithms and the system modeling
in the context of mobile, wireless, ad-hoc, and sensor networks.
In particular, it aims at bringing together the practitioners and
theoreticians of the field and is intended to foster cooperation among
researchers in mobile computing and researchers in discrete and
distributed algorithms. DIALM-POMC 2010 will be held in September
in Cambridge, MA, USA, and will be co-located with the 24th Symposium
on Distributed Computing (DISC 2010). Previous DIALM-POMC workshops had
been co-located with the International Conference on Mobile Computing
and Networking (MOBICOM) and the International Conference on Principles
of Distributed Computing (PODC).

Technical papers describing original, previously unpublished research,
not currently under review by another conference or journal,
are solicited. Contributions are solicited in all areas related to
mobile and wireless computing and communications where discrete
algorithms and methods are utilized. Specific topics include,
but are not limited to:

- Channel assignment and management
- Energy saving methods and protocols
- Routing, multicast and broadcast
- Gossiping, information diffusion
- Scheduling
- Synchronization and discovery
- Emerging networks, including cognitive, delay-tolerant, ad hoc
and sensor networks
- Localization and location tracking, handover/handoff
- Network protocols: design, optimization, and analysis
- Local algorithms, algorithms with incomplete knowledge
- Distributed optimization algorithms
- Dynamic networks, dynamic graph algorithms
- Selfish behavior, incentives, and cooperation
- Modeling
- MAC layer protocols
- Network capacity
- Autonomous agents, mobile robot networks
- Location- and context-aware distributed systems
- Cryptography and security

SUBMISSIONS:

Authors must submit their papers electronically, following the
guidelines available on the DIALM-POMC web page. Papers for regular
presentation must be no longer than 10 pages on letter-size paper
using at least 11-point font, including figures, tables and references.
Additional details may be included in a clearly marked appendix, which
will be read at the discretion of the program committee.

PUBLICATION:
The selection of presentations will be based on peer-review by program
committee members. Papers will be included in the workshop proceedings.
Selected accepted papers will be invited for a special issue of the
Journal of Ad-Hoc Networks, Elsevier.

=======================================================================
IMPORTANT DATES:

Paper submission due (EXTENDED): July 3, 2010, 11:59pm PDT
Notification of acceptance: August 10, 2010
Workshop date: September 16, 2010

=======================================================================
CONFERENCE ORGANIZATION:

Program Committee Co-Chairs:
Thomas Moscibroda (Microsoft Research)
Andrea Richa (Arizona State University)

Program Committee
Ittai Abraham (Microsoft Research)
Matthew Andrews (Bell Labs)
Augustin Chaintreau (Thompson Research)
Alon Efrat (University of Arizona)
Sandor Fekete (TU Braunschweig)
Seth Gilbert (EPFL)
David Ilcinkas (Universite Bordeaux)
Anne-Marie Kermarrec (INRIA)
Goran Konjevod (Arizona State University)
Dariusz Kowalski (University of Liverpool)
Fabian Kuhn (University of Lugano)
Dave Levin (University of Maryland)
Christian Scheideler (Paderborn University)
Stefan Schmid (T-Labs, Berlin)
Michael Segal (Ben Gurion University)
Anil Vullikanti (Virginia Tech)
Jennifer Welch (Texas A&M)
Guoliang Xue (Arizona State University)

Publicity Chair
Jin Zhang (Arizona State University)

Steering Committee
Maurizio Bonuccelli (University of Pisa)
Errol L. Lloyd (University of Delaware)
Nancy Lynch (MIT)
Andre Schiper (EPFL)
Arunabha Sen (Arizona State University)
Nitin Vaidya (UIUC)

=======================================================================
--
Jin Zhang
PhD Student
Computer Science and Engineering
School of Computing, Informatics, and Decision Systems Engineering
http://www.public.asu.edu/~jzhang82/
Arizona State University
**********************************************************
*
* 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, June 23, 2010

from Doina Bein: PostDoc position at Penn State

The Applied Research Laboratory (ARL) at The Pennsylvania State
University is an integral part of one of the leading research
universities in the nation and serves as a University center of
excellence in Defense Science and Technologies, with a focus in naval
missions and related areas.

ARL is currently searching to fill a Postdoctoral Scholar position in
our Distributed Systems Department.

As an integral part of the Applied Research Laboratory's Information
Science and Technology Division (IS&T), the Distributed Systems
Department has a unique mix of capabilities. It contains engineers
with decades of practical experience, Ph.D.s with theoretical
backgrounds and many students with fresh perspectives and enthusiasm.
Although our domain is deeply rooted in the domains of computer
science, telecommunications and electrical engineering, current
partners of the Department include academics in the areas of compiler
design, power engineering, biology and industrial engineering.

You will conduct cutting edge research in the area of sensor networks
and autonomous systems.

Requirements include a Ph.D. in Computer Science, Information Systems,
Electrical Engineering or Mathematics/Statistics. You must have
knowledge in one or more of the following areas: sensor networks;
mobile ad hoc networks; sensor data fusion; autonomous systems; and,
dynamic control. Experience in network control, information processing
and systems and computer security is highly desirable.

The initial appointment is for one year, with excellent possibility
for an additional two year renewal.

Electronically apply to Job #: E-30668, at:

arl-jobs@psu.edu

PLEASE INSERT JOB NUMBER IN SUBJECT LINE.

Applications will be accepted until position is filled.

FOR FURTHER INFORMATION about the Applied Research Laboratory or
current position vacancies, visit our website, at:

http://www.arl.psu.edu

Resumes accepted until position is filled.

The Pennsylvania State University/Applied Research Laboratory offers
an exceptional benefits package.

EEO/AA Policy:

Penn State is committed to affirmative action, equal opportunity and
the diversity of its workforce.

PLEASE NOTE: YOU MUST BE A U.S. CITIZEN TO APPLY.

POSTDOCTORAL POSITION in ALGORITHMS AND COMPLEXITY (ALGORITHMIC GAME THEORY), UNIV. of LIVERPOOL, UK

DEPARTMENT of COMPUTER SCIENCE, The UNIVERSITY of LIVERPOOL, UK

POSTDOCTORAL RESEARCH FELLOW in ALGORITHMS AND COMPLEXITY (ALGORITHMIC
GAME THEORY)

A researcher is required to participate in the EPSRC-funded Research
Project "Algorithmic Mechanism Design and Optimization Problems with
Economic Applications". The research will be undertaken within the
Economics and Computation Research Group in the Department of
Computer Science at the University of Liverpool (UK), under the
supervision of Dr Piotr Krysta. The aim of the project is to apply
algorithmic and computational complexity tools to game theoretic problems
motivated by concrete applications in electronic commerce and networks.
In particular approximation algorithms techniques will be used. The
project may involve collaboration with other staff members in the
Department of Computer Science at the University of Liverpool.

The successful candidate will have a PhD in the area of Algorithms and
Complexity Theory. Knowledge and/or a PhD in the area of Algorithmic Game
Theory will be highly appreciated.

The post is available for 20 months, commencing August 2010, or as soon as
possible thereafter, by negotiation; a further extension may be possible.
The starting salary is GBP 30,747 - 31,671 pa.

Informal enquiries may be sent to:

Dr Piotr Krysta (mailto: P.Krysta@liverpool.ac.uk).

http://www.csc.liv.ac.uk/~piotr

Further particulars and details of the application procedure can be found
at:

http://www.liv.ac.uk/working/job_vacancies/research/

** CLOSING DATE FOR APPLICATIONS: 23 July 2010

-----
Dr. Piotr Krysta
University of Liverpool
Department of Computer Science
Ashton Building, Ashton Street
Liverpool L69 3BX, U.K.
http://www.csc.liv.ac.uk/~piotr

[DMANET] POSTDOCTORAL RESEARCH FELLOW in ALGORITHMS AND COMPLEXITY (ALGORITHMIC GAME THEORY), UNIV. of LIVERPOOL, UK

DEPARTMENT of COMPUTER SCIENCE, The UNIVERSITY of LIVERPOOL, UK

POSTDOCTORAL RESEARCH FELLOW in ALGORITHMS AND COMPLEXITY
(ALGORITHMIC GAME THEORY)

A researcher is required to participate in the EPSRC-funded Research Project
'Algorithmic Mechanism Design and Optimization Problems with Economic
Applications'.
The research will be undertaken within the Economics and Computation
Research Group in the Department of Computer Science at the University of
Liverpool (UK), under the supervision of Dr Piotr Krysta.
The aim of the project is to apply algorithmic and computational complexity
tools to game theoretic problems motivated by concrete applications in
electronic commerce and networks.
In particular approximation algorithms techniques will be used. The project
may involve collaboration with other staff members in the Department of
Computer Science at the University of Liverpool.

The successful candidate will have a PhD in the area of Algorithms and
Complexity Theory.
Knowledge and/or a PhD in the area of Algorithmic Game Theory will be
highly appreciated.

The post is available for 20 months, commencing August 2010, or as soon as
possible thereafter, by negotiation; a further extension may be possible.
The starting salary is GBP 30,747 - 31,671 pa.

Informal enquiries may be sent to:

Dr Piotr Krysta (mailto: P.Krysta@liverpool.ac.uk).

http://www.csc.liv.ac.uk/~piotr

Further particulars and details of the application procedure can be found
at:

http://www.liv.ac.uk/working/job_vacancies/research/

** CLOSING DATE FOR APPLICATIONS: 23 July 2010

-----
Dr. Piotr Krysta
University of Liverpool
Department of Computer Science
Ashton Building, Ashton Street
Liverpool L69 3BX, U.K.
http://www.csc.liv.ac.uk/~piotr
**********************************************************
*
* 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, June 22, 2010

Call for Participation: ESSLLI 2010

CALL FOR PARTICIPATION
**********************************

ESSLLI 2010 / UNIVERSITY OF COPENHAGEN / DENMARK / AUGUST 9-20, 2010

http://esslli2010cph.info/

The European Summer School in Logic, Language and Information (ESSLLI)
is organized every year by the Association for Logic, Language and
Information (FoLLI) in different sites around Europe. The main focus
of ESSLLI is on the interface between linguistics, logic and
computation. ESSLLI offers foundational, introductory and advanced
courses, as well as workshops, covering a wide variety of topics
within the three areas of interest: Language and Computation, Language
and Logic, and Logic and Computation.

Previous summer schools have been highly successful, attracting up to
500 students from Europe and elsewhere. The school has developed into
an important meeting place and forum for discussion for students and
researchers interested in the interdisciplinary study of Logic,
Language and Information. During two weeks,46 foundational, introductory
and advanced courses + 6 workshops headed by some of the most
prominent scholars in the fields are offered to the attendants, each of 1.5
hours per day during a five days week, with up to seven parallel sessions.
ESSLLI also includes a student session (papers and posters by students only,
1.5 hour per day during the two weeks) and four evening lectures by
senior scientists in the covered areas.

In 2010, the venue for ESSLLI will be The University of Copenhagen,
Denmark. Chair of the Program Committee is Valentin Goranko (The
Technical University of Denmark), and Chair of the Organizing
Committee is Vincent F. Hendricks (The University of Copenhagen).

The registration for ESSLLI 2010 is open, see
http://esslli2010cph.info/?page_id=40

* Student: 350€.
* Regular: 480€

Different accommodation packages are available, from 21€/night to
46€/night. All packages are currently available, but availability
cannot be guaranteed. The rooms suggested are at
Danhostel Copenhagen City, a mere 10 minute walk from the main venue.

For more information and links to registration and accommodation
pages, please visit the ESSLLI 2010 website:
http://esslli2010cph.info/

Best regards,
Rasmus K. Rendsvig,
ESSLLI 2010 Organization Committee

Faculty Early Career Development (CAREER) Program

Full Proposal Deadline Date: July 22, 2010
Program Guidelines: NSF 08-557

CAREER: The Faculty Early Career Development (CAREER) Program is a Foundation-wide activity that offers the National Science Foundation's most prestigious awards in support of junior faculty who exemplify the role of teacher-scholars through outstanding research, excellent education and the integration of education and research within the context of the mission of their organizations. Such activities should build a firm foundation for a lifetime of leadership in integrating ...
More at http://www.nsf.gov/funding/pgm_summ.jsp?pims_id=503214&WT.mc_id=USNSF_41

Monday, June 21, 2010

FLoC 2010: Final Call for Participation

2010 FEDERATED LOGIC CONFERENCE (FLoC'10)

Edinburgh, Scotland, U.K.
July 9-21, 2010
http://www.floc-conference.org

DEADLINES (all deadlines are firm):
* standard registration deadline: 30 JUNE 2010.

* The fifth Federated Logic Conference (FLoC'10)
will be held in Edinburgh, Scotland, U.K. (www.edinburgh.org),
in July 2010, at the School of Informatics at the University
of Edinburgh (www.inf.ed.ac.uk).

* FLoC'10 promises to be the premier scientific meeting in
computational logic in 2010.
The following conferences will participate in FLoC:

- CAV 2010: Int'l Conference on Computer-Aided Verification
- CSF 2010: IEEE Computer Security Foundations Symposium
- ICLP 2010: Int'l Conference on Logic Programming
- IJCAR 2010: Int'l Joint Conference on Automated Reasoning
- ITP 2010: Int'l Conference on Interactive Theorem Proving
- LICS 2010: IEEE Symposium on Logic in Computer Science
- RTA 2010: Int'l Conference on Rewriting Techniques and Applications
- SAT 2010: Int'l Conference on Theory and Applications of
Satisfiability Testing

The eight major conferences will be accompanied by more than
fifty workshops and a number of other affiliated events.

* Program:
The FLoC'10 program includes plenary talks by David Basin,
Georg Gottlob, David Harel, and Gordon Plotkin, as well as
keynote talks by Deepak Kapur and J Strother Moore.
Please consult the FLoC website for further information on
invited speakers and contributed talks of all the
participating conferences.

* The city of Edinburgh:
Edinburgh (http://www.ed.ac.uk/about/city/introduction), one of the
most vibrant, cosmopolitan cities in Europe, has been regularly voted
one of the most desirable places to live in the world - and the
University is at the heart of it all.
Located throughout the centre of the city, the campus plays an integral
part in the activities of Scotland's lively capital.
Set against a beautiful backdrop of stunning architecture, Edinburgh is
a welcoming, cosmopolitan city with a large and diverse student population.
The city offers an exciting array of entertainment, history, culture and
sport, with the lush Scottish countryside and coastline just a few miles
away. It is a safe and prosperous city, with an abundance of parks and
green spaces for recreation and reflection.
FLoC receptions will be held at the Edinburgh Castle (11 July) and
the National Galleries of Scotland (16 July).

* Registration:
For online registration for FLoC, please follow the link on the
FLoC website at http://floc-conference.org/registration.html
Registration is open. The deadline for early registration was 17 May.
Standard rates will apply for those who register between 18 May
and 30 June. For those who register after 30 June, late rates will apply.
Note that it is possible to register early, and then add components
(e.g., additional workshops, additional registration days, etc.) later on.

* Accomodation:
Very affordable accommodation has been booked at the University's
Pollock Halls campus, about 15-minute walk from the conference site.
Room types include single/double rooms with shared facilities/ensuite,
and standard hotel rooms in a 3-star Victorian mansion.
Alternatively, blocks of rooms have been booked at several hotels in
the cite centre. For details, see
http://floc-conference.org/accommodation.html

* Cancellation Policy:
If a participant is unable to attend FLoC because of force
majeure (e.g., volcanic ash causing flight cancellation) or because
of visa denial, their registration fee and accommodation payments
will be refunded in full, except for a GBP 50 administrative charge.

* FLoC'10 Steering Committee:
- General Chair: Moshe Y. Vardi
- Conference Co-chairs: Leonid Libkin, Gordon Plotkin
- CAV Representative: Edmund Clarke
- ICLP Representative: Manuel Hermenegildo
- IJCAR Representative: Alan Bundy
- ITP Representative: Tobias Nipkow
- LICS Representative: Martin Abadi
- RTA Representative: Juergen Giesl
- SAT Representative: Enrico Giunchiglia
- EasyChair Representative: Andrei Voronkov
----------------------
You are subscribed to the FLoC 2010 mailing list.
To unsubscribe please send an email to majordomo@informatik.uni-frankfurt.de
with the keywords unsubscribe floc2010 in the message body.

[DMANET] Postdoc position in computer science at LIMOS (France)

We apologize if you receive multiple copies of this message

Postdoc position in CS at LIMOS (UMR 6158 CNRS)

In the context of the DAG project (http://liris.cnrs.fr/dag/?q=node/20),
a 12 months position (funded by the French National Research Agency ANR,
DEFI 2009 program) is available at the LIMOS laboratory in the
"Algorithmic, Graph and Data Mining" group

(http://www.isima.fr/limos/ ).

This project explores the cross-fertilization between constraints programming, combinatorial algorithmic and databases to bring original solutions to fundamental pattern mining problems. In particular, enumeration algorithms on discrete structures such as graphs or Hypergraphs.

The project involve collaboration with other members in DAG (LIRIS and CRIL).

Applicants must have a PhD in computer sciences in one of the following
areas:

graph theory,

algorithmic,

or theoretical computer science in general.

Applications should include the following materials:

a motivation letter

a detailed CV (with publications)

two references

The position is open in September or october 2010, the funding is
available for up to 1 year. The salary is around 1900 euros net monthly
salary.

The position is located at the university Blaise Pascal,
Clermont-Ferrand (France).

Application material should be sent to Prof. Lhouari Nourine
(nourine@isima.fr <mailto:nourine@isima.fr>). The deadline for
applications is *** July 15, 2010 ***.

______________________________________________________________________
Lhouari Nourine
Universite de Clermont II
Laboratoire LIMOS
Complexe Scientifique des Cezeaux
63177 Aubiere, Cedex
France
Tel: 33-(0)4 73 40 50 43
fax: 33-(0)4 73 40 50 01
e-mail:nourine@isima.fr
web :http://www.isima.fr/nourine
_____________________________________________________________________
**********************************************************
*
* 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/
*
**********************************************************

Saturday, June 19, 2010

[DMANET] [IEEE/ACM GreenCom 2010] CFP: Deadline is Approaching!

(Apologies if you receive multiple copies of this Call for Papers)

Dear all colleagues,

You kindly invited to submit your recent works on Green Communications
and Green Computing to the 2010 IEEE/ACM International Conference on Green
Computing and Communications (GreenCom2010, http://cse.stfx.ca/~GreenCom2010/),
which (to my best memory) is the VERY first international conference that
is supported by both IEEE and ACM simultaneously with clear focus on
'Greener' research.

Best regards,

Honggang Zhang

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

The 2010 IEEE/ACM International Conference on Green Computing and
Communications (GreenCom2010)

(Sponsored by IEEE, IEEE Computer Society, IEEE TCSC and ACM)

http://cse.stfx.ca/~GreenCom2010/,

Hangzhou, China, October 30–November 1, 2010

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

IMPORTANT DATES:

Submission Deadline: June 30, 2010

Authors Notification: August 10, 2010

Final Manuscript Due: August 30, 2010

INTRODUCTION:

Computing and communication systems play key roles in modern IT
infrastructure, affecting every aspect of life, including services
related to health, banking, commerce, defense, education and entertainment.
It has been viewed that there are tremendously increasing demands for
computing, communication and storage systems since last decades. To
fulfill such requirements, modern IT infrastructures have been extended
and scaled, which brings various 'green' related issues, such as energy
consumption, heat dissemination, greenhouse emission and resource total
cost of ownership.

To make the fully efficient use of computing and communication systems
and reduce their environmental and social impact, green computing and
communication research has increasingly become a hot topic of interest
for the computer research and industry. The study of green computing and
communication attempts to alleviate this problem by delivering both high
performance and reduced power consumption, effectively maximizing total
system efficiency.

IEEE/ACM GreenCom 2010 is the next event of the series of International
Conference on Green Computing and Communications (GreenCom) after it has
been held for 5 editions as a workshop or symposium, namely PerGrid-09
(Vancouver, Canada, August 2009), PerGrid-08 (São Paulo, Brazil, July,
2008), WESAPEC-07 (Jeju Island, Korea, October, 2007), Multisec-06 (San
Diego, USA, December, 2006) and Multisec-05 (Irvine, USA, December,
2005).
It will be an exciting international forum for researchers to exchange
the information regarding advancements in the state of the art and practice
of green computing and communications, as well as to identify the emerging
research topics and define the future directions.

TOPICS OF INTEREST:

- Green computing methodologies and paradigms;

- Energy efficient design and implementation for VLSI and
microarchitecture;

- Energy efficient system level software such as compilers,
hypervisors, monitoring and profiling tools, workload managers,
and programming environments;

- Energy aware high performance computing and applications;

- Energy aware large scale distributed systems, such as Grids
and Clouds;

- Power aware, thermal aware data center design, service, and
application;

- Energy awareness in network equipment and operations;

- Energy efficient network infrastructures and protocols;

- Energy efficient network services and applications;

- Energy efficient enterprise computing and IT infrastructure;

- Performance characterization and evaluation for green computing
systems and applications;

- Experience, case studies, and lessons learned for green computing
systems and applications;

- Standards and metrics for green computing and communications;

ELECTRONIC SUBMISSION:

Prepare your paper with free styles not more than 15 pages in PDF file.
Submit your paper(s) at the GreenCom 2010 submission site:
http://cse.stfx.ca/~GreenCom2010/sub/ 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 CS Proceedings and Digital Library.

PAPER PUBLICATIONS:

Accepted papers will be published in proceedings of the GreenCom 2010
conference by IEEE Computer Society (EI indexed). Selected bested papers
will be recommended for publication in special issues of several
SCI-indexed journals.

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

General Chairs:

Wu Feng, Virginia Tech, USA

Salim Hariri, University of Arizona, USA

Honggang Zhang, Zhejiang University, China

Program Chairs:

Lizhe Wang, Indiana University, USA

Feng Xia, Dalian University of Technology, China

Mitsuhisa Sato, University of Tsukuba, Japan

Wednesday, June 30, 2010

Tuesday, June 29, 2010

Monday, June 28, 2010

Saturday, June 26, 2010

Friday, June 25, 2010

Thursday, June 24, 2010

Wednesday, June 23, 2010

Tuesday, June 22, 2010

Monday, June 21, 2010

Saturday, June 19, 2010

Mailing Lists

Subscribe To

Search This Blog

Blog Archive