Monday, November 30, 2009

[DMANET] COMPUTABILITY IN EUROPE 2010 - Second call for papers

Second call for papers

---------------------------------------------------------------------------
COMPUTABILITY IN EUROPE 2010: Programs, Proofs, Processes
Ponta Delgada (Azores), Portugal
June 30 to July 4, 2010
http://www.cie2010.uac.pt/

Deadline for submissions: 20 JANUARY 2010
---------------------------------------------------------------------------

Computability in Europe provides the largest international conference
dealing with the full spectrum of computability-related research.

CiE 2010 in the Azores is the sixth conference of the Series, held in a
geographically unique and dramatic location, Europe's most Westerly outpost.
The theme of CiE 2010 - "Programs, Proofs, Processes" - points to the usual
CiE synergy of Computer Science, Mathematics and Logic, with important
computability-theoretic connections to science and the real universe.

TUTORIALS: Jeffrey Bub (Information, Computation and Physics),
Bruno Codenotti (Computational Game Theory).

INVITED SPEAKERS: Eric Allender, Jose L. Balcazar, Shafi Goldwasser, Denis
Hirschfeldt, Seth Lloyd, Sara Negri, Toniann Pitassi, and Ronald de Wolf.

SPECIAL SESSIONS on:

Biological Computing, organizers: Paola Bonizzoni, Krishna Narayanan
Invited speakers: Giancarlo Mauri, Natasha Jonoska, Stephane Vialette,
Yasubumi Sakakibara

Computational Complexity, organizers: Luis Antunes, Alan Selman
Invited speakers: Eric Allender, Christian Glasser, John Hitchcock, Rahul
Santhanam

Computability of the Physical, organizers: Barry Cooper, Cris Calude
Invited speakers: Giuseppe Longo, Yuri Manin, Cris Moore, David Wolpert

Proof Theory and Computation, organizers: Martin Hyland, Fernando Ferreira
Invited speakers: Thorsten Altenkirch, Samuel Mimram, Paulo Oliva, Lutz
Strassburger

Reasoning and Computation from Leibniz to Boole, organizers: Benedikt Loewe,
Guglielmo Tamburrini
Confirmed speakers: Volker Peckhaus, Olga Pombo, Sara Uckelman

Web Algorithms and Computation, organizers: Martin Olsen, Thomas Erlebach
Confirmed speaker: Debora Donato

SPECIAL TRIBUTE TO MARIAN POUR-EL: Ning Zhong.

CiE serves as an interdisciplinary forum for research in all aspects of
computability and foundations of computer science, as well as the interplay
of these theoretical areas with practical issues in computer science and
with other disciplines such as biology, mathematics, philosophy, or physics.

Formal systems, attendant proofs, and the possibility of their computer
generation and manipulation (for instance, into programs) have been changing
a whole spectrum of disciplines. The conference will address not only the
more established lines of research of Computational Complexity and the
interplay between Proofs and Computation, but also novel views that rely on
physical and biological processes and models to find new ways of tackling
computations and improving their efficiency.

We particularly invite papers that build bridges between different parts of
the research community. Since women are underrepresented in mathematics and
computer science, we emphatically encourage submissions by female authors.
The Elsevier Foundation is supporting the CiE conference series in the
programme "Increasing representation of female researchers in the
computability community". This programme will allow us to fund child-care
support, a mentoring system for young female researchers, and also a small
number of grants for junior female researchers (see below).

The dates around the submission process are as follows:

Submission Deadline: 20 January 2010
Notification to Authors: 18 March 2010
Deadline for Final Version: 8 April 2010

CiE 2010 conference topics include, but not exclusively:

* Admissible sets
* Analog computation
* Artificial intelligence
* Automata theory
* Classical computability and degree structures
* Computability theoretic aspects of programs
* Computable analysis and real computation
* Computable structures and models
* Computational and proof complexity
* Computational complexity
* Computational learning and complexity
* Concurrency and distributed computation
* Constructive mathematics
* Cryptographic complexity
* Decidability of theories
* Derandomization
* Domain theory and computability
* Dynamical systems and computational models
* Effective descriptive set theory
* Finite model theory
* Formal aspects of program analysis
* Formal methods
* Foundations of computer science
* Games
* Generalized recursion theory
* History of Computing
* Hybrid systems
* Higher type computability
* Hypercomputational models
* Infinite time Turing machines
* Kolmogorov complexity
* Lambda and combinatory calculi
* L-systems and membrane computation
* Mathematical models of emergence
* Molecular computation
* Natural computing
* Neural nets and connectionist models
* Philosophy of science and computation
* Physics and computability
* Probabilistic systems
* Process algebra
* Programming language semantics
* Proof mining
* Proof theory and computability
* Quantum computing and complexity
* Randomness
* Reducibilities and relative computation
* Relativistic computation
* Reverse mathematics
* Swarm intelligence
* Type systems and type theory
* Uncertain reasoning
* Weak arithmetics and applications

Contributed papers will be selected from submissions received by the
PROGRAMME COMMITTEE consisting of:

Klaus Ambos-Spies (Heidelberg), Luis Antunes (Porto), Arnold Beckmann
(Swansea), Paola Bonizzoni (Milano), Alessandra Carbone (Paris), Steve Cook
(Toronto ON), Barry Cooper (Leeds), Erzsebet Csuhaj-Varju (Budapest),
Fernando Ferreira (Lisbon, co-chair), Nicola Galesi (Rome), Luis Mendes
Gomes (Ponta Delgada), Rosalie Iemhoff (Utrecht), Achim Jung (Birmingham),
Michael Kaminski (Haifa), Jarkko Kari (Turku), Viv Kendon (Leeds), James
Ladyman (Bristol), Kamal Lodaya (Chennai), Giuseppe Longo (Paris), Benedikt
Loewe (Amsterdam), Elvira Mayordomo (Zaragoza, co-chair), Wolfgang Merkle
(Heidelberg), Russell Miller (New York NY), Dag Normann (Oslo), Isabel
Oitavem (Lisbon), Joao Rasga (Lisbon), Nicole Schweikardt (Frankfurt), Alan
Selman (Buffalo NY), Peter van Emde Boas (Amsterdam), Albert Visser
(Utrecht)

The Programme Committee cordially invites all researchers in the area of the
conference to submit their papers (in PDF-format, at most 10 pages) for
presentation at CiE 2010.

The best of the accepted papers will be published in the conference
proceedings within the Lecture Notes in Computer Science (LNCS) series of
Springer, which will be available at the conference. Authors of accepted
papers are expected to present their work at the conference. Submitted
papers must describe work not previously published, and they must neither be
accepted nor under review at a journal or at another conference with
refereed proceedings.

All papers need to be prepared in LNCS-style LaTeX. Papers must not exceed
10 pages. Full proofs may appear in a technical appendix which will be read
at the reviewers' discretion. Submissions authored or co-authored by members
of the Programme Committee are not allowed.

Papers that have only student authors are eligible for the "CiE 2010 Best
Student Paper Award." If your submission satisfies the requirements, please
submit your paper in the category "Regular paper (eligible for Best Student
Paper Award)." The Programme Committee will select the best submission among
these after acceptance. The recipient of the Best Student Paper Award will
get a fee waiver of the registration fee, a certificate, and a small
symbolic cash prize.

Funded by the Elsevier Foundation's programme 'Women in Computability'
we shall offer five travel grants (covering registration fee and up to 300
EUR in reimbursement for travel and accomodation expenses) for junior
female researchers. More information will become available in March 2010.

Funded by the Elsevier journal Annals of Pure and Applied Logic (APAL),
the organizers are offering a number of travel grants (including fee
waivers and a modest reimbursement of travel and accommodation expenses)
for students to attend CiE 2010. Student authors of accepted papers will
have priority for these grants.

The Association for Symbolic Logic (ASL) sponsors modest student member
travel grants. See http://www.aslonline.org/studenttravelawards.html

New funding opportunities are expected to be offered. For more details
concerning funding and up to date information, please consult regularly the
web page of the conference http://www.cie2010.uac.pt/

__________________________________________________________________________
ASSOCIATION COMPUTABILITY IN EUROPE http://www.computability.org.uk
CiE Conference Series http://www.illc.uva.nl/CiE
CiE 2010 http://www.cie2010.uac.pt/
CiE Membership Application Form http://www.cs.swan.ac.uk/acie
__________________________________________________________________________


**********************************************************
*
* 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] Int'l Symp. on Artificial Intelligence and Mathematics (Jan 6-8, 2010, Ft. Lauderdale)

Apologies for multiple postings

ISAIM 2010
Conference Announcement

Call-for-Participation

11th International Symposium on
Artificial Intelligence and Mathematics

January 6-8, 2010
Ft. Lauderdale, Florida

http://gauss.ececs.uc.edu/Conferences/isaim2010
(periodically updated)

John Franco and Raj Bhatnagar, Program Co-chairs
Fred Hoffman, Symposium Chair
Martin Golumbic, General Chair

The International Symposium on Artificial Intelligence and Mathematics
(ISAIM) is a biennial meeting that fosters interactions between
mathematics, theoretical computer science, and artificial
intelligence. This is the eleventh Symposium in the series, which is
sponsored by the Annals of Mathematics and Artificial Intelligence.
Traditionally, the Symposium attracts participants from a variety of
disciplines, thereby providing a unique forum for scientific exchange.
This exchange is assisted by carefully selected and numerous special
sessions and invited speakers.

Each symposium has had a special focus. Focus topics have included
monotonic and non-monotonic logic, data mining, satisfiability,
constraint programming, knowledge representation, rewriting logic,
probabilistic logic, category theory, neural nets, and many others.
This year there will be many talks on Boolean and pseudo-Boolean
functions and related areas such as theorem provers in industrial
applications.

The Symposium spans three days and is in sunny and warm Ft. Lauderdale
at a time when many of us need a break.


KEYNOTE SPEAKERS

* Larry Manevitz (University of Haifa, Israel)
* Warren Hunt (University of Texas, Austin, USA)
* Georg Gottlob, (Oxford University, UK)

Details on keynote speakers:
http://gauss.ececs.uc.edu/Conferences/isaim2010/keynotes.html


SPECIAL TOPIC INVITED SESSIONS

* Constraint Programming and Hybrid Methods - John Hooker
* Boolean and Pseudo-Boolean Functions - Endre Boros and Yves Crama
* Data Clustering for Bio-Informatics (tentative) - Raj Bhatnagar

Details on special sessions:
http://gauss.ececs.uc.edu/Conferences/isaim2010/sessions.html


IMPORTANT DATES

Early Registration Ends: December 21, 2009
Conference Hotel Low Rates: December 2, 2009
Program finalized: 2nd week in December


Send inquiries and requests: isaim2010@gauss.ececs.uc.edu.

_______________________________________________
isaim2008 mailing list
isaim2008@lists.stanford.edu
https://mailman.stanford.edu/mailman/listinfo/isaim2008
**********************************************************
*
* 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, November 29, 2009

[DMANET] Ph.D. Position in Algorithms/Computational Geometry at University of Lugano, Switzerland

Ph.D. Position in Algorithms, Comp. Geometry at University of Lugano,
Switzerland


At the Faculty of Informatics, University of Lugano, Switzerland,
http://www.inf.usi.ch/, there is an opening for a PhD student in
Computer Science in the area of Algorithms and Computational Geometry
under a project entitled: Generalized Voronoi diagrams of polygonal
objects: algorithms and applications. The project is funded by the
Swiss National Science Foundation for a time period of three years.

This project will investigate open problems on generalized Voronoi
diagrams of polygonal objects as motivated by concrete applications.
Voronoi diagrams are among the most fundamental structures in
Computational Geometry and they have proved to be powerful tools in
solving diverse and seemingly unrelated computational problems. Research
will combine combinatorial analysis, the design and analysis of
efficient algorithms, as well as implementation and application issues.
The problems under investigation have been motivated by applications in
VLSI Computer-Aided Design but they are fundamental structures of
independent interest.

Applicants should have a Masters degree in Computer Science (or
equivalent) and an affinity with algorithms, preferably geometric
algorithms. Some experience in implementation and experimentation is
expected. Candidates with a strong background in the design and analysis
of algorithms will be preferred. Fluency in English is required.

For further information please contact Professor Evanthia Papadopoulou,
e-mail: evanthia.papadopoulou@usi.ch, phone. +41(0)58 666 4122,
http://www.inf.unisi.ch/faculty/papadopoulou/. Interested candidates
should apply as soon as possible (deadline is Dec. 15). The application
procedure is described in

http://www.inf.usi.ch/presentazionetudiare/container_education_phd/dottorato_regolamenti.htm

Annual Ph.D. salary is CHF 39'600 for the 1st year, growing to CHF
45'600 for the 3rd and 4th year.

**********************************************************
*
* 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, November 27, 2009

[DMANET] Open Scientific Position -- TU Berlin

On behalf of Dr. Roland Wessäly:

please find below the announcement of an open
position at TU Berlin in the project "Optimization
models and methods for telecommunication network
design with varying and uncertain demands".

I would be very happy, if you could pass this
announcement to potential candidates.

All the best,
Roland Wessäly


Position:
---------
Research Assistant - Vgr. IIa BAT
Faculty II - Inst. of Mathematics/ DFG-Research Center MATHEON
"Mathematics for key technologies"

Reference number:
---------
FO-220 (initially to be filled for 36 months/ Closing date for
applications 10.12.2009)

Working field:
---------
Scientific work in the DFG-project "Optimization models and methods for
telecommunication network design with varying and uncertain demands".
This is an international Polish-German project which is executed in
cooperation with the Warsaw University of Technology. The project aims
at developing mixed-integer programming models as well as primal and
dual methods to solve the problems of practical relevance. Eventually,
it should be possible to compute cost-effective networks with provable
high quality for varying demand scenarios; possibilities for promotion

Requirements:
---------
As a successful candidate you should hold a Master's / Diploma degree in
mathematics, computer science, or a related discipline; interest in new
challenges and cooperative team-work; ability to work self-contained and
target-oriented; desired: background in discrete and algorithmic
mathematics (combinatorics, network algorithms),
experience with modeling and solving LP/MIP, software implementation
skills using Java or C/C++, basic telecommunications know-how; for more
information please contact Dr. Roland Wessäly, (Tel.: 030 84185245,
E-Mail: wessaely@zib.de)

Please send your written application with the job reference number, with
the appropriate documentation to Konrad-Zuse-Zentrum für
Informationstechnik Berlin, Verwaltung, Takustr. 7, 14195 Berlin-Dahlem.
To ensure equal opportunity between men and women, applications from
women with the respective qualifications are explicitly desired.
Handicapped applicants with the same qualifications are preferred.
Please send only copies and not originals of documents, as they will not
be returned by mail. The vacancy is also available in the internet at
http://www.personalabteilung.tu-berlin.de/menue/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] Professor Position at ETH Zurich

ETH Zurich, Switzerland, is looking for a new professor in

Mathematical Methods in Information and Communication Technology

This is a broad call, also well suited for "DMANET people" with some
application background. In my (biased) opinion ETH Zurich is a great place,
so I encourage you to apply. Here are the details:

http://www.facultyaffairs.ethz.ch/facultypositions/profinformationstech_EN

Best regards,

Roger Wattenhofer

**********************************************************
*
* 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] CSR 2010: deadline is approaching

Dear Colleagues,

The submission deadline for CSR-2010 is fast approaching (December 7)!

Please find below the 2nd version of the CfP,
and note the updated Program Committee list.

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

Second Call for Papers

5th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM IN RUSSIA (CSR 2010)

June 16-20, 2010, Kazan, Russia

http://csr2010.antat.ru/

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

CSR 2010 intends to reflect the broad scope of international cooperation in
computer science. It is the 5th conference in a series of regular events
started with CSR 2006 in St. Petersburg (see LNCS 3967), CSR 2007 in
Ekaterinburg (see LNCS 4649), CSR 2008 in Moscow (see LNCS 5010), and
CSR 2009 in Novosibirsk (see LNCS 5675).

IMPORTANT DATES:

Deadline for submissions: December 7, 2009
Notification of acceptance: January 31, 2010
Conference dates: June 16-20, 2010

As has become tradition, there will be YANDEX AWARDs
for the best paper and for the best student paper!

TOPICS

* algorithms and data structures
* combinatorial optimization
* constraint solving
* complexity and cryptography
* formal languages and automata
* computational models and concepts
* algorithms for concurrent and distributed systems, networks
* proof theory and applications of logic to computer science
* model checking
* automated reasoning
* deductive methods

OPENING LECTURE:

Alexander Razborov (University of Chicago and Steklov Mathematical Institute)

PROGRAM COMMITTEE:

Ernst W. Mayr (TU München, Germany; Chair)
Sergei N. Artemov (City University of New York, USA)
Lev Beklemishev (M.V. Lomonossov Moscow State University, Russia)
Michael Ben-Or (Hebrew University, Israel)
Harry Buhrman (University of Amsterdam, Netherlands)
Edith Cohen (AT&T Research, USA)
Samir Datta (Chennai Mathematical Institute, India)
Andrew V. Goldberg (Microsoft Research, USA)
Dima Grigoriev (Université de Lille, France)
Martin Hofmann (LMU München, Germany)
Stasys Jukna (Universität Frankfurt, Germany)
Yuri Matiyasevich (Steklov Inst. of Math., St. Petersburg, Russia)
Peter Bro Miltersen (Aarhus University, Denmark)
Georg Moser (University of Innsbruck, Austria)
Madhavan Mukund (Chennai Mathematical Institute, India)
Harald Räcke (University of Warwick, United Kingdom)
Uwe Schöning (Universität Ulm, Germany)
Jeffrey Shallit (University of Waterloo, Canada)
Alexander Shen (LIF, Marseille, France)
Alberto Marchetti Spaccamela (Università di Roma "La Sapienza", Italy)
Michael Tautschnig (TU Darmstadt, Germany)
Pascal Tesson (Université Laval, Canada)
Berthold Vöcking (RWTH Aachen, Germany)
Sergey Yekhanin (Microsoft Research, USA)
Alexander Zelikovsky (Georgia State University, USA)

INVITED SPEAKERS:

(coming soon!)

ORGANIZERS:

Institute of Informatics, Tatar Academy of Sciences, and Kazan State University

CONFERENCE CHAIR:

Farid Ablayev (Kazan State University)

SUBMISSIONS:

Authors are invited to submit an extended abstract or a full paper of at most
12 pages in the LNCS format (LaTeX, as pdf; final version with source);
instructions are here:
http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0
Proofs and other material omitted due to space constraints are to be put into
a clearly marked appendix to be read at discretion of the referees. Papers
must present original (and not previously published) research. Simultaneous
submission to journals or to other conferences with published proceedings is
not allowed. The proceedings of the symposium will be published in Springer's
LNCS series.

Selected papers from the conference will be reviewed for and published in a
special issue of Theory of Computing Systems (Springer-Verlag).

Submissions should be uploaded to the EasyChair Conference system:
https://www.easychair.org/login.cgi?conf=csr2010


FURTHER INFORMATION AND CONTACTS:

Web: http://csr2010.antat.ru/
Email: csr2010.kazan@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/
*
**********************************************************

Thursday, November 26, 2009

[DMANET] Research professor position in Business Research Methodologies at University of Antwerp, Faculty of Applied Economics

Dear colleague

The Faculty of Applied Economics of the University of Antwerp has a vacancy
for a *research professor* tenure track (ZAP BOF). This is a full time
position with a very light teaching load (max. 30 hours per semester) and is
therefore an excellent opportunity for candidates with a strong research
profile.

The position is open for applicants who obtained their PhD after 1 October
2003. Since one of the possible domains in which the position will be
awarded is "*Business Research Methodologies*", which includes *Operations
Research*, we would like to ask you to distribute this email within your
department or research group or to any other potential candidates.

The *deadline for application is 21 December 2009*. More information on the
position can be found here:

In English:
http://www.ua.ac.be/main.aspx?c=*VACATURES&n=26392&ct=025732&e=2141
In Dutch:
http://www.ua.ac.be/main.aspx?c=*VACATURES&n=80931&ct=74698&e=21410=7

Best Regards
--Kenneth Sörensen

--
Prof. dr. Kenneth Sörensen
University of Antwerp
Faculty of Applied Economics

Prinsstraat 13, B-2000 Antwerp, Belgium
tel: +32 3 265 40 48
fax: +32 3 265 49 01

kenneth.sorensen@ua.ac.be
http://www.ua.ac.be/kenneth.sorensen
**********************************************************
*
* 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] Two Postdoc Positions in Computer Science at TU Vienna

Within the ERC-funded project "The Parameterized Complexity of Reasoning
Problems" lead by Prof. Stefan Szeider applications are invited for two
postdoctoral positions in computer science. The aim of the project is to
study computational reasoning problems in the framework of parameterized
complexity theory. The positions are for the duration of two years with
the possibility to extend. The earliest starting date is January 2010.

The candidates should have a PhD degree in Computer Science or related
area; research experience at postdoctoral level is of advantage.
Successful candidates will have excellent knowledge in some of the
following areas:

* algorithm design and analysis
* computational complexity
* satisfiability and constraints
* nonmonotonic reasoning
* probabilistic reasoning
* discrete optimization
* implementation and testing of algorithms

The review of applicants will begin immediately and continue until the
positions are filled. Applications received by 19 December 2009 will
receive full consideration.

Further details on the requirements and information on how to apply can
be found at http://www.kr.tuwien.ac.at/drm/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] Last reminder: TRISTAN VII deadline

Dear Colleague,

I apologize for multiple postings.

This is the last reminder about the deadline for extended abstracts for
TRISTAN VII which is November 30, 2009.
For more information, see
http://www.tristan7.org<http://www.tristan7.org/>.

Our partner VIA Travel Group & Meeting offers pre and post conference trips
(Coastal Express, Spitsbergen/Svalbard).
You may also book your flights to and from Tromsø with VIA.
Please see the TRISTAN VII web pages
http://www.tristan7.org<http://www.tristan7.org/>.

Conference registration is expected to open mid December.

On behalf of the TRISTAN VII Organizing Committee,

Arild Hoff
**********************************************************
*
* 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] EWMINLP 2010: Call for Papers (updated deadline)

EWMINLP 2010, CIRM (Marseille) 12-16 April 2010
-----------------------------------------------
http://sites.google.com/site/ewminlp/Home

Please note: The deadline for abstracts and posters has been
changed to *December 15, 2009*.

We apologize for multiple notifications received via different lists.

The European Workshop on Mixed Integer Nonlinear Programming will
take place from April 12 to April 16, 2010, at the Centre
International de Rencontres Mathematiques, in Marseille. There
will be a single track of speakers: the list of confirmed invited
speakers appears at the end of this email.

In addition, there will be a number of contributed presentations
and some poster sessions. The important dates to be aware of are

*December 15, 2009*: Submission deadline (updated)
January 15, 2010: Acceptance notification

If you wish to contribute a presentation, please send an extended
abstract of your contribution, of 4 to 6 pages in PDF format, to
ewminlp@lif.univ-mrs.fr. All extended abstracts should be
prepared using the class file cedram-sem.cls, available for
download at
http://sites.google.com/site/ewminlp/Home/call-for-papers.
(Template files, .tex and .bib, are also provided in case they
prove helpful.) Abstracts will be used for selection purposes. As
few contributed slots are available, this may not be an easy
selection process. Abstracts not accepted for oral presentation
will be either accepted as posters or rejected.

If you wish to contribute a poster, but do not wish to be
considered for a contributed presentation, please send an
abstract of your poster, of 1-2 pages in PDF format, to ewminlp
AT lif.univ-mrs.fr. Abstracts should be prepared using the class
file cedram-sem.cls (available for download at
http://sites.google.com/site/ewminlp/Home/call-for-papers). These
abstracts will be used for selection purposes.

The selection process for both contributed presentations and
posters will be coordinated by the conference organizers (Bonami,
Liberti, Miller, Sartenaer).

As more information becomes available, it will be posted at the
conference web site:

http://sites.google.com/site/ewminlp/

Please feel free to contact us at the above email address for
additional information.

Sincerely,

The EWMINLP Program Committee

Pierre Bonami, LIFM, Marseille
Leo Liberti, LIX, Ecole Polytechnique
Andrew J. Miller, IMB, Université Bordeaux 1
Annick Sartenaer, FUNDP, Namur

-----------------------------------------------
List of confirmed invited speakers:

--Claire Adjiman, Imperial College
--Kurt M. Anstreicher University of Iowa
--Pietro Belotti, Lehigh University
--Maria Elena Bruni, D.E.I.S, Universite della Calabria
--Ignacio Grossmann, Carnegie-Mellon University
--Michal Kocvara, University of Birmingham
--Jean Bernard Lasserre, LAAS-CNRS, Toulouse
--Jon Lee, IBM T.J. Watson Research Center
--Sven Leyffer, Argonne National Laboratory
--Jeff Linderoth, University of Wisconsin-Madison
--Andrea Lodi, Universite di Bologna
--Jerome Malick, Universite de Grenoble
--Frederic Messine, ENSEEIHT-IRIT, Toulouse
--Veronica Piccialli, Universite Tor Vergata, Roma
--Renata Sotirov, Tillburg University
--Mohit Tawarmalani, Purdue University
--Philippe Toint, (FUNDP), Namur
--Tapio Westerlund, Abo Akademi University
--Andreas Waechter, IBM T.J. Watson Research Center
--Robert Weismantel Otto von Goericke Universitaet, Magdeburg
--Angelika Wiegele, Universitaet Klagenfurt

**********************************************************
*
* 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, November 25, 2009

Call for Participation - 11th ACM Conference on Electronic Commerce (EC'10)

      CALL FOR PAPERS, WORKSHOPS, AND TUTORIALS

 Eleventh ACM Conference on Electronic Commerce (EC'10)
 June 7-11, 2010, Harvard University, Massachusetts, USA
            http://www.sigecom.org/ec10/

Co-located with:
 The Ninth Workshop on the Economics of Information Security (WEIS 2010)
      June 7-8, 2010, Harvard University, Massachusetts, USA
            http://weis2010.econinfosec.org/

Since 1999 the ACM Special Interest Group on Electronic Commerce
(SIGECOM) has sponsored the leading scientific conference on advances in
theory, systems, and applications for electronic commerce. The Eleventh
ACM Conference on Electronic Commerce (EC'10) will feature invited
speakers, paper presentations, workshops, and tutorials covering all
areas of electronic commerce.

The natural focus of the conference is on computer science issues, but
the conference is interdisciplinary in nature, addressing research
related to (but not limited to) the following topics:

Applications and Empirical Studies, including

o       Consumer search and online behavior
o       Crowdsourcing and collective intelligence
o       Prediction/information markets
o       Social and economic networks
o       Experience with e-commerce systems and markets
o       Pricing for quality of service
o       Web analysis and characterization for e-commerce
o       Open access publishing
o       User contributed content
o       Economics of online textual content
o       Behavioral and experimental economics related to e-commerce

Theory and Foundations, including

o       Computational aspects of economics, game theory, finance, and
social choice
o       Algorithmic mechanism design
o       Auction and negotiation technology
o       Formation of supply chains, coalitions, and virtual enterprises
o       Agency and contract theory in e-commerce
o       Game-theoretic aspects of e-commerce and the Internet
o       Preferences and decision theory
o       Economics of information
o       Economics of networks

Architectures and Languages, including

o       Peer-to-peer, grid, and other open distributed systems
o       Mobile commerce
o       Software and systems requirements, architectures, and performance
o       Languages for describing agents, goods, services, and contracts

Automation, Personalization, and Targeting, including

o       AI and autonomous agent systems in e-commerce
o       Automated shopping, trading, and contract management
o       Recommendation, reputation, and trust systems
o       Advertising and marketing technology
o       Sponsored web search, viral marketing
o       Databases and data mining
o       Machine learning for e-commerce applications
o       Mobile and location-based services
o       Search and information retrieval for e-commerce

Security, Privacy, Encryption, and Digital Rights, including

o       Intellectual property and digital rights management
o       Digital payment systems
o       Authentication
o       Privacy-enhancing technologies
o       Economics of information security and privacy
o       Economics of intellectual property and digital rights

Social factors, including

o       Usability of e-commerce systems
o       Human factors in security and privacy
o       Human factors in agents and mechanism design for e-commerce
o       Legal, policy, and social issues
o       Impact of social networks

The conference will be held from Monday, June 7 through Friday June 11
at Harvard University, Cambridge, Massachusetts. Tutorials and Workshops
will be held on Monday June 7 and Tuesday June 8. Accepted technical
papers and invited talks will be presented from Wednesday June 9 through
Friday June 11, 2010.

PAPER SUBMISSION

The conference is soliciting full papers (as well as workshop and
tutorial proposals; see below) on all aspects of electronic commerce.
Submitted papers will be evaluated on significance, originality,
technical quality, and exposition. They should clearly establish the
research contribution, its relevance to electronic commerce, and its
relation to prior research. Submissions to be considered for publication
in the archival ACM proceedings may be up to 10 pages (including the
bibliography), in 10-point font, double-column format, with reasonable
margins and interline spacing. Additional details may be included in
appendices beyond the 10 page limit but will only be read at the
discretion of the reviewers. These submissions must not have appeared
before (or be pending to appear) in a journal or conference with
published proceedings. All accepted submissions will need to be migrated
to the publisher's format/macros for the proceedings. Instructions will
be given by the publisher after the paper is accepted. Accepted papers
will be presented at the conference in one of two formats: (1) a long
oral presentation or (2) a short oral presentation. Presentation format
will be chosen by the program committee with the goal of encouraging
breadth and diversity among presentations. Presentation format will have
no bearing on how papers appear in the archival conference proceedings:
all accepted papers will be allotted 10 pages in the proceedings.

IMPORTANT NOTICE: To accommodate the publishing traditions of different
fields, authors may instead submit working papers that are under review
or nearly ready for journal review. These submissions will be subject to
review and considered for presentation at the conference but only a one
page abstract will appear in the proceedings with a URL that points to
the full paper and that will be reliable for at least two years. Open
access is preferred although the paper can be hosted by a publisher who
takes copyright and limits access, as long as there is a link to the
location. Electronic submission is required. Details on the submission
procedure will be made available on the main conference web page.

WORKSHOP AND TUTORIAL PROPOSALS

The conference is soliciting proposals for tutorials and workshops to be
held in conjunction with the conference. Tutorial proposals should
contain the title of the tutorial, a two-page description of the topic
matter, the names and short biographies of the tutor(s), and
dates/venues where earlier versions of the tutorial were given (if any).
Workshop proposals should contain the title of the workshop, the names
and short biographies of the organizers, and the names of confirmed or
candidate participants. Workshop proposals should also include a
two-page description describing the theme, the reviewing process for
participants, the organization of the workshop, and required facilities
for the workshop. Informal suggestions for workshop or tutorial ideas
can also be sent without a full proposal to the workshop and tutorial
chairs at any time. Submission information can be found on the
conference website.

KEY DATES

o       January 11, 2010: Full electronic paper submissions due
      Upload at http://www.acm.org/sigs/sigecom/ec10/
o       January 15, 2010: Workshop and Tutorial proposals due
      Send to: ec10-workshops-chair@acm.org
<mailto:ec10-workshops-chair@acm.org> and ec10-tutorial-chair@acm.org
<mailto:ec10-tutorial-chair@acm.org>.
o       February 12, 2010: Tutorial & workshop proposal accept/reject
notifications
o       February 25, 2010: Initial Reviews Returned to authors
o       March 1, 2010: Responses from Authors Returned
o       March 11, 2010: Paper Accept/Reject Notifications
o       March 31, 2010: Camera-ready copies arrive at the publisher
o       June 7-8, 2010: Conference Workshops and Tutorials, Cambridge,
MA, USA
o       June 9-11, 2010: Conference Technical Program, Cambridge, MA, USA

ORGANIZING COMMITTEE

General Chair:  David Parkes, Harvard University

Program Chairs: Chris Dellarocas, Boston University and Moshe
Tennenholtz, Technion and Microsoft Israel R&D Center

Workshop Chair: Rahul Sami, University of Michigan

Tutorial Chair: Jason Hartline, Northwestern University

Local Arrangements Yiling Chen, Harvard University and Jennifer Wortman
Vaughan, Harvard University

Senior Program Committee:

Alessandro Acquisti     Carnegie Mellon University
Dirk Bergemann          Yale University
Yan Chen                University of Michigan
John Chuang             University of California, Berkeley
Vincent Conitzer        Duke University
Edith Elkind            Nanyang Technological University
Boi Faltings            Ecole Polytechnique Federale de Lausanne
Michal Feldman          Hebrew University
Amy Greenwald           Brown University
Bernardo Huberman       Hewlett Packard Labs
Nick Jennings           University of Southampton
Michael Kearns          University of Pennsylvania
Ron Lavi                Technion
Jeffrey MacKie-Mason    University of Michigan
Muthu Muthukrishnan     Google
David Pennock           Yahoo Research
Paul Resnick            University of Michigan
John Riedl              University of Minnesota
Michael Schwarz         Yahoo Research
Ilya Segal              Stanford University
Yoav Shoham             Stanford University
Eva Tardos              Cornell University
Alex Tuzhilin           New York University
Rakesh Vohra            Northwestern University
Makoto Yokoo            Kyushu University

FURTHER INFORMATION

More information and details are available at the conference web site:
http://www.acm.org/sigs/sigecom/ec10/

General inquiries and requests pertaining to the conference should be
sent to: ec10-general-chair@acm.org <mailto:ec10-general-chair@acm.org>

Inquiries and requests pertaining specifically to the program, and in
particular to paper submission and decision status, should be sent to:
ec10-pc-chairs@acm.org <mailto:ec10-pc-chairs@acm.org>

Inquiries and requests pertaining specifically to workshop and tutorials
should be sent to: ec10-workshops-chair@acm.org
<mailto:ec10-workshops-chair@acm.org> and ec10-tutorial-chair@acm.org
<mailto:ec10-tutorial-chair@acm.org>.


[DMANET] full professor position in Operations Research at Paris 6 university

Position type : Full professor
Domain : Operations Research
Localisation : Paris 6 university, LIP6 laboratory,
DESIR dept, OR team
Contact : Philippe.Chretienne@lip6.fr

Research profile :
The candidate must be competent and experienced in OR and be open to
emergent OR domains so that he will be able to supervise one of the
research directions of the RO team of the LIP6 laboratory. The
candidate is also expected to
develop the industrial collaborations as well as the institutional
projects of the RO team, especially for what concerns the research
domain
he will have to supervise.

Among the research directions of the RO team, the candidate should
integrate one of the following themes: scheduling, lot-sizing, network
optimization or algorithmic game theory. The optimization problems
are treated
through mathematical modelling, problem complexity analysis,
efficient algorithm design, and the development of a resolution
software. The models may be deterministic or stochastic. In the
deterministic
case, the tools are issued from Combinatorial Optimization for exact or
approximate resolution while for the stochastic case, tools are
issued fom stochastic analysis and optimal control.

For further informations on the OR team :
http://www.lip6.fr/recherche/team.php?id=320

---------------
Prof. Philippe Chrétienne
Université Pierre et Marie Curie
Laboratoire LIP6
Bureau 513
104, avenue du président Kennedy
75016 Paris, France

tél: 01 44 27 72 09
fax: 01 44 27 88 89

**********************************************************
*
* 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, November 24, 2009

[DMANET] DCFS 2010 - Preliminary Call for Papers

Dear colleagues and friends,


Enclosed you will find the

P R E L I M I N A R Y C A L L F O R P A P E R S

for

DCFS 2010 - Descriptional Complexity of Formal Systems.


The 12th International Workshop DCFS 2010 will take place
in Saskatoon, Canada.
The workshop will be jointly organized by the IFIP Working Group 1.2
on Descriptional Complexity and by the Department of Computer Science
at the University of Saskatchewan.

We hope that many of you will submit papers and will attend DCFS 2010.


With best wishes,

Ian McQuillan (University of Saskatchewan)
Giovanni Pighizzini (University of Milan)

PS: We apologize for multiple posting.

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

12th International Workshop on
Descriptional Complexity of Formal Systems (DCFS 2010)
Saskatoon, Canada, August 8-10, 2010
http://www.cs.usask.ca/dcfs2010


P R E L I M I N A R Y C A L L F O R P A P E R S


Researchers are invited to submit papers concerning the descriptional
complexity of formal systems and structures (and its applications)
for DCFS 2010.

Topics include, but are not limited to:

-- various measures of descriptional complexity of automata,
grammars, languages, and of related systems,
-- trade-offs between different formal systems and/or different
modes of operation (e.g., determinism and nondeterminism)
with respect to descriptional complexity,
-- circuit complexity of Boolean functions and related measures,
-- succinctness of description of (finite) objects,
-- descriptional complexity in resource-bounded or
structure-bounded environments,
-- structural complexity,
-- descriptional complexity of formal systems for
applications (e.g. software reliability, software and
hardware testing, modelling of natural languages),
-- descriptional complexity aspects of nature-motivated
(bio-inspired) architectures and unconventional
models of computing,
-- Kolmogorov complexity and its relation to
descriptional complexity.

In accordance with the spirit of a workshop, the program
committee will try to accept as many papers as possible,
provided that their scientific quality is high and merits
acceptance. If the number of such papers exceeds the number of
time slots for "regular" presentation, the program committee
will try to accept some papers as "short" papers.


Deadline for submissions: April 25, 2010
Notification of acceptance or rejection: June 15, 2010
Final copy for the proceedings: July 8, 2010
Workshop: August 8-10, 2010


Proceedings
------------------------------------
All invited and accepted papers will appear in the conference
proceedings, which will be available during the conference,
and will be published also in electronic form.

As in previous years, selected papers will be published in a
special journal issue.
In order to be able to publish the special issue in 2011,
a strict schedule for the preparation and for the revision
process of the papers submitted to the issue will be fixed.
The notification about acceptance/rejection of the papers
will be in the first months of 2011.


Instructions for Submissions
------------------------------------
Detailed instructions for submissions will be available on the
conference website. Simultaneous submissions to any other
conferences with published proceedings are not allowed.


Program Committee
------------------------------------

* Janusz A. (John) Brzozowski (Waterloo, ON, Canada)
* Juergen Dassow (Magdeburg, Germany)
* Michael Domaratzki (Winnipeg, MB, Canada)
* Markus Holzer (Giessen, Germany)
* Oscar H. Ibarra (Santa Barbara, CA, USA)
* Galina Jiraskova (Kosice, Slovakia)
* Chandra Kintala (Newark, USA)
* Ian McQuillan (Saskatoon, SK, Canada, co-chair)
* Andrei Paun (Madrid, Spain; Bucharest, Romania)
* Giovanni Pighizzini (Milano, Italy, co-chair)
* Jacques Sakarovitch (Paris, France)
* Kai Salomaa (Kingston, ON, Canada)
* György Vaszil (Hungarian Academy of Sciences, Budapest, Hungary)
* Sheng Yu (London, ON, Canada)


Invited Speakers
------------------------------------
* Ming Li (Waterloo, ON, Canada)
* Przemyslaw Prusinkiewicz (Calgary, AB, Canada)
* TBA


Conference Location
------------------------------------
DCFS 2010 will be held on the campus of the University of
Saskatchewan in the province of Saskatchewan, Canada.

DCFS and its predecessors DCAGRS (Descriptional Complexity of
Automata, Grammars and Related Structures) and FDSR (Formal
Descriptions and Software Reliability) were previously held in
Paderborn (1998); Magdeburg (1999); Boca Raton (1999);
London, Ontario (2000); San Jose (2000); Vienna (2001);
London, Ontario (2002); Budapest (2003); London, Ontario (2004);
Como (2005); Las Cruces, New Mexico (2006);
Novy Smokovek, High Tatras (2007), Charlottetown, Prince
Edward Island (2008) and Magdeburg (2009).

DFCS 2010 will take place immediately before
CIAA 2010, the 15th International Conference on Implementation
and Application of Automata, August 12 - 15, 2010
in Winnipeg, Manitoba, Canada
and DLT 2010, the 14th International Conference on
Developments in Language Theory, August 17 - 20, 2010,
in London, Ontario, Canada.
Thus it will be easy to attend all of DCFS, CIAA and DLT
within a two week period.


Steering Committee
------------------------------------
* Erzsebet Csuhaj-Varju (Budapest, Hungary)
* Juergen Dassow (Magdeburg, Germany)
* Helmut Juergensen (Potsdam, Germany, and London/Ontario, Canada)
* Hing Leung (Las Cruces, New Mexico)
* Chandra Kintala (Newark, USA)
* Giovanni Pighizzini (Milano, Italy, Chair)
* Detlef Wotschke (Frankfurt, Germany)

Organizing Committee
------------------------------------
* Ian McQuillan (Chair)
* Shakiba Jalal

Website and Contacts
------------------------------------
More detailed on-line information will be displayed at

http://www.cs.usask.ca/dcfs2010

Personal inquires should be sent to

dcfs2010@cs.usask.ca

or to

DCFS 2010 Organizing Committee,
c/o Ian McQuillan
Dept. of Computer Science
176 Thorvaldson Bldg.
University of Saskatchewan
110 Science Place
Saskatoon, SK S7N 5C9
Canada
**********************************************************
*
* 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, November 23, 2009

Professorship on Theory of Algorithms - Aristotle University

Department of Informatics of the Aristotle University of Thessaloniki
seeks for a new staff member at the Professor/Associate Professor level.
The desired specialization area should lie in the interface between Theory
and Mathematics (e.g. Theory of Computation, Theory of Algorithms),
with concrete connection/applications to any informatics subfield.
According to law, only Greek citizens are eligible.

The department has been founded in 1992 and currently has 29 staff members.
For information, please visit the website http://www.csd.auth.gr or email
the department head Prof. Yannis Manolopoulos at manolopo@csd.auth.gr

[DMANET] Professorship on Theory of Algorithms - Aristotle University

Department of Informatics of the Aristotle University of Thessaloniki
seeks for a new staff member at the Professor/Associate Professor level.
The desired specialization area should lie in the interface between Theory
and Mathematics (e.g. Theory of Computation, Theory of Algorithms),
with concrete connection/applications to any informatics subfield.
According to law, only Greek citizens are eligible.

The department has been founded in 1992 and currently has 29 staff members.
For information, please visit the website http://www.csd.auth.gr or email
the department head Prof. Yannis Manolopoulos at manolopo@csd.auth.gr
**********************************************************
*
* 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] Professor in Programming Languages and Systems - University of Copenhagen

The Department of Computer Science, University of Copenhagen, seeks a
professor in programming languages and systems.

>From September 2009, the Copenhagen Master of Excellence (COME)
program in Computer Science includes a competence profile in
programming languages and systems. The professor is expected to play a
central role in teaching and research activities as part of the
Algorithms and Programming Languages research group:

http://www.offentlige-stillinger.dk/sites/cfml/kbhuni/kbhuniVis.cfm?plugin=1&nJobNo=181242

Deadline: December 17, 2009.
**********************************************************
*
* 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/
*
**********************************************************

Professor in Programming Languages and Systems - University of Copenhagen

The Department of Computer Science, University of Copenhagen, seeks a
professor in programming languages and systems.

From September 2009, the Copenhagen Master of Excellence (COME)
program in Computer Science includes a competence profile in
programming languages and systems. The professor is expected to play a
central role in teaching and research activities as part of the
Algorithms and Programming Languages research group:

http://www.offentlige-stillinger.dk/sites/cfml/kbhuni/kbhuniVis.cfm?plugin=1&nJobNo=181242

Sunday, November 22, 2009

[DMANET] SAT 2010 Change of Submission Dates

SAT 2010 - 13th International Conference on
Theory and Applications of Satisfiability Testing

The submission and notification dates have been changed as follows:

Abstract Submission: February 1, 2010
Paper Submission: February 8, 2010
Author Notification: March 15, 2010
Final Version: April 5, 2010

The changes were necessary to synchronize with FLoC deadlines, we
apologize for any inconvenience caused.

Ofer Strichman
Stefan Szeider
(co-chairs of SAT 2010)

http://ie.technion.ac.il/SAT10/
http://www.floc-conference.org/
**********************************************************
*
* 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, November 21, 2009

[DMANET] Submission Extension for IEEE Workshop on Smart Grid Communications

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

Dear all colleagues,

The paper submission deadline for the First IEEE International Workshop on
Smart Grid Communications (SmartGridComm 2010), in conjunction with IEEE ICC
2010 (http://www.smartgridcomm.org/), has been extended to December 6, 2009.
Your contributions are strongly expected.

With best regards,

Honggang Zhang


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

CALL FOR PAPERS

First IEEE International Workshop on Smart Grid Communications
(SmartGridComm 2010), in conjunction with IEEE ICC 2010
http://www.smartgridcomm.org/

Important Dates:
- The Submission Deadline has been EXTENDED to December 6, 2009
- Notification of Acceptance: January 20, 2010
- Camera Ready Due: February 20, 2010
- Workshop Date: May 27, 2010

Workshop Summary

Developing smart grid has become an urgent global priority, as its immense
economic, environmental and societal benefit will be enjoyed by generations
to come. Information and communication technologies (ICT) will empower
conventional power grid to support two-way energy and information flow,
which in turn can help the world reduce dependence on fossil fuel, enable
demand response and distributed energy resources, accelerate the adoption of
clean energy technology and ultimately achieve sustainable prosperity.

Communications for smart grid is not only a noble calling but also a tall
order. To meet the challenges, we have to resort to a variety of
paradigm-shifting technologies. In addition, various international
standardization bodies have recently established new initiatives for smart
grid (e.g., IEEE P2030). At this critical junction, the First International
Workshop on Smart Grid Communications can help bring together researchers
from academia, industry and government to exchange novel ideas, explore
enabling technologies, discuss innovative designs, and share trial
experiences.

The topics of the workshop include, but are not limited to, the following
areas:

. Enabling ICT for smart home (e.g., wireless, PLCs, IPv6, etc.)
. Enabbling ICT for smart meters (e.g., cellular, PLCs, WiMAX, virtual
meters, etc.)
. p; Design paradigm for distributed control under communication constraints

. Ennabling ICT for demand response and distributed energy resources
. Privacy prottection and security for smart grid
. ICT for smart power grid (e.g., NASPInet , DNP3, BACNet , etc.)
. Virtual power plants
. Enabling ICT for plug-in hybrid electric vehicle (PHEV) system and network

. Reliable self-healing networking for smart grid
. ICT for wide-area situattional awareness (e.g., fault-detection and
localization, sensing, etc.)
. Routting for smart grid (e.g., IETF 6LoWPAN, ROLL, etc.)
. Middleware for smart griid
. Interoperability iissues within the Smart Grid
. Standardization (e.g., IEEE P2030, IEC, NEMA, etc.)
. Regulation
. Business model
. Application innovation Field trials


Workshop Co-chairs:

Zhifeng Tao, Mitsubishi Electric Research Lab, USA
Kwang -Cheng Chen, National Taiwan University, Taiwan
Stefano Galli, Panasonic Research, USA
Honggang Zhang, Zhejiang University, China
Mario Pickavet, Ghent University - IBBT, Belgium

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

Friday, November 20, 2009

[DMANET] Diagrams 2010 - 2nd Call for papers

****************************************************************
Diagrams 2010

Sixth International Conference on the
Theory and Application of Diagrams

http://www.diagrams-conference.org/2010/
diagrams2010@diagrams-conference.org

9-11 August 2010
Portland, Oregon, USA

****************************************************************
Second Call for Papers

News:
- New Program Committee Members
- Call for Workshop Proposals
- Call for Tutorial Proposals
- Call for Graduate Symposium Submissions

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

Diagrams is an international and interdisciplinary conference series,
covering all aspects of research on the theory and application of diagrams.

Recent advances in technology have enabled the use of diagrams, sketches and
other visualizations to become an integral part of our lives. For effective
communication with these novel and sophisticated visual representations, we
need insight into how diagrams are used, how they are represented, which
types are available and when it is appropriate to use them. These concerns
have triggered a surge of interest in the study of diagrammatic notations
for communication, cognition, creative thought, computation and
problem-solving.

The study of diagrammatic notations and their use must be pursued as an
interdisciplinary endeavour. Diagrams is the only conference series that
provides a united forum for all areas that are concerned with the study of
diagrams: for example, architecture, artificial intelligence, cartography,
cognitive science, computer science, education, graphic design, history of
science, human-computer interaction, linguistics, logic, mathematics,
philosophy, psychology, and software modelling.

Diagrams 2010 is the sixth event in this conference series, which was
launched in Edinburgh in 2000. Diagrams attracts a large number of
researchers from virtually all related fields mentioned, placing the
conference as a major international event in the area.

Diagrams 2010 will be co-located with the 32nd Annual Meeting of the
Cognitive Science Society (Cogsci-2010). This co-location will provide a
lively and stimulating environment, enabling researchers from related
communities to exchange ideas and more widely disseminate research results.

Diagrams 2010 will consist of sessions including presentations of refereed
papers, posters, and also tutorial and workshop sessions. For the first time
in history of Diagrams we will organize workshops and postgraduate student
sessions. We invite submissions of:

- long research papers (15 pages)
- short research papers (7 pages)
- posters (3 pages)
- tutorial proposals (2 pages; see the conference web page for full details)
- workshop proposals (2 pages; see the conference web page for full details)
- graduate symposium submissions (3 pages; see the conference web page for
full details)

that focus on any aspect of diagrams research. Long papers should present
original research results. Short papers and posters should present original
research contributions, position or problem statements, summarize software
to support the use of diagrams, or integrate results published elsewhere
which are of interest to the Diagrams community.

All submissions will be fully peer reviewed. The proceedings, which will
include accepted long and short papers and posters, will be published by
Springer in their Lecture Notes in Computer Science series,
http://www.springer.com/lncs.

Full details on the preparation of submissions can be found on the
conference web site
http://www.diagrams-conference.org/2010/content/submission

Topics of interest include, but are not limited to:

- applications of diagrams
- computational models of reasoning with, and interpretation of, diagrams
- design of diagrammatic notations
- diagram understanding by humans or machines
- diagram aesthetics and layout
- educational uses of diagrams
- evaluation of diagrammatic notations
- graphical communication
- heterogeneous notations involving diagrams
- history of diagrammatic notations
- information visualization using diagrams
- novel uses of diagrams
- psychological issues pertaining to perception, comprehension or production
of diagrams
- reasoning with diagrams
- software to support the use of diagrams
- theoretical aspects of diagrams including, for example, classification and
formalization
- usability and human-computer interaction issues concerning diagrams
- use of diagrams in disciplines of humanities, engineering, mathematics,
science and technology.


Important dates
***************

Abstract submission: 8 January 2010
Paper, tutorial and workshop proposal submissions: 18 January 2010
Poster submission: 1 February 2010
Notification for workshops: 8 February 2010
Notification for papers and tutorials: 1 March 2010
Notification for posters: 8 March 2010
Camera ready copies due: 29 March 2010
Graduate symposium submissions: 5 April 2010
Notification for graduate symposium submissions: 19 April 2010
Diagrams 2010 conference: 9-11 August 2010


Organizers
**********

Conference Chairs:
Ashok Goel (Georgia Institute of Technology, USA)
Mateja Jamnik (Cambridge University, UK)
N. Hari Narayanan (Auburn University, USA)

Workshop Chair:
Unmesh Kurup (Rensselaer Polytechnic Institute, USA)

Tutorial Chair:
Stephanie Elzer (Millersville University, USA)

Graduate Symposium Chair:
Jim Davies (Carleton University, Canada)

Contact Us
**********

diagrams2010@diagrams-conference.org


****************************************************************
Call For Workshop Proposals At Diagrams 2010

We solicit proposals for half-day workshops to be held as part of Diagrams
2010. Interested researchers should submit a one or two page proposal that
includes a title, the focus areas and goals of the proposed workshop, the
target community (or communities), the number of expected talks, the planned
format and the program committee. For more information see:

http://www.diagrams-conference.org/2010/content/workshops


****************************************************************
Call for Tutorial Proposals at Diagrams 2010

We call for proposals for two or four hour tutorials to be offered as part
of Diagrams 2010. Proposals should include a title, names and affiliations
of instructors, preferred duration, benefits to be gained from attending the
tutorial, features of the tutorial content, description of the intended
audience, presentation formats, tutorial history, and any additional
equipment or support requirements. For more details, please see:

http://www.diagrams-conference.org/2010/content/tutorials


****************************************************************
Call for Graduate Symposium Submissions at Diagrams 2010

We solicit submission for Graduate Symposium to be held as part of Diagrams
2010. The goal of the Graduate Symposium is to provide senior graduate
students or recent master's and Ph.D. graduates with an opportunity to
present their work and get feedback from established people. A group of
experts will be present to comment on the presentations. Talks will also be
given on 1) how to present scientific papers and 2) dissertation advice.
Submissions should be up to three pages long. Accepted papers will be
printed and made available at Diagrams 2010 and also on the conference web
page. For more details, please see:

http://www.diagrams-conference.org/2010/content/graduate-symposium


=============================================================
Mateja Jamnik
Computer Laboratory Email: Mateja.Jamnik@cl.cam.ac.uk
University of Cambridge http://www.cl.cam.ac.uk/~mj201
J.J. Thomson Avenue Tel: +44 (0)1223 763 587
Cambridge, CB3 0FD, UK Fax: +44 (0)1223 334 678
=============================================================

**********************************************************
*
* 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] CIAC 2010 - Call for Papers: 7th International Conference on Algorithms and Complexity

CIAC 2010
7th International Conference on Algorithms and Complexity
http://ciac.di.uniroma1.it/
May 26-28, 2010 Rome, Italy

CALL FOR PAPERS
SUBMISSION DEADLINE: December 11, 2009

We apologize if you receive multiple copies of this message.


AIM AND SCOPE OF THE CONFERENCE:

The 7th International Conference on Algorithms and Complexity is intended
to provide a forum for researchers working in all aspects of computational
complexity and the use, design, analysis and experimentation of efficient
algorithms and data structures.


TOPICS:

Papers presenting original research in the areas of algorithms and
complexity are sought, including (but not limited to):

- sequential, parallel and distributed algorithms and data structures;
- approximation and randomized algorithms;
- graph algorithms and graph drawing;
- on-line and streaming algorithms;
- analysis of algorithms and computational complexity;
- algorithm engineering;
- web algorithms;
- algorithmic game theory;
- computational biology;
- communication networks;
- computational geometry;
- cryptography;
- discrete optimization.


SUBMISSION GUIDELINES:

Authors are invited to submit an extended abstract of at most 12 pages
(LNCS style) to arrive before December 11, 2009. Submission is handled
by EasyChair at the following web page:
http://www.easychair.org/conferences/?conf=ciac2010

Further information and submission details can be found on the Conference
web page. Simultaneous submissions to other conferences with published
proceedings are not allowed.


PROCEEDINGS:

The conference proceedings will be published by
Springer-Verlag in Lecture Notes in Computer Science (LNCS) series.
Selected papers from CIAC 2010 will be invited to a special issue of Journal
of Discrete Algorithms.


IMPORTANT DATES:

Deadline for submission: December 11, 2009.
Notification of acceptance: February 13, 2010.
Final manuscript due: March 12, 2010.
Conference: May 26-28, 2010.


INVITED SPEAKERS:

- Ricardo Baeza-Yates, Yahoo! Research
- Monika Henzinger, Ecole Polytechnique Federale de Lausanne
- Eran Halperin, Tel Aviv Univ.
- Bruce Reed, McGill Univ.


STEERING COMMITTEE:

- Giorgio Ausiello, Sapienza Univ. of Rome
- Giuseppe F. Italiano, Univ. of Rome Tor Vergata
- Rossella Petreschi, Sapienza Univ. of Rome


PROGRAM COMMITTEE:

- Sandip Das, Indian Statistical Institute
- Josep Diaz (Chair), Univ. Politecnica de Catalunya
- Irene Finocchi, Sapienza Univ. of Rome
- Fabrizio Grandoni, Univ. of Rome Tor Vergata
- Kazuo Iwama, Kyoto Univ.
- Jan Kratochvil, Charles Univ.
- Kurt Mehlhorn, Max Planck Institut
- Dieter Mitsche, Univ. Politecnica de Catalunya
- Jarik Nesetril, Charles Univ.
- Vangelis Paschos, Univ. Paris-Dauphine
- Maurizio Patrignani, Univ. Roma Tre
- David Peleg, Weizmann Institute of Science
- Piotr Sankowski, Univ. of Warsaw
- Paul Spirakis, Univ. of Patras
- Geppino Pucci, Univ. of Padova
- Jared Saia, Univ. of New Mexico
- Dimitrios Thilikos, National and Kapodistrian Univ. of Athens
- Luca Trevisan, Univ. of California, Berkeley
- Lusheng Wang, City Univ. of Hong Kong
- Peter Widmayer, ETH Zurich


ORGANIZING COMMITTEE:

- Tiziana Calamoneri (Chair), Sapienza Univ. of Rome
- Saverio Caminiti, Sapienza Univ. of Rome
- Umberto Ferraro Petrillo, Sapienza Univ. of Rome
- Emanuele G. Fusco, Sapienza Univ. of Rome
- Maria Daniela Salvati, Sapienza Univ. of Rome

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

CIAC 2010 - Call for Papers: 7th International Conference on Algorithms and Complexity

CIAC 2010
7th International Conference on Algorithms and Complexity
http://ciac.di.uniroma1.it/
May 26-28, 2010 Rome, Italy

CALL FOR PAPERS
SUBMISSION DEADLINE: December 11, 2009

We apologize if you receive multiple copies of this message.


AIM AND SCOPE OF THE CONFERENCE:

The 7th International Conference on Algorithms and Complexity is intended
to provide a forum for researchers working in all aspects of computational
complexity and the use, design, analysis and experimentation of efficient
algorithms and data structures.


TOPICS:

Papers presenting original research in the areas of algorithms and
complexity are sought, including (but not limited to):

- sequential, parallel and distributed algorithms and data structures;
- approximation and randomized algorithms;
- graph algorithms and graph drawing;
- on-line and streaming algorithms;
- analysis of algorithms and computational complexity;
- algorithm engineering;
- web algorithms;
- algorithmic game theory;
- computational biology;
- communication networks;
- computational geometry;
- cryptography;
- discrete optimization.


SUBMISSION GUIDELINES:

Authors are invited to submit an extended abstract of at most 12 pages
(LNCS style) to arrive before December 11, 2009. Submission is handled
by EasyChair at the following web page:
http://www.easychair.org/conferences/?conf=ciac2010

Further information and submission details can be found on the Conference
web page. Simultaneous submissions to other conferences with published
proceedings are not allowed.


PROCEEDINGS:

The conference proceedings will be published by
Springer-Verlag in Lecture Notes in Computer Science (LNCS) series.
Selected papers from CIAC 2010 will be invited to a special issue of Journal
of Discrete Algorithms.


IMPORTANT DATES:

Deadline for submission: December 11, 2009.
Notification of acceptance: February 13, 2010.
Final manuscript due: March 12, 2010.
Conference: May 26-28, 2010.


INVITED SPEAKERS:

- Ricardo Baeza-Yates, Yahoo! Research
- Monika Henzinger, Ecole Polytechnique Federale de Lausanne
- Eran Halperin, Tel Aviv Univ.
- Bruce Reed, McGill Univ.


STEERING COMMITTEE:

- Giorgio Ausiello, Sapienza Univ. of Rome
- Giuseppe F. Italiano, Univ. of Rome Tor Vergata
- Rossella Petreschi, Sapienza Univ. of Rome


PROGRAM COMMITTEE:

- Sandip Das, Indian Statistical Institute
- Josep Diaz (Chair), Univ. Politecnica de Catalunya
- Irene Finocchi, Sapienza Univ. of Rome
- Fabrizio Grandoni, Univ. of Rome Tor Vergata
- Kazuo Iwama, Kyoto Univ.
- Jan Kratochvil, Charles Univ.
- Kurt Mehlhorn, Max Planck Institut
- Dieter Mitsche, Univ. Politecnica de Catalunya
- Jarik Nesetril, Charles Univ.
- Vangelis Paschos, Univ. Paris-Dauphine
- Maurizio Patrignani, Univ. Roma Tre
- David Peleg, Weizmann Institute of Science
- Piotr Sankowski, Univ. of Warsaw
- Paul Spirakis, Univ. of Patras
- Geppino Pucci, Univ. of Padova
- Jared Saia, Univ. of New Mexico
- Dimitrios Thilikos, National and Kapodistrian Univ. of Athens
- Luca Trevisan, Univ. of California, Berkeley
- Lusheng Wang, City Univ. of Hong Kong
- Peter Widmayer, ETH Zurich


ORGANIZING COMMITTEE:

- Tiziana Calamoneri (Chair), Sapienza Univ. of Rome
- Saverio Caminiti, Sapienza Univ. of Rome
- Umberto Ferraro Petrillo, Sapienza Univ. of Rome
- Emanuele G. Fusco, Sapienza Univ. of Rome
- Maria Daniela Salvati, Sapienza Univ. of Rome

[DMANET] CMCS 2010: First call for papers

------------------------------------------------------------------------------
CMCS 2010 First call for papers
------------------------------------------------------------------------------

The Tenth International Workshop on Coalgebraic Methods in Computer Science
26-28 March 2010, Paphos, Cyprus
(co-located with ETAPS 2010)
http://event.cwi.nl/cmcs10/

Aims and scope
------------------

The aim of the workshop is to bring together researchers with a common
interest in the theory of coalgebras and its applications. Over the
last two decades, coalgebra has developed into a field of its own,
presenting a mathematical foundation for various kinds of dynamical
systems, infinite data structures, and logics. Coalgebra has an ever
growing range of applications in and interactions with other fields
such as reactive and interactive system theory, object oriented and
concurrent programming, formal system specification, modal logic,
dynamical systems, control systems, category theory, algebra,
analysis, etc.

The topics of the workshop include, but are not limited to:

* the theory of coalgebras (including set theoretic and categorical
approaches);
* coalgebras as computational and semantical models (for programming
languages, dynamical systems, etc.);
* coalgebras in (functional, object-oriented, concurrent) programming;
* coalgebras and data types;
* (coinductive) definition and proof principles for coalgebras (with
bisimulations or invariants);
* coalgebras and algebras;
* coalgebraic specification and verification;
* coalgebras and (modal) logic;
* coalgebra and control theory (notably of discrete event and hybrid
systems).


An anniversary: the 10th CMCS
----------------------------------------

CMCS took place for the first time when ETAPS started, in 1998. Since
then, it has always been collocated with ETAPS, becoming bi-annual
since the start of CALCO (Conference on Algebra and Coalgebra) in
2005.

In 2010, we will celebrate the 10th edition of CMCS,
by inviting a number of specialists in the field to present overviews
of both obtained results and future challenges.

Invited Speakers
---------------------

At this tenth meeting the following invited speakers will present
overviews of important subareas.

* Venanzio Capretta: Coalgebra in functional programming and type theory
* Bartek Klin: Operational semantics coalgebraically
* Dirk Pattinson: Logic and coalgebra
* Ana Sokolova: Probabilistic systems coalgebraically


Submissions
--------------

There are two types of submissions possible:

(a) Papers to be evaluated by the PC for publication in the proceedings:

They must have a length no greater than 20 pages. They must contain
original contributions, be clearly written, and include appropriate
reference to and comparison with related work. Accepted papers will
appear in ENTCS (style files can be found in http://www.entcs.org/).
The web-based system EasyChair will be used for submission
(http://www.easychair.org/conferences/?conf=cmcs10).

After the event, a special journal issue of selected papers will be
considered.

(b) Short contributions:

These will not be published in the proceedings but will be bundled in
a CWI technical report.

They should be no more than two pages and may describe work in
progress, summarise work submitted to a conference or workshop
elsewhere, or in some other way appeal to the CMCS audience. For
short submissions, the style file easychair.cls should be used
(http://www.easychair.org/coolnews.cgi). The submission (pdf file)
is via email: cmcs10@cwi.nl.

Important dates
-------------------
* 8 January 2010: strict submission deadline regular papers
* 13 February 2010: notification regular papers
* 15 February 2010: deadline early registration
* 20 February 2010: final version
* 27 February 2010: strict submission deadline short contributions
* 6 March 2010: notification short contributions
* 26-28 March 2010: the workshop


Contact
----------
cmcs10@cwi.nl
.
**********************************************************
*
* 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/
*
**********************************************************

CFP: Logic Algebra and Truth Degrees 2010

(apologies for multiple copies)

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

Logic, Algebra and Truth Degrees 2010

September 7 - 11, Prague, Czech Republic

First announcement

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

Logic, Algebra and Truth Degrees is the second official meeting of the
EUSFLAT Working Group on Mathematical Fuzzy Logic (www.mathfuzzlog.org).

Mathematical Fuzzy Logic is a subdiscipline of Mathematical Logic which
studies the notion of comparative truth. The assumption that "truth comes
in degrees" has proved to be very useful in many, both theoretical and
applied, areas of Mathematics, Computer Science and Philosophy.

The main goals of this meeting are to foster collaboration between
researchers in the area of Mathematical Fuzzy Logic and to promote
communication and cooperation with members of neighbouring fields.

The featured topics include, but are not limited to, the following:

. Proof systems for fuzzy logics: Hilbert, Gentzen, natural deduction,
tableaux, resolution, computational complexity, etc.

. Algebraic semantics: residuated lattices, MTL-algebras, BL-algebras,
MV-algebras, Abstract Algebraic Logic, functional representation, etc.

. Game-theory: Giles games, Renyi-Ulam games, evaluation games, etc.

. First-order fuzzy logics: axiomatizations, arithmetical hierarchy,
model theory, etc.

. Higher-order fuzzy logical systems: type theories, Fuzzy Class
Theory, and formal fuzzy mathematics.

. Philosophical issues: connections with vagueness and uncertainty.

. Applied fuzzy logical calculi: foundations of fuzzy logical
programming, logic-based reasoning about similarity, fuzzy description
logics, etc.

We also welcome contributions on any relevant aspects of related logical
systems (such as substructural and quantum logics, and many-valued logics
in general).

Programme Committee:

Petr Hajek (Chair), Czech Republic
Antonio Di Nola, Italy
Christian Fermuller, Austria
Siegfried Gottwald, Germany
Daniele Mundici, Italy
Carles Noguera, Spain

Invited speakers:

Arnon Avron, Israel
Felix Bou, Spain
Agata Ciabattoni, Austria
Roberto Cignoli, Argentina
Ioana Leustean, Romania
Franco Montagna, Italy
James G. Raftery, South Africa
Hiroakira Ono, Japan

Tutorials:

George Metcalfe, Switzerland - Proof theory for fuzzy logics
Vilem Novak, Czech Republic - Mathematical fuzzy logic in linguistic
semantics

If you are interested in presenting a paper, please submit a 2-4 page
abstract at http://www.easychair.org/conferences/?conf=latd2010. Your
submission will be confirmed automatically on the e-mail address you
provide. The accepted abstracts will be available on-line after the final
decision of the program committee. If you have any problems to submit an
abstract, please contact us at mail to: latd2010(at)matfuzzlog.org

The deadline for contributions is 20th March 2010. The notification of
acceptance/rejection will be sent until 30th April 2010.

For further information please visit the official web page of the
conference: http://www.mathfuzzlog.org/latd2010. All correspondence
should be directed to latd2010(at)mathfuzzlog.org

Please, feel free to distribute this call.

The Organizing Committee
Petr Cintula (Chair), Petra Ivanicova, Karel Chvalovsky, Milan Petrik,
Zuzana Hanikova

Thursday, November 19, 2009

[DMANET] MSSIP Prize 2010 - dead-line: January 1, 2010

Please note that the dead-line (*January 1, 2010*) for submitting a paper
to MSSIP 2010 is now very close.

The MSSIP Prize is awarded for an outstanding innovative contribution to
Management Science/OR. In 2010, it will be awarded at the EURO 2010
Conference in Lisbon (Portugal) .

The submitted work should consist of a recent paper in which the
theoretical result or the practical implementation is explained. The
prize is sponsored by SAP AG (12000 Euro).

The Jury is composed of 7 members: Jesus Artalejo (Complutense
University of Madrid), Walid Ben Ameur (Institut Telecom SudParis),
Heinrich Braun (SAP AG), Eric Gourdin (Orange Labs), Martine Labbé
(Université Libre de Bruxelles), Stefan Nickel (Universitaet Karlsruhe)
and Nigel Walker (BT Innovate).

The paper is to be submitted in electronic form to the chair of the
jury, no later than *January 1, 2010*:
Eric Gourdin.
Senior Expert in Network Optimization
France Telecom, Orange Labs R&D/
/eric.gourdin@orange-ftgroup.com/

Information about the Guidelines of this prize are made available at:

_http://www.euro-online.org/display.php?page=mssip2&_
<http://www.euro-online.org/display.php?page=mssip2&>

--
Eric Gourdin
Orange Labs
Research & Development
CORE/MCN/TOP
38-40 rue du Général Leclerc
92794 Issy-Les-Moulineaux
Phone: +33 1 45 29 45 66
http://perso.rd.francetelecom.fr/gourdin/


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