Wednesday, February 10, 2010

[DMANET] CFP: IEEE Communications Magazine SI on Green Communications

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++


CALL FOR PAPERS (CFP)

IEEE Communications Magazine Feature Topic Issue on "Green Communications"

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

The unprecedented expansion of wireline and wireless networks has resulted
in increase in energy consumption and left a significant environmental
footprint. Recently, it has been reported that energy costs can account for
as much as half of a mobile service provider's annual operating expenses.
If the aggregate energy consumption of networking devices would follow the
growth trajectories of Internet traffic (i.e., about 60% per year), the
environmental and financial consequences will be dire. Thus, making ICT
equipment and applications "greener" can not only have a tangible positive
impact on environment, but also help operators attain long-term
profitability. Moreover, green communications can help the world reduce
dependence on fossil fuel, enable demand response and distributed energy
resources, and ultimately achieve sustainable prosperity. Accordingly, a
myriad of communications and information technologies have already been
exploited by the global smart grid initiatives to empower conventional power
grid to support two-way energy and information flow.

To meet the green communications challenges, we have to resort to a plethora
of paradigm-shifting technologies, including but not limiting to
energy-efficient network architecture & protocols, energy-efficient wireless
transmission techniques, energy-efficient home networking, energy-aware
backbone networks, Smart Grid, and opportunistic spectrum sharing without
causing harmful interference pollution (e.g., Green Spectrum).

This IEEE Communications Magazine special issue (feature topic issue) aims
to provide a comprehensive overview of the state-of-the-art in technology,
regulation and standardization for "Green Communications", and present a
holistic view of research challenges and opportunities in the coming green
era. Suggested topics include but not limit to the following:

. Energy-efficient circuit and device

. Energy-efficient transmission switching and routing technologies

. Energy-efficient base station architectures and networking

. Energy-efficiency in wired and wireless access networks

. Energy-efficiency in home and enterprise networking

. Energy efficiency of data centers and intelligent cloud computing

. Protocols and protocol extensions to enable energy efficient
networks

. Network-wide cross-layer optimizations to minimize energy
consumption

. Network load balance and smart information storage in distributed
networks

. Instrumentation for energy consumption measurement

. Remote power management for wireless terminals and access networks


. Hierarchical and distributed techniques for energy management

. Harvesting distributed energy generation

. Smart Grid

. Information theory on energy efficiency

. Cognitive, cooperative and reconfigurable networks

. Energy evaluation and comparison of different network technologies

. Novel network concepts and architectures lowering the overall
footprint of ICT (e.g., Compressed Sensing for network monitoring)

. Realistic estimation of the worldwide footprint of communications
and future evolution

. Assessment of the footprint of individual communication devices,
including life cycle assessment

. Regulation and standardization

. Deployment, trial experience, business models and applications
(e.g., green multimedia broadcasting, femtocells)

Articles should be tutorial in nature and should be written in a style
comprehensible to readers outside the specialty of the field. Authors must
follow the IEEE Communications Magazine's guidelines for preparation of the
manuscript. Complete guidelines for prospective authors can be found at
www.comsoc.org/pubs/commag/sub_guidelines.html
<http://www.comsoc.org/livepubs/ci1/info/sub_guidelines.html> . Please send
PDF (preferred) or MS WORD formatted paper to Manuscript Central
(http://commag-ieee.manuscriptcentral.com), resister or log in, go to the
Author Center and follow the instructions there.

Manuscript Submission Due: April 1, 2010

Acceptance Notification: July 1, 2010

Final Manuscript Due: August 15, 2010

Publication: November 2010

Guest Editors:


Honggang Zhang ( <mailto:honggangzhang@zju.edu.cn> honggangzhang@zju.edu.cn)

Zhejiang University, China

Andreas Gladisch (andreas.gladisch@telekom.de)

Deutsche Telekom Laboratories, Germany

Mario Pickavet (mario.pickavet@intec.ugent.be)

University of Ghent - IBBT, Belgium

Zhifeng Tao (tao@merl.com)

Mitsubishi Electric Research Lab (MERL), USA

Werner Mohr (werner.mohr@nsn.com)

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

Tuesday, February 9, 2010

[DMANET] Mixed Integer Programming 2010, call for posters and participation

*** CALL FOR POSTER PRESENTATIONS, CALL FOR PARTICIPATION ***

Date: July 26-29, 2010
Location: Georgia Institute of Technology, Atlanta, Georgia, USA
Registration: http://www2.isye.gatech.edu/mip2010/
Poster submission deadline: March 31, 2010

You are cordially invited to participate in the upcoming workshop in
Mixed Integer Programming (MIP 2010).

The 2010 Mixed Integer Programming workshop will be the seventh in a
series of annual workshops held in North America designed to bring the
integer programming community together to discuss very recent
developments in the field. The workshop series consists of a single
track of invited talks.

Confirmed speakers:

Karen Aardal, Tobias Achterberg, Egon Balas,
Pierre Bonami, Michele Conforti, Sanjeeb Dash,
Daniel Espinoza, Matteo Fischetti, Antonio Frangioni,
Zonghao Gu, Ellis Johnson, Simge Kucukyavuz,
Jon Lee, Quentin Louveaux, Jim Luedtke,
Andrew Miller, Michele Monaci, James Ostrowski,
Marc Pfetsch, Jean-Philippe Richard, Martin Savelsbergh,
Stefano Smriglio, Andrea Tramontani, Santosh Vempala,
Juan-Pablo Vielma, Giacomo Zambelli

We encourage anyone with interests in mixed integer programming to
participate. Space is limited, and thus early registration is
recommended.

In addition to the invited talks, there will be a contributed poster
session for which we invite all participants to submit an abstract. To
submit an abstract for the poster session, please register for the
conference at the above web page, then email a 1-or-2-page .pdf file
containing your abstract to mip2010@isye.gatech.edu by March 31. Space
for posters is limited, and we may not be able to accommodate all
posters; we expect to send out notifications by April 30.

There will be ample time for discussion and interaction between the
participants during the workshop, as one of its aims is to facilitate
research collaboration.

Thanks to the generous support by our sponsors, registration is free,
and travel support is available. Students and postdocs who wish to
apply for travel support are strongly encouraged to submit a poster
abstract no later than March 31, as funding priority will be given to
students and postdocs who have submitted poster abstracts. We expect
to make funding decisions by April 30.

Our apologies if you happen to receive multiple copies of this announcement.

Sincerely,

Shabbir Ahmed (Georgia Institute of Technology)
Ismael Regis de Farias Jr. (Texas Tech University)
Ricardo Fukasawa (University of Waterloo)
Matthias Koeppe (University of California, Davis)
Andrea Lodi (University of Bologna)

(MIP 2010 Organizing Committee, mip2010@isye.gatech.edu)

--
Matthias Koeppe -- http://www.math.ucdavis.edu/~mkoeppe
**********************************************************
*
* 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/
*
**********************************************************

Portland State faculty position

The Computer Science Department at Portland State University invites
applications for a junior tenure-track faculty position to begin Fall
2010.  Specific areas of computer science under consideration include:
artificial intelligence and machine learning; multi-core architectures
and parallel programming; visualization and graphics; security and
cryptography.  Exceptional applicants in other areas or at other ranks
will also be considered.

The department currently has twenty-five tenure-track faculty,
including four NSF CAREER Award winners and two ACM Fellows.  The
department offers an ABET accredited B.S., an M.S., and a Ph.D. in
Computer Science.  Our teaching loads give faculty time to maintain
funded research programs and to collaborate with local industry.  The
department currently serves approximately 400 undergraduates and 120
graduate students.  Further information about the department is
available at http://www.cs.pdx.edu.

Portland State University is located in downtown Portland, Oregon.
Portland's "Silicon Forest" is one of the major software/hardware
development centers in the country.  The Portland metropolitan area
has over 200 hardware and software organizations, including Intel, the
Open Source Development Lab, Tektronix, InFocus, Mentor Graphics, IBM
and many software start-ups.  The University is approximately one hour
from magnificent beaches and year-round outdoor activities.  Portland
has been ranked highly for quality of life, including the #1 greenest
city, the #1 cleanest city, and the #1 cycling city.  Applicants are
expected to hold or be near completion of a Ph.D. degree in Computer
Science or a closely related field.  All applicants are expected to
show great potential for future external research support and a
demonstrated record of research excellence.

The faculty member will maintain scholarly activity in funded research
and publications; teach undergraduate and graduate classes; provide
professionally related public service; advise students, and support
University activities through committee service.

For more information and application procedure, please visit
http://cs.pdx.edu.  For inquiries about this position, please contact
cssearch@cs.pdx.edu.  Review of applications will begin immediately
and will continue until finalists are identified.

Portland State University is an Affirmative Action, Equal Opportunity
Institution and welcomes applications from diverse candidates and
candidates who support diversity.


[DMANET] CFP Extended Deadline of IEEE CIT-10, ICESS-10, ScalCom-10 and Journal Special Issues

=== Extended Paper Submission Deadline: Friday, 05 March 2010 ===

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

CALL FOR PAPERS

The 10th IEEE International Conference on Computer and Information
Technology (CIT-10), Bradford, UK, 29 June - 1 July, 2010

http://www.scim.brad.ac.uk/~ylwu/CIT2010/

The 10th IEEE International Conference on Scalable Computing and
Communications (ScalCom-10), Bradford, UK, 29 June - 1 July, 2010

http://www.scim.brad.ac.uk/~ylwu/ScalCom2010/

The 7th IEEE International Conference on Embedded Software and Systems
(ICESS-10), Bradford, UK, 29 June - 1 July, 2010

http://www.scim.brad.ac.uk/~ylwu/ICESS2010/

Sponsored by
IEEE, IEEE Computer Society and IEEE Technical Committee of Scalable
Computing (TCSC)

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

Distinguished selected papers from the conferences, after further
extensions, will be published in special issues of the following prestigious
Journals indexed by SCI:

. Journal of Supercomputing - Springer
. Journal of Computer and System Sciences - Elsevier
. Concurrency and Computation: Practice and Experience - John Wiley &
Sons
. Telecommunication Systems - Springer
. Simulation Modelling Practice and Theory - Elsevier
. Future Generation Computer Systems - Elsevier
. The Computer Journal - The British Computer Society

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


**********************************************************
*
* 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] NMA'2010 CFP

Dear Colleague,
On behalf of the Organizing Committee, we invite you to participate in
the special session (workshop) on "METAHEURISTICS FOR OPTIMIZATION
PROBLEMS" at the 7th Conference on Numerical Methods and Applications
NM&A'10,
to be held 20-24 August 2010 in Borovets, Bulgaria.
The session is organized by: Assoc. Prof. Stefka Fidanova
(stefka@parallel.bas.bg)
from the Institute for Parallel Processing, Bulgarian Academy of
Sciences and Assoc. Prof. Antonio Nebro (antonio@lcc.uma.es)
from University of Malaga, Spain.
Proceedings The refereed and presented papers will be published as a
special volume of Springer Lecture Notes in Computer Science (LNCS).

Important deadlines Deadline for submission of abstracts
February 15, 2010
Notification of acceptance of the talks on the basis of the submitted
abstract
March 1, 2010
Deadline for submission of full papers
April 30, 2010
Notification of acceptance of full papers
June 20, 2010
Submission of accommodation forms
July 15, 2010


Abstracts and contributed papers The abstracts (up to 1 page stating
clearly the originality of the results) are to be written in standard
LaTeX. The length of the contributed papers is limited up to 8 pages. It
is assumed that one participant will present not more than one talk.
Send the abstracts and papers to special session organizers and
conference organizers, indicating the name of the special session. After
sending the abstract go to the conference web page and fill in the
registration form (personal data of the participants, minimum one per
paper, and the name of the special session).

Information about abstract and paper preparation, accommodation,
transportation, registration form and conference location you can find
at the conference web page http://www.math.bas.bg/~nummeth/nma10

Special session organizers
Assoc. Prof. S. Fidanova, Institute of Parallel Processing, Bulgarian
Academy of
Science, stefka@parallel.bas.bg
Assoc. Prof. A. Nebro, University of Malaga, Spain, e-mal:
antonio@lcc.uma.es

**********************************************************
*
* 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] Oxford Combinatorics Meeting

------------------------------------------
One-Day Meeting in Combinatorics at Oxford
------------------------------------------

A One-Day Meeting in Combinatorics will be held in Oxford on Wednesday 17
March 2010. The meeting will take place in the Mathematical Institute,
with talks starting at 11am and coffee available beforehand from 10.30am.

The speakers are:

Mark Jerrum (QMUL)
The ferromagnetic Potts model: phase transition,
gadgets and computational complexity

David Gamarnik (MIT)
A combinatorial approach to the interpolation method and scaling
limits in sparse random graphs

Benny Sudakov (UCLA)
Ramsey numbers of graphs and hypergraphs

Günter M. Ziegler (Berlin)
Some centrally-symmetric polytopes derived from perfect graphs

Adrian Bondy (Lyon)
Switching Reconstruction

Anyone interested is welcome to attend. Some funds may be available to
contribute to the expenses of research students who wish to attend the
meeting.

Further details can be obtained from Alex Scott (email:
scott@maths.ox.ac.uk) or from the web page, which can be found at
http://people.maths.ox.ac.uk/~scott/Pages/one-day_meeting.htm
**********************************************************
*
* 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] TAMC 2010 - Extended deadline

*** Following requests of prospective authors, the PC has decided to
extend the submission deadline by 5 days to February 15, 2010. ***

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
TAMC 2010 - 7th Annual Conference on Theory and Applications of Models
of Computation

June 7 - 11, 2010 Prague, Czech Republic

tamc2010@tamc2010.cz http://www.tamc2010.cz
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

LOCATION:
The conference will take place in the premisses of Charles University in
the historic center of Prague, the capital of the Czech Republic. Six
previous annual meetings were held in 2004-2009, in Beijing, Shanghai,
Xi'an, and ChangSha, with enthusiastic participation from researchers
all around the world. In 2010, the conference is organized for the first
time in Europe.

PLENARY SPEAKERS:
John Hopcroft (Cornell University, USA)
ShangHua Teng (Boston University, USA)

SPECIAL SESSIONS:
Computational Geometry (organized by Jiri Matousek)
Proof Complexity (organized by Jan Krajicek)

IMPORTANT DATES:
Submission of papers: Extended to February 15, 2010
Notification of acceptance: March 20, 2010
Final version due: March 30, 2010
Early registration: April 10, 2010
Conference: June 7-11, 2010

SCOPE:
The three main themes of the conference continue to be Computability,
Complexity, and Algorithms. It aims to bring together researchers with
interests in theoretical computer science, algorithmic mathematics, and
applications to the physical sciences. Typical but not exclusive topics
of interest include:
- algorithmic graph theory and combinatorics,
- algorithmic algebra, number theory and coding theory,
- algorithms and data structures,
- automata and neural networks,
- computable mathematics,
- computational biology,
- computational complexity,
- computational game theory,
- computational geometry,
- continuous and real computation,
- cryptography,
- decidability and undecidability,
- generalized and higher type computation,
- learning theory,
- models of computation,
- natural computation,
- on-line algorithms,
- parallel algorithms,
- physical computability,
- proofs and computation,
- quantum computing,
- randomness,
- relative computability and degree structures,
- theoretical problems in networks and security,
- network information,
- network structures and algorithms,
- Turing definability.

SUBMISSIONS:
The submission must not exceed 10 pages in Springer-Verlag Lecture Notes
LaTeX style. A clearly marked appendix that will be read at the
discretion of the program committee may be added. Simultaneous
submission of papers to any other conference with published proceedings
or submitting papers previously accepted for journal publication is not
allowed. Only electronic submissions in postscript or pdf formats are
accepted.

PROCEEDINGS:
Invited papers and accepted contributions will be published in the
conference proceedings in Lecture Notes in Computer Science,
Springer-Verlag. A special issue of Theoretical Computer Science
published by Elsevier containing selected contributions presented at the
conference is planned.

SPONSORS:
DIMATIA - Center for Discrete Mathematics and ITI - Institute for
Theoretical Computer Science, Charles University, Prague

Further details are available on the conference web site
http://www.tamc2010.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/
*
**********************************************************

Monday, February 8, 2010

[DMANET] ICE 2010: First call for papers

[- Apologies for multiple copies -]

3rd Interaction and Concurrency Experience
ICE 2010: Guaranteed Interactions

Satellite workshop of DisCoTec 2010
10th of June 2010
Amsterdam, The Netherlands

http://www.artist-embedded.org/artist/-ICE-10-.html

=== Highlights ===

- Innovative selection procedure
- Travel grants for young researchers

=== Important Dates ===

- Abstract submission: 22 March 2010
- Full paper submission: 29 March 2010
- Reviews, rebuttal and PC discussion: 30 March - 28 April 2010
- Notification to authors: 30 April 2010

=== Scope ===

Interaction and Concurrency Experiences (ICEs) is a series of
international scientific meetings oriented to theoretical
computer science researchers with special interest in models,
verification, tools and programming primitives for complex interactions.

The general scope is to include theoretical and applied aspects of
interactions and the synchronization mechanisms used among actors of
concurrent/distributed systems, but every experience will focus on a
different specific topic which affects several areas of computer science.

The theme of ICE'10 is ***Guaranteed Interactions***, like guaranteeing
safety, responsiveness, quality of service levels or satisfaction of
analysis hypotheses. In this context, coordination can be viewed as
imposing constraints on the interaction among the actors. Such constraints
and guarantees of their satisfaction play an important role in the
analysis of distributed systems. In order to provide such guarantees, a
number of directions are being explored to develop appropriate models,
methodologies and tools, like behavioural types, component-based model
checking, assume-guarantee and "by construction" techniques such as glue
synthesis. Considering interaction as a first class entity is crucial for
overcoming complexity issues of distributed systems, such as state space
explosion.

Topics of interest include, but shall not be limited to:

- logic and types for interactions
- concurrent models and semantics
- techniques and tools for specification, analysis, verification of
guaranteed interaction
- programming primitives for interactions
- languages, protocols and mechanisms for sound coordination
- "by construction" guarantees for interaction
- expressiveness results
- formal contract languages
- disciplined interactions inspired by emerging computational models
(systems biology, quantum computing, etc.)

=== Selection Procedure ===

The workshop proposes an innovative paper selection mechanism based on an
interactive discussion amongst authors and PC members. As witnessed by the
past two editions of ICE, this considerably improves the accuracy of the
feedback from reviews, the fairness of the selection, the quality of
accepted papers, and the discussion during the workshop.

During the review phase, each submitted paper is published on a Wiki and
associated with a discussion forum whose access will be restricted to the
authors and to all the PC members not in conflict of interests. The PC
members post comments / questions which the authors shall reply to.

=== The Public Wiki ===

After the notification, the accepted papers will be published on a public
forum, the rationale being to initiate public discussions that will
trigger and stimulate the scientific debate of the workshop. We argue that
this will drive the workshop discussions and let perspective participants
to interact with each other well in advance with respect to the modus
operandi of more traditional events.

=== Submission Guidelines ===

Papers must report previously unpublished work and not be
simultaneously submitted to other conferences / workshops with
refereed proceedings. The ICE'10 post-proceedings will be published in
Electronic Proceedings in Theoretical Computer Science
(http://eptcs.org/). Depending on the quality of submissions a special issue in
a journal will be considered.

Submissions must be made electronically in PDF format via EasyChair
(http://www.easychair.org/conferences/?conf=ice2010) and should not
exceed 15 pages with EPTCS style (http://style.eptcs.org/).

Accepted papers must be presented at the workshop by one of the authors.

=== Contact ===

Please write to <ice2010@di.unipi.it> for any additional information you
may need.

=== Previous editions ===

The previous two editions of ICE have been held in:
– Reykjavik, Iceland, on July 6th, 2008, with focus on Synchronous and Asyn-
chronous Interactions in Concurrent/Distributed Systems, co-located with
ICALP'08 (http://ice08.dimi.uniud.it/). The post proceedings were published
in ENTCS (vol.229-3).
– Bologna, Italy, on August 31st, 2009, with focus on Structured Interactions,
co-located with CONCUR'09 (http://ice09.dimi.uniud.it/). The post
proceedings were published in EPTCS (vol.12) and a special issue of MSCS is
now in preparation.


=== Sponsors ===

* CEA LIST (http://www-list.cea.fr)
* ArtistDesign network of excellence (http://www.artist-embedded.org)
* Institute for Programming research and Algorithmics (IPA - http://www2.win.tue.nl/ipa/)


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

[DMANET] Call for Papers: Special Issue on Heuristic Search Methods for Large Scale Optimization Problems in Industry, Evolutionary Computation Journal

Special Issue on
Heuristic Search Methods for Large Scale Optimization Problems in
Industry

Evolutionary Computation Journal, MIT Press
http://ecj.lri.fr/

SUBMISSION DEADLINE: July 31, 2010.

Guest Editors:
Andreas Ernst, CSIRO Mathematical and Information Science,
andreas.ernst@csiro.au
Zbigniew Michalewicz, University of Adelaide,
zbigniew.michalewicz@adelaide.edu.au
Frank Neumann, Max Planck Institute for Informatics, fne@mpi-inf.mpg.de

Description:
This special issue aims to provide a forum for researchers working on
large applied optimization problems arising in industry. Such problems
often defy solution by exact approaches such as integer and constraint
programming. Particular challenges of large applied problems include the
presence of complex objectives containing a mixture of real costs and
soft constraints which can be time consuming to evaluate. In addition
the search space of problems is often so large that traversing it with
neighbourhood-move, crossover or mutation operators can take too long to
allow effective exploration. This special issue solicits novel
high-quality contributions on heuristic methods for large applied
optimization problems that have been used in practice. While papers on
any aspect of solving large scale optimization problems in industry are
welcome, of special interest are submissions on:

-Scheduling/planning problems solved for particular organizations
-Novel methods for exploring very large search spaces
-Decomposition and parallel computing techniques for solving large
optimization problems
-Hybrid heuristics for real world optimization problems
-Methods for dealing with large data sets in formulating and solving
large optimization problems, including issues around data consistency
and completeness.
-Case studies of successful (or unsuccessful) implementations of large
scale heuristic optimization algorithms in a business and lessons
learned from these.

Authors are encouraged to make available (de-identified) versions of
some of their real world data sets to support the development of more
sophisticated methods to deal with some of these challenging problems.
This special issue will not consider the solution of large abstract
problems (eg classical VRP or job shop scheduling problems) nor papers
that only test algorithms on randomly generated data sets. Authors are
invited to submit original work on topics relevant for this special
issue. The publication of the special issue is tentatively scheduled for
Summer 2011.

Submission:
Authors should submit their manuscripts to the Evolutionary Computation
Editorial Manager at http://ecj.lri.fr/.
When submitting a paper, please send at the same time also an
email to Frank Neumann (fne@mpi-inf.mpg.de) with paper title and author
list to inform about the submission.
**********************************************************
*
* 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, February 7, 2010

CSR 2010: Call for Participation

               CALL FOR PARTICIPATION - CSR 2010

   5th International Computer Science Symposium in Russia
                June 16-20, 2010, Kazan, Russia

    Organized by Institute of Informatics of the Tatarstan
       Academy of Sciences, and Kazan State University

                    http://csr2010.antat.ru/


     *** WE STRONGLY ADVICE TO REGISTER BEFORE MARCH 1 ***


CSR 2010 is the fifth conference in the series of regular
events spanning all areas of computer science. This year
it is mainly focused on its theoretical aspects.

The program of CSR 2010 consists of 30 contributed papers,
an opening lecture by
 Alexander Razborov (University of Chicago and Steklov Mathematical Institute)
and 8 invited lectures by
 Susanne Albers (Humboldt-Universität, Germany)
 Fedor Fomin (University of Bergen, Norway)
 Juraj Hromkovic (Federal Institute of Technology, Switzerland)
 Richard Jozsa (University of Bristol and University of Cambridge)
 Prabhakar Raghavan (Yahoo! Labs and Stanford University)
 Miklos Santha (Université Paris Sud and National University of Singapore)
 Uwe Schöning (Universität Ulm, Germany).

The list of accepted papers can be found at the conference web site.
The preliminary program is coming soon.

Two workshops in Kazan and one in Moscow
are organized in conjunction with CSR-2010.
Pre-conference Workshop on Program Semantics, Specification and Verification:
Theory and Applications (PSSV 2010) in Kazan will be held on June 14-15.

Post-conference Workshop on High Productivity Computations (HPC 2010) in Kazan
will be held on June 21-22. It is intended to organize the discussions
about high productivity computing means and models, including but not
limited to high performance and quantum information processing.

Note also that Franco-Russian Workshop "Complexity in algorithms,
dynamics and bioinformatics" is organized in Moscow on June 13-15;
one may find it convenient to attend before CSR-2010:
http://www.mccme.ru/~anromash/workshop/fr-alg-workshop.html
Regarding this one, please contact its organizers directly.

The main accomodation site is the hotel "Korston" which offers conference
discounts to participants (the number of rooms is limited, accomodation
requests will be considered on a first-come-first-served basis).

The early registration fee of 300 euros (150 euros for students) should
be paid before March 1, 2010 via bank transfer. The late registration fee
is 390 euros (240 euros for students). Participants registered after May 13
will be required to pay upon arrival. There are also reduced fees for
participants working in Russia.

To register for participation, please fill in the form at
http://csr2010.antat.ru/CSR2010RegistrationForm.pdf and send it to
info(at)antat.ru. If you plan to participate and need a *Russian visa*,
please contact the organizers before March 1 since it takes more than
a month just to issue the official invitation.

Symposium chair: Farid Ablayev (Kazan State University).

Further information and contacts:
 Web: http://csr2010.antat.ru/
 Email: csr2010.kazan(at)gmail.com



[DMANET] CSR 2010: Call for Participation

CALL FOR PARTICIPATION - CSR 2010

5th International Computer Science Symposium in Russia
June 16-20, 2010, Kazan, Russia

Organized by Institute of Informatics of the Tatarstan
Academy of Sciences, and Kazan State University

http://csr2010.antat.ru/


*** WE STRONGLY ADVICE TO REGISTER BEFORE MARCH 1 ***


CSR 2010 is the fifth conference in the series of regular
events spanning all areas of computer science. This year
it is mainly focused on its theoretical aspects.

The program of CSR 2010 consists of 30 contributed papers,
an opening lecture by
Alexander Razborov (University of Chicago and Steklov Mathematical Institute)
and 8 invited lectures by
Susanne Albers (Humboldt-Universität, Germany)
Fedor Fomin (University of Bergen, Norway)
Juraj Hromkovic (Federal Institute of Technology, Switzerland)
Richard Jozsa (University of Bristol and University of Cambridge)
Prabhakar Raghavan (Yahoo! Labs and Stanford University)
Miklos Santha (Université Paris Sud and National University of Singapore)
Uwe Schöning (Universität Ulm, Germany).

The list of accepted papers can be found at the conference web site.
The preliminary program is coming soon.

Two workshops in Kazan and one in Moscow
are organized in conjunction with CSR-2010.
Pre-conference Workshop on Program Semantics, Specification and Verification:
Theory and Applications (PSSV 2010) in Kazan will be held on June 14-15.

Post-conference Workshop on High Productivity Computations (HPC 2010) in Kazan
will be held on June 21-22. It is intended to organize the discussions
about high productivity computing means and models, including but not
limited to high performance and quantum information processing.

Note also that Franco-Russian Workshop "Complexity in algorithms,
dynamics and bioinformatics" is organized in Moscow on June 13-15;
one may find it convenient to attend before CSR-2010:
http://www.mccme.ru/~anromash/workshop/fr-alg-workshop.html
Regarding this one, please contact its organizers directly.

The main accomodation site is the hotel "Korston" which offers conference
discounts to participants (the number of rooms is limited, accomodation
requests will be considered on a first-come-first-served basis).

The early registration fee of 300 euros (150 euros for students) should
be paid before March 1, 2010 via bank transfer. The late registration fee
is 390 euros (240 euros for students). Participants registered after May 13
will be required to pay upon arrival. There are also reduced fees for
participants working in Russia.

To register for participation, please fill in the form at
http://csr2010.antat.ru/CSR2010RegistrationForm.pdf and send it to
info(at)antat.ru. If you plan to participate and need a *Russian visa*,
please contact the organizers before March 1 since it takes more than
a month just to issue the official invitation.

Symposium chair: Farid Ablayev (Kazan State University).

Further information and contacts:
Web: http://csr2010.antat.ru/
Email: csr2010.kazan(at)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/
*
**********************************************************

[DMANET] CP 2010: Call for Workshop Proposals

Call for Workshop Proposals

Sixteenth International Conference on Principles and Practice of
Constraint Programming

6-10 September, 2010

St. Andrews, Scotland


The CP 2010 Workshop Chair invites proposals for the Workshop Program.

CP 2010 workshops will provide an informal setting where workshop
participants will have the opportunity to discuss specific technical
topics in an atmosphere that facilitates the active exchange of
ideas. It is an opportunity to disseminate work in progress or to
promote new and emerging areas within the field of constraints. The
topics of the workshops can cover any area related to constraints and
any related cross-disciplinary areas.

All workshops will take place on 6 September, 2010 at the site of the
main conference. Workshops can be half-day or full-day. The internal
format of the workshop will be determined by the organisers of each
workshop.

Important Dates

March 16, 2010: Proposal submission deadline
March 30, 2010: Acceptance notification
April 20, 2010: Deadline for receipt of CFP and URL for workshop web
page
August 16, 2010: Deadline for workshop working notes
September 6, 2010: CP 2010 workshops

Proposal Submissions

Proposals for workshops should contain the following information:
- The title and a brief technical description of the workshop,
specifying the goals and the technical issues it will focus on.
- A brief discussion of why and to whom the workshop is of interest.
- A list of tentatively confirmed attendees, if available.
- A list of related workshops held within the last three years, if
any, and their relation to the proposed workshop.
- A list of workshops previously arranged by any members of the
proposed organising committee, if any.
- The names of the proposed organising committee. This committee
should consist of two or three people knowledgeable about the
technical issues to be addressed, preferably not coming from the same
institution.
- The name and email address of the main organiser.

Responsibilities of the Workshop Organisers

Each workshop main organiser will be responsible for:
- Producing a "Call for Papers" and a Web page for their workshop by
April 20, 2010. Please provide a web page/URL that can be linked into
the CP 2010 home page. The call must make it clear that the workshop
is open to all members of the CP community. It should also mention
that at least one author of each accepted submission must attend the
workshop, and that all workshop participants must pay the workshop
fee. Finally, it should also clearly describe the process by which
the organising committee will select the participants.
- Providing a brief description of the workshop for the conference
program.
- Selecting submitted papers.
- Scheduling workshop activities in collaboration with the local
organisers and the workshop chairs.
- Providing working notes to be duplicated for the workshop (up to a
maximum of 200 pages) by August 16, 2010.

Responsibilities of the CP 2010 Organising Committee

The CP 2010 organising committee will be responsible for the following:
- Providing publicity for the workshop series as a whole.
- Providing logistics support and a meeting place for the workshop.
- In conjunction with the organisers, determining the start and end
times of the workshop.
- Duplicating working notes as described above and distributing them
to the participants.

Submitting a Proposal

All proposals should be submitted by electronic mail (in ASCII), to
the Workshop Chair.

CP'10 Workshop Chair

Pedro Meseguer
IIIA - CSIC
pedro@iiia.csic.es

**********************************************************
*
* 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, February 5, 2010

[DMANET] CFP of The 2010 International Workshop on Intelligent Sensor and Wireless Networks (IntelNet 2010)

[Please accept our apologies if you receive multiple copies of this email]

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

CALL FOR PAPERS


The 2010 International Workshop on Intelligent Sensor and Wireless Networks (IntelNet 2010)


To be held in conjunction with CIT'10 (Supported by IEEE Computer
Society), June 29 - July 1, 2010, Bradford, UK

http://www.inf.brad.ac.uk/~xjin/IntelNet10/index.html
http://www.scim.brad.ac.uk/~ylwu/CIT2010/


SCOPE:

Modern sensor and wireless networks have been becoming more and more
large-scaled and complicated. Due to their rapidly increasing scale
and complexity, the management and maintenance of sensor and wireless
networks have posed many grand challenges to both industrial and
academic communication communities. To overcome these challenges, it
is very necessary to find new levels of autonomy and intelligence in
deploying, managing, and maintaining sensor and wireless networks.

The purpose of the 2010 International Workshop on Intelligent Sensor
and Wireless Networks (IntelNet 2010) is to bring together scientists,
researchers, professionals, and practitioners from both industry and
academia to exchange ideas, discuss solutions, share experiences, and
report state-of-the-art research results on various aspects of
intelligent sensor and wireless networks. The topics of interest
include, but are not limited to:

-- Advanced Technologies for Enabling Intelligent and Autonomic
Communications
-- Autonomy-Oriented Sensor/Wireless Networks
-- Biological, Social, and Economic Models for Intelligent Networks
-- Bio-Inspired Network Protocol Design
-- Bio-Inspired Network Services
-- Bio-Inspired Sensor/Wireless Networks
-- Characterization and Detection of Emergent Properties in Self-
Organizing Networks
-- Complex Dynamics of Autonomous Communication Networks
-- Experimental Case Studies and Testbeds of Intelligent Networks
-- Novel Design and Management Technologies for Autonomic Sensor/
Wireless Networks
-- Scalability and Complexity of Self-Organizing Communication
Networks
-- Self-Organization in Autonomic Communication Networks
-- Self-Organizing, Self-Adaptive and Self-Tuning Sensor/Wireless
Networks
-- Sensing, Monitoring, Evaluation, and Measurements of Intelligent
Networks
-- Stability and Dependability of Intelligent Sensor/Wireless
Networks
-- Tools and Techniques for Designing, Implementing, and Analyzing
Intelligent Sensor/Wireless Networks


STEERING COMMITTEE:

Duncan F. Gillies, Imperial College London, UK
Jiming Liu, Hong Kong Baptist University, Hong Kong
Ruqian Lu, Chinese Academy of Sciences, China
Geyong Min, University of Bradford, UK
Jie Wu, Temple University, USA

GENERAL CHAIR:

Xiaolong Jin
School of Informatics
University of Bradford
Bradford, BD7 1DP, U.K.
E-mail: x.jin@brad.ac.uk

PROGRAM CHAIRS:

Lei Liu
Department of Computing
University of Bradford
Bradford, BD7 1DP, U.K.
E-mail: l.liu6@brad.ac.uk

Hui Cheng
Department of Computer Science
University of Leicester
Leicester, LE1 7RH
U.K.
E-mail: hc118@le.ac.uk

PAPER SUBMISSION:

Authors are invited to submit manuscripts reporting original unpublished
research and recent developments in the topics related to the workshop.
The length of the papers should not exceed 6 pages + 2 pages for overlength
charges (IEEE Computer Society Proceedings Manuscripts style: two columns,
single-spaced), including figures and references, using 10 fonts, and
number each page. Papers should be submitted electronically in PDF format
by sending it as an e-mail attachment to Xiaolong Jin
(x.jin@bradford.ac.uk).
All papers will be peer reviewed and the comments will be provided to the
authors. The accepted papers will be published together with those of other
workshops by the IEEE Computer Society Press.

Distinguished papers, after further extensions, will be published
in CIT 2010's special issues of the following prestigious SCI-indexed
journals:

-- The Journal of Supercomputing - Springer
-- Journal of Computer and System Sciences - Elsevier
-- Concurrency and Computation: Practice and Experience - John Wiley & Sons


IMPORTANT DATES:

Submission Deadline: February 15, 2010
Author Notification: March 26, 2010
Final Manuscript Due: April 18, 2010
Registration Due: April 18, 2010
Conference Date: June 29 - July 1, 2010

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

**********************************************************
*
* 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] COCOON 2010 - CFP - Feb 15

###################################################################################
COCOON 2010 - Call for Paper
The 16th Annual International Computing and Combinatorics Conference
(COCOON 2010)

http://www.cise.ufl.edu/cocoon2010/

July 19 - July 21, 2010.
Sheraton Hotel, NhaTrang, Vietnam
###################################################################################

IMPORTANT DATES

* Submission Deadline: February 15, 2010
* Notification of acceptance: April 12, 2010
* Camera Ready / Registration: April 29, 2010
* Early Registration: May 17, 2010
* Conference Dates: July 19 - 21, 2010


SCOPE and MISSION

The 16th Annual International Computing and Combinatorics Conference
(COCOON 2010) will be held in Nha Trang, Vietnam during July 19 -- 21.
The conference organizers would like to extend their most cordial
invitation to researchers around the world to come to one of the most
beautiful countries in South East Asia, to explore its 4000-year-old
culture, to enjoy the beach scenery and to exchange their most
significant research works.

Original research works in the areas of algorithms, theory of
computation, computational complexity, and combinatorics related to
computing are solicited. In addition to theoretical studies,
submissions that report on experimental and applied research of
general algorithmic interest are especially encouraged.

Topics of interest (but not limited to)

* Algorithms and data structures;
* Algorithmic game theory and online algorithms;
* Automata, languages, logic, and computability;
* Combinatorics related to algorithms and complexity;
* Complexity theory;
* Computational learning theory and knowledge discovery;
* Cryptography, reliability and security, and database theory;
* Computational biology and bioinformatics ;
* Computational algebra, geometry, and number theory;
* Graph drawing and information visualization;
* Graph theory, communication networks, and optimization;
* Parallel and distributed computing;
* Experimental analysis of algorithms


Submitted manuscripts must be no longer than 10 pages long (including
figures, references, and appendices) and be formatted in standard LNCS
format (for LNCS templates, please refer to
http://www.springer.com/lncs).

The proceedings of the conference will be published by Springer-Verlag
in the Lecture Notes in Computer Science. High quality papers will be
invited to a special issue in Algorithmica and Journal of
Combinatorial Optimization.

Best Regards,

My T. Thai and Sartaj Sahni
TPC co-chairs

CISE Department
University of Florida
http://www.cise.ufl.edu/cocoon2010
**********************************************************
*
* 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/
*
**********************************************************

[STACS] Second Call for Participation

27th International Symposium on Theoretical Aspects of Computer Science

                  STACS 2010 - CALL FOR PARTICIPATION

                 MARCH 4-6, 2010, NANCY, FRANCE

                     http://stacs.loria.fr/

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

INVITED SPEAKERS
***********************
Mikolaj Bojanczyk, Warsaw University
Rolf Niedermeier, University of Jena
Jacques Stern, Ecole Normale Supérieure

PROGRAM
*************
http://stacs.loria.fr/program.html


PROGRAM COMMITTEE
***************************
Markus Bläser, Saarland University
Harry Buhrman, CWI, University of Amsterdam
Thomas Colcombet, CNRS, Paris 7 University
Anuj Dawar, University of Cambridge
Arnaud Durand, Paris 7 University
Sándor Fekete, Braunschweig University of Technology
Ralf Klasing, CNRS, Bordeaux University
Christian Knauer, Freie Universität of Berlin
Piotr Krysta, University of Liverpool
Sylvain Lombardy, Marne la Vallée University
Parthasarathy Madhusudan, University of Illinois
Jean-Yves Marion, Nancy University (co-chair)
Pierre McKenzie, Université de Montréal
Rasmus Pagh, IT University of Copenhagen
Boaz Patt-Shamir, Tel Aviv University
Christophe Paul, CNRS, Montpellier University
Georg Schnitger, Frankfurt University
Thomas Schwentick, TU Dortmund University (co-chair)
Helmut Seidl, TU Munich
Jirí Sgall, Charles University
Sebastiano Vigna, Università degli Studi di Milano
Paul Vitanyi, CWI, Amsterdam


CONTACT : stacs@loria.fr
*************************

[DMANET] CFP-- RP2010 -- REACHABILITY PROBLEMS

----------------------- Call for Papers ---------------------------------

4th WORKSHOP ON REACHABILITY PROBLEMS, RP'2010
(August 27-29, 2010, Masaryk University, Brno, Czech Republic)
co-located with MFCS & CSL 2010
http://www.csc.liv.ac.uk/~rp2010/

-------------------------------------------------------------------------
Deadline for submissions: April 21, 2010
Proceedings will be published in the

Springer LNCS series

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

The Workshop on Reachability Problems will be hosted by the
Faculty of Informatics, Masaryk University, Brno, Czech Republic
and will be co-located with Joint MFCS and CSL 2010. RP'10 is
the fourth in the series of workshops following three successful
meetings at Ecole Polytechnique, France in 2009 at University of
Liverpool, UK in 2008 and at Turku University, Finland in 2007.
Scope: The Reachability Workshop is specifically aimed at
gathering together scholars from diverse disciplines and backgrounds
interested in reachability problems that appear in
- Algebraic structures
- Computational models
- Hybrid systems
- Logic and Verification

Invited Speakers:

- Markus Holzer (Giessen University, Germany)
- Kim Guldstrand Larsen (Aalborg University, Denmark)
- Alexander Rabinovich (Tel Aviv University, Israel)
- Philippe Schnoebelen (ENS Cachan, France)

Important dates:

Submission: April 21, 2010
Notification: June 3, 2010
Final version: June 10, 2010
Conference dates: Aug. 27-29, 2010

Topics of interest:

Papers presenting original contributions related to reachability
problems in different computational models and systems are
being sought. Topics of interest include (but are not limited to):
Reachability for infinite state systems, rewriting systems;
Reachability analysis in counter/ timed/ cellular/ communicating
automata; Petri-Nets; computational aspects of semigroups,
groups and rings; Reachability in dynamical and hybrid systems;
frontiers between decidable and undecidable reachability
problems; complexity and decidability aspects; predictability
in iterative maps and new computational paradigms

The reachability problems are in the core of many questions
of computer science and mathematics. This topic covers
many aspects about the analysis of computational traces/paths
in classical and unconventional computational models, logic,
algebraic structures as well as in mathematical systems and
control theory. The classical reachability can be formulated as
follows: Given a computational system or model with a set of
allowed transformations (functions). Decide whether a certain
state of a system is reachable from a given initial state by a set
of allowed transformations. The same questions can be asked
not only about reachability of exact states of the system but
also about a set of states expressed in term of some property
as a parameterized reachability problem. Another set of
predictability questions can be seen in terms of reachability of
eligible traces of computations, their equivalence; unavoidability
of some dynamics and a possibility to avoid undesirable dynamic
using a limited control.

Proceedings

The Conference Proceedings will be published as the volume
of the Springer Verlag Lecture Notes in Computer Science
(LNCS) series www.springer.com/lncs<http://www.springer.com/lncs> and distributed at the
Conference. We plan also to publish selected papers in a special
issue of a high quality journal following the regular referee procedure.

Submissions:

Authors are invited to submit a draft of a full paper
with at most 12 pages (in LaTeX, formatted according
to LNCS guidelines) via the conference web page.
Proofs omitted due to space constraints must be put
into an appendix to be read by the program committee
members at their discretion.
Submissions deviating from these guidelines risk rejection.
Electronic submissions should be formatted in postscript
or pdf. Simultaneous submission to other conferences or
workshops with published proceedings is not allowed.

Organizing Committee:

- Antonin Kucera (Masaryk University)
- Igor Potapov (University of Liverpool)

Contact details: RP'2010
Faculty of Informatics, Masaryk University,
Emails: Antonin Kucera tony@fi.muni.cz<mailto:tony@fi.muni.cz>
Igor Potapov potapov@liverpool.ac.uk<mailto:potapov@liverpool.ac.uk>
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Thursday, February 4, 2010

[DMANET] EuroCG 2010 - Call for Participation

*** The registration server is open. Early registration until February
16 ***
*** The list of accepted papers is available online at http://2010.eurocg.org
***

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

26th European Workshop on Computational Geometry

http://2010.eurocg.org
March 22-24, 2010
Technische Universitaet Dortmund, Germany

Final Call for Papers

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

The 26th European Workshop on Computational Geometry (EuroCG'10) will
be held March 22-24, 2010, at the Technische Universitaet Dortmund
(Dortmund, Germany). EuroCG is renown as a friendly workshop, where
researchers across Europe and the world can meet and exchange ideas in
a delightful atmosphere.


TOPICS OF INTEREST

- discrete and combinatorial geometry and topology
- design and analysis of geometric algorithms and data structures
- implementation and experimental evaluation of geometric algorithms
- numerical and algebraic issues arising from implementations
- analysis of geometric configurations
- geometric modelling, visualization, and simulation
- combinatorial optimization
- computer-aided design and manufacturing
- structural molecular biology
- geographic information systems
- robotics and virtual worlds
- and other fields.


INVITED SPEAKERS

Timothy M. Chan, U Waterloo
Markus Gross, ETH Zurich and Disney Research Zurich
Janos Pach, EPFL Lausanne and Renyi Insitute Budapest


CONTACT

Jan Vahrenhold, Faculty of Computer Science, Computer Science XI,
Technische Universitaet Dortmund, 44221 Dortmund, Germany.

E-mail: jan (dot) vahrenhold (insert an @ here) cs.tu-dortmund.de
Phone: +49 (0) 231 755-7711
Fax: +49 (0) 231 755-7740

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

[DMANET] CFP: PASCO 2010 || July 21-23, 2010 - Grenoble, France

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

Parallel Symbolic Computation 2010 (PASCO 2010)

July 21-23, 2010 -- Grenoble, France

http://pasco2010.imag.fr/

C A L L f o r P A P E R S

Initial Announcement

Overview:

The International Workshop on Parallel and Symbolic Computation (PASCO)
is a series of workshops dedicated to the promotion and advancement of
parallel algorithms and software in all areas of symbolic mathematical
computation. The pervasive ubiquity of parallel architectures and memory
hierarchy has led to the emergence of a new quest for parallel
mathematical algorithms and software capable of exploiting the various
levels of parallelism: from hardware acceleration technologies (multicore
and multi-processor system on chip, GPGPU, FPGA) to cluster and global
computing platforms. To push up the limits of symbolic and algebraic
computations, beyond the optimization of the application itself, the
effective use of a large number of resources --memory and general
or specialized computing units-- is expected to enhance the performance
multi-criteria objectives: time, energy consumption, resource usage,
reliability. In this context, the design and the implementation of
mathematical algorithms with provable and adaptive performances is a
major challenge.

Earlier meetings in the PASCO series include PASCO'94 (Linz, Austria),
PASCO'97 (Maui, U.S.A.), PASCO'07 (London, Canada).
PASCO 2010 is affiliated with the 2010 International Symposium on Symbolic
and Algebraic Computation (ISSAC) in Munich, Germany. Immediately prior to
the ISSAC 2010 meeting, PASCO will be held in Grenoble, France.

The workshop PASCO 2010 will be a three-day event including invited
presentations and tutorials, contributed research papers and posters.
Specific topics include, but are not limited to:
* Design and analysis of parallel algorithms for computer algebra
* Practical parallel implementation of symbolic or symbolic-numeric
algorithms
* High-performance software tools and libraries for computer algebra
* Applications of high-performance computer algebra
* Distributed data-structures for computer algebra
* Hardware acceleration technologies (multi-cores, GPUs, FPGAs) applied
to computer algebra
* Cache complexity and cache-oblivious algorithms for computer algebra
* Compile-time and run-time techniques for automating optimization and
platform adaptation of computer algebra algorithms

Call for Papers:

The conference invites submission of papers presenting original research,
either in the form of extended abstracts (2 pages) or full papers (up to 10
pages) in ACM format. As in previous years, PASCO 2010 will publish formal
proceedings of the accepted papers.

Important Dates

Paper submission deadline: April 2 (Fri), 2010
Notification of acceptance: May 10 (Mon), 2010
Camera-ready version of paper due: May 28 (Fri), 2010
Tutorials and Workshop in Grenoble: July 21-23 (Wed-Fri), 2010


Conference Chairs:

Marc Moreno Maza (University of Western Ontario, Canada)
<moreno@csd.uwo.ca>
Jean-Louis Roch (Grenoble University, France)
<jlroch@imag.fr


Local Arrangements Chairs:

Jean-Guillaume Dumas (Grenoble University, France)
<jean-guillaume.dumas@imag.fr
Thierry Gautier (INRIA Grenoble, France)
<thierry.gautier@imag.fr>
Clement Pernet (Grenoble University, France)
<clement.pernet@imag.fr>

Publicity Chair:

Daniel Cordeiro (Grenoble University, France)
<daniel.cordeiro@imag.fr>

Administration:

Daniele Herzog (INRIA Grenoble, France)
<daniele.herzog@inrialpes.fr>
Christian Seguy (CNRS, France)
<christian.seguy@imag.fr>
Ahlem Zammit-Boubaker (INRIA Grenoble, France)
<ahlem.zammit-boubaker@inrialpes.fr>

Links:

PASCO 2010 http://pasco2010.imag.fr/
ISSAC 2010 http://www.issac-conference.org/2010/

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

[DMANET] CfP: Special issue on New Combinatorial Optimisation Models for Decision Making

CALL FOR PAPERS
(apologies for multiply received copies)

** Special Issue of International Journal of Applied Management Science
(IJAMS) **

Published by Inderscience Enterprises Ltd.
Cfp home page: http://www.inderscience.com/browse/callpaper.php?callID=1298

** Subject: New Combinatorial Optimisation Models for Decision Making **

Combinatorial optimisation problems are known for their high level of
complexity. Problems such as, but not limited to, the travelling
salesman problem, the multiple knapsack problem, or the generalised
assignment problem, have attracted the interest of many researchers for
many years. A plethora of different solution approaches have been used
in order to find the solution to such hard optimisation problems. Some
of these approaches include exact methods and algorithms from Operations
Research (OR), while other approaches include techniques like
meta-heuristics from other scientific fields such as Artificial
Intelligence (AI). Therefore, combinatorial optimisation models for
decision making in real life applications constitute a challenging
research area. The domain of applicability of combinatorial optimisation
problems is extraordinarily broad. Examples of applications area include
routing and scheduling, financial and industrial fields, and
telecommunications, to name but a few. The objective of this special
issue is to present modern applications of combinatorial optimisation
models to the decision making in management.

Suitable topics include, but are not limited to:

* Real life applications of combinatorial optimisation models
* Modelling of large scale combinatorial optimisation problems
* New modelling approaches for combinatorial optimisation problems
* Network flow models for decision making
* Evaluation of currently-used combinatorial optimisation models for
decision making
* Decision support systems featuring embedded combinatorial
optimisation techniques
* Combinatorial optimisation case studies in the fields of
management, finance, military and industry

We are particularly interested in new, real life combinatorial
optimisation models, large scale network flow models or improvements in
modelling techniques, regarding the decision making in management.

** Important Dates **

Submission deadline: 30 September 2010
Author notification - review comments: 20 December 2010
Second review cycle: 31 March 2011
Final manuscript due: 20 May 2011

** Guest Editors **

1) Dr. Angelo Sifaleras, Lecturer, University of Macedonia, Economic and
Social Sciences, Greece
2) Dr. Jason Papathanasiou, Lecturer, University of Macedonia, Economic
and Social Sciences, Greece
3) Professor Marc Demange, ESSEC Business School, Romania

** Notes for Prospective Authors **

Submitted papers should not have been previously published nor be
currently under consideration for publication elsewhere. (N.B.
Conference papers may only be submitted if the paper was not originally
copyrighted and if it has been completely re-written). All papers are
refereed through a peer review process. A guide for authors, sample
copies and other relevant information for submitting papers are
available on the Author Guidelines page
(http://www.inderscience.com/mapper.php?id=31), You may send one copy in
the form of an MS Word file attached to an e-mail (details in Author
Guidelines page) to the following:

Dr. Angelo Sifaleras
Department of Technology Management
University of Macedonia, Economic and Social Sciences
Loggou-Tourpali
Naousa 59200
Greece
Tel: +30 2310 891881
Fax: +30 2310 891825
Email: sifalera@uom.gr
Web: http://macedonia.uom.gr/~sifalera

Please include in your submission the title of the Special Issue, the
title of the Journal and the name of the Guest Editor.

**********************************************************
*
* 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, February 3, 2010

ICALP 2010: Submission Deadline: Feb 10, 2010

REMINDER: submission deadline Feb 10, 2010
______________________________________________________________________


                 CALL FOR PAPERS

                  ICALP 2010


 37th International Colloquium on Automata, Languages and Programming


                 July 5-12, 2010
                 Bordeaux, France


             http://icalp10.inria.fr/


Supported by the European Association for Theoretical Computer Science (EATCS)


______________________________________________________________________

Important Dates:
* Submission Deadline: Feb 10, 2010
* Author Notification: Apr 6, 2010
* Final Manuscript Due: Apr 27, 2010
______________________________________________________________________


The 37th International Colloquium on Automata, Languages and
Programming, the main conference and annual meeting of the European
Association for Theoretical Computer Science (EATCS), will take place
from the 5th to the 12th of July 2010 in Bordeaux, France. The main
conference will be preceded and followed by a series of
Workshops. Papers presenting original research on all aspects of
theoretical computer science are sought. Typical but not exclusive
topics of interest are:

______________________________________________________________________

Track A - Algorithms, Complexity and Games

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


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

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


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

Topics: Algorithmic Aspects of Networks * Auctions * Computing with
Incentives * E-commerce, Privacy, Spam * Formal Methods for Network
Information Management * Foundations of Trust and Reputation in
Networks * Internet Algorithmics * Mobile and Wireless Networks *
Models of Complex Networks * Models and Algorithms for Global
Computing * Models of Mobile Computation * Networks Economics *
Networks of Low Capability Devices * Overlay Networks and P2P Systems
* Social Networks * Specification, Semantics, Synchronization of
Networked Systems * Theory of Security in networks and Distributed
Computing * Web Searching, Ranking * Web Mining and Analysis

______________________________________________________________________

Invited Speakers:
* Pierre Fraigniaud (CNRS and Univ. Paris Diderot)
* Jean Goubault-Larrecq (ENS Cachan and LSV)
* Burkhard Monien (Univ. Paderborn)
* Joel Ouaknine, (Oxford Univ. Computing Lab.)
* Roger Wattenhofer (ETH Zurich)
* Emo Welzl (ETH Zurich)



______________________________________________________________________

Submission Guidelines:
Submissions should be made through the on-line submission site:
https://wiki.bordeaux.inria.fr/icalp10/index.php?n=Main.Submission

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

It is recommended that submissions adhere to the specified format and
length. Submissions that are clearly too long may be rejected
immediately. Additional material intended for the referee but not for
publication in the final version - for example details of proofs - may
be placed in a clearly marked appendix that is not included in the
page limit.



______________________________________________________________________

Conference Chairs:
* Cyril Gavoille, Univ. of Bordeaux (LaBRI) & INRIA, Bordeaux.
* Claude Kirchner, INRIA, Bordeaux.


Program Committees:

Track A. - Algorithms, Complexity and Games
* Dimitris Achlioptas, Univ. Santa Cruz
* Kwstis Daskalakis, MIT
* Anuj Dawar, Cambridge Univ.
* Xiaotie Deng, City Univ. Hong Kong
* Philippe Flajolet, INRIA
* Micelle Flammini, Univ. L\'Acquilla
* Oscar Ibarra, UCSB (Santa Barbara)
* Giuseppe Italiano, Univ. Roma 2
* Kazuo Iwama, Univ. Kyoto
* Klaus Jansen, Univ. Kiel
* Elias Koutsoupias, Univ. Athens
* Ludek Kucera, Charles Univ.
* Daniel Marx, Budapest Univ.
* Burkhard Monien, U Paderborn
* Amin Coja Oghlan, Univ. Edinburgh
* Tonyann Pitassi, Univ. Toronto
* John Reif, Duke Univ.
* Jose Rolim, Univ. Geneva
* Paul Spirakis, Univ. Patras and RACTI (PC Chair)
* Leslie Valiant, Harvard Univ.
* Emo Welzl, ETH
* Gerhard Woeginger, Univ. Eindhoven

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

* Samson Abramsky, Oxford Univ. (PC Chair)
* Luca Aceto, Univ. Rejkjavik
* Lars Birkedal, Univ. Copenhagen
* Mikolaj Bojanczyk, Univ. Warsaw
* Patricia Bouyer, CNRS, LSV Cachan
* Josée Desharnais, Univ. Laval
* Gilles Dowek, Ecole Polytechnique & INRIA
* Manfred Droste, Univ. Leipzig
* Peter Dybjer, Univ. Chalmers
* Jose Felix Costa, Univ. Lisbon
* Phokion Kolaitis, IBM Almaden
* Ugo Dal Lago, Univ. Bologna
* Daniel Leivant, Univ. Indiana
* Andrzej Murawski, Oxford Univ.
* Filip Murlak, Univ. Warsaw
* Flemming Nielsen, Univ. Copenhagen
* Dominique Perrin, Univ. Paris Est
* Alex Rabinovich, Univ. Tel Aviv
* Lutz Schroder, DFKI Bremen
* Ian Stark, Univ. Edinburgh

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

* Debora Donato, Yahoo! Research Barcelona
* Faith Ellen, Univ. Toronto
* Phil Gibbons, Intel Research Pittsburgh
* Rob van Glabbeek, Stanford Univ. and National ICT Australia
* Monika Henzinger, EPFL Lausanne
* Christos Kaklamanis, Univ. of Patras
* Fabian Kuhn, MIT
* Miroslaw Kutylowski, Wroclaw University of Technology
* Christian Lengauer, Univ. Passau
* Stefano Leonardi, Sapienza Univ. of Rome
* Friedhelm Meyer auf der Heide, Univ. Paderborn (PC chair)
* Dusko Pavlovic, Oxford Univ. and Kestrel Institute
* Andrzej Pelc, Univ. du Québec en Outaouais
* Giuseppe Persiano, Univ. Salerno
* Frank Pfenning, CMU
* Geppino Pucci, Univ. Padova
* Christian Scheideler, Univ. Paderborn
* Nir Shavit, Tel Aviv Univ.
* Berthold Vöcking, RWTH Aachen
* Gerhard Weikum, MPI-Saarbrücken



Workshops Chair:
* Ralf Klasing, CNRS & Univ. Bordeaux (LaBRI) & INRIA

Publicity Chairs:
* Nicolas Bonichon, Univ. Bordeaux (LaBRI) & INRIA
* Lionel Eyraud-Dubois, INRIA & Univ. Bordeaux (LaBRI)
* Frédéric Mazoit, Univ. Bordeaux (LaBRI)

Conference Secretariat:
* Laetitia Grimaldi, INRIA, Bordeaux


ICALP 2010 is organised by the INRIA Bordeaux - Sud-Ouest research
center in collaboration with the LaBRI, computer science laboratory of
CNRS and the University of Bordeaux.