Theory Announcements: October 2011

Monday, October 31, 2011

[DMANET] New versions of SCIP, SoPlex, and ZIMPL released

Dear all,

we are pleased to announce that version 2.1.0 of the ZIB Optimization
Suite has been released.

The ZIB Optimization Suite is a tool for generating and solving mixed
integer linear and nonlinear programs as well as more general constraint
integer programs.

It comprises the new versions SCIP 2.1.0, Soplex 1.6.0, and ZIMPL 3.2.0.
The new release provides many new features, including major extensions for
nonlinear CIP, improved branch-and-price support, and many performance
improvements and bug fixes.
It can be obtained via http://zibopt.zib.de. For detailed information and
documentation visit the project web sites
http://{scip,soplex,zimpl}.zib.de.

Best regards,
the SCIP, SoPlex, and ZIMPL team

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

SCIP 2.1.0: http://scip.zib.de/doc/html/RELEASENOTES.html
Soplex 1.6.0: http://soplex.zib.de/notes-160.txt
ZIMPL 3.2.0: http://zimpl.zib.de/download/CHANGELOG.txt
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] CFP: The 2nd IEEE Internacional Workshop of Smart Communication Protocols and Algorithms (IEEE SCPA 2012 - Summer)

Apologies for crossposting

-------------------- CALL FOR PAPERS -----------------

The 2nd IEEE Internacional Workshop of Smart Communication Protocols and Algorithms (IEEE SCPA 2012 - Summer)
June 10-15, 2012, Ottawa, CANADA
In conjunction with IEEE ICC 2012
http://scpa.it.ubi.pt/2012

Selected papers will be invited to the Special Issue on Smart Protocols and Algorithms of the International Journal Network Protocols and Algorithms (ISSN 1943-3581)

Communication protocols and algorithms are needed to communicate network devices and exchange data between them. The appearance of new technologies usually comes with a protocol procedure and communication rules that allows data communication while taking profit of this new technology. Recent advances in hardware and communication mediums allow proposing new rules, conventions and data structures which could be used by network devices to communicate across the network. Moreover, devices with higher processing capacity let us include more complex algorithms that can be used by the network device to enhance the communication procedure.

Smart communication protocols and algorithms make use of several methods and techniques (such as machine learning techniques, decision making techniques, knowledge representation, network management, network optimization, problem solution techniques, and so on), to communicate the network devices to transfer data between them. They can be used to perceive the network conditions, or the user behavior, in order to dynamically plan, adapt, decide, take the appropriate actions, and learn from the consequences of its actions. The algorithms can make use of the information gathered from the protocol in order to sense the environment, plan actions according to the input, take consciousness of what is happening in the environment, and take the appropriate decisions using a reasoning engine. Goals such as decide which scenario fits best its end-to-end purpose, or environment prediction, can be achieved with smart protocols and algorithms. Moreover, they could learn from the past and !
use this knowledge to improve futur
e decisions.

In this workshop, researchers are encouraged to submit papers focused on the design, development, analysis or optimization of smart communication protocols or algorithms at any communication layer. Algorithms and protocols based on artificial intelligence techniques for network management, network monitoring, quality of service enhancement, performance optimization and network secure are included in the workshop.

We welcome technical papers presenting analytical research, simulations, practical results, position papers addressing the pros and cons of specific proposals, and papers addressing the key problems and solutions. The topics suggested by the conference can be discussed in term of concepts, state of the art, standards, deployments, implementations, running experiments and applications.

Topics of interest:
Authors are invited to submit complete unpublished papers, which are not under review in any other conference or journal, including, but are not limited to, the following topic areas:
� Smart network protocols and algorithms for multimedia delivery
� Application layer, transport layer and network layer cognitive protocols
� Cognitive radio network protocols and algorithms
� Automatic protocols and algorithms for environment prediction.
� Algorithms and protocols to predict data network states.
� Intelligent synchronization techniques for network protocols and algorithms
� Smart protocols and algorithms for e-health
� Software applications for smart algorithms design and development.
� Dynamic protocols based on the perception of their performance
� Smart protocols and algorithms for Smartgrids
� Protocols and algorithms focused on building conclusions for taking the appropriate actions.
� Smart Automatic and self-autonomous ad-hoc and sensor networks.
� Artificial intelligence applied in protocols and algorithms for wireless, mobile and dynamic networks.
� Smart security protocols and algorithms
� Smart cryptographic algorithms for communication
� Artificial intelligence applied to power efficiency and energy saving protocols and algorithms
� Smart routing and switching protocols and algorithms
� Cognitive protocol and algorithm models for saving communication costs.
� Any kind of intelligent technique applied to QoS, content delivery, network Monitoring and network management.
� Smart collaborative protocols and algorithms
� Problem recognition and problem solving protocols
� Genetic algorithms, fuzzy logic and neural networks applied to communication protocols and algorithms

Important Dates
Submission Deadline: November 30, 2011
Acceptance Notification: February 10, 2012
Camera Ready Deadline: March 31, 2012

Submission guidelines:
All submissions must be full papers in PDF format and uploaded on EDAS (http://edas.info//N11477).
All submissions should be written in English with a maximum paper length of five (5) printed pages (10-point font) including figures without incurring additional page charges.

General Chairs
Jaime Lloret, Univ. Politecnica Valencia, Spain
Joel Rodrigues, Inst. of Telecommunications, Univ. of Beira Interior, Pt

TPC Chairs
Ivan Stojmenovic, University of Ottawa, Canada
Kai Lin, Dalian University of Technology, China

Poster Chairs
Binod Vaidya, University of Ottawa, Canada
Bin Wei, AT&T, USA

Industry Chairs
Haohong Wang, Cisco
Chi-Ming Chen, AT&T, USA

Keynote Chair
Mbaye B. Sene, Cheikh Anta Diop University, Dakar, Senegal

Publicity Chairs
Sandra Sendra, Univ. Politecnica Valencia, Spain
Alejandro Canovas, Univ. Politecnica Valencia, Spain

Web Chair
Miguel Garcia, Univ. Politecnica Valencia, Spain

Sunday, October 30, 2011

[DMANET] ISCO 2012: 2nd CFP

2nd International Symposium on Combinatorial Optimization (ISCO 2012)
April 19-21, 2012

Spring School
"Mathematical Programming and Design of Approximation Algorithms"
April 17-18, 2012

Athens University of Economics and Business,
Athens, Greece

http://isco12.cs.aueb.gr/
isco12@cs.aueb.gr

ISCO is a new biannual symposium with its first issue held in Hammamet,
Tunisia in March 2010. The symposium aims to bring together researchers from
all the communities related to combinatorial optimization, including
algorithms and complexity, mathematical programming and operations research.
It is intended to be a forum for presenting original research in these areas
and especially in their intersections. Quality papers on all aspects of
combinatorial optimization, from mathematical foundations and theory of
algorithms to computational studies and practical applications, are
solicited.

Spring School

ISCO 2012 will be preceded by a spring school on "Mathematical Programming
and Design of Approximation Algorithms". David Shmoys and David Williamson
will give 16 hours of lectures on April 17-18, 2012.

Invited Speakers

Giorgio Ausiello, Università di Roma "La Sapienza"
Christos Papadimitriou, UC Berkeley
George Nemhauser, Georgia Tech
Paolo Toth, Università di Bologna

Important Dates

Submissions deadline: December 1, 2011
Notification of authors: January 30, 2012
Early registration deadline: February 24, 2012
Spring School: April 17-18, 2012
Conference: April 19-21, 2012
Camera ready version: May 4, 2012

Submission - Publications

The submission deadline is Thursday December 1, 2011.
Paper submission will be handled only via Easychair:
https://www.easychair.org/conferences/?conf=isco2012

Papers presenting original unpublished results in all areas of combinatorial
optimization and its applications are welcome. Topics of interest include,
but are not limited to:
• Approximation algorithms
• Branch-and-bound algorithms
• Branch-and-cut-and-price algorithms
• Computational biology
• Computational complexity
• Computational geometry
• Constraint Programming
• Cutting plane algorithms
• Exact and parameterized algorithms
• Graph and network algorithms
• Interior point methods
• Linear and nonlinear integer programming
• Local search algorithms
• Metaheuristics
• On-line algorithms
• Polyhedral combinatorics
• Randomized algorithms
• Scheduling algorithms

There will be two types of submissions:

a) Regular papers

They should be of at most 12 pages, including front matter and bibliography,
in LNCS style (see http://www.springer.de/comp/lncs/authors.html). Proofs
omitted due to space constraints should be included in a clearly marked
appendix which will be taken into account by the program committee members
and the reviewers, but it will not be published in the proceedings.
Simultaneous submission to other conferences with published proceedings or
journals is not allowed.

Accepted regular papers will be published by Springer-Verlag in the Lecture
Notes in Computer Science (LNCS) series in a post-conference proceedings
volume. For a paper to be included in this volume, it should be presented at
the conference by one of the authors. The authors will have to prepare their
camera-ready version two weeks after the end of ISCO 2012.

b) Short papers

They should be of at most 4 pages (including front matter and bibliography)
with no optional appendix. Accepted short papers will be included in a
volume of local proceedings.

Special issues

Selected papers presented at the conference will be invited to special
issues devoted to the event that will be published in international
journals.

Program Committee

Mourad Baïou, Université Blaise Pascal, Clermont-Ferrand
Evripidis Bampis, Université Pierre et Marie Curie
Francisco Barahona, IBM T. J. Watson, New York
Walid Ben-Ameur, TELECOM SudParis
Jaroslaw Byrka, University of Wrocław
William Cook, Georgia Tech
Gerard Cornuéjols, CMU
Federico Della Croce, Politecnico di Torino
Josep Diaz, Universitat Politecnica de Catalunya
Bruno Escoffier, Université Paris Dauphine
Satoru Fujishige, Kyoto University
Eric Gourdin, Orange Labs, Paris
Luis Gouveia, University of Lisbon
Anupam Gupta, CMU
Mohamed Haouari, INSAT, Tunis
Brahim Hnich, Izmir University of Economics
Klaus Jansen, Christian-Albrechts-
Universität, Kiel
Stavros Kolliopoulos, NKUA, Athens
Jochen Könemann, University of Waterloo
Andrea Lodi, Università di Bologna
Nelson Maculan, Universidade Federal do Rio de Janeiro
A. Ridha Mahjoub, Université Paris Dauphine (co-chair)
Alberto Marchetti-Spaccamela, Università di Roma "La Sapienza"
Vangelis Markakis, AUEB, Athens
Tom McCormick, University of British Columbia
Ioannis Milis, AUEB, Athens (co-chair)
Jérôme Monnot, Université Paris Dauphine
Vangelis Paschos, Université Paris Dauphine
Gerhard Reinelt, Universität Heidelberg
Giovanni Rinaldi, IASI-CNR, Roma
Amin Saberi, Stanford University
François Vanderbeck, Université Bordeaux 1
Peter Widmayer, ETH, Zürich
Gerhard Woeginger, Eindhoven University of Technology
Hande Yaman, Bilkent University, Ankara
Vassilis Zissimopoulos, NKUA, Athens

Organizing Committee

Christos Amanatidis, AUEB,
Katerina Kinta, Université Paris Dauphine
Anna Klouvatou, RC-AUEB, Athens
Giorgio Lucarelli, Université Paris Dauphine
A. Ridha Mahjoub, Université Paris Dauphine
Vangelis Markakis, AUEB, Athens
Ioannis Milis, AUEB, Athens
Vangelis Paschos, Université Paris Dauphine
Georgios Zois, AUEB, Athens
**********************************************************
*
* 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, October 29, 2011

[DMANET] Deadline Extension: ICAS 2012 || March 25-29, 2012 - St. Maarten, The Netherlands Antilles

INVITATION:

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

Please, consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results to ICAS 2012.

The submission deadline is extended to November 16, 2011.

In addition, authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org

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

============== ICAS 2012 | Call for Papers ===============

CALL FOR PAPERS, TUTORIALS, PANELS

ICAS 2012, The Eighth International Conference on Autonomic and Autonomous Systems

March 25-29, 2012 - St. Maarten, The Netherlands Antilles

General page: http://www.iaria.org/conferences2012/ICAS12.html

Call for Papers: http://www.iaria.org/conferences2012/CfPICAS12.html

- regular papers
- short papers (work in progress)
- posters
- ideas

Submission page: http://www.iaria.org/conferences2012/SubmitICAS12.html

Submission deadline: November 16, 2011

Announcement and Call for Papers: GTORA 2012

----------------------------------
Announcement and Call for Papers:
----------------------------------

We are organizing the International Conference on Game Theory, Operations
Research and their Applications (GTORA 2012) to be held during January 5-7,
2012, preceded by a Workshop on Game Theory, during January 3-4, 2012,
at the Indian Statistical Institute, Chennai Centre, India.

Our conference website is:
http://www.isichennai.com/gtora2012/index.html

Our brochure and poster are downloadable from the website.

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

Authors are invited to submit unpublished work on topics including but not
limited to:
- Algorithmic Game Theory
- Non-cooperative Games
- Cooperative Games
- Stochastic Games
- Evolutionary Games
- Solution Concepts in Game Theory
- Congestion, Routing and Network Design
- Game Theory and Logic
- Mathematical Programming
- Markov Decision Processes
- Numerical Methods in Game Theory
- Applications of Game Theory and OR in areas including
o Supply Chain Management
o Neuroscience and
o Networks (Communication and Social Networks)

Submission of extended abstracts is via EasyChair:
https://www.easychair.org/conferences/?conf=gtora2012

Selected papers will be considered for publication in a special issue of the
journal "International Game Theory Review" (IGTR).

The list of invited speakers, Program Committee and further details can be
found on our website:

http://www.isichennai.com/gtora2012/index.html

Email: gtora2012[AT]gmail[DOT]com

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

Friday, October 28, 2011

CMCS 2012: second call for papers

[- Please note submission deadline January 4 2011 -]

------------------------------------------------------------------------------
CMCS 2012 second call for papers
------------------------------------------------------------------------------

The 11th International Workshop on Coalgebraic Methods in Computer Science
31 March - 1 April 2012, Tallinn, Estonia
(co-located with ETAPS 2012)
www.coalg.org/cmcs12

*** Proceedings to be published in Springer LNCS ***

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

In more than a decade of research, it has been established that a wide
variety of state-based dynamical systems, like transition systems,
automata (including weighted and probabilistic variants), Markov
chains, and game-based systems, can be treated uniformly as
coalgebras. Coalgebra has developed into a field of its own interest
presenting a deep mathematical foundation, a growing field of
applications, and interactions with various other fields such as
reactive and interactive system theory, object-oriented and concurrent
programming, formal system specification, modal and description
logics, artificial intelligence, dynamical systems, control systems,
category theory, algebra, analysis, etc. The aim of the CMCS workshop
series is to bring together researchers with a common interest in the
theory of coalgebras, their logics, and their applications.

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 semantic 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).

Keynote Speaker
---------------

Samson Abramsky, Oxford University, UK

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

Marcello Bonsangue, Leiden University, The Netherlands
Pawel Sobocinski, University of Southampton, UK

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

Submission is electronic via the easychair system at

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

following the submission guidelines below. We solicit two types of
contributions:

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

They must have a length no greater than 20 pages, formatted in LNCS
style (http://www.springer.de/comp/lncs/authors.html). They must
contain original contributions, be clearly written, and include
appropriate reference to and comparison with related work.

(b) Short contributions:

These will not be published in the proceedings but will be bundled in
a technical report. They should be no more than two pages in LNCS
format 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.

Proceedings Publication
-----------------------

The proceedings of CMCS 2012 will be published in Springer Lecture
Notes in Computer Science. The final proceedings will be published
post-conference and feature revised versions of the accepted regular
papers. Preliminary proceedings will be made available at the
conference in electronic form.

Depending on the number and quality of submissions, we will consider
publishing extended and revised papers as a journal special issue,
subject to the usual reviewing procedure. Previous special issues of
CMCS have appeared in high-ranking journals including Information and
Computation and Theoretical Computer Science.

Important dates
---------------

( for regular papers )
* 4 January 2012: submission deadline (strict)
* 3 February 2012: author notification
* 7 February 2012: final version

( for short contributions )
* 27 February 2012: submission deadline (strict)
* 6 March 2010: author notification

( workshop )
* 31 March - 1 April 2012

Programme Committee
-------------------

Luis Barbosa, University of Minho, Braga, Portugal
Filippo Bonchi, LIP ENS-Lyon, France
Josee Desharnais, Université Laval, Canada
Mai Gehrke, Radboud University Nijmegen, The Netherlands
H. Peter Gumm, University of Marburg, Germany
Ichiro Hasuo, University of Tokyo, Japan
Patricia Johann, University of Strathclyde, Glasgow, Scotland, UK
Ekaterina Komendantskaya, University of Dundee, Scotland, UK
Dexter Kozen, Cornell University, Ithaca, NY, USA
Dorel Lucanu, Alexandru Ioan Cuza University, Iasi, Romania
Stefan Milius, Technical University of Braunschweig, Germany
Larry Moss, Indiana University, Bloomington, USA
Prakash Panangaden, McGill University, Montreal, Canada
Dirk Pattinson, Imperial College London, UK (co-chair)
Dusko Pavlovic, Royal Holloway, London, UK
Daniela Petrisan, University of Leicester, UK
Grigore Rosu, University of Illinois at Urbana-Champaign, USA
Jan Rutten, CWI and Radboud University Nijmegen, The Netherlands
Luigi Santocanale, University of Provence, Marseille, France
Lutz Schröder, DFKI GmbH, Bremen, Germany (co-chair)
Alexandra Silva, CWI, Amsterdam, The Netherlands
Ana Sokolova, University of Salzburg, Austria
Sam Staton, University of Cambridge, UK
Yde Venema, University of Amsterdam, The Netherlands

Steering Committee
------------------

[DMANET] CMCS 2012: second call for papers

[- Please note submission deadline January 4 2011 -]

------------------------------------------------------------------------------
CMCS 2012 second call for papers
------------------------------------------------------------------------------

The 11th International Workshop on Coalgebraic Methods in Computer Science
31 March - 1 April 2012, Tallinn, Estonia
(co-located with ETAPS 2012)
www.coalg.org/cmcs12

*** Proceedings to be published in Springer LNCS ***

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

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

Keynote Speaker
---------------

Samson Abramsky, Oxford University, UK

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

Marcello Bonsangue, Leiden University, The Netherlands
Pawel Sobocinski, University of Southampton, UK

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

Submission is electronic via the easychair system at

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

following the submission guidelines below. We solicit two types of
contributions:

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

(b) Short contributions:

Proceedings Publication
-----------------------

Important dates
---------------

( for regular papers )
* 4 January 2012: submission deadline (strict)
* 3 February 2012: author notification
* 7 February 2012: final version

( for short contributions )
* 27 February 2012: submission deadline (strict)
* 6 March 2010: author notification

( workshop )
* 31 March - 1 April 2012

Programme Committee
-------------------

Steering Committee
------------------

Jiri Adamek, Technical University of Braunschweig, Germany
Corina Cirstea, University of Southampton, UK
H. Peter Gumm (chair), University of Marburg, Germany
Bart Jacobs, Radboud University Nijmegen, The Netherlands
Alexander Kurz, University of Leicester, UK
Marina Lenisa, University of Udine, Italy
Ugo Montanari, University of Pisa, Italy
Larry Moss, Indiana University, Bloomington, USA
Dirk Pattinson, Imperial College London, UK
John Power, University of Bath, UK
Horst Reichel, Technical University of Dresden, Germany
Jan Rutten, CWI and Radboud University Nijmegen, The Netherlands
Lutz Schröder, DFKI GmbH and University of Bremen, 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/
*
**********************************************************

CfP: 25th International Workshop on Description Logics (DL 2012)

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

CALL FOR PAPERS

25th International Workshop on Description Logics (DL 2012)

Rome, Italy, June 7-10, 2012

Co-located with KR 2012, NMR 2012, AI*IA 2012

http://dl.kr.org/dl2012

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

The DL workshop is the major annual event of the description logic
research community. It is the forum at which those interested in
description logics, both from academia and industry, meet to discuss
ideas, share information and compare experiences.

The workshop will be held in the conference rooms of Sapienza
Università di Roma (Via Caserta 6, Rome), from June 7th to June 10th,
2012.

In this year, DL workshop will share a joint session together with the
International Workshop on Non-Monotonic Reasoning (NMR 2012).

IMPORTANT DATES

Paper submission deadline: March 10, 2012
Notification of acceptance: April 22, 2012
Camera ready papers due: May 4, 2012
Workshop: June 7-10, 2012

WORKSHOP SCOPE

We invite contributions on all aspects of description logics,such as:

* foundations of description logics, including expressive power,
decidability and complexity of reasoning, novel inference problems,
and reasoning techniques for solving these problems;
* extensions of description logics, including, but not limited to,
closed-world and non-monotonic reasoning, defaults, epistemic
reasoning, temporal and spatial reasoning, procedural knowledge, and
query languages;
* integration of description logics with other formalisms, such as
object-oriented representation languages, database query languages,
constraint-based programming, logic programming, and rule-based
systems;
* use of description logics in applications or areas such as ontology
engineering, ontology languages, databases, semi-structured data,
document management, natural language, learning, planning, semantic
web, and grid computing;
* building systems based on description logics, with special emphasis on
optimization and implementation techniques; and
* tools that exploit description logic reasoning, such as ontology
editors, database schema design, query optimization, and data
integration tools.

INVITED SPEAKERS

* Serge Abiteboul, Collège de France, INRIA & ENS Cachan, France
* Piero Bonatti, Università degli Studi di Napoli Federico II, Italy
* Alan Rector, University of Manchester, U.K.

ORGANIZATION

* Domenico Lembo, Sapienza Università di Roma, Italy (Workshop Chair)
* Yevgeny Kazakov, University of Ulm, Germany (Program co-Chair)
* Frank Wolter, University of Liverpool, U.K. (Program co-Chair)

RESOURCES

* Information about submission, registration, travel information, etc.,
is available on the DL 2012 homepage: http://dl.kr.org/dl2012
* Enquiries about the DL 2012 workshop can be made by contacting the
organizing committee: dl2012@dis.uniroma1.org
* The official Description Logic home page is at http://dl.kr.org/

Thursday, October 27, 2011

[DMANET] =?iso-8859-1?Q?VII_Discrete_Math_Summer_School_(Valpara=EDso, _Chile), _Sec?= ond call

Dear colleagues:

Please find below the call for applications to our seventh summer school
in discrete mathematics. (Warning: one course in Spanish)

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

VII Discrete Math Summer School (Valparaíso, Chile)
January 16-20, 2012.

http://www.discretas2012.cmm.uchile.cl/

--------------------------------------------------------------------
Target audience:

The school is meant for graduate students and advanced undergraduates in
Mathematics, Computer Science or Engineering, interested in algorithms,
combinatorics, optimization, or game theory.

---------------------------------------------------------------------
Courses:

* Networks and markets, by Nicole Immorlica (Northwestern U.)
* Matching under preferences (in Spanish), by Julian Mestre (U of
Sydney)(in spanish)
* Colouring via the probabilistic method, by Bruce Reed (McGill U.)

--------------------------------------------------------------------
Location:

Instituto de Sistemas Complejos de Valparaíso (http://www.iscv.cl/).

----------------------------------------------------------------------
Deadline for applications:

For non-residents in Chile: November 4, 2011.
For residents in Chile: November 25, 2011.

-----------------------------------------------------------------------
Registration Fees: USD 30

There is a limited number of fellowships available to cover registration
and local accommodation.

-----------------------------------------------------------------------
Organizing Committee:

José Correa, Universidad de Chile
Nicolás Figueroa, Pontificia U. Católica de Chile
Marcos Kiwi (Chair), U. de Chile
Bernardo Pagnoncelli, U. Adolfo Ibáñez
José Zamora, U. Andrés Bello

-----------------------------------------------------------------------
Websites of previous School versions:
http://www.dim.uchile.cl/~redes/escuela06.htm
http://www.dim.uchile.cl/~redes/escuela2007.htm
http://www.dim.uchile.cl/~redes/escuela2008.htm
http://www.discretas2009.cmm.uchile.cl/
http://www.discretas2010.cmm.uchile.cl/
http://www.discretas2011.cmm.uchile.cl/

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

Jose Zamora
Depto. de Matematicas
Universidad Andres Bello

**********************************************************
*
* 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 collaboration with Google

Object: Call for Proposal for Google Focused Grant Program on Mathematical Optimization and Combinatorial Optimization in Europe.
Deadline: November 25th (strict).
Contact: proposal should be sent to both Laurent Perron (lperron@google.com) and Michel Benard (benard@google.com).
Format: A proposal is a 3 pages document following the format described in http://research.google.com/university/relations/research_awards.html

The purpose of this program is to facilitate more interaction between Google and academia and also nurture stronger relations and partnerships with universities. The intent of this focused awards program is to support academic research aimed at improving the theory and applications of mathematical and combinatorial optimization (Operations Research, Constraint Programming, Meta-Heuristics). Google funds Research Awards unrestricted and retains no intellectual property from the research. We prefer if the results from the research are open sourced and widely published. Awards through this program are for one year in the range of $10K-$150K.
A typical grant will cover 1 Post-Doctoral student for 1 year. This program is restricted to Europe.

Areas that are of particular interest include (but are not limited to):

* Inference and relaxation methods: constraint propagation, cutting planes, global constraints, graph algorithms, dynamic programming, Lagrangean and convex relaxations, counting based inferences and heuristics, constraint relaxation based heuristics.

* Search methods: branch and bound, intelligent backtracking, incomplete search, randomized search, column generation and other decomposition methods, local search, meta-heuristics, large scale parallelism.

* Integration methods: static/dynamic problem decomposition, solver communication, transformations between models and solvers, collaboration between concurrent methods, models, and solvers.

* Modeling methods: comparison of models, symmetry breaking, uncertainty, dominance relationships, model compilation into different technologies (CP, LP, etc.), learning (CP, LP) models from examples.

* Innovative applications derived from OR techniques.

As a point of comparison, last year, we funded 9 grants in the following fields: Explanations in Constraint Programming, SAT techniques in Scheduling, Just-In-Time scheduling, Complex Bin-Packing, Parallel Resources in Scheduling, Convex Integer Programming, Ride sharing, Large Scale Mixed Integer Programming, and Territory Design.

Google values well written proposals that fit into the 3 page format + references. These proposals should include the following sections:
- A clear description of the problem the authors are trying to solve, and the potential impact they could have if the research is successful.
- An overview of the state of the art in this field and an explanation of why the proposed research is innovative.
- A precise understanding on how the authors are going to solve this problem.
- A convincing experimental method that will prove the authors are solving the real problem on realistic data instances, and that will measure the actual gains.
- The biography and a link to recent publications from the P.I. related to the proposal.

Finally, receiving a Google Research Award does not grant access to Google data. In some instances Google researchers may however be interested in collaborating on the problem formulation and the algorithmic solution.
______________________
Prof. Andrea Lodi
DEIS, University of Bologna
Viale Risorgimento 2
40136 Bologna, Italy
phone: +39 051 2093029
fax: +39 051 2093073
e-mail: andrea.lodi@unibo.it

[DMANET] CFP: Springer PPNA SI on M2M Communications, submission due by Nov. 15

Peer-to-Peer Networking and Applications (SCIE indexed)
Special Issue Call for Papers
The Green, Reliability and Security of Machine-to-Machine Communications

Machine-to-machine communications is an emerging technology that
realizes a system of networks, wireless or wired, possibly distributed
across the world, for transmitting events captured by low-end machines
such as sensors and smart meters to high-end applications and/or
personal appliances, where the events are translated into meaningful
information. It embraces several major research fields including
wireless sensor networks, vehicular networks, smart grid and RFID, and
enables future ubiquitous computing environment. Unlike current
world-scale human-centric 3G wireless networks, M2M communication
network is characterized by the absence of direct human intervention and
the rapid increase in size and is therefore imposed with unique
requirements.

With ever-decreasing cost of deployment of M2M communication devices and
access to public wireless data networks, and thanks to its potential to
support a large number of ubiquitous characteristics and achieving
better cost efficiency, M2M communications has quickly become a market-
changing force for a wide variety of real-time monitoring applications,
such as remote e-healthcare, smart homes, utility management,
environmental monitoring and industrial automation. However, the
flourishing of M2M communications still hinges on fully understanding
and managing the existing GRS challenges: Green (i.e., energy
efficiency), Reliability and Security.

The objective of this special issue is to bring together state-
of-the-art contributions on the GRS aspects of M2M communications. It
aims to provide an environment conducive of cross-fertilization between
researchers from different areas spanning wireless sensor networks,
vehicular networks, smart grid and RFID, all relevant, in one way or
another to the advance and realization of M2M communication paradigm.
Original, unpublished contributions are solicited in ALL aspects of M2M
communications.

Possible topics of interest include, but are certainly not limited to
the following:
* GRS in wireless sensor, actuator and robot networks
* GRS in vehicular networks and intelligent transportation systems
* GRS in smart grid
* GRS in RFID technologies
* GRS in interworking for M2M communication
* GRS modeling for M2M communication
* GRS in emerging M2M applications

IMPORTANT DATES
* Paper submission deadline: November 15, 2011
* Notification to authors:   March 1, 2012
* Revisions:                 April 15, 2012
* Data of Publication:       2012

PAPER SUBMISSION
Authors are encouraged to submit high-quality, original work that has
neither appeared in, nor under consideration by, other journals.
Springer offers authors, editors and reviewers of Peer-to-Peer
Networking and Applications a web-enabled online manuscript submission
and review system. Our online system offers authors the ability to track
the review process of their manuscript. This online system offers easy
and straightforward long-in and submission procedures, and supports a
wide range of submission file formats. Manuscripts should be submitted
to: http://PPNA.edmgr.com. Choose "The GRS of M2M Communications" as the
article type.

To avoid delays, authors of submissions that, in the opinion of the
editors, fall out of scope of this issue will be notified promptly.

GUEST EDITORS
Dr. Xu Li, INRIA Lille – Nord Europe, France
Dr. Xiaodong Lin, University of Ontario Institute of Technology, Canada
Dr. Nathalie Mitton, INRIA Lille – Nord Europe, France
Dr. Wenye Wang, North Carolina State University, USA
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Book "Scientific Visualization: Interactions, Features, Metaphors", edited by Hans Hagen, published open access (Dagstuhl Follow-Ups, Vol.2)

= Book Announcement =

Title: Scientific Visualization: Interactions, Features, Metaphors
Editor: Hans Hagen
Series: DFU (Dagstuhl Follow-Ups)
Volume: 2
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl Publishing
Publication Date: October, 2011
ISBN: 978-3-939897-26-2

== Open Access ==

Accessible online and free of charge at

http://www.dagstuhl.de/dagpub/978-3-939897-26-2
http://www.dblp.org/db/conf/dagstuhl/P11009.html

== About the book ==

The Schloss Dagstuhl seminars on Scientific Visualization provide a dynamic
setting for ongoing and future research in visualization. Numerous contributions
in this active field originated at Schloss Dagstuhl, and were extended to
large-scale collaborative research and high-impact works. This volume of the
Dagstuhl Follow-Ups series contains the proceedings from the 2009 seminar (see
http://www.dagstuhl.de/09251).

Emphasizing the heterogeneity of this research field, the Dagstuhl Seminar
Scientific Visualization in 2009 focused on a wide range of visualization topics
such as "Knowledge Assisted Visualization", "Visual Exploration Environment",
"Biomedical Visualization", and "Visualization of Vector- and Tensorfields".

In the course of the seminar, leading international scientists presented state
of-the-art summaries as well as novel research results and ideas. Among the
discussed key topics were:
- Interaction Techniques/Frameworks
- Feature Definition and Extraction/Reconstruction
- Visualization Metaphors

See also:
* Frontmatter incl. table of contents and preface:
http://dx.doi.org/10.4230/DFU.Vol2.SciViz.2011.i
* CompleteVolume-PDF (28 MB):
http://drops.dagstuhl.de/opus/volltexte/dfu-complete/dfu-vol2-complete.pdf

== About the Dagstuhl Follow-Ups Series ==

The Dagstuhl Follow-Ups (DFU) series is a publication format which offers
a frame for the publication of peer-reviewed paper collections based on Dagstuhl
Seminars. DFU volumes are published according to the principle of OpenAccess,
i.e., they are available online and free of charge.

--
Dr. Marc Herbstritt
Schloss Dagstuhl - Leibniz Center for Informatics
\\\/ Dagstuhl Publishing | Editorial Office
Email: publishing@dagstuhl.de
http://www.dagstuhl.de/dagpub
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Wednesday, October 26, 2011

[DMANET] CFP: DAM Special Issue CTW 2011

CALL FOR PAPERS:

Special Issue DAM: CTW 2011
10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization
---
Deadline: *November 30, 2011*. (Extensions may be obtained upon request,
if necessary.)
---

Following the tradition of previous workshops, a special issue of
Discrete Applied Mathematics will be devoted to the 10th Cologne-Twente
Workshop on Graphs and Combinatorial Optimization
(http://ctw2011.dia.uniroma3.it).

All interested researchers are invited to contribute to this special
volume. The topics should relate to the themes of the workshop (graphs,
combinatorial optimization and the design and analysis of algorithms).
Submissions of contributions not presented at the workshop are also welcome.

All articles will be thoroughly refereed according to the high standards
of Discrete Applied Mathematics.

The full papers must be submitted through the Elsevier Editorial
System (http://ees.elsevier.com/dam). When submitting your paper, be
sure to specify that the paper is a contribution for the Special Issue
of CTW 2011, so that your paper is assigned to the guest editors.

Looking forward to your contribution,

The guest editors

Ulrich Faigle (Mathematisches Institut, Universität zu Köln)
faigle@zpr.uni-koeln.de

Gaia Nicosia (Dip. Informatica e Automazione, Università di Roma Tre)
nicosia@dia.uniroma3.it

Andrea Pacifici (Dip. Informatica, Sistemi e Produzione, Università di
Roma "Tor Vergata")
pacifici@disp.uniroma2.it
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Tuesday, October 25, 2011

[DMANET] Call for faculty positions in Computer Science

The Escuela de Informatica y Telecomunicaciones at Universidad Diego
Portales in Santiago, Chile, is requesting applications to an academic
position at the level of associate/assistant professor.

Requirements:

- The candidate should hold a doctoral degree, or be within six months
of graduation, with a major field of expertise in computer science.
Preference will be given to applicants with research experience in
machine learning or software architecture.
- Interest in teaching at undergraduate and graduate levels.
- Capability for developing a research area in an autonomous manner.
- Availability not later than March 2012.

We offer a good work environment and competitive salary according to
the applicant's qualifications and experience.

For confidential consideration submit before november 15, by email, a
letter of application, current Curriculum Vitae, reprints of one to
three recent publications, and two references (name, position and
email address of referee) to: postulacion.ingenieria@mail.udp.cl

Best regards,

Luciano Ahumada
Escuela de Informatica y Telecomunicaciones
Universidad Diego Portales
Santiago - Chile
http://eit.udp.cl
**********************************************************
*
* 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] Deadline Extension: INTENSIVE 2012 || March 25-29, 2012 - St. Maarten, The Netherlands Antilles

INVITATION:

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

Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results to INTENSIVE 2012.

The submission deadline is extended to November 16, 2011.

In addition, authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org

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

============== INTENSIVE 2012 | Call for Papers ===============

CALL FOR PAPERS, TUTORIALS, PANELS

INTENSIVE 2012, The Fourth International Conference on Resource Intensive Applications and Services

March 25-29, 2012 - St. Maarten, The Netherlands Antilles

General page: http://www.iaria.org/conferences2012/INTENSIVE12.html

Call for Papers: http://www.iaria.org/conferences2012/CfPINTENSIVE12.html

- regular papers
- short papers (work in progress)
- posters
- ideas

Submission page: http://www.iaria.org/conferences2012/SubmitINTENSIVE12.html

Submission deadline: November 16, 2011

Sponsored by IARIA, www.iaria.org

Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org

Please, note the Poster and Work in Progress options.

The topics suggested by the conference can be discussed in term of concepts, state of the art, research, standards, implementations, running experiments, applications, and industrial case studies. Authors are invited to submit complete unpublished papers, which are not under review in any other conference or journal in the following, but not limited to, topic areas.

All tracks are open to both research and industry contributions, in terms of Regular papers, Posters, Work in progress, Technical/marketing/business presentations, Demos, Tutorials, and Panels.

Before submission, please check and conform with the Editorial rules: http://www.iaria.org/editorialrules.html

INTENSIVE 2012 Topics (topics and submission details: see CfP on the site)

Basics on RIAS (Resource Intensive Applications and Services)
Fundamentals on RIAS; Heuristics for relaxing RIAS; Optimization on RIAS; Coordinated checkpointing and rollback in RIAS; Approximation approach in RIAS; Suboptimal solutions in RIAS; Distribution RIAS; Pervasive parallelism RIAS

Basic algorithms for RIAS
Fundamental algorithms for massive data; Specialized algorithms for grapics, statistics, bio-databases; Load-balancing and cache algoritms; Hierarchical algorithms; Streaming algorithms; Sublinear algorithms; Quick convergence algorithms; Algorithms for synchronization intensive processes; Algorithms for very high speed sustainability;

Communications intensive
Transaction RIAS; Bandwidth RIAS; Traffic RIAS; Broadcast and multicast RIAS; Propagation RIAS; Stream media intensive

Process intensive
Resource RIAS; Computation RIAS; Memory RIAS; Data acquisition RIAS; Data compression RIAS; Replication intensive RIAS; Storage RIAS; Access RIAS; Image processing RIAS

Data-intensive computing
Computing platforms; Collaborative sharing and datasets analysis; Large data streams; Data-processing pipelines; Data warehouses; Data centers; Data-driven society and economy

Operational intensive
Cryptography RIAS; Intrusion prevention RIAS; Deep packet inspection RIAS; Reconfiguration RIAS; Load-balancing RIAS; Buffering & cashing RIAS; Performance RIAS

Cloud-computing intensiveness
Infrastructure-as-a-service; Software-as-a-service [SaaS applicaitions]; Platform-as-service; On-demand computing models; Cloud computing programming and application development; Cloud SLAs, scalability, privacy, security, ownership and reliability issues; Power-efficiency and Cloud computing; Load balancing; Business models and pricing policies; Custom platforms, on-premise, private clouds; Managing applications in the clouds; Content and service distribution in Cloud computing infrastructures; Migration of Legacy Applications

User intensive
User interaction RIAS; Multi-user RIAS; User-adaptation RIAS

Technology intensive
Mobility RIAS; High-speed RIAS; Intensive real-time decoding

Control intensive
Message RIAS; Monitoring RIAS; Power consumption RIAS; Hardware for RIAS; Software for RIAS; Middleware for RIAS; Threat containment RIAS

Complex RIAS
Bioinformatics computation; Large scale ehealth systems; Pharmaceutical/drug computation; Weather forecast computation; Earthquake simulations; Geo-spatial simulations; Spatial programs; Real-time manufacturing systems; Transportation systems; Avionic systems; Economic/financial systems; Electric-power systems

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

[DMANET] Special Issue of Algorithmica on "Algorithms & DataStructures for Selection, Identification and Encoding"

CALL FOR PAPERS
Special Issue of Algorithmica on:
"Algorithms and Data Structures for selection, identification and encoding -
Group testing, compressed sensing, multi access communication and more"

Manuscripts are solicited for a special issue in the international journal ALGORITHMICA on "Algorithms and Data Structures for selection, identification and encoding - Group testing, compressed sensing, multi access communication and more"

Theoretical and practical studies in group testing, compressed sensing and in a broader sense combinatorial identification are attracting increasing interest in the areas of Theoretical Computer Science, Computational Biology, Combinatorial Optimization, Multi-access Communications and Distributed Computing.

With this Special Issue, we wish to foster research in group testing and compressed sensing, and their many different facets, by exposing new results and directions for further research and to contribute to the development of further scientific links with this flourishing area of investigation.

Papers presenting use of group testing and selection primitives in pattern matching, data structures for static membership, communication protocols, cryptographic protocols, streaming computation, bioinformatics and computational biology, compressed sensing as well as papers focussing on theoretical aspects of combinatorial structures for identification and coding, like randomness extractors, superimposed codes, list-decodable codes, selectors, and the like are welcome.

Submissions must be received by December 31, 2011. To ensure that all manuscripts are correctly identified for inclusion into the special issue, it is important that authors select "SI: Group Testing & Compressed Sensing" when they reach the step in the submission process.

Papers will be refereed according to the standards of Algorithmica. We will do our best to have the refereeing procedure timely finished.

Please contact the guest editors for additional information.

The Guest Editors
Ferdinando Cicalese and Ely Porat

Ferdinando Cicalese,
Department of Computer Science
University of Salerno, Italy
cicalese@dia.unisa.it

Ely Porat,
Department of Computer Science
Bar Ilan University, Israel
porately@gmail.com

[DMANET] PPSN 2012: CALL FOR WORKSHOP PROPOSALS

PPSN 2012: CALL FOR WORKSHOP PROPOSALS
======================================

12th International Conference on Parallel Problem Solving From Nature
(PPSN2012)
September 1-5, 2012 Taormina, Italy

http://www.dmi.unict.it/ppsn2012/
http://www.dmi.unict.it/ppsn2012/call_for_workshops

IMPORTANT DATES

Submission due: November 15, 2011
Notification of acceptance: December 15, 2011
Conference: September 1-5, 2012

SCOPE

The PPSN2012 Organising Committee invites proposals for workshops to be
held in conjunction with PPSN 2012. The workshops are intended to be
forums to present and discuss new approaches, visions, or critical
reflections within a subfield. They provide an excellent opportunity to
meet people with similar interests, to be exposed to cutting-edge
research and to exchange ideas in an informal setting.

The organizers of an accepted workshop are responsible for its
coordination, for its publicity (e.g., for sending out call for
papers/abstracts), for collecting and reviewing the papers/abstracts,
and for maintaining a webpage providing a list of accepted talks. The
workshops can be half day or a full day long. The format can be decided
by the organizers who are encouraged to plan interactive sessions. We
suggest not to ask for full papers, but rather for concept papers or
abstracts of not more than a few pages length. All workshops will be
held during one day (Saturday, September 1st, 2012).

SUBMISSION DETAILS

Prospective workshop organizers are invited to submit a plain text
workshop proposal by email to: WCppsn2012@dmi.unict.it

The proposal should include:
- title of the workshop
- brief description of the workshop topics
- potential target participants and audience
- rough estimate of the number of participants
- rough estimate of the number of talks
- contact details and a short CV of the organizer(s)

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

[DMANET] "Sustainable Transport Planning" Stream at EURO XXV

**Apologies for cross-postings.**

Call for Abstracts for the "Sustainable Transport Planning" Stream at EURO XXV

Co-organisers: Bülent Çatay, Sabanci University (catay "at" sabanciuniv.edu) and Tolga Bektas, University of Southampton (t.bektas "at" soton.ac.uk)

Transportation and logistics are part of today's most important economic activities as they remain to be vital tools for businesses to remain competitive. However, the ever growing volume of activity generated by both passenger and freight transportation is a source of concern as it is likely to hinder the environmental, economic and social sustainability of transport activities. The Sustainable Transport Planning stream at EURO XXV calls for abstracts describing models, tools, techniques and methodologies for achieving sustainable ways of planning transport operations, in application domains such as:

*   city logistics,
*   intelligent transportation systems,
*   intermodal transportation,
*   network design and planning,
*   passenger transportation,
*   reverse logistics,
*   green logistics,
*   road, rail, air and maritime freight operations,
*   supply chain management,
*   terminal operations management and planning,
*   vehicle routing and scheduling.

Contributors are requested to contact the stream organisers first for the submission (invitation) code and then submit their abstracts via the Conference web page (www.euro-2012.lt) by February 29, 2012. The abstracts must be written in English and contain no more than 600 characters (no formulas or mathematical notations are allowed). Please note that each participant is allowed to present one paper at the Conference. The EURO XXV Conference will be held in Vilnius, Lithuania from 8-11 July, 2012.

[DMANET] Reminder CFP: NIPS 2011 Workshop on Discrete Optimization in Machine Learning (DISCML)

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

Call for Papers

3rd Workshop on
Discrete Optimization in Machine Learning (DISCML):
Uncertainty, Generalization and Feedback

at the
25th Annual Conference on Neural Information Processing Systems
(NIPS 2011)

http://www.discml.cc

Submission Deadline: Friday 11/11/11, 11:11

===================================================================
- We apologize for multiple postings -

Solving optimization problems with ultimately discretely solutions is
becoming increasingly important in machine learning: At the core of
statistical machine learning is to infer conclusions from data, and when
the variables underlying the data are discrete, both the tasks of
inferring the model from data, as well as performing predictions using
the estimated model are discrete optimization problems. This workshop
aims at exploring discrete structures relevant to machine learning and
techniques relevant to solving discrete learning problems. The focus of
this year's workshop is on the interplay between discrete optimization
and machine learning: How can we solve inference problems arising in
machine learning using discrete optimization? How can one solve discrete
optimization problems that themselves are learned from training data?
How can we solve challenging sequential and adaptive discrete
optimization problems where we have the opportunity to incorporate
feedback? We will also explore applications of such approaches.

We would like to encourage high quality submissions of short papers
relevant to the workshop topics. Accepted papers will be presented as
spotlight talks and posters. Of particular interest are new algorithms
with theoretical guarantees, as well as applications of discrete
optimization to machine learning problems in areas such as
the following:

Combinatorial algorithms

•Submodular & supermodular optimization
•Discrete convex analysis
•Pseudo-boolean optimization
•Randomized / approximation algorithms

Continuous relaxations

•Sparse approximation& compressive sensing
•Regularization techniques
•Structured sparsity models

Learning in discrete domains

•Online learning / bandit optimization
•Generalization in discrete optimization
•Adaptive / stochastic optimization

Applications

•Graphical model inference& structure learning
•Clustering
•Feature selection, active learning& experimental design
•Structured prediction
•Novel discrete optimization problems in ML, Computer
Vision, NLP, ...

Submission deadline: November 11, 2011

Length& Format: max. 6 pages NIPS 2011 format

Time& Location: December 16/17 2011, Sierra Nevada, Spain

Submission instructions: Email tosubmit@discml.cc

Invited talks by

•Jack Edmonds
•Nicolo Cesa-Bianchi
•Francis Bach
•Pushmeet Kohli

Organizers:
Andreas Krause (ETH Zurich, Switzerland),
Pradeep Ravikumar (University of Texas, Austin),
Jeff A. Bilmes (University of Washington),
Stefanie Jegelka (Max Planck Institute for Intelligent Systems, Germany)

Monday, October 24, 2011

CSR 2012: First Call for Papers

Dear Colleagues,

Please find below the First Call for Papers for CSR-2012.

We apologize for multiple copies.

Best regards,
Edward Hirsch

UNSUBSCRIPTION: If you do not wish to receive any news
regarding CSR conferences, please reply to this mail
and I will remove you from the mailing list.

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

First Call for Papers

7th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM IN RUSSIA (CSR 2012)

July 3-7, 2012, Nizhni Novgorod, Russia

http://agora.guru.ru/display.php?conf=csr2012

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

CSR 2012 intends to reflect the broad scope of international cooperation in
computer science. It is the seventh conference in a series of regular events
previously held in St.Petersburg (2006), Ekaterinburg (2007), Moscow (2008),
Novosibirsk (2009), Kazan (2010), and St.Petersburg (2011). The proceedings
are published in Springer LNCS.

IMPORTANT DATES

Deadline for submissions: December 11, 2011
Notification of acceptance: February 17, 2012
Conference dates: July 3-7, 2012

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

VENUE

Nizhni Novgorod was founded by Prince Yuri (George) Vsevolodovich in 1221
on the confluence of two great Russian rivers, Volga and Oka.
It is a large city accessible by multiple international airlines
including regular Lufthansa flights from Frankfurt.

TOPICS include, but are not limited to:

* algorithms and data structures
* automata and formal languages
* combinatorial optimization
* constraint solving
* computational complexity
* cryptography
* combinatorics in computer science
* 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

INVITED SPEAKERS include

* Lev Beklemishev (MI RAS)
* Mikolaj Bojanzcyk (Warsaw)
* Julien Cassaigne (Marseille)
* Jaroslav Nesetril (Prague)
* Pavel Pevzner (UCSD and SPbAU RAS)

TURING LECTURE connected to the THE ALAN TURING YEAR 2012 will be given by

* Yuri Matiyasevich (PDMI RAS)

PROGRAM COMMITTEE

* Lev Afraimovich (Nizhni Novgorod)
* Susanne Albers (Berlin)
* Andris Ambainis (Riga)
* Alberto Bertoni (Milan)
* Bruno Durand (Marseille)
* Edward A. Hirsch (PDMI RAS)
* Juraj Hromkovic (ETH Zurich)
* Kazuo Iwama (Kyoto)
* Juhani Karhumaki (Turku, chair)
* Markus Lohrey (Leipzig)
* Ernst Mayr (Munich)
* Ilya Mironov (Microsoft Research)
* Anca Muscholl (Bordeaux)
* Alexander Okhotin (Turku)
* Alexander Razborov (Chicago)
* Wojcieh Rytter (Warsaw)
* Jiri Sgall (Prague)
* Alexander Shen (Moscow)
* Arseny Shur (Ekaterinburg)
* Wofgang Thomas (Aachen)
* Nikolai Vereshchagin (Moscow)
* Mikhail Vyalyi (CC RAS)
* Gerhard Woeginger (Eindhoven)

ORGANIZERS

N.I.Lobachevsky State University of Nizhni Novgorod

CONFERENCE CHAIR

Michail Prilutskii (UNN)

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),
in English; instructions can be found at
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.

Submissions should be uploaded to the EasyChair Conference system:
http://www.easychair.org/conferences/?conf=csr2012

FURTHER INFORMATION AND CONTACTS

Web: http://agora.guru.ru/display.php?conf=csr2012
Email: csr2012.conf at gmail.com

Special Issue of Algorithmica on "Algorithms & DataStructures for Selection, Identification and Encoding"

CALL FOR PAPERS
Special Issue of Algorithmica on:
"Algorithms and Data Structures for selection, identification and encoding -
Group testing, compressed sensing, multi access communication and more"

Manuscripts are solicited for a special issue in the international journal ALGORITHMICA on
"Algorithms and Data Structures for selection, identification and encoding - Group testing,
compressed sensing, multi access communication and more"

Theoretical and practical studies in group testing, compressed sensing and in a broader sense
combinatorial identification are attracting increasing interest in the areas of Theoretical Computer
Science, Computational Biology, Combinatorial Optimization, Multi-access Communications and
Distributed Computing.

With this Special Issue, we wish to foster research in group testing and compressed sensing, and
their many different facets, by exposing new results and directions for further research and to
contribute to the development of further scientific links with this flourishing area of investigation.

Papers presenting use of group testing and selection primitives in pattern matching, data
structures for static membership, communication protocols, cryptographic protocols, streaming
computation, bioinformatics and computational biology, compressed sensing as well as papers
focussing on theoretical aspects of combinatorial structures for identification and coding, like
randomness extractors, superimposed codes, list-decodable codes, selectors, and the like are
welcome.

Submissions must be received by December 31, 2011. To ensure that all manuscripts are correctly
identified for inclusion into the special issue, it is important that authors select "SI: Group Testing
& Compressed Sensing" when they reach the step in the submission process.

Papers will be refereed according to the standards of Algorithmica. We will do our best to have the
refereeing procedure timely finished.

Please contact the guest editors for additional information.

The Guest Editors
Ferdinando Cicalese and Ely Porat

Ferdinando Cicalese,
Department of Computer Science
University of Salerno, Italy
cicalese@dia.unisa.it

Ely Porat,
Department of Computer Science
Bar Ilan University, Israel
porately@gmail.com

[DMANET] [NPA] CFP: International Journal "Network Protocols and Algorithms"

********************* Call for Papers Vol 3, Issue 3 *********************

Network Protocols and Algorithms

ISSN 1943-3581

http://www.macrothink.org/journal/index.php/npa/

Network Protocols and Algorithms is a free-access online international journal, peer-reviewed and published by Macrothink Institute. It publishes papers focused on the design, development, manage, optimize or monitoring any type of network protocol, communication system, algorithm for communication and any protocol and algorithm to communicate network devices.

The scope of the journal include, but are not limited to, the following topic areas:

- Synchronization Protocols and Algorithms
- Security Protocols and Algorithms
- QoS Protocols and Algorithms
- Ad-Hoc and Sensor Networks Protocols and Algorithms
- Content Delivery Networks Protocols and Algorithms
- P2P Protocols and Algorithms
- Cluster-Based Protocols and Algorithms
- Real-Time Protocols and Algorithms
- Wireless Protocols and Algorithms
- MAC Protocols and Algorithms for Wired Networks
- Mobile wireless internet protocols and algorithms
- Delay Tolerant protocols and algorithms
- Mesh network protocols and algorithms
- Protocols and algorithms for Voice over IP delivery
- Cognitive Radio Network Protocols and Algorithms
- Monitoring and management protocols and algorithms
- optical networking protocols and algorithms
- Scalable Network Protocols and Algorithms
- Protocols and algorithms for Green Computing and Resource Allocation
- Routing Protocols and Algorithms
- Tree-based Protocols and Algorithms
- Distributed/Decentralized Algorithms for Networks
- Fault tolerant Protocols and Algorithms
- Protocols and algorithms for Mobile and Dynamic Networks
- Cross-Layer Collaborative Protocols and Algorithms
- Formal methods and cryptographic algorithms for communication
- Power Efficient and Energy Saving Network Protocols and Algorithms
- Multimedia Network Protocols and Algorithms
- Network Protocols and Algorithms for Context-Aware and Semantic Networks
- Localized Network Protocols and Algorithms
- Transport Layer Protocols
- Smart Grids protocols and algorithms

Network Protocols and Algorithms has linked its papers to references by DOI (Digital Object Identifier) numbers.

Network Protocols and Algorithms appears in the next search engines: Google Scholar, Bing, Yahoo and Ask.

Network Protocols and Algorithms is added and indexed in Index Copernicus, ProQuest, EBSCO, Ulrichsweb.com, Directory of Open Access Journals (DOAJ), Open J-Gate, Gale, Socolar, io-port Database, NewJour - Electronic Journals and Newsletters, Public Knowledge Project metadata harvester, Ovid LinkSolver, Genamics JournalSeek and PublicationsList.org. It is also requested to be included in other major Indexing Databases.

You are welcome to submit a paper or forward this call for papers to any people working in Network Protocols and Algorithms that may be interested in submitting a paper.

The topics suggested by the journal can be discussed in term of concepts, state of the art, standards, implementations, running experiments and applications. Proposals and deployments are also welcome.

Submission Information:
Only original and unpublished research papers will be considered in this journal. Manuscripts must be writen in English. All submissions will be reviewed based on technical merit and relevance. Instructions for authors and submissions can be found in http://www.macrothink.org/journal/index.php/npa/about/submissions

Jaime Lloret Mauri
Editor in Chief of the International Journal of Network Protocols and Algorithms
Department of Communications
Polytechnic University of Valencia, Spain
**********************************************************
*
* 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/
*
**********************************************************

[NPA] CFP: International Journal "Network Protocols and Algorithms"

********************* Call for Papers Vol 3, Issue 3 *********************

Network Protocols and Algorithms

ISSN 1943-3581

http://www.macrothink.org/journal/index.php/npa/

The scope of the journal include, but are not limited to, the following topic areas:

Network Protocols and Algorithms has linked its papers to references by DOI (Digital Object Identifier) numbers.

Network Protocols and Algorithms appears in the next search engines: Google Scholar, Bing, Yahoo and Ask.

You are welcome to submit a paper or forward this call for papers to any people working in Network Protocols and Algorithms that may be interested in submitting a paper.

Jaime Lloret Mauri
Editor in Chief of the International Journal of Network Protocols and Algorithms
Department of Communications
Polytechnic University of Valencia, Spain

Theory Announcements

Monday, October 31, 2011

[DMANET] New versions of SCIP, SoPlex, and ZIMPL released

[DMANET] CFP: The 2nd IEEE Internacional Workshop of Smart Communication Protocols and Algorithms (IEEE SCPA 2012 - Summer)

Sunday, October 30, 2011

[DMANET] ISCO 2012: 2nd CFP

Saturday, October 29, 2011

[DMANET] Deadline Extension: ICAS 2012 || March 25-29, 2012 - St. Maarten, The Netherlands Antilles

Announcement and Call for Papers: GTORA 2012

Friday, October 28, 2011

CMCS 2012: second call for papers

[DMANET] CMCS 2012: second call for papers

CfP: 25th International Workshop on Description Logics (DL 2012)

Thursday, October 27, 2011

[DMANET] =?iso-8859-1?Q?VII_Discrete_Math_Summer_School_(Valpara=EDso, _Chile), _Sec?= ond call

[DMANET] call for collaboration with Google

[DMANET] CFP: Springer PPNA SI on M2M Communications, submission due by Nov. 15

[DMANET] Book "Scientific Visualization: Interactions, Features, Metaphors", edited by Hans Hagen, published open access (Dagstuhl Follow-Ups, Vol.2)

Wednesday, October 26, 2011

[DMANET] CFP: DAM Special Issue CTW 2011

Tuesday, October 25, 2011

[DMANET] Call for faculty positions in Computer Science

[DMANET] Deadline Extension: INTENSIVE 2012 || March 25-29, 2012 - St. Maarten, The Netherlands Antilles

[DMANET] Special Issue of Algorithmica on "Algorithms & DataStructures for Selection, Identification and Encoding"

[DMANET] PPSN 2012: CALL FOR WORKSHOP PROPOSALS

[DMANET] "Sustainable Transport Planning" Stream at EURO XXV

[DMANET] Reminder CFP: NIPS 2011 Workshop on Discrete Optimization in Machine Learning (DISCML)

Monday, October 24, 2011

CSR 2012: First Call for Papers

Special Issue of Algorithmica on "Algorithms & DataStructures for Selection, Identification and Encoding"

[DMANET] [NPA] CFP: International Journal "Network Protocols and Algorithms"

[NPA] CFP: International Journal "Network Protocols and Algorithms"

Mailing Lists

Search This Blog

Blog Archive

Monday, October 31, 2011

Sunday, October 30, 2011

Saturday, October 29, 2011

Friday, October 28, 2011

Thursday, October 27, 2011

Wednesday, October 26, 2011

Tuesday, October 25, 2011

Monday, October 24, 2011

Mailing Lists

Subscribe To

Search This Blog

Blog Archive