*** Apologies for multiple copies due to cross-posting ***
*** Please forward to colleagues who might be interested
***
===========================================================
PETRI NETS 2013 34th International Conference on
Application and Theory of Petri Nets and Concurrency
Milano, Italy, June 24-28, 2013 Additional information
about the conference will be published via
http://www.mc3.disco.unimib.it/petrinets2013/ Contact
e-mail: petrinets2013@disco.unimib.it Important Dates
--------------------------------------------------------
Submission of Papers: January 10, 2013 (*) Submission of
Tutorial Proposals: January 10, 2013 Notification: March
1, 2013 Final Version Due: April 1, 2013 Participation in
Tool Exhibition: June 1, 2013 Workshops & Tutorials: June
24-25, 2013 Conference: June 26-28, 2013 (*) The
deadline for submission of papers is STRICT. However, if
you submit the TITLE PAGE by January 10 it is sufficient
to submit the FULL PAPER by January 15. Some of the best
papers accepted for the conference will be invited as
submissions to a special issue of the Fundamenta
Informaticae journal. The 34th annual international
Petri Net conference will be organised by the Department
of Computer Science, Systems and Communication (DISCo),
University of Milano - Bicocca. The conference takes
place under the auspices of the EATCS, and GI SIG "Petri
Nets and Related System Models". The language of the
conference is English, and its proceedings will be
published by Springer-Verlag in Lecture Notes in Computer
Science. All accepted papers will be considered for the
"Outstanding Paper" award(s). Papers presenting original
research on application or theory of Petri nets, as well
as contributions addressing topics relevant to the
general field of distributed and concurrent systems are
sought. Topics
--------------------------------------------------------
Topics specific to Petri Nets - System design using
nets - Analysis and synthesis, structure and behaviour of
nets - Relationships between Petri Nets and other
approaches - Net-based semantical, logical and algebraic
calculi - Symbolic net representation (graphical or
textual) - Computer tools for nets - Experience with
using nets, case studies - Higher-level net models -
Timed and stochastic nets - Standardisation of nets -
Experience reports describing applications of nets to
different kinds of systems and application fields,
e.g.: - flexible manufacturing systems - office
automation - real-time systems - workflows
- embedded systems - supervisory control -
defence systems - protocols and networks -
biological systems - Internet - health and
medical systems - e-commerce and trading -
environmental systems - programming languages -
hardware - performance evaluation -
telecommunications - operations research -
railway networks General topics related to concurrency
- Model checking and verification of distributed systems
- Verification of infinite-state or parametric systems -
Causality/partial order theory of concurrency -
Educational issues related to concurrency - New issues
and developments in the theory of concurrency - Modelling
of hardware and biological systems Paper Submissions
--------------------------------------------------------
Two kinds of papers can be submitted: - regular papers
(max 20 pages) describing original results pertaining to
the development of the theory of Petri Nets and
distributed and concurrent systems in general, new
results extending the applicability of Petri Nets, or
case studies, application and experience reports pertinent
to the practical use of Petri Nets and concurrency. For
papers describing the experiences from applications of
Petri Nets, authors are encouraged to consult the
document: ApplicationFormat.pdf (available at
www.informatik.uni-hamburg.de/TGI/sc-info/docs/ApplicationFormat.pdf).
- tool papers (max 10 pages) describing a computer tool
based on Petri Nets (not an application of the tool or
the theory behind the tool). For more information,
please see the document: ToolFormat.pdf (available at
www.informatik.uni-hamburg.de/TGI/sc-info/docs/ToolFormat.pdf).
The tool should be available for use by other groups
(but not necessarily for free). The submission should
indicate how the reviewers can get access to the tool
(this must be for free). The tool will be demonstrated
in the Tool Exhibition, in addition to being presented
in a conference talk. Submitted papers must: - be
contributions that have neither already been published nor
are simultaneously being considered for publication in
a peer-reviewed forum; - clearly state the problem being
addressed, the goal of the work, the results achieved,
and the relation to other work; - be in English and in
the Springer LNCS-format:
http://www.springer.de/comp/lncs/authors.html; -
adhere to the page limit for the relevant category (see
above); - be sent electronically (as a PDF file) no later
than the above mentioned deadlines using the website
http://www.easychair.org/conferences/?conf=petrinets2013.
The title page must: - contain a short abstract and a
classification of the topics covered, preferably using
the list of topics above; - clearly indicate whether the
paper is submitted as a regular paper or tool paper.
Authors will be notified about the outcome of the
evaluation procedure by March 1, 2013. Submissions
violating the above requirements may be immediately
rejected by the PC Chairs. Tool Exhibition
--------------------------------------------------------
An exhibition of Petri net tools takes place on
Wednesday. It consists of informal demonstrations for
small groups/individuals, and there are no scheduled
talks. Requests for participation in the tool exhibition
must be sent to the Tool Exhibition Chair before June 1,
2013. They should include a link to the web pages for the
tool (or a short description of the tool). The
demonstrators bring their own machines, while the
organisers may be requested to give access to the
Internet. Workshops and Tutorials
--------------------------------------------------------
The conference takes place from Wednesday to Friday. The
days before the conference also offer a wide range of
activities. The Petri Net Course takes place from Sunday
to Tuesday. It offers a thorough introduction to Petri
Nets and consists of four parts: Basic Net Classes,
Coloured Petri Nets, Timed and Stochastic Petri Nets, and
Applications of Petri Nets. If all four parts are
followed, 3 ECTS credit points can be awarded to a
participant. For further information please contact Jetty
Kleijn (kleijn@liacs.nl) or Joerg Desel
(joerg.desel@fernuni-hagen.de). The Workshops and
Advanced Tutorials take place on Monday and Tuesday. A
detailed description of the tutorials and workshops will
be available via the conference web pages. The following
workshops are scheduled for 2013: * Petri Nets and
Software Engineering (PNSE'13) * Biological Processes &
Petri Nets (BioPPN) * Models of Objects, Organizations,
Components, Agents, Artefacts and Services in Business
Environments (MOCASBE) In addition there will a Model
Checking contest: * Petri Net Model Checking Contest The
submission deadline for workshops is March 22, 2013. It
is also possible to arrange Meetings and Courses related
to Petri Nets. Submissions for such activities, as well as
for Advanced Tutorials, must contain a 2-5 page
description. They must be received by the PC-chairs no
later than January 10, 2013. Organisation
================================ Steering Committee
--------------------------------------------------------
W. van der Aalst, The Netherlands J. Billington, Australia
G. Ciardo, USA J. Desel, Germany S. Donatelli, Italy S.
Haddad, France K. Hiraishi, Japan K. Jensen, Denmark J.
Kleijn, The Netherlands F. Kordon, France M. Koutny, UK
(chair) C. Lin, China W. Penczek, Poland L. Pomello, Italy
W. Reisig, Germany G. Rozenberg, The Netherlands M. Silva,
Spain A. Valmari, Finland A. Yakovlev, UK Program
Committee Co-Chairs
--------------------------------------------------------
José Manuel Colom, Spain Joerg Desel, Germany Workshop
and Tutorial Co-Chairs
--------------------------------------------------------
Serge Haddad, France Alex Yakovlev, UK Organising
Committee Chair
--------------------------------------------------------
Lucia Pomello, Italy Tools Exhibition Chair
--------------------------------------------------------
Luca Bernardinello, Italy Publicity Chairs
--------------------------------------------------------
Luca Bernardinello, Italy Lucia Pomello, Italy Program
Committee
--------------------------------------------------------
H. Alla, France M. Beccuti, Italy J. Billington, Australia
J. Carmona, Spain G. Ciardo, USA J.M. Colom, Spain
(co-chair) P. Darondeau, France J. Desel, Germany
(co-chair) R. Devillers, Belgium Z. Duan, China J.
Esparza, Germany M.P. Fanti, Italy L. Gomes, Portugal S.
Haddad, France H. Hansen, Singapore K. Hiraishi, Japan V.
Khomenko, UK E. Kindler, Denmark H. Klaudel, France J.
Kleijn, The Netherlands R. Lazic, UK C. Lin, China N.
Lohmann, Germany I. Lomazova, Russia A. Miner, USA L.
Pomello, Italy W. Reisig, Germany C. Seatzu, Italy C.
Stahl, The Netherlands S. Taoka, Japan A. Valmari, Finland
M. Westergaard, The Netherlands
--
Luca Bernardinello
Università degli studi di Milano - Bicocca
Dipartimento di informatica, sistemistica e comunicazione
viale Sarca 336, I-20126 Milano (Italia)
Monday, December 31, 2012
Saturday, December 29, 2012
[DMANET] SPECIAL ISSUE ON VARIABLE NEIGHBORHOOD SEARCH
Dear colleagues,
I would appreciate if you could distribute this announcement of change
in
the dealine through your
mail list.
Best wishes and Merry Christmas,
Emilio Carrizosa
******************************************************
SPECIAL ISSUE ON VARIABLE NEIGHBORHOOD SEARCH
******************************************************
DEADLINE EXTENDED TO 31.01.13
******************************************************
JOURNAL OF GLOBAL OPTIMIZATION
2011 Impact Factor 1.196
******************************************************
Variable Neighborhood Search (VNS) is a metaheuristic which has shown
to
be very successful for solving hard combinatorial and global
optimization
problems.
During the EURO Mini-Conference on VNS took place in Herceg Novi,
Montenegro, October 4th-7th 2012, researchers all around the world
presented their most recent findings on VNS, either from a
methodological
viewpoint or as applications to real world problems.
Authors of papers presented at the EURO Mini-Conference on VNS are
especially encouraged to submit their work to this special issue in the
Journal of Global Optimization. However, the issue is open to all
researchers who can contribute to a better
knowledge of VNS. Potential topics include, but are not limited to:
Theory and Methodology:
* Theoretical or empirical analysis of VNS
* New variants of deterministic and stochastic VNS
* Continuous global VNS
* Mat-heuristics and VNS
* Formulation space VNS
* Multi-objective VNS
* Parallel VNS
* VNS hybrids
Applications:
* Mixed integer programming
* Graphs, communication networks
* Clustering, data mining, location
* Inventory, routing, supply chains
* Packing and covering
* Discovery sciences
* Other real world problems
Before submission authors should carefully read over the journals
Author
Guidelines. Prospective authors should submit an electronic copy of
their
complete manuscript through the journal's editorial manager
http://jogo.edmgr.com/ and specifying that their paper is for the
special
issue "SI: VNS 2012".
GUEST EDITORS
Emilio Carrizosa, Universidad de Sevilla, Spain, ecarrizosa@us.es
Pierre Hansen, GERAD and École des Hautes Etudes Commerciales, Canada,
José A. Moreno, Universidad de la Laguna, Spain, jamoreno@ull.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, December 28, 2012
[DMANET] SEA 2013 - 2nd Call for Papers
--------------------------------------------------------------------
12th International Symposium on Experimental Algorithms
http://sea2013.dis.uniroma1.it
June 5-7, 2013
Rome, Italy
2nd Call for Papers
--------------------------------------------------------------------
IMPORTANT DATES
Submission deadline: January 23, 2013
Author notification: March 8, 2013
Camera-ready submission: March 24, 2013
AIMS & SCOPE
SEA, previously known as WEA (Workshop on Experimental Algorithms),
is an international forum for researchers in the area of design,
analysis, and experimental evaluation and engineering of algorithms,
as well as in various aspects of computational optimization and
its applications. The preceding symposia were held in Riga, Monte
Verita, Rio de Janeiro, Santorini, Menorca Island, Rome, Cape Cod,
Dortmund, Ischia Island, Crete, and Bordeaux.
The main theme of the symposium is the role of experimentation and
of algorithm engineering techniques in the design and evaluation of
algorithms and data structures. Submissions should present
significant contributions supported by experimental evaluation,
methodological issues in the design and interpretation of
experiments, the use of (meta-)heuristics, or application-driven
case studies that deepen the understanding of a problem's
complexity.
Topics of interest include, but are not limited to:
- Algorithm Engineering
- Algorithmic Libraries
- Algorithmic Mechanism Design
- Analysis of Algorithms
- Algorithms for Memory Hierarchies
- Approximation Techniques
- Bioinformatics
- Branch and Bound Algorithms
- Combinatorial and Irregular Problems
- Combinatorial Structures and Graphs
- Communication Networks
- Complex Networks
- Computational Geometry
- Computational Learning Theory
- Computational Optimization
- Computer Systems
- Cryptography and Security
- Data Streams
- Data Structures
- Distributed and Parallel Algorithms
- Evaluation of Algorithms for Realistic Environments
- Experimental Techniques and Statistics
- Graph Drawing
- Heuristics for Combinatorial Optimization
- Implementation, Testing, Evaluation and Fine-tuning
- Information Retrieval
- Integer Programming
- Logistics and Operations Management
- Machine Learning and Data Mining
- Mathematical Programming
- Metaheuristic Methodologies
- Multiple Criteria Decision Making
- Network Analysis
- Novel Applications of Algorithms in Other Disciplines
- On-line Problems
- Parallel Algorithms and Computing
- Railway Optimization using Algorithmic Methods
- Randomized Techniques
- Robotics
- Semidefinite Programming
- Simulation
- Software Repositories and Platforms for using Algorithms
- Telecommunications and Networking
- World Wide Web Algorithms
PROGRAM COMMITTEE
Vincenzo Bonifaci (co-chair) (IASI-CNR, Rome, Italy)
Ulrik Brandes (U. Konstanz, Germany)
Daniel Delling (Microsoft Research, USA)
Giuseppe Di Battista (Roma Tre U., Italy)
Tobias Friedrich (U. Jena, Germany)
Ralf Klasing (CNRS & U. Bordeaux, France)
Arie Koster (RWTH Aachen U., Germany)
Pierre Leone (U. Geneva, Switzerland)
Leo Liberti (LIX, Ecole Polytechnique, France)
Andrea Lodi (U. Bologna, Italy)
Alberto Marchetti-Spaccamela (co-chair) (Sapienza U. Rome, Italy)
Nicole Megow (TU Berlin, Germany)
Frank Neumann (U. Adelaide, Australia)
Simon Puglisi (King's College London, UK)
Rajeev Raman (U. Leicester, UK)
Anita Schöbel (U. Goettingen, Germany)
Maria Serna (U. Politecnica de Catalunya,
Spain)
Renato Werneck (Microsoft Research, USA)
Christos Zaroliagis (U. Patras & CTI, Greece)
Norbert Zeh (Dalhousie U., Canada)
PLENARY SPEAKERS
Andrew Goldberg (Microsoft Research, USA)
Roberto Grossi (U. Pisa, Italy)
Martin Skutella (TU Berlin, Germany)
SUBMISSIONS
Authors are invited to submit high-quality manuscripts reporting
original unpublished research and recent developments in the topics
related to the symposium. Simultaneous submission to other
conferences or workshops with published proceedings is not allowed.
Submissions must not exceed 12 pages formatted according to LNCS
style plus an optional, clearly marked appendix of reasonable
length (to be read at the program committee's discretion). All papers
will be peer reviewed and comments will be provided to the authors.
The submission system can be accessed via
http://sea2013.dis.uniroma1.it/.
PROCEEDINGS
Accepted papers will appear in the SEA 2013 proceedings published
by Springer in the LNCS series.
ORGANIZING COMMITTEE
Vincenzo Bonifaci (IASI-CNR, Rome, Italy)
Saverio Caminiti (Sapienza U. Rome, Italy)
Camil Demetrescu (chair) (Sapienza U. Rome, Italy)
Alberto Marchetti-Spaccamela (Sapienza U. Rome, Italy)
CONTACT
For further information, please send an e-mail to
sea2013@dis.uniroma1.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/
*
**********************************************************
12th International Symposium on Experimental Algorithms
http://sea2013.dis.uniroma1.it
June 5-7, 2013
Rome, Italy
2nd Call for Papers
--------------------------------------------------------------------
IMPORTANT DATES
Submission deadline: January 23, 2013
Author notification: March 8, 2013
Camera-ready submission: March 24, 2013
AIMS & SCOPE
SEA, previously known as WEA (Workshop on Experimental Algorithms),
is an international forum for researchers in the area of design,
analysis, and experimental evaluation and engineering of algorithms,
as well as in various aspects of computational optimization and
its applications. The preceding symposia were held in Riga, Monte
Verita, Rio de Janeiro, Santorini, Menorca Island, Rome, Cape Cod,
Dortmund, Ischia Island, Crete, and Bordeaux.
The main theme of the symposium is the role of experimentation and
of algorithm engineering techniques in the design and evaluation of
algorithms and data structures. Submissions should present
significant contributions supported by experimental evaluation,
methodological issues in the design and interpretation of
experiments, the use of (meta-)heuristics, or application-driven
case studies that deepen the understanding of a problem's
complexity.
Topics of interest include, but are not limited to:
- Algorithm Engineering
- Algorithmic Libraries
- Algorithmic Mechanism Design
- Analysis of Algorithms
- Algorithms for Memory Hierarchies
- Approximation Techniques
- Bioinformatics
- Branch and Bound Algorithms
- Combinatorial and Irregular Problems
- Combinatorial Structures and Graphs
- Communication Networks
- Complex Networks
- Computational Geometry
- Computational Learning Theory
- Computational Optimization
- Computer Systems
- Cryptography and Security
- Data Streams
- Data Structures
- Distributed and Parallel Algorithms
- Evaluation of Algorithms for Realistic Environments
- Experimental Techniques and Statistics
- Graph Drawing
- Heuristics for Combinatorial Optimization
- Implementation, Testing, Evaluation and Fine-tuning
- Information Retrieval
- Integer Programming
- Logistics and Operations Management
- Machine Learning and Data Mining
- Mathematical Programming
- Metaheuristic Methodologies
- Multiple Criteria Decision Making
- Network Analysis
- Novel Applications of Algorithms in Other Disciplines
- On-line Problems
- Parallel Algorithms and Computing
- Railway Optimization using Algorithmic Methods
- Randomized Techniques
- Robotics
- Semidefinite Programming
- Simulation
- Software Repositories and Platforms for using Algorithms
- Telecommunications and Networking
- World Wide Web Algorithms
PROGRAM COMMITTEE
Vincenzo Bonifaci (co-chair) (IASI-CNR, Rome, Italy)
Ulrik Brandes (U. Konstanz, Germany)
Daniel Delling (Microsoft Research, USA)
Giuseppe Di Battista (Roma Tre U., Italy)
Tobias Friedrich (U. Jena, Germany)
Ralf Klasing (CNRS & U. Bordeaux, France)
Arie Koster (RWTH Aachen U., Germany)
Pierre Leone (U. Geneva, Switzerland)
Leo Liberti (LIX, Ecole Polytechnique, France)
Andrea Lodi (U. Bologna, Italy)
Alberto Marchetti-Spaccamela (co-chair) (Sapienza U. Rome, Italy)
Nicole Megow (TU Berlin, Germany)
Frank Neumann (U. Adelaide, Australia)
Simon Puglisi (King's College London, UK)
Rajeev Raman (U. Leicester, UK)
Anita Schöbel (U. Goettingen, Germany)
Maria Serna (U. Politecnica de Catalunya,
Spain)
Renato Werneck (Microsoft Research, USA)
Christos Zaroliagis (U. Patras & CTI, Greece)
Norbert Zeh (Dalhousie U., Canada)
PLENARY SPEAKERS
Andrew Goldberg (Microsoft Research, USA)
Roberto Grossi (U. Pisa, Italy)
Martin Skutella (TU Berlin, Germany)
SUBMISSIONS
Authors are invited to submit high-quality manuscripts reporting
original unpublished research and recent developments in the topics
related to the symposium. Simultaneous submission to other
conferences or workshops with published proceedings is not allowed.
Submissions must not exceed 12 pages formatted according to LNCS
style plus an optional, clearly marked appendix of reasonable
length (to be read at the program committee's discretion). All papers
will be peer reviewed and comments will be provided to the authors.
The submission system can be accessed via
http://sea2013.dis.uniroma1.it/.
PROCEEDINGS
Accepted papers will appear in the SEA 2013 proceedings published
by Springer in the LNCS series.
ORGANIZING COMMITTEE
Vincenzo Bonifaci (IASI-CNR, Rome, Italy)
Saverio Caminiti (Sapienza U. Rome, Italy)
Camil Demetrescu (chair) (Sapienza U. Rome, Italy)
Alberto Marchetti-Spaccamela (Sapienza U. Rome, Italy)
CONTACT
For further information, please send an e-mail to
sea2013@dis.uniroma1.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/
*
**********************************************************
[DMANET] CFP: ACM e-Energy 2013 deadline approaching
----------------------------------------------------------
Call for Papers:
ACM e-Energy 2013
----------------------------------------------------------
Date and location:
May 21-24 2013, Berkeley CA
----------------------------------------------------------
Computing and communication technologies impact energy systems in two
distinct ways. The exponential growth in deployment of these
technologies has made them large-scale energy consumers. Therefore,
new architectures, technologies and systems are being developed and
deployed to make computing and networked system more energy efficient.
Additionally, and perhaps more importantly, these technologies are at
the center of the on-going revolution in next-generation 'smart' and
sustainable energy systems. They measure, monitor and control energy
systems such as the smart grid; inform and shape human demand; aid in
the prediction, deployment, storage and control of energy resources;
and determine how utilities, generators, regulators, and consumers
measure, analyze, and collectively control system elements.
The fourth International Conference on Future Energy Systems (ACM
e-Energy), to be held in Berkeley, CA in May 2013, aims to be the
premier venue for researchers working in the broad areas of computing
and communication for smart energy systems (including the smart grid),
and in energy-efficient computing and communication systems. By
bringing together researchers in a high-quality single-track
conference with significant opportunities for individual and
small-group interaction, it will serve as a major forum for
presentations and discussions that will shape the future of this area.
We solicit high-quality papers in the area of computing and
communication for the Smart Grid and energy-efficient computing and
communications. We welcome submissions describing theoretical advances
as well as system design, implementation and experimentation. ACM
e-Energy is committed to a fair, timely, and thorough review process
providing authors of submitted papers with sound and detailed
feedback.
Relevant topics for the conference include, but are not limited to the
following:
- Advances in monitoring and control of smart homes and buildings
- Sensing, monitoring, control, and management of energy systems
- Energy-efficient computing and communication, including
energy-efficient data centers
- The impact of storage integration on the smart grid
- Electric Vehicle monitoring and control
- Distribution and transmission network control techniques
- Microgrid and distributed generation management and control
- Modeling, control, and architectures for renewable energy generation resources
- Smart grid communication architectures and protocols
- Privacy and security of smart grid infrastructure
- Innovative pricing and incentives for demand-side management
- Novel technologies to enhance reliability and robustness of energy systems
- HCI for energy monitoring, management, and awareness
- User studies and behavioral change enabled by computing and
communication technologies
- Data analytics for the smart grid and energy-efficient systems
Two type of contributions are solicited:
- Full papers, up to 12 pages in ACM double-column format, should
present original theoretical and/or experimental research in any of
the areas listed above that has not been previously published,
accepted for publication, or is not currently under review by another
conference or journal.
- Poster/demo descriptions, up to 2 pages in ACM double-column format
showcasing works-in-progress; accepted posters/demos will be presented
at the conference. Topics of interest are the same as research topics
listed above. Preference will be given to posters/demos where the
primary contribution is from one or more students.
Full submission details can be found at the conference website:
http://conferences.sigcomm.org/eenergy/2013/
Important Dates:
- January 15, 2013: paper submission deadline
- March 20, 2013: Author notification
- April 20, 2013: Camera ready papers due
- May 21-24 2013, Berkeley CA: 2013 e-Energy conference
Organizing Committee:
- General Co-chairs: David Culler (UC Berkeley, USA), Catherine
Rosenberg (U. Waterloo, Canada)
- TPC Co-chairs: S. Keshav (U. Waterloo, Canada), Jim Kurose (U.
Massachusetts, USA)
- Local chair: Barath Raghavan (Google, USA)
- Registration Chair/Treasurer: Sarvapali Ramchurn (U. Southampton, UK)
- Publicity Chair: Vincenzo Mancuso, (IMDEA, Spain)
- Publication chair: Anirban Mahanti, (NICTA Australia)
- Web administrator: Omid Ardakanian (U. Waterloo, Canada)
--
Dr. Vincenzo Mancuso
PhD in Electronics, Computer Science and Telecommunications
Staff Researcher at Institute IMDEA Networks
Avenida del Mar Mediterraneo, 22
28918 Leganes (Madrid)
SPAIN
Tel. (Office): +34 91 481 6968
Tel. (Mobile): +34 68 235 7169 [Spain]
Tel. (Mobile): +39 327 362 1897 [Italy]
**********************************************************
*
* 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/
*
**********************************************************
Call for Papers:
ACM e-Energy 2013
----------------------------------------------------------
Date and location:
May 21-24 2013, Berkeley CA
----------------------------------------------------------
Computing and communication technologies impact energy systems in two
distinct ways. The exponential growth in deployment of these
technologies has made them large-scale energy consumers. Therefore,
new architectures, technologies and systems are being developed and
deployed to make computing and networked system more energy efficient.
Additionally, and perhaps more importantly, these technologies are at
the center of the on-going revolution in next-generation 'smart' and
sustainable energy systems. They measure, monitor and control energy
systems such as the smart grid; inform and shape human demand; aid in
the prediction, deployment, storage and control of energy resources;
and determine how utilities, generators, regulators, and consumers
measure, analyze, and collectively control system elements.
The fourth International Conference on Future Energy Systems (ACM
e-Energy), to be held in Berkeley, CA in May 2013, aims to be the
premier venue for researchers working in the broad areas of computing
and communication for smart energy systems (including the smart grid),
and in energy-efficient computing and communication systems. By
bringing together researchers in a high-quality single-track
conference with significant opportunities for individual and
small-group interaction, it will serve as a major forum for
presentations and discussions that will shape the future of this area.
We solicit high-quality papers in the area of computing and
communication for the Smart Grid and energy-efficient computing and
communications. We welcome submissions describing theoretical advances
as well as system design, implementation and experimentation. ACM
e-Energy is committed to a fair, timely, and thorough review process
providing authors of submitted papers with sound and detailed
feedback.
Relevant topics for the conference include, but are not limited to the
following:
- Advances in monitoring and control of smart homes and buildings
- Sensing, monitoring, control, and management of energy systems
- Energy-efficient computing and communication, including
energy-efficient data centers
- The impact of storage integration on the smart grid
- Electric Vehicle monitoring and control
- Distribution and transmission network control techniques
- Microgrid and distributed generation management and control
- Modeling, control, and architectures for renewable energy generation resources
- Smart grid communication architectures and protocols
- Privacy and security of smart grid infrastructure
- Innovative pricing and incentives for demand-side management
- Novel technologies to enhance reliability and robustness of energy systems
- HCI for energy monitoring, management, and awareness
- User studies and behavioral change enabled by computing and
communication technologies
- Data analytics for the smart grid and energy-efficient systems
Two type of contributions are solicited:
- Full papers, up to 12 pages in ACM double-column format, should
present original theoretical and/or experimental research in any of
the areas listed above that has not been previously published,
accepted for publication, or is not currently under review by another
conference or journal.
- Poster/demo descriptions, up to 2 pages in ACM double-column format
showcasing works-in-progress; accepted posters/demos will be presented
at the conference. Topics of interest are the same as research topics
listed above. Preference will be given to posters/demos where the
primary contribution is from one or more students.
Full submission details can be found at the conference website:
http://conferences.sigcomm.org/eenergy/2013/
Important Dates:
- January 15, 2013: paper submission deadline
- March 20, 2013: Author notification
- April 20, 2013: Camera ready papers due
- May 21-24 2013, Berkeley CA: 2013 e-Energy conference
Organizing Committee:
- General Co-chairs: David Culler (UC Berkeley, USA), Catherine
Rosenberg (U. Waterloo, Canada)
- TPC Co-chairs: S. Keshav (U. Waterloo, Canada), Jim Kurose (U.
Massachusetts, USA)
- Local chair: Barath Raghavan (Google, USA)
- Registration Chair/Treasurer: Sarvapali Ramchurn (U. Southampton, UK)
- Publicity Chair: Vincenzo Mancuso, (IMDEA, Spain)
- Publication chair: Anirban Mahanti, (NICTA Australia)
- Web administrator: Omid Ardakanian (U. Waterloo, Canada)
--
Dr. Vincenzo Mancuso
PhD in Electronics, Computer Science and Telecommunications
Staff Researcher at Institute IMDEA Networks
Avenida del Mar Mediterraneo, 22
28918 Leganes (Madrid)
SPAIN
Tel. (Office): +34 91 481 6968
Tel. (Mobile): +34 68 235 7169 [Spain]
Tel. (Mobile): +39 327 362 1897 [Italy]
**********************************************************
*
* 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, December 27, 2012
ICALP 2013: 2nd Call for Papers
==============================
ICALP 2013: 2nd Call for Papers
==============================
The 40th International Colloquium on Automata, Languages and
Programming (ICALP),
the main conference and annual meeting of the European Association for
Theoretical Computer Science (EATCS),
will take place from the 8th to the 12th of July 2013 in Riga, Latvia.
The main conference will be preceded by a series of workshops,
taking place on Sunday, July 7th, 2013 (i.e., one day before ICALP).
Topics
======
Papers presenting original research on all aspects of theoretical
computer science are sought.
Typical but not exclusive topics of interest are:
** Track A: Algorithms, Complexity and Games
* Algorithmic Game Theory
* Approximation Algorithms
* Combinatorial Optimization
* Combinatorics in Computer Science
* Computational Biology
* Computational Complexity
* Computational Geometry
* Cryptography
* Data Structures
* Design and Analysis of Algorithms
* Machine Learning
* Parallel, Distributed and External Memory Computing
* Parameterized Algorithms and Complexity
* Randomness in Computation
* Quantum Computing
** Track B: Logic, Semantics, Automata and Theory of Programming
* Algebraic and Categorical Models
* Automata Theory, Formal Languages
* Emerging and Non-standard Models of Computation
* Databases, Semi-Structured Data and Finite Model Theory
* Principles of Programming Languages
* Logics, Formal Methods and Model Checking
* Models of Concurrent, Distributed, and Mobile Systems
* Models of Reactive, Hybrid and Stochastic Systems
* Program Analysis and Transformation
* Specification, Refinement and Verification
* Type Systems and Theory, Typed Calculi
** Track C: Foundations of Networked Computation: Models, Algorithms
and Information Management
* Cloud Computing, Overlay Networks, P2P Systems
* Cryptography, Privacy, Security, Spam
* Distributed and Parallel Computing
* E-commerce, Auctions, Trust and Reputation
* Game Theory, Incentives, Selfishness
* Internet Algorithms
* Mobile and Complex Networks
* Natural and Physical Algorithms
* Network Information Management
* Sensor, Mesh, and Ad Hoc Networks
* Social Networks, Viral Marketing
* Specification, Semantics, Synchronization
* Web Mining, Searching, Ranking and Analysis
* Wireless and Optical Communication
Important Dates
===============
*** Submission Deadline: Feb 15, 2013
*** Author Notification: Apr 12, 2013
*** Final Manuscript Due: April 28, 2013
*** The conference: July 8-12, 2013
Paper Submissions
=================
Authors are invited to submit an extended abstract of no more than 12
pages in LNCS style presenting original research
on the theory of Computer Science. Submissions should indicate to
which track (A, B, or C) the paper is submitted.
No prior publication or simultaneous submission to other publication
outlets (either a conference or a journal) is allowed.
The proceedings will be published in the Lecture Notes in Computer
Science Series by Springer-Verlag.
It is strongly recommended that submissions adhere to the specified
format and length.
Submissions that are clearly too long may be rejected immediately.
Material other than the abstract,
references and the first 12 pages may be considered as supplementary
and will be read at the committee's discretion.
Best Paper Awards
=================
As in previous editions of ICALP, there will be best paper and best
student paper awards for each track of the conference.
In order to be eligible for a best student paper award, a paper should
be authored only by students and should be
marked as such upon submission.
Submission server
=================
Submissions should be contributed using the EasyChair system
(http://www.easychair.org/conferences/?conf=icalp13)
Submissions are due on February 15, 2013, 23:59 CET.
Invited Speakers
================
* Susanne Albers, Humboldt University
* Orna Kupferman, Hebrew University
* Paul Spirakis, University of Patras
* Daniel Marx, Hungarian Academy of Sciences
* Peter Widmayer, ETH Zürich
Conference Chair
================
Rūsiņš Freivalds, University of Latvia
Contact: icalp2013@gmail.com
=============================
ICALP 2013: 2nd Call for Papers
==============================
The 40th International Colloquium on Automata, Languages and
Programming (ICALP),
the main conference and annual meeting of the European Association for
Theoretical Computer Science (EATCS),
will take place from the 8th to the 12th of July 2013 in Riga, Latvia.
The main conference will be preceded by a series of workshops,
taking place on Sunday, July 7th, 2013 (i.e., one day before ICALP).
Topics
======
Papers presenting original research on all aspects of theoretical
computer science are sought.
Typical but not exclusive topics of interest are:
** Track A: Algorithms, Complexity and Games
* Algorithmic Game Theory
* Approximation Algorithms
* Combinatorial Optimization
* Combinatorics in Computer Science
* Computational Biology
* Computational Complexity
* Computational Geometry
* Cryptography
* Data Structures
* Design and Analysis of Algorithms
* Machine Learning
* Parallel, Distributed and External Memory Computing
* Parameterized Algorithms and Complexity
* Randomness in Computation
* Quantum Computing
** Track B: Logic, Semantics, Automata and Theory of Programming
* Algebraic and Categorical Models
* Automata Theory, Formal Languages
* Emerging and Non-standard Models of Computation
* Databases, Semi-Structured Data and Finite Model Theory
* Principles of Programming Languages
* Logics, Formal Methods and Model Checking
* Models of Concurrent, Distributed, and Mobile Systems
* Models of Reactive, Hybrid and Stochastic Systems
* Program Analysis and Transformation
* Specification, Refinement and Verification
* Type Systems and Theory, Typed Calculi
** Track C: Foundations of Networked Computation: Models, Algorithms
and Information Management
* Cloud Computing, Overlay Networks, P2P Systems
* Cryptography, Privacy, Security, Spam
* Distributed and Parallel Computing
* E-commerce, Auctions, Trust and Reputation
* Game Theory, Incentives, Selfishness
* Internet Algorithms
* Mobile and Complex Networks
* Natural and Physical Algorithms
* Network Information Management
* Sensor, Mesh, and Ad Hoc Networks
* Social Networks, Viral Marketing
* Specification, Semantics, Synchronization
* Web Mining, Searching, Ranking and Analysis
* Wireless and Optical Communication
Important Dates
===============
*** Submission Deadline: Feb 15, 2013
*** Author Notification: Apr 12, 2013
*** Final Manuscript Due: April 28, 2013
*** The conference: July 8-12, 2013
Paper Submissions
=================
Authors are invited to submit an extended abstract of no more than 12
pages in LNCS style presenting original research
on the theory of Computer Science. Submissions should indicate to
which track (A, B, or C) the paper is submitted.
No prior publication or simultaneous submission to other publication
outlets (either a conference or a journal) is allowed.
The proceedings will be published in the Lecture Notes in Computer
Science Series by Springer-Verlag.
It is strongly recommended that submissions adhere to the specified
format and length.
Submissions that are clearly too long may be rejected immediately.
Material other than the abstract,
references and the first 12 pages may be considered as supplementary
and will be read at the committee's discretion.
Best Paper Awards
=================
As in previous editions of ICALP, there will be best paper and best
student paper awards for each track of the conference.
In order to be eligible for a best student paper award, a paper should
be authored only by students and should be
marked as such upon submission.
Submission server
=================
Submissions should be contributed using the EasyChair system
(http://www.easychair.org/conferences/?conf=icalp13)
Submissions are due on February 15, 2013, 23:59 CET.
Invited Speakers
================
* Susanne Albers, Humboldt University
* Orna Kupferman, Hebrew University
* Paul Spirakis, University of Patras
* Daniel Marx, Hungarian Academy of Sciences
* Peter Widmayer, ETH Zürich
Conference Chair
================
Rūsiņš Freivalds, University of Latvia
Contact: icalp2013@gmail.com
=============================
[DMANET] ICALP 2013: 2nd Call for Papers
==============================
ICALP 2013: 2nd Call for Papers
==============================
ICALP 2013: 2nd Call for Papers
==============================
The 40th International Colloquium on Automata, Languages and
Programming (ICALP),
the main conference and annual meeting of the European Association for
Theoretical Computer Science (EATCS),
will take place from the 8th to the 12th of July 2013 in Riga, Latvia.
The main conference will be preceded by a series of workshops,
taking place on Sunday, July 7th, 2013 (i.e., one day before ICALP).
Topics
======
Papers presenting original research on all aspects of theoretical
computer science are sought.
Typical but not exclusive topics of interest are:
** Track A: Algorithms, Complexity and Games
* Algorithmic Game Theory
* Approximation Algorithms
* Combinatorial Optimization
* Combinatorics in Computer Science
* Computational Biology
* Computational Complexity
* Computational Geometry
* Cryptography
* Data Structures
* Design and Analysis of Algorithms
* Machine Learning
* Parallel, Distributed and External Memory Computing
* Parameterized Algorithms and Complexity
* Randomness in Computation
* Quantum Computing
** Track B: Logic, Semantics, Automata and Theory of Programming
* Algebraic and Categorical Models
* Automata Theory, Formal Languages
* Emerging and Non-standard Models of Computation
* Databases, Semi-Structured Data and Finite Model Theory
* Principles of Programming Languages
* Logics, Formal Methods and Model Checking
* Models of Concurrent, Distributed, and Mobile Systems
* Models of Reactive, Hybrid and Stochastic Systems
* Program Analysis and Transformation
* Specification, Refinement and Verification
* Type Systems and Theory, Typed Calculi
** Track C: Foundations of Networked Computation: Models, Algorithms
and Information Management
* Cloud Computing, Overlay Networks, P2P Systems
* Cryptography, Privacy, Security, Spam
* Distributed and Parallel Computing
* E-commerce, Auctions, Trust and Reputation
* Game Theory, Incentives, Selfishness
* Internet Algorithms
* Mobile and Complex Networks
* Natural and Physical Algorithms
* Network Information Management
* Sensor, Mesh, and Ad Hoc Networks
* Social Networks, Viral Marketing
* Specification, Semantics, Synchronization
* Web Mining, Searching, Ranking and Analysis
* Wireless and Optical Communication
Important Dates
===============
*** Submission Deadline: Feb 15, 2013
*** Author Notification: Apr 12, 2013
*** Final Manuscript Due: April 28, 2013
*** The conference: July 8-12, 2013
Paper Submissions
=================
Authors are invited to submit an extended abstract of no more than 12
pages in LNCS style presenting original research
on the theory of Computer Science. Submissions should indicate to
which track (A, B, or C) the paper is submitted.
No prior publication or simultaneous submission to other publication
outlets (either a conference or a journal) is allowed.
The proceedings will be published in the Lecture Notes in Computer
Science Series by Springer-Verlag.
It is strongly recommended that submissions adhere to the specified
format and length.
Submissions that are clearly too long may be rejected immediately.
Material other than the abstract,
references and the first 12 pages may be considered as supplementary
and will be read at the committee's discretion.
Best Paper Awards
=================
As in previous editions of ICALP, there will be best paper and best
student paper awards for each track of the conference.
In order to be eligible for a best student paper award, a paper should
be authored only by students and should be
marked as such upon submission.
Submission server
=================
Submissions should be contributed using the EasyChair system
(http://www.easychair.org/conferences/?conf=icalp13)
Submissions are due on February 15, 2013, 23:59 CET.
Invited Speakers
================
* Susanne Albers, Humboldt University
* Orna Kupferman, Hebrew University
* Paul Spirakis, University of Patras
* Daniel Marx, Hungarian Academy of Sciences
* Peter Widmayer, ETH Zürich
Conference Chair
================
Rūsiņš Freivalds, University of Latvia
Contact: icalp2013@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/
*
**********************************************************
Wednesday, December 26, 2012
[DMANET] Deadline extension: PATTERNS 2013 || May 27 - June 1, 2013 - Valencia, Spain
INVITATION:
=================
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to
submit and publish original scientific results to PATTERNS 2013.
The submission deadline is extended to January 22, 2013.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals:
http://www.iariajournals.org
=================
============== PATTERNS 2013 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
PATTERNS 2013, The Fifth International Conferences on Pervasive Patterns and Applications
May 27 - June 1, 2013 - Valencia, Spain
General page: http://www.iaria.org/conferences2013/PATTERNS13.html
Call for Papers: http://www.iaria.org/conferences2013/CfPPATTERNS13.html
- regular papers
- short papers (work in progress)
- posters
Submission page: http://www.iaria.org/conferences2013/SubmitPATTERNS13.html
Submission deadline: January 22, 2013
Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org
Print proceedings will be available via Curran Associates, Inc.: http://www.proceedings.com/9769.html
Articles will be archived in the free access ThinkMind Digital Library: http://www.thinkmind.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
PATTERNS 2013 Topics (topics and submission details: see CfP on the site)
Basics on patterns
Design patterns; Pattern identification and extraction; Validate patterns; Patterns? accuracy; Incomplete
patterns; Patterns and noise
Patterns at work
Pattern logics and algebras; Pattern recognition; Pattern matching; Pattern languages; Patterns
languages/models pitfalls; Pattern specification/modeling; Pattern validation; Pattern composition; Pattern
reuse; Testing in pattern-based designed systems; Manageability and maintenance of pattern-based designed
systems
Ubiquity patterns
User mobility patterns; Social networking patterns; Content dependency patterns; Content accessing
patterns; Behavioral autonomy patterns; Prediction patterns /behavioral, structure, environment/; Patterns
of discovery
Software patterns
Software design patterns; Software reuse patterns; Software quality patterns; Software testing patterns;
Software performance, security, and safety patterns; Software management patterns; Patterns for evolving
software elements
Security patterns
Security patterns; Patterns of trust; Attack patterns; Authorization patterns; Failed access patterns;
Intrusion attempt patterns; Local malware patterns; Distributed malware patterns; Predictive patterns;
Mobility patterns; Tracking patterns
System management patterns
Management and control patterns; Monitoring patterns; Correlation patterns; Event patterns; Visualization
patterns
Discovery and decision patterns
Search patterns; Data mining for patterns; Query patterns; Knowledge patterns; Behavioral patterns;
Reasoning patterns; Decision patterns; Patterns in WWW; Predictive patterns; Mobility patterns; Tracking
patterns
Communications patterns
Communication patterns; Propagation patterns; Traffic/routing patterns; P2P and P4P patterns;
Configuration change patterns; System abnormal behavior patterns
Domain-oriented patterns
Forensic patterns; Genomic patterns; Image patterns; Voice patterns; Speech patterns; Hand writing
patterns; Text-embedded sentiment patterns; Emotion recognition patterns; Site access patterns; Service
orchestration; Keyboard typing patterns; Financial/stock patterns; Shopping patterns; Dietary patterns;
Global warming patterns; Job market patterns; Stock movement patterns; Investing patterns
Antipatterns and lessons learned
Architectural; Design; Development; People and project management; Social
--------------------------------
Committee: http://www.iaria.org/conferences2013/ComPATTERNS13.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/
*
**********************************************************
=================
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to
submit and publish original scientific results to PATTERNS 2013.
The submission deadline is extended to January 22, 2013.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals:
http://www.iariajournals.org
=================
============== PATTERNS 2013 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
PATTERNS 2013, The Fifth International Conferences on Pervasive Patterns and Applications
May 27 - June 1, 2013 - Valencia, Spain
General page: http://www.iaria.org/conferences2013/PATTERNS13.html
Call for Papers: http://www.iaria.org/conferences2013/CfPPATTERNS13.html
- regular papers
- short papers (work in progress)
- posters
Submission page: http://www.iaria.org/conferences2013/SubmitPATTERNS13.html
Submission deadline: January 22, 2013
Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org
Print proceedings will be available via Curran Associates, Inc.: http://www.proceedings.com/9769.html
Articles will be archived in the free access ThinkMind Digital Library: http://www.thinkmind.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
PATTERNS 2013 Topics (topics and submission details: see CfP on the site)
Basics on patterns
Design patterns; Pattern identification and extraction; Validate patterns; Patterns? accuracy; Incomplete
patterns; Patterns and noise
Patterns at work
Pattern logics and algebras; Pattern recognition; Pattern matching; Pattern languages; Patterns
languages/models pitfalls; Pattern specification/modeling; Pattern validation; Pattern composition; Pattern
reuse; Testing in pattern-based designed systems; Manageability and maintenance of pattern-based designed
systems
Ubiquity patterns
User mobility patterns; Social networking patterns; Content dependency patterns; Content accessing
patterns; Behavioral autonomy patterns; Prediction patterns /behavioral, structure, environment/; Patterns
of discovery
Software patterns
Software design patterns; Software reuse patterns; Software quality patterns; Software testing patterns;
Software performance, security, and safety patterns; Software management patterns; Patterns for evolving
software elements
Security patterns
Security patterns; Patterns of trust; Attack patterns; Authorization patterns; Failed access patterns;
Intrusion attempt patterns; Local malware patterns; Distributed malware patterns; Predictive patterns;
Mobility patterns; Tracking patterns
System management patterns
Management and control patterns; Monitoring patterns; Correlation patterns; Event patterns; Visualization
patterns
Discovery and decision patterns
Search patterns; Data mining for patterns; Query patterns; Knowledge patterns; Behavioral patterns;
Reasoning patterns; Decision patterns; Patterns in WWW; Predictive patterns; Mobility patterns; Tracking
patterns
Communications patterns
Communication patterns; Propagation patterns; Traffic/routing patterns; P2P and P4P patterns;
Configuration change patterns; System abnormal behavior patterns
Domain-oriented patterns
Forensic patterns; Genomic patterns; Image patterns; Voice patterns; Speech patterns; Hand writing
patterns; Text-embedded sentiment patterns; Emotion recognition patterns; Site access patterns; Service
orchestration; Keyboard typing patterns; Financial/stock patterns; Shopping patterns; Dietary patterns;
Global warming patterns; Job market patterns; Stock movement patterns; Investing patterns
Antipatterns and lessons learned
Architectural; Design; Development; People and project management; Social
--------------------------------
Committee: http://www.iaria.org/conferences2013/ComPATTERNS13.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] CFP: CSoNet 2013 - Co-located with COCOON 2013 - June 22, 2013, Hangzhou China
===========================================================================
Apologies if you receive multiple copies of this Call for Papers
===========================================================================
FIRST CALL FOR PAPERS
CSoNet 2013 : Workshop on Computational Social Networks
Hangzhou 06/22/2013 - Co-located with COCOON 2013
http://www.cise.ufl.edu/csonet13/
Computing in social science has recently become one of the central
themes across mathematical science, information and communication
technology, which attracts significant interest from researchers in
mathematics, computer science, system science, and social science. The
objective of this workshop is to advance and promote the theoretical
foundation, mathematical aspects, and applications of social
computing.
Accepted papers will be published in LNCS along with main papers of
COCOON 2013. We will select some papers from the accepted papers to be
published in Journal of Combinatorial Optimization (JOCO), a special
issue on computational social networks.
*Topics of interest include, but not limited to:
Mathematical modeling and analysis
Real-world complex networks
Information retrieval in social contexts, political analysts
Network structure analysis
Network dynamics optimization
Complex network robustness and vulnerability
Information diffusion models and analysis
Security and privacy
Searching in complex networks
Efficient algorithms
Submission instructions:
Prospective authors are invited to submit ten-page papers in LNCS
format, including diagrams and references. Authors can submit online
via https://www.easychair.org/account/signin.cgi?conf=csonet2013.
Important Dates:
-------------------------------------------------------------------------
Paper submission due: Feb 15, 2013
Notification of Acceptance: Mar 15, 2013
Camera-ready and Registration deadline: Apr 01, 2013
-------------------------------------------------------------------------
PC Co-Chairs
My T. Thai, University of Florida
Arun Sen, Arizona State University
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Apologies if you receive multiple copies of this Call for Papers
===========================================================================
FIRST CALL FOR PAPERS
CSoNet 2013 : Workshop on Computational Social Networks
Hangzhou 06/22/2013 - Co-located with COCOON 2013
http://www.cise.ufl.edu/csonet13/
Computing in social science has recently become one of the central
themes across mathematical science, information and communication
technology, which attracts significant interest from researchers in
mathematics, computer science, system science, and social science. The
objective of this workshop is to advance and promote the theoretical
foundation, mathematical aspects, and applications of social
computing.
Accepted papers will be published in LNCS along with main papers of
COCOON 2013. We will select some papers from the accepted papers to be
published in Journal of Combinatorial Optimization (JOCO), a special
issue on computational social networks.
*Topics of interest include, but not limited to:
Mathematical modeling and analysis
Real-world complex networks
Information retrieval in social contexts, political analysts
Network structure analysis
Network dynamics optimization
Complex network robustness and vulnerability
Information diffusion models and analysis
Security and privacy
Searching in complex networks
Efficient algorithms
Submission instructions:
Prospective authors are invited to submit ten-page papers in LNCS
format, including diagrams and references. Authors can submit online
via https://www.easychair.org/account/signin.cgi?conf=csonet2013.
Important Dates:
-------------------------------------------------------------------------
Paper submission due: Feb 15, 2013
Notification of Acceptance: Mar 15, 2013
Camera-ready and Registration deadline: Apr 01, 2013
-------------------------------------------------------------------------
PC Co-Chairs
My T. Thai, University of Florida
Arun Sen, Arizona State University
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Tuesday, December 25, 2012
[DMANET] Deadline extension: FUTURE COMPUTING 2013 || May 27 - June 1, 2013 - Valencia, Spain
INVITATION:
=================
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to
submit and publish original scientific results to FUTURE COMPUTING 2013.
The submission deadline is January 22, 2013.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals:
http://www.iariajournals.org
=================
============== FUTURE COMPUTING 2013 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
FUTURE COMPUTING 2013, The Fifth International Conference on Future Computational Technologies and
Applications
May 27 - June 1, 2013 - Valencia, Spain
General page: http://www.iaria.org/conferences2013/FUTURECOMPUTING13.html
Call for Papers: http://www.iaria.org/conferences2013/CfPFUTURECOMPUTING13.html
- regular papers
- short papers (work in progress)
- posters
Submission page: http://www.iaria.org/conferences2013/SubmitFUTURECOMPUTING13.html
Submission deadline: January 22, 2013
Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org
Print proceedings will be available via Curran Associates, Inc.: http://www.proceedings.com/9769.html
Articles will be archived in the free access ThinkMind Digital Library: http://www.thinkmind.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
FUTURE COMPUTING 2013 Topics (topics and submission details: see CfP on the site)
Computational intelligence strategies
Cognitive computing; Intelligent computation; Ambient computing; Unconventional computing; Indeterminist
computing; Adaptive computation; Autonomic computation; Computation under uncertainty; Chaotic computation;
Intentional computing; Anticipative computing; Evolutionary computing
Mechanism-oriented computing
Spatial computation; Elastic computing; Human-centered computing; Embedded computing; Entertainment
computing; Time-sensitive/temporal computing; Soft computing (fuzzy logic, neural computing, evolutionary
computation, machine learning, and probabilistic reasoning + belief networks, + chaos theory + learning
theory)
Large-scale computing strategies
Distributed computing; Parallel computing; Macro- and micro-computing; Activity-based computing; Data
intensive computing; Resource-constraint computing; Grid computing; Cloud computing; Cluster computing; On-
demand computing; Ubiquitous/pervasive computing
Computing technologies
Quantum computing; Optical computing; DNA (genetic) computing; Molecular computing; Reversible computing;
Billiard Ball computing; Neuronal computing; Magnetic computing; Gloopware computing; Moldy computing; Water
wave-based computing; Graphene-based computing
Technology-oriented computing
Peer-to-Peer computing; Mobile computing; Sensor-based computing; Wireless computing; Trusted computing;
Financial computing; Genetic computation
------------------------
Committee: http://www.iaria.org/conferences2013/ComFUTURECOMPUTING13.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/
*
**********************************************************
=================
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to
submit and publish original scientific results to FUTURE COMPUTING 2013.
The submission deadline is January 22, 2013.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals:
http://www.iariajournals.org
=================
============== FUTURE COMPUTING 2013 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
FUTURE COMPUTING 2013, The Fifth International Conference on Future Computational Technologies and
Applications
May 27 - June 1, 2013 - Valencia, Spain
General page: http://www.iaria.org/conferences2013/FUTURECOMPUTING13.html
Call for Papers: http://www.iaria.org/conferences2013/CfPFUTURECOMPUTING13.html
- regular papers
- short papers (work in progress)
- posters
Submission page: http://www.iaria.org/conferences2013/SubmitFUTURECOMPUTING13.html
Submission deadline: January 22, 2013
Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org
Print proceedings will be available via Curran Associates, Inc.: http://www.proceedings.com/9769.html
Articles will be archived in the free access ThinkMind Digital Library: http://www.thinkmind.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
FUTURE COMPUTING 2013 Topics (topics and submission details: see CfP on the site)
Computational intelligence strategies
Cognitive computing; Intelligent computation; Ambient computing; Unconventional computing; Indeterminist
computing; Adaptive computation; Autonomic computation; Computation under uncertainty; Chaotic computation;
Intentional computing; Anticipative computing; Evolutionary computing
Mechanism-oriented computing
Spatial computation; Elastic computing; Human-centered computing; Embedded computing; Entertainment
computing; Time-sensitive/temporal computing; Soft computing (fuzzy logic, neural computing, evolutionary
computation, machine learning, and probabilistic reasoning + belief networks, + chaos theory + learning
theory)
Large-scale computing strategies
Distributed computing; Parallel computing; Macro- and micro-computing; Activity-based computing; Data
intensive computing; Resource-constraint computing; Grid computing; Cloud computing; Cluster computing; On-
demand computing; Ubiquitous/pervasive computing
Computing technologies
Quantum computing; Optical computing; DNA (genetic) computing; Molecular computing; Reversible computing;
Billiard Ball computing; Neuronal computing; Magnetic computing; Gloopware computing; Moldy computing; Water
wave-based computing; Graphene-based computing
Technology-oriented computing
Peer-to-Peer computing; Mobile computing; Sensor-based computing; Wireless computing; Trusted computing;
Financial computing; Genetic computation
------------------------
Committee: http://www.iaria.org/conferences2013/ComFUTURECOMPUTING13.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/
*
**********************************************************
Monday, December 24, 2012
[DMANET] CanaDAM 2013 - Second Announcement and Call for Submissions
CanaDAM 2013 - Second Announcement and Call for Submissions
-----------------------------------------------------------
*** La version française de l'annonce ci-dessous ***
The fourth Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM)
will be held June 10-13, 2013 on the St. John's campus of Memorial University
of Newfoundland, Canada.
The general topic of the conference is the theory and application of discrete
structures. Its goal is to highlight the most salient trends in the field. The
conference will bring together researchers from the various disciplines with
which discrete and algorithmic mathematics interact. The CanaDAM Conference is
held in odd numbered years using a format similar to the SIAM Conference on
Discrete Mathematics. Particular areas of interest include graphs and digraphs,
hypergraphs, matroids, ordered sets, designs, coding theory, enumeration,
combinatorics of words, discrete optimization, discrete and computational
geometry, lattice point enumeration, combinatorial algorithms, computational
complexity, and applications of discrete and algorithmic mathematics, including
(but not limited to) web graphs, computational biology, telecommunication
networks, and information processing.
Please check the conference website, http://CanaDAM.Math.ca/2013 , for
information about:
* contacts
* accommodation
* important dates
* registration fees
* local information
* student/PDF funding
* the organising team, and
* how to participate in the meeting by submitting a talk or minisymposium.
The deadline for submission of a minisymposium is January 27, 2013 (acceptance
notifications will be sent by February 4, 2013).
The deadline for submission of a contributed talk is February 10, 2013
(acceptance notifications will be sent by February 18, 2013).
The deadline for Student / PDF funding applications is March 11, 2013
(notifications will be sent by April 1, 2013)
Online registration will be available shortly. The early registration deadline
is April 9, 2013.
Invited Speakers:
Miguel Anjos (École Polytechnique, Montréal)
Anne Condon (University of British Columbia)
Reinhard Diestel (Universität Hamburg)
Cheryl Praeger (The University of Western Australia)
Victor Reiner (University of Minnesota)
Carla Savage (North Carolina State University)
Robert Sedgewick (Princeton University)
Benny Sudakov (University of California Los Angeles)
Invited Minisymposia:
Algebraic Combinatorics - Steph Van Willigenburg (University of British
Columbia)
Algorithmic Methods in Comparative Genomics - Max Alekseyev (University of South
Carolina)
Analytic Combinatorics - Alfredo Viola (Universidad de la República, Uruguay)
Combinatorics and Geometry of Linear Optimization - Antoine Deza (McMaster
University)
Design Theory - Ian Wanless (Monash University)
Enumerative Combinatorics - Marni Mishna (Simon Fraser University)
Extremal Combinatorics - Dhruv Mubayi (University of Illinois at Chicago)
Graph Theory - Matthias Kriesell (Universität Hamburg)
Probabilistic Combinatorics - Mike Molloy (University of Toronto)
Problem Session - hosted by Brett Stevens (Carleton University). Please submit
open problems for this session directly to Brett at brett@math.carleton.ca, and
put "CanaDAM open problems" in the Subject: field when doing so.
Please pass this message along to colleagues in discrete mathematics. Our
apologies to those who receive it more than once. The organising team
expresses its thanks and gratitude to the Canadian Mathematical Society for the
conference's web presence.
======================================================
CanaDAM 2013
Deuxième annonce et soumission de présentations et de minisymposiums
Le Quatrième congrès canadien de mathématiques discrètes et algorithmiques aura
lieu du 10 au 13 juin 2013 sur le campus de l'Université Memorial dans la ville
de St. John's, à Terre-Neuve, Canada. Le congrès portera sur la théorie et les
applications des structures discrètes. Son but est de mettre en évidence les
développements récents et importants de cette branche des mathématiques. Le
congrès rassemblera des chercheurs des diverses disciplines ayant des
interactions avec les mathématiques discrètes et algorithmiques. Les congrès
CanaDAM ont lieu pendant les années impaires et leur format est semblable à
celui de la SIAM Conference on Discrete Mathematics. Parmi les sujets qui
seront abordés, mentionnons en particulier les graphes et digraphes, les
matroïdes, les ensembles ordonnés, la combinatoire des plans d'expérience, la
théorie des codes, le dénombrement des structures discrètes, la combinatoire
des mots, l'optimisation discrète, la géométrie discrète et algorithmique, le
dénombrement des points d'un treillis, les algorithmes combinatoires, la
théorie de la complexité, et finalement les applications des mathématiques
discrètes et algorithmiques, incluant (entre autres) les applications aux
graphes de la toile, à la biologie computationnelle, aux réseaux de
télécommunication et au traitement de l'information.
Veuillez consulter le site du congrès, http://CanaDAM.Math.ca/2013 , pour des
renseignements sur
* les personnes à contacter,
* l'hébergement,
* les dates importantes,
* les frais d'inscription,
* la ville et le campus,
* l'aide financière pour les étudiants et stagiaires postdoctoraux,
* le comité d'organisation et
* la procédure pour soumettre une présentation ou un minisymposium.
Les minisymposiums devront être soumis au plus tard le 27 janvier 2013 et les
personnes qui les proposeront recevront une réponse au plus tard le 4 février
2013.
Les présentations devront être soumises au plus tard le 10 février 2013 et leurs
auteurs recevront une réponse au plus tard le 18 février 2013.
Les étudiants ou stagiaires postdoctoraux devront faire leur demande d'aide
financière au plus tard le 11 mars 2013 et recevront une réponse au plus tard
le 1 avril 2013.
Il sera bientôt possible de s'inscrire en ligne au congrès. La date limite pour
l'inscription avec frais réduits est le 9 avril 2013.
Conférenciers invités:
Miguel Anjos (École Polytechnique, Montréal)
Anne Condon (University of British Columbia)
Reinhard Diestel (Universität Hamburg)
Cheryl Praeger (The University of Western Australia)
Victor Reiner (University of Minnesota)
Carla Savage (North Carolina State University)
Robert Sedgewick (Princeton University)
Benny Sudakov (University of California Los Angeles)
Minisymposiums sur invitation:
Algebraic Combinatorics - Steph Van Willigenburg (University of British
Columbia)
Algorithmic Methods in Comparative Genomics - Max Alekseyev (University of South
Carolina)
Analytic Combinatorics - Alfredo Viola (Universidad de la República, Uruguay)
Combinatorics and Geometry of Linear Optimization - Antoine Deza (McMaster
University)
Design Theory - Ian Wanless (Monash University)
Enumerative Combinatorics - Marni Mishna (Simon Fraser University)
Extremal Combinatorics - Dhruv Mubayi (University of Illinois at Chicago)
Graph Theory - Matthias Kriesell (Universität Hamburg)
Probabilistic Combinatorics - Mike Molloy (University of Toronto)
Séance de problèmes
Brett Stevens, de l'Université Carleton, présidera une séance de problèmes
pendant le congrès CanaDAM 2013. Toute personne désirant soumettre des
problèmes ouverts est invitée à les envoyer à Brett Stevens
(brett@math.carleton.ca), en donnant "CanaDAM open problems" comme sujet du
message.
Veuillez faire circuler cette annonce parmi vos collègues en mathématiques
discrètes, et nous excuser si vous la recevez plus d'une fois. Le Comité
d'organisation est très reconnaissant à la Société mathématique du Canada de
son aide pour la diffusion sur la toile des informations concernant le
congrès.
This electronic communication is governed by the terms and conditions at
http://www.mun.ca/cc/policies/electronic_communications_disclaimer_2012.php
**********************************************************
*
* 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/
*
**********************************************************
-----------------------------------------------------------
*** La version française de l'annonce ci-dessous ***
The fourth Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM)
will be held June 10-13, 2013 on the St. John's campus of Memorial University
of Newfoundland, Canada.
The general topic of the conference is the theory and application of discrete
structures. Its goal is to highlight the most salient trends in the field. The
conference will bring together researchers from the various disciplines with
which discrete and algorithmic mathematics interact. The CanaDAM Conference is
held in odd numbered years using a format similar to the SIAM Conference on
Discrete Mathematics. Particular areas of interest include graphs and digraphs,
hypergraphs, matroids, ordered sets, designs, coding theory, enumeration,
combinatorics of words, discrete optimization, discrete and computational
geometry, lattice point enumeration, combinatorial algorithms, computational
complexity, and applications of discrete and algorithmic mathematics, including
(but not limited to) web graphs, computational biology, telecommunication
networks, and information processing.
Please check the conference website, http://CanaDAM.Math.ca/2013 , for
information about:
* contacts
* accommodation
* important dates
* registration fees
* local information
* student/PDF funding
* the organising team, and
* how to participate in the meeting by submitting a talk or minisymposium.
The deadline for submission of a minisymposium is January 27, 2013 (acceptance
notifications will be sent by February 4, 2013).
The deadline for submission of a contributed talk is February 10, 2013
(acceptance notifications will be sent by February 18, 2013).
The deadline for Student / PDF funding applications is March 11, 2013
(notifications will be sent by April 1, 2013)
Online registration will be available shortly. The early registration deadline
is April 9, 2013.
Invited Speakers:
Miguel Anjos (École Polytechnique, Montréal)
Anne Condon (University of British Columbia)
Reinhard Diestel (Universität Hamburg)
Cheryl Praeger (The University of Western Australia)
Victor Reiner (University of Minnesota)
Carla Savage (North Carolina State University)
Robert Sedgewick (Princeton University)
Benny Sudakov (University of California Los Angeles)
Invited Minisymposia:
Algebraic Combinatorics - Steph Van Willigenburg (University of British
Columbia)
Algorithmic Methods in Comparative Genomics - Max Alekseyev (University of South
Carolina)
Analytic Combinatorics - Alfredo Viola (Universidad de la República, Uruguay)
Combinatorics and Geometry of Linear Optimization - Antoine Deza (McMaster
University)
Design Theory - Ian Wanless (Monash University)
Enumerative Combinatorics - Marni Mishna (Simon Fraser University)
Extremal Combinatorics - Dhruv Mubayi (University of Illinois at Chicago)
Graph Theory - Matthias Kriesell (Universität Hamburg)
Probabilistic Combinatorics - Mike Molloy (University of Toronto)
Problem Session - hosted by Brett Stevens (Carleton University). Please submit
open problems for this session directly to Brett at brett@math.carleton.ca, and
put "CanaDAM open problems" in the Subject: field when doing so.
Please pass this message along to colleagues in discrete mathematics. Our
apologies to those who receive it more than once. The organising team
expresses its thanks and gratitude to the Canadian Mathematical Society for the
conference's web presence.
======================================================
CanaDAM 2013
Deuxième annonce et soumission de présentations et de minisymposiums
Le Quatrième congrès canadien de mathématiques discrètes et algorithmiques aura
lieu du 10 au 13 juin 2013 sur le campus de l'Université Memorial dans la ville
de St. John's, à Terre-Neuve, Canada. Le congrès portera sur la théorie et les
applications des structures discrètes. Son but est de mettre en évidence les
développements récents et importants de cette branche des mathématiques. Le
congrès rassemblera des chercheurs des diverses disciplines ayant des
interactions avec les mathématiques discrètes et algorithmiques. Les congrès
CanaDAM ont lieu pendant les années impaires et leur format est semblable à
celui de la SIAM Conference on Discrete Mathematics. Parmi les sujets qui
seront abordés, mentionnons en particulier les graphes et digraphes, les
matroïdes, les ensembles ordonnés, la combinatoire des plans d'expérience, la
théorie des codes, le dénombrement des structures discrètes, la combinatoire
des mots, l'optimisation discrète, la géométrie discrète et algorithmique, le
dénombrement des points d'un treillis, les algorithmes combinatoires, la
théorie de la complexité, et finalement les applications des mathématiques
discrètes et algorithmiques, incluant (entre autres) les applications aux
graphes de la toile, à la biologie computationnelle, aux réseaux de
télécommunication et au traitement de l'information.
Veuillez consulter le site du congrès, http://CanaDAM.Math.ca/2013 , pour des
renseignements sur
* les personnes à contacter,
* l'hébergement,
* les dates importantes,
* les frais d'inscription,
* la ville et le campus,
* l'aide financière pour les étudiants et stagiaires postdoctoraux,
* le comité d'organisation et
* la procédure pour soumettre une présentation ou un minisymposium.
Les minisymposiums devront être soumis au plus tard le 27 janvier 2013 et les
personnes qui les proposeront recevront une réponse au plus tard le 4 février
2013.
Les présentations devront être soumises au plus tard le 10 février 2013 et leurs
auteurs recevront une réponse au plus tard le 18 février 2013.
Les étudiants ou stagiaires postdoctoraux devront faire leur demande d'aide
financière au plus tard le 11 mars 2013 et recevront une réponse au plus tard
le 1 avril 2013.
Il sera bientôt possible de s'inscrire en ligne au congrès. La date limite pour
l'inscription avec frais réduits est le 9 avril 2013.
Conférenciers invités:
Miguel Anjos (École Polytechnique, Montréal)
Anne Condon (University of British Columbia)
Reinhard Diestel (Universität Hamburg)
Cheryl Praeger (The University of Western Australia)
Victor Reiner (University of Minnesota)
Carla Savage (North Carolina State University)
Robert Sedgewick (Princeton University)
Benny Sudakov (University of California Los Angeles)
Minisymposiums sur invitation:
Algebraic Combinatorics - Steph Van Willigenburg (University of British
Columbia)
Algorithmic Methods in Comparative Genomics - Max Alekseyev (University of South
Carolina)
Analytic Combinatorics - Alfredo Viola (Universidad de la República, Uruguay)
Combinatorics and Geometry of Linear Optimization - Antoine Deza (McMaster
University)
Design Theory - Ian Wanless (Monash University)
Enumerative Combinatorics - Marni Mishna (Simon Fraser University)
Extremal Combinatorics - Dhruv Mubayi (University of Illinois at Chicago)
Graph Theory - Matthias Kriesell (Universität Hamburg)
Probabilistic Combinatorics - Mike Molloy (University of Toronto)
Séance de problèmes
Brett Stevens, de l'Université Carleton, présidera une séance de problèmes
pendant le congrès CanaDAM 2013. Toute personne désirant soumettre des
problèmes ouverts est invitée à les envoyer à Brett Stevens
(brett@math.carleton.ca), en donnant "CanaDAM open problems" comme sujet du
message.
Veuillez faire circuler cette annonce parmi vos collègues en mathématiques
discrètes, et nous excuser si vous la recevez plus d'une fois. Le Comité
d'organisation est très reconnaissant à la Société mathématique du Canada de
son aide pour la diffusion sur la toile des informations concernant le
congrès.
This electronic communication is governed by the terms and conditions at
http://www.mun.ca/cc/policies/electronic_communications_disclaimer_2012.php
**********************************************************
*
* 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: COGNITIVE 2013 || May 27 - June 1, 2013 - Valencia, Spain
INVITATION:
=================
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to
submit and publish original scientific results to COGNITIVE 2013.
The submission deadline is January 22, 2013.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals:
http://www.iariajournals.org
=================
============== COGNITIVE 2013 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
COGNITIVE 2013, The Fifth International Conference on Advanced Cognitive Technologies and Applications
May 27 - June 1, 2013 - Valencia, Spain
General page: http://www.iaria.org/conferences2013/COGNITIVE13.html
Call for Papers: http://www.iaria.org/conferences2013/CfPCOGNITIVE13.html
- regular papers
- short papers (work in progress)
- posters
Submission page: http://www.iaria.org/conferences2013/SubmitCOGNITIVE13.html
Submission deadline: January 22, 2013
Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org
Print proceedings will be available via Curran Associates, Inc.: http://www.proceedings.com/9769.html
Articles will be archived in the free access ThinkMind Digital Library: http://www.thinkmind.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
COGNITIVE 2013 Topics (topics and submission details: see CfP on the site)
BRAIN: Brain information processing and informatics
Cognitive and computation models; Human reasoning mechanisms; Modeling brain information processing
mechanisms; Brain learning mechanisms; Human cognitive functions and their relationships; Modeling human
multi-perception mechanisms and visual, auditory, and tactile information processing; Neural structures and
neurobiological process; Cognitive architectures; Brain information storage, collection, and processing;
Formal conceptual models of human brain data; Knowledge representation and discovery in neuroimaging;
Brain-computer interface; Cognition-inspired complex systems
COGNITION: Artificial intelligence and cognition
Expert systems, knowledge representation and reasoning; Reasoning techniques, constraint satisfaction and
machine learning; Logic programming, fuzzy logic, neural networks, and uncertainty; State space search,
ontologies and data mining; Games, planning and scheduling; Natural languages processing and advanced user
interfaces; Cognitive, reactive and proactive systems; Ambient intelligence, perception and vision
AGENTS: Agent-based adaptive systems
Agent frameworks and development platforms; Agent models and architectures; Agent communication languages
and protocols; Cooperation, coordination, and conversational agents; Group decision making and distributed
problem solving; Mobile, cognitive and autonomous agents; Task planning and execution in multi-agent
systems; Security, trust, reputation, privacy and safety in agent-based systems; Negotiation brokering and
matchmaking in agent-oriented protocols; Web-oriented agents (mining, semantic discovery, navigation, etc.;
SOA and software agents; Economic agent models and social adoption
AUTONOMY: Autonomous systems and autonomy-oriented computing
Self-organized intelligence nature-inspired thinking paradigms; Swarm intelligence and emergent behavior;
Autonomy-oriented modeling and computation; Coordination, cooperation and collective group behavior; Agent-
based complex systems modeling and development; Complex behavior aggregation and self-organization; Agent-
based knowledge discovery and sharing; Autonomous and distributed knowledge systems; Autonomous knowledge
via information agents; Ontology-based agent services; Knowledge evolution control and information filtering
agents; Natural and social law discovery in multi-agent systems; Distributed problem solving in complex and
dynamic environments; Auction, mediation, pricing, and agent-based market-places; Autonomous auctions and
negotiations
APPLICATIONS
Agent-oriented modeling and methodologies; Agent-based interaction protocols and cognitive architectures;
Emotional modeling and quality of experience techniques; Agent-based assistants and e-health; Agent-based
interfaces; Knowledge and data intensive classification systems; Agent-based fault-tolerance systems;
Learning and self-adaptation via multi-agent systems; Task-based and task-oriented agent-based systems;
Agent-based virtual enterprise; Embodied agents and agent-based systems applications; Agent-based perceptive
animated interfaces; Agent-based social simulation; Socially planning; E-Technology agent-based ubiquitous
services and systems
------------------------------------
Committee: http://www.iaria.org/conferences2013/ComCOGNITIVE13.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/
*
**********************************************************
=================
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to
submit and publish original scientific results to COGNITIVE 2013.
The submission deadline is January 22, 2013.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals:
http://www.iariajournals.org
=================
============== COGNITIVE 2013 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
COGNITIVE 2013, The Fifth International Conference on Advanced Cognitive Technologies and Applications
May 27 - June 1, 2013 - Valencia, Spain
General page: http://www.iaria.org/conferences2013/COGNITIVE13.html
Call for Papers: http://www.iaria.org/conferences2013/CfPCOGNITIVE13.html
- regular papers
- short papers (work in progress)
- posters
Submission page: http://www.iaria.org/conferences2013/SubmitCOGNITIVE13.html
Submission deadline: January 22, 2013
Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org
Print proceedings will be available via Curran Associates, Inc.: http://www.proceedings.com/9769.html
Articles will be archived in the free access ThinkMind Digital Library: http://www.thinkmind.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
COGNITIVE 2013 Topics (topics and submission details: see CfP on the site)
BRAIN: Brain information processing and informatics
Cognitive and computation models; Human reasoning mechanisms; Modeling brain information processing
mechanisms; Brain learning mechanisms; Human cognitive functions and their relationships; Modeling human
multi-perception mechanisms and visual, auditory, and tactile information processing; Neural structures and
neurobiological process; Cognitive architectures; Brain information storage, collection, and processing;
Formal conceptual models of human brain data; Knowledge representation and discovery in neuroimaging;
Brain-computer interface; Cognition-inspired complex systems
COGNITION: Artificial intelligence and cognition
Expert systems, knowledge representation and reasoning; Reasoning techniques, constraint satisfaction and
machine learning; Logic programming, fuzzy logic, neural networks, and uncertainty; State space search,
ontologies and data mining; Games, planning and scheduling; Natural languages processing and advanced user
interfaces; Cognitive, reactive and proactive systems; Ambient intelligence, perception and vision
AGENTS: Agent-based adaptive systems
Agent frameworks and development platforms; Agent models and architectures; Agent communication languages
and protocols; Cooperation, coordination, and conversational agents; Group decision making and distributed
problem solving; Mobile, cognitive and autonomous agents; Task planning and execution in multi-agent
systems; Security, trust, reputation, privacy and safety in agent-based systems; Negotiation brokering and
matchmaking in agent-oriented protocols; Web-oriented agents (mining, semantic discovery, navigation, etc.;
SOA and software agents; Economic agent models and social adoption
AUTONOMY: Autonomous systems and autonomy-oriented computing
Self-organized intelligence nature-inspired thinking paradigms; Swarm intelligence and emergent behavior;
Autonomy-oriented modeling and computation; Coordination, cooperation and collective group behavior; Agent-
based complex systems modeling and development; Complex behavior aggregation and self-organization; Agent-
based knowledge discovery and sharing; Autonomous and distributed knowledge systems; Autonomous knowledge
via information agents; Ontology-based agent services; Knowledge evolution control and information filtering
agents; Natural and social law discovery in multi-agent systems; Distributed problem solving in complex and
dynamic environments; Auction, mediation, pricing, and agent-based market-places; Autonomous auctions and
negotiations
APPLICATIONS
Agent-oriented modeling and methodologies; Agent-based interaction protocols and cognitive architectures;
Emotional modeling and quality of experience techniques; Agent-based assistants and e-health; Agent-based
interfaces; Knowledge and data intensive classification systems; Agent-based fault-tolerance systems;
Learning and self-adaptation via multi-agent systems; Task-based and task-oriented agent-based systems;
Agent-based virtual enterprise; Embodied agents and agent-based systems applications; Agent-based perceptive
animated interfaces; Agent-based social simulation; Socially planning; E-Technology agent-based ubiquitous
services and systems
------------------------------------
Committee: http://www.iaria.org/conferences2013/ComCOGNITIVE13.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/
*
**********************************************************
Sunday, December 23, 2012
[DMANET] [STACS 2013] Call for Participation
************************************************************************
STACS 2013 CALL FOR PARTICIPATION
30th International Symposium on Theoretical Aspects of Computer Science
February 27-March 2, 2013, Kiel, Germany
http://www.stacs2013.uni-kiel.de
************************************************************************
The 30th International Symposium on Theoretical Computer Science (STACS) will be held from February 27 to March 2, 2013 (Wednesday through Saturday), on the premises of the Christian-Albrechts-Universität zu Kiel.
SCIENTIFIC PROGRAM
******************
The program, which is available at
http://www.stacs2013/uni-kiel.de/ ,
is composed of 54 contributed and three invited talks as well as a tutorial.
INVITED TALKS AND TUTORIAL
**************************
- Kousha Etessami, University of Edinburgh
The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games
- Kurt Mehlhorn, MPI Saarbrücken and Saarland University
Physarum can compute shortest paths
- Stéphan Thomassé, Ecole Normale Supérieure de Lyon
Graph Coloring, Communication Complexity and the Stubborn Problem
- Dániel Marx, MTA SZTAKI, Hungarian Academy of Sciences (tutorial)
Algorithmic Graph Structure Theory
REGISTRATION
************
Registration is through the conference website,
http://www.stacs2013.uni-kiel.de/ .
INFORMATION
***********
For detailed information on STACS 2013, visit the conference website,
http://www.stacs2013.uni-kiel.de/ .
IMPORTANT DATES
***************
Early registration deadline: Jan 14, 2013
Regular registration: Jan 15 - Feb 14, 2013
Late registration: Feb 15 - Mar 2, 2013
Symposium: Feb 27 - Mar 2, 2013
CONTACT INFORMATION
*******************
info@stacs2013.uni-kiel.de
**********************************************************
*
* 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] Multiple Postdoctoral Programs at the Israeli center of research excellence in Algorithms
Multiple Postdoctoral Programs at the Israeli center of research
excellence in Algorithms
------------------------------------
We are seeking excellent candidates for three postdoctoral programs:
1. I-CORE in Algorithms postdoctoral program
2. I-CORE in Algorithms and the Simons Institute for the Theory of
Computing in Berkeley - a joint postdoctoral program
3. Leonardo Fibonacci fellowships - a joint postdoctoral program of
I-CORE Algo, CNR and ENEA
Details:
=======
1. I-CORE in Algorithms postdoctoral program
-----------------------------------------
The positions are supported by the Israeli Science Foundation (ISF).
The Israeli Center of Research Excellence in Algorithms is part of the
I-CORE program,
initiated by the Government of Israel and adopted by Israel's Council
of Higher Education,
in order to reinforce Israel's intellectual capacities and promote
synergy among Israel's leading research centers.
The institutes participating in the center are:
* The Blavatnik School of Computer Science, Tel Aviv University
* The Rachel and Selim Benin School of Computer Science and
Engineering, The Hebrew University of Jerusalem,
* Faculty of Mathematics and Computer Science, Weizmann Institute of Science.
Topics of interest include (but are not limited to):
all variety of algorithms (optimization, online, streaming,
approximation, randomized, geometric and more),
cryptography, security and privacy, algorithmic game theory, quantum
computing, networking and distributed computing,
databases, machine learning and computer vision.
To apply please send the following to saritc@post.tau.ac.il (deadline: 15/1/13)
- A CV of the applicant including the list of publications.
- A short research statement.
- The preferable I-CORE ALGO fellow to work with (if already known)
and institution in I-CORE ALGO. (There is a possibility of more than
one fellow and/or institution.)
In addition, all applicants should ensure that their recommenders
email their letters (as pdf files) to the email address above, with
the subject line "<candidate_name>: recommendation". (It is the
applicant's
responsibility to ensure that the letters are sent; the Institute will
not solicit letters directly.)
***
2. I-CORE in Algorithms and the Simons Institute for the Theory of
Computing in Berkeley - a joint postdoctoral program
--------------------------------------------------------------------------------------------------------------------
The Israeli Center of Research Excellence in Algorithms is part of the
I-CORE program,
initiated by the Government of Israel and adopted by Israel's Council
of Higher Education,
in order to reinforce Israel's intellectual capacities and promote
synergy among Israel's leading research centers.
The members of the center are some of Israel's most exceptional
computer scientists,
from The Blavatnik School of Computer Science in Tel Aviv University,
The Rachel and Selim Benin School of Computer Science and Engineering
in The Hebrew University of Jerusalem,
and the Faculty of Mathematics and Computer Science in Weizmann
Institute of Science.
The Simons Institute for the Theory of Computing is an exciting new
venue for collaborative research
in theoretical computer science and related fields. The Institute will
be housed in a dedicated building
on the UC Berkeley campus, and will act as a vibrant and welcoming
environment for visiting researchers.
In each academic semester the activities of the Institutes are largely
focused on specific research programs,
each of which attracts thirty to forty participants ranging from
senior scientists to graduate students.
The Simons Institute for the Theory of Computing was created in 2012
through a ten-year grant
from the Simons Foundation (more information can be found at
http://simons.berkeley.edu).
The joint postdoctoral position would start in the Fall 2013.
The joint post-doctoral fellow will first spend a semester (Fall 2013)
at the Simons Institute,
and then will continue at the I-Core in Algorithms for the remainder
of the academic year.
The topics of the research programs for Fall 2013 in the Simons Institute are
Real Analysis in Computer Science" and "Theoretical Foundations of Big
Data Analysis."
The topics of research in I-CORE in Algorithms include (but are not
limited to):
all variety of algorithms (optimization, online, streaming,
approximation, randomized, geometric and more),
cryptography, security and privacy, algorithmic game theory, quantum computing,
networking and distributed computing, databases, machine learning and
computer vision
(The research interests of potential candidates should match the
research interests of both institutions).
Salaries and benefits are competitive and assistance with visas and
housing will be provided.
We particularly encourage applications from outstanding women and
minority candidates.
In addition, the I-CORE in Algorithm would provide some support to
travel to and from Israel.
APPLICATION INSTRUCTIONS
Each applicant should submit the following documents (as pdf files) in
a single email to
info@icore-algo.org.il or saritc@post.tau.ac.il
- cover letter, including current institution and employment status,
(expected) date of PhD, and a statement indicating the Simon Institute
program (or
programs) in which you wish to participate, and why. For the I-CORE
Algo please indicate which institute
you would like to perform the research at (can be more than one);
- curriculum vitae, including full list of publications;
- research statement;
- names and email addresses of at least three recommenders.
In addition, all applicants should ensure that their recommenders
email their letters (as pdf files) to the email address above, with the
subject line "<candidate_name>: recommendation". (It is the applicant's
responsibility to ensure that the letters are sent; the Institute will
not solicit letters directly.)
The deadline for receipt of all application materials, including letters,
is January 15, 2013.
***
3. Leonardo Fibonacci fellowships - a joint postdoctoral program of
I-CORE Algo, CNR and ENEA
------------------------------------------------------------------------------------------
I-CORE Algo – the Israeli Center of Research Excellence in algorithms,
CNR – the National Research Council of Italy and ENEA – the Italian
National agency for new technologies,
Energy and sustainable economic development are seeking excellent
candidates for postdoctoral fellowships.
The joint program is supported by the Italian Ministry of Foreign Affairs,
and one of its objectives is strengthening the bi-national cooperation in
science and technology between Italy and Israel, under the auspices of the
Italian-Israeli Agreement on Industrial, Scientific and Technological
Cooperation.
CNR and ENEA participate in the program to help open new paths towards
excellence for young researchers,
some of whom will eventually join the Italian research system.
The Leonardo Fibonacci fellowships are named after the Italian
mathematician Leonardo Fibonacci,
arguably the greatest European mathematician of the middle ages.
I-CORE Algo is part of the I-CORE program, initiated by the Government of Israel
and adopted by Israel's Council of Higher Education in order to
reinforce Israel's
intellectual capacities and promote synergy among Israel's leading
research centers.
The members of the center are some of Israel's most exceptional
computer scientists,
from The Blavatnik School of Computer Science in Tel Aviv University,
The Rachel and Selim Benin School of Computer Science and Engineering in
The Hebrew University of Jerusalem, and the Faculty of Mathematics and
Computer Science in Weizmann Institute of Science.
SELECTION PROCESS:
Researches of any nationality can apply to the program, given that
they obtained their PhD
(Dottorato di Ricerca) from an institution in Italy no longer than 2
years before the date
of the application, or will obtain it within 3 months after the application.
EU nationals can apply independently of where they have obtained their degree,
within the same temporal frame.
Equal opportunity is a principle underlying the whole selection process.
Key criteria for the selection will be
1. the scientific potential of the candidates, as assessed by their
academic record and thesis,
by publications, if any, by previous research experience and by any
previous awards and honors.
2. the expected benefits of the fellowship for the trainees, as
indicated also by a short research statement
(or tentative project) submitted with the application.
Reference letters are requested from at least three recommenders and
will contribute to assess both criteria.
The Fellowships will be awarded initially for a period of up to twelve
months, and they may be prolonged,
after consideration, within the same program or other programs of the
I-CORE center.
The Leonardo Fibonacci fellows will perform their postdoctoral
research in one of the I-CORE in Algorithms institutions.
Salaries and benefits are competitive and assistance with visas and
housing will be provided.
The selection Committee (3 members, from the CNR, the I-CORE in
Algorithms and the Embassy of Italy in Israel)
will choose between applicants, on the basis of the above criteria.
The selected candidates will submit a brief activity report to the
Committee every three months.
RESEARCH SCOPE:
The topics of research in I-CORE in Algorithms include (but are not
limited to): all variety of algorithms
(optimization, online, streaming, approximation, randomized, geometric
and more), cryptography,
security and privacy, algorithmic game theory, quantum computing,
networking and distributed computing,
databases, machine learning and computer vision.
The selected candidates will be able to choose which of the center
members will be their advisor.
APPLICATION PROCEDURE:
To apply, please send the attached form (as .pdf) by e-mail to both
saritc@post.tau.ac.il and lucilla.alagna @esteri.it
In addition, applicants should ensure that their recommenders email
their letters (as pdf files)
to the email addresses above, with the subject line "<candidate_name>:
recommendation".
(It is the applicant's responsibility to ensure that the letters are
sent; letters will not be solicited directly.)
The deadline is 15th January 2013, 24:00 (at GMT+1)
to download application form:
http://www.icore-algo.org.il/?q=content/post-doc-programs
**********************************************************
*
* 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/
*
**********************************************************
excellence in Algorithms
------------------------------------
We are seeking excellent candidates for three postdoctoral programs:
1. I-CORE in Algorithms postdoctoral program
2. I-CORE in Algorithms and the Simons Institute for the Theory of
Computing in Berkeley - a joint postdoctoral program
3. Leonardo Fibonacci fellowships - a joint postdoctoral program of
I-CORE Algo, CNR and ENEA
Details:
=======
1. I-CORE in Algorithms postdoctoral program
-----------------------------------------
The positions are supported by the Israeli Science Foundation (ISF).
The Israeli Center of Research Excellence in Algorithms is part of the
I-CORE program,
initiated by the Government of Israel and adopted by Israel's Council
of Higher Education,
in order to reinforce Israel's intellectual capacities and promote
synergy among Israel's leading research centers.
The institutes participating in the center are:
* The Blavatnik School of Computer Science, Tel Aviv University
* The Rachel and Selim Benin School of Computer Science and
Engineering, The Hebrew University of Jerusalem,
* Faculty of Mathematics and Computer Science, Weizmann Institute of Science.
Topics of interest include (but are not limited to):
all variety of algorithms (optimization, online, streaming,
approximation, randomized, geometric and more),
cryptography, security and privacy, algorithmic game theory, quantum
computing, networking and distributed computing,
databases, machine learning and computer vision.
To apply please send the following to saritc@post.tau.ac.il (deadline: 15/1/13)
- A CV of the applicant including the list of publications.
- A short research statement.
- The preferable I-CORE ALGO fellow to work with (if already known)
and institution in I-CORE ALGO. (There is a possibility of more than
one fellow and/or institution.)
In addition, all applicants should ensure that their recommenders
email their letters (as pdf files) to the email address above, with
the subject line "<candidate_name>: recommendation". (It is the
applicant's
responsibility to ensure that the letters are sent; the Institute will
not solicit letters directly.)
***
2. I-CORE in Algorithms and the Simons Institute for the Theory of
Computing in Berkeley - a joint postdoctoral program
--------------------------------------------------------------------------------------------------------------------
The Israeli Center of Research Excellence in Algorithms is part of the
I-CORE program,
initiated by the Government of Israel and adopted by Israel's Council
of Higher Education,
in order to reinforce Israel's intellectual capacities and promote
synergy among Israel's leading research centers.
The members of the center are some of Israel's most exceptional
computer scientists,
from The Blavatnik School of Computer Science in Tel Aviv University,
The Rachel and Selim Benin School of Computer Science and Engineering
in The Hebrew University of Jerusalem,
and the Faculty of Mathematics and Computer Science in Weizmann
Institute of Science.
The Simons Institute for the Theory of Computing is an exciting new
venue for collaborative research
in theoretical computer science and related fields. The Institute will
be housed in a dedicated building
on the UC Berkeley campus, and will act as a vibrant and welcoming
environment for visiting researchers.
In each academic semester the activities of the Institutes are largely
focused on specific research programs,
each of which attracts thirty to forty participants ranging from
senior scientists to graduate students.
The Simons Institute for the Theory of Computing was created in 2012
through a ten-year grant
from the Simons Foundation (more information can be found at
http://simons.berkeley.edu).
The joint postdoctoral position would start in the Fall 2013.
The joint post-doctoral fellow will first spend a semester (Fall 2013)
at the Simons Institute,
and then will continue at the I-Core in Algorithms for the remainder
of the academic year.
The topics of the research programs for Fall 2013 in the Simons Institute are
Real Analysis in Computer Science" and "Theoretical Foundations of Big
Data Analysis."
The topics of research in I-CORE in Algorithms include (but are not
limited to):
all variety of algorithms (optimization, online, streaming,
approximation, randomized, geometric and more),
cryptography, security and privacy, algorithmic game theory, quantum computing,
networking and distributed computing, databases, machine learning and
computer vision
(The research interests of potential candidates should match the
research interests of both institutions).
Salaries and benefits are competitive and assistance with visas and
housing will be provided.
We particularly encourage applications from outstanding women and
minority candidates.
In addition, the I-CORE in Algorithm would provide some support to
travel to and from Israel.
APPLICATION INSTRUCTIONS
Each applicant should submit the following documents (as pdf files) in
a single email to
info@icore-algo.org.il or saritc@post.tau.ac.il
- cover letter, including current institution and employment status,
(expected) date of PhD, and a statement indicating the Simon Institute
program (or
programs) in which you wish to participate, and why. For the I-CORE
Algo please indicate which institute
you would like to perform the research at (can be more than one);
- curriculum vitae, including full list of publications;
- research statement;
- names and email addresses of at least three recommenders.
In addition, all applicants should ensure that their recommenders
email their letters (as pdf files) to the email address above, with the
subject line "<candidate_name>: recommendation". (It is the applicant's
responsibility to ensure that the letters are sent; the Institute will
not solicit letters directly.)
The deadline for receipt of all application materials, including letters,
is January 15, 2013.
***
3. Leonardo Fibonacci fellowships - a joint postdoctoral program of
I-CORE Algo, CNR and ENEA
------------------------------------------------------------------------------------------
I-CORE Algo – the Israeli Center of Research Excellence in algorithms,
CNR – the National Research Council of Italy and ENEA – the Italian
National agency for new technologies,
Energy and sustainable economic development are seeking excellent
candidates for postdoctoral fellowships.
The joint program is supported by the Italian Ministry of Foreign Affairs,
and one of its objectives is strengthening the bi-national cooperation in
science and technology between Italy and Israel, under the auspices of the
Italian-Israeli Agreement on Industrial, Scientific and Technological
Cooperation.
CNR and ENEA participate in the program to help open new paths towards
excellence for young researchers,
some of whom will eventually join the Italian research system.
The Leonardo Fibonacci fellowships are named after the Italian
mathematician Leonardo Fibonacci,
arguably the greatest European mathematician of the middle ages.
I-CORE Algo is part of the I-CORE program, initiated by the Government of Israel
and adopted by Israel's Council of Higher Education in order to
reinforce Israel's
intellectual capacities and promote synergy among Israel's leading
research centers.
The members of the center are some of Israel's most exceptional
computer scientists,
from The Blavatnik School of Computer Science in Tel Aviv University,
The Rachel and Selim Benin School of Computer Science and Engineering in
The Hebrew University of Jerusalem, and the Faculty of Mathematics and
Computer Science in Weizmann Institute of Science.
SELECTION PROCESS:
Researches of any nationality can apply to the program, given that
they obtained their PhD
(Dottorato di Ricerca) from an institution in Italy no longer than 2
years before the date
of the application, or will obtain it within 3 months after the application.
EU nationals can apply independently of where they have obtained their degree,
within the same temporal frame.
Equal opportunity is a principle underlying the whole selection process.
Key criteria for the selection will be
1. the scientific potential of the candidates, as assessed by their
academic record and thesis,
by publications, if any, by previous research experience and by any
previous awards and honors.
2. the expected benefits of the fellowship for the trainees, as
indicated also by a short research statement
(or tentative project) submitted with the application.
Reference letters are requested from at least three recommenders and
will contribute to assess both criteria.
The Fellowships will be awarded initially for a period of up to twelve
months, and they may be prolonged,
after consideration, within the same program or other programs of the
I-CORE center.
The Leonardo Fibonacci fellows will perform their postdoctoral
research in one of the I-CORE in Algorithms institutions.
Salaries and benefits are competitive and assistance with visas and
housing will be provided.
The selection Committee (3 members, from the CNR, the I-CORE in
Algorithms and the Embassy of Italy in Israel)
will choose between applicants, on the basis of the above criteria.
The selected candidates will submit a brief activity report to the
Committee every three months.
RESEARCH SCOPE:
The topics of research in I-CORE in Algorithms include (but are not
limited to): all variety of algorithms
(optimization, online, streaming, approximation, randomized, geometric
and more), cryptography,
security and privacy, algorithmic game theory, quantum computing,
networking and distributed computing,
databases, machine learning and computer vision.
The selected candidates will be able to choose which of the center
members will be their advisor.
APPLICATION PROCEDURE:
To apply, please send the attached form (as .pdf) by e-mail to both
saritc@post.tau.ac.il and lucilla.alagna @esteri.it
In addition, applicants should ensure that their recommenders email
their letters (as pdf files)
to the email addresses above, with the subject line "<candidate_name>:
recommendation".
(It is the applicant's responsibility to ensure that the letters are
sent; letters will not be solicited directly.)
The deadline is 15th January 2013, 24:00 (at GMT+1)
to download application form:
http://www.icore-algo.org.il/?q=content/post-doc-programs
**********************************************************
*
* 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: COMPUTATION TOOLS 2013 || May 27 - June 1, 2013 - Valencia, Spain
INVITATION:
=================
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results to COMPUTATION TOOLS 2013.
The submission deadline is extended to January 22, 2013.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org
=================
============== COMPUTATION TOOLS 2013 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
COMPUTATION TOOLS 2013, The Fourth International Conference on Computational Logics, Algebras, Programming, Tools, and Benchmarking
May 27 - June 1, 2013 - Valencia, Spain
General page: http://www.iaria.org/conferences2013/COMPUTATIONTOOLS13.html
Call for Papers: http://www.iaria.org/conferences2013/CfPCOMPUTATIONTOOLS13.html
- regular papers
- short papers (work in progress)
- posters
Submission page: http://www.iaria.org/conferences2013/SubmitCOMPUTATIONTOOLS13.html
Submission deadline: January 22, 2013
Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org
Print proceedings will be available via Curran Associates, Inc.: http://www.proceedings.com/9769.html
Articles will be archived in the free access ThinkMind Digital Library: http://www.thinkmind.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
COMPUTATION TOOLS 2013 Topics (topics and submission details: see CfP on the site)
Logics
Reasoning logics; Fuzzy logics; Semantic logics; Temporal logics; Emotion logics; Ambiant logics; Modal logics; Description logics; Computational tree logic; Computational logics and constraints; Quantum computational logics; Executable computational logics; Monadic computational logics; Many-valued computational logics; Computability logic
Algebras
Computational algebras; K-theories, C*-algebras, Index theory; Algebraic and topological K-theory; Geometric group theory and group C*-algebras; Noncommutative geometry and topology; Pseudodifferential operators on singular manifolds; Topological invariants of non-simply connected manifolds; Deformation quantization; Lambda calculus; Relation algebra; Algebras for symbolic computation; Constructive algebras
Advanced computation techniques
Machine learning; Fuzzy theory/computation/logic; (Artificial) neuronal networks; Distributed artificial intelligence; Genetic algorithms; Analytic tableaux; Autonomous agent-based techniques; Knowledge-based systems and automated reasoning; Logical issues in knowledge representation /non-monotonic reasoning/belief; Dempster-Shafer theory; Concurrent computation and planning; Deduction and reasoning
Specialized programming languages
Logic programming; Specialized computation languages; Real-time computation languages; Embedded-computing languages; Programming semantics; Content-driven programming; Multimedia-oriented programming; Context-driven programming; Service-oriented programming; Pattern-oriented programming; Regenerative programming; Progressive programming; Sensing-oriented programming; Mobile-ubiquity-oriented computing; Compilation issues
Tools for distributed computation
Platforms for distributed computing; Specification and verification of programs and systems; Techniques for cloud computing; On-request resource allocation mechanisms; Security and privacy techniques; Computational benchmarking metrics, criteria and methodologies; Distributed debug and on-fly repairing; Inference of schemas, integrity constraints in computational applications; Real-world applications, experiments, projects
-------------------------------------------
Committee: http://www.iaria.org/conferences2013/ComCOMPUTATIONTOOLS13.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/
*
**********************************************************
=================
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results to COMPUTATION TOOLS 2013.
The submission deadline is extended to January 22, 2013.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org
=================
============== COMPUTATION TOOLS 2013 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
COMPUTATION TOOLS 2013, The Fourth International Conference on Computational Logics, Algebras, Programming, Tools, and Benchmarking
May 27 - June 1, 2013 - Valencia, Spain
General page: http://www.iaria.org/conferences2013/COMPUTATIONTOOLS13.html
Call for Papers: http://www.iaria.org/conferences2013/CfPCOMPUTATIONTOOLS13.html
- regular papers
- short papers (work in progress)
- posters
Submission page: http://www.iaria.org/conferences2013/SubmitCOMPUTATIONTOOLS13.html
Submission deadline: January 22, 2013
Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org
Print proceedings will be available via Curran Associates, Inc.: http://www.proceedings.com/9769.html
Articles will be archived in the free access ThinkMind Digital Library: http://www.thinkmind.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
COMPUTATION TOOLS 2013 Topics (topics and submission details: see CfP on the site)
Logics
Reasoning logics; Fuzzy logics; Semantic logics; Temporal logics; Emotion logics; Ambiant logics; Modal logics; Description logics; Computational tree logic; Computational logics and constraints; Quantum computational logics; Executable computational logics; Monadic computational logics; Many-valued computational logics; Computability logic
Algebras
Computational algebras; K-theories, C*-algebras, Index theory; Algebraic and topological K-theory; Geometric group theory and group C*-algebras; Noncommutative geometry and topology; Pseudodifferential operators on singular manifolds; Topological invariants of non-simply connected manifolds; Deformation quantization; Lambda calculus; Relation algebra; Algebras for symbolic computation; Constructive algebras
Advanced computation techniques
Machine learning; Fuzzy theory/computation/logic; (Artificial) neuronal networks; Distributed artificial intelligence; Genetic algorithms; Analytic tableaux; Autonomous agent-based techniques; Knowledge-based systems and automated reasoning; Logical issues in knowledge representation /non-monotonic reasoning/belief; Dempster-Shafer theory; Concurrent computation and planning; Deduction and reasoning
Specialized programming languages
Logic programming; Specialized computation languages; Real-time computation languages; Embedded-computing languages; Programming semantics; Content-driven programming; Multimedia-oriented programming; Context-driven programming; Service-oriented programming; Pattern-oriented programming; Regenerative programming; Progressive programming; Sensing-oriented programming; Mobile-ubiquity-oriented computing; Compilation issues
Tools for distributed computation
Platforms for distributed computing; Specification and verification of programs and systems; Techniques for cloud computing; On-request resource allocation mechanisms; Security and privacy techniques; Computational benchmarking metrics, criteria and methodologies; Distributed debug and on-fly repairing; Inference of schemas, integrity constraints in computational applications; Real-world applications, experiments, projects
-------------------------------------------
Committee: http://www.iaria.org/conferences2013/ComCOMPUTATIONTOOLS13.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/
*
**********************************************************
Saturday, December 22, 2012
[DMANET] Two Postdoctoral Positions in Algorithms at Sapienza University of Rome
=========================================================
Two Postdoctoral Positions in Algorithms at Sapienza University of Rome
=========================================================
Two postdoctoral positions in algorithms are available at Sapienza
University of Rome, Department of Computer, Control and Management
Engineering. Candidates with strong qualifications in all areas of
algorithmic design are encouraged to apply and will be carefully
considered. Areas of specific interest are:
- Approximation Algorithms
- Algorithmic Game Theory
- Mechanism Design and Computerized Auctions
- Algorithms for Social Networks
- Web Algorithmics and Data Mining
Applicants should have a PhD degree or being close to completing it.
Knowledge of Italian language is not necessary, but good knowledge of
English is required. Salary will be commensurate with experience and
levels of accomplishment. The positions are partly supported by the
EU PAAl project (ERC Starting Grant 259515: Practical Approximation
Algorithms, Principal Investigator: Piotr Sankowski) and by the
EU MULTIPLEX project (EU-FET-317532:Foundational Research on Multilevel
Complex Networks and Systems.)
Successful candidates can start after May 2013 (negotiable). Funding is
available for up to 2 years and different durations are possible.
Travel support is available.
Applications (including curriculum vitae, list of publications, research
statement, names of references with their e-mail addresses, and intended
period of stay) should be sent, by email if possible, by January 31st,
2013 to:
Stefano Leonardi
Department of Computer, Control and Management Engineering
Sapienza University of Rome
00185 Roma
Italy
Email: leonardi@dis.uniroma1.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/
*
**********************************************************
Two Postdoctoral Positions in Algorithms at Sapienza University of Rome
=========================================================
Two postdoctoral positions in algorithms are available at Sapienza
University of Rome, Department of Computer, Control and Management
Engineering. Candidates with strong qualifications in all areas of
algorithmic design are encouraged to apply and will be carefully
considered. Areas of specific interest are:
- Approximation Algorithms
- Algorithmic Game Theory
- Mechanism Design and Computerized Auctions
- Algorithms for Social Networks
- Web Algorithmics and Data Mining
Applicants should have a PhD degree or being close to completing it.
Knowledge of Italian language is not necessary, but good knowledge of
English is required. Salary will be commensurate with experience and
levels of accomplishment. The positions are partly supported by the
EU PAAl project (ERC Starting Grant 259515: Practical Approximation
Algorithms, Principal Investigator: Piotr Sankowski) and by the
EU MULTIPLEX project (EU-FET-317532:Foundational Research on Multilevel
Complex Networks and Systems.)
Successful candidates can start after May 2013 (negotiable). Funding is
available for up to 2 years and different durations are possible.
Travel support is available.
Applications (including curriculum vitae, list of publications, research
statement, names of references with their e-mail addresses, and intended
period of stay) should be sent, by email if possible, by January 31st,
2013 to:
Stefano Leonardi
Department of Computer, Control and Management Engineering
Sapienza University of Rome
00185 Roma
Italy
Email: leonardi@dis.uniroma1.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/
*
**********************************************************
Friday, December 21, 2012
[DMANET] CFP: IJCAI 2013 with special track on "AI and Computational Sustainability"
IJCAI 2013 Call for papers
The IJCAI 2013 Program Committee invites submissions of technical
papers for IJCAI 2013, to be held in Beijing, China, on August 3-9,
2013. Submissions are invited on significant, original, and
previously unpublished research on all aspects of artificial
intelligence.
The theme of IJCAI 2013 is "AI and computational sustainability". AI
can play a key role in addressing environmental, economic, and
societal challenges concerning sustainable development and a
sustainable future. AI techniques and methodologies can be exploited
to help address sustainability problems and questions, for example to
increase the efficiency and effectiveness of the way we manage and
allocate our natural and societal resources. The study of
sustainability questions will also enrich and transform AI, by
providing new challenges. The conference will include a special track
dedicated to papers concerned with all these aspects (see below the
call for paper for this track).
Important dates
Abstract submission: January 26, 2013 (11:59PM, UTC-12)
Paper submission: January 31, 2013 (11:59PM, UTC-12)
Author feedback: March 4-6, 2013 (11:59PM, UTC-12).
Notification of acceptance/rejection: April 2, 2013
Camera-ready copy due: Apr 23, 2013
Technical sessions: August 3-9, 2013
For full details, please visit:
http://ijcai13.org/calls/call_for_papers
*** IJCAI 2013 AI and Computational Sustainability (AICS) Track: Call
for Papers ***
Computational Sustainability aims to apply computational techniques to
the balancing of environmental, economic, and societal needs, in order
to support sustainable development and a sustainable future. Research
in computational sustainability is inherently interdisciplinary: It
brings together computational sciences and other fields such as
environmental sciences, biology, economics, and sociology. AI
techniques and methodologies can be instrumental in addressing
sustainability problems and questions, for example to increase the
efficiency and effectiveness of the way we manage and allocate our
natural and societal resources. This will also enrich and transform
AI, by providing new challenges.
Sustainability domains include the following:
Natural resources and the environment (such as water, atmosphere,
oceans, forest, land, etc.)
Economics and human behavior (such as well-being, poverty, diseases,
over-population, etc.)
Energy resources (for example, renewable energy, smart grid, and so on.)
Human-built systems and land use (such as transportation, cities,
buildings, agriculture, etc.)
Climate (such as climate prediction, impact of and on climate, etc.)
This special track is dedicated to papers concerned with innovative
notions, models, algorithms, techniques, methodologies, and systems,
in order to address problems in computational sustainability. Papers
can range from formal analysis to applied research. Papers describing
interesting sustainability problems and data sets, or papers proposing
general challenges and competitions for computational sustainability,
are also welcome.
The AICS track welcomes two types of articles:
technical AICS papers, showing how AI can be instrumental in
addressing sustainability questions;
data challenge papers,providing the description of a new
sustainability problem as well as the corresponding data set to be
made available to the AI community.
Technical AICS papers must follow the instructions given in the
general call for technical conference papers. Dataset papers should be
up to three pages in length, included figures and references. Please
indicate that your paper is a dataset paper by selecting this paper
type in the submission site.
There will be specific keywords for the AICS track. When registering a
paper, authors should select at least one keyword from the AICS list
and at least one keyword from the general IJCAI 2013 list.
Submitted papers in the AICS track will be reviewed by qualified
reviewers drawn from a special track committee as well as the general
program committee. AICS papers will be judged based on the usual
measures of quality, with consideration of the relevance to the theme
and the potential impact on sustainability problems. Submissions to
this special track that are deemed not to be relevant may be
considered for review in the general technical papers track at the
discretion of the chairs. Papers are submitted via the same submission
Web site as the main technical track, where the "Special Track on
Artificial Intelligence and Computational Sustainability" option
should be selected after logging in. For more submission details,
please consult http://ijcai13.org/calls/call_for_papers. For
questions, please email the AICS Track Chair, Carla Gomes, at
aicschair13@ijcai.org.
Computational Sustainability Awards
IJCAI 2013 is joining with the Computing Community Consortium (CCC) to
promote work at the intersection of computing and sustainability on
principles and applications that address environmental, economic, and
societal needs in support of a sustainable future. An IJCAI 2013
committee will select outstanding papers in this area to receive CCC
travel awards provided by CCC to the authors of the papers
http://www.cra.org/ccc/csus.php).
**********************************************************
*
* 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/
*
**********************************************************
The IJCAI 2013 Program Committee invites submissions of technical
papers for IJCAI 2013, to be held in Beijing, China, on August 3-9,
2013. Submissions are invited on significant, original, and
previously unpublished research on all aspects of artificial
intelligence.
The theme of IJCAI 2013 is "AI and computational sustainability". AI
can play a key role in addressing environmental, economic, and
societal challenges concerning sustainable development and a
sustainable future. AI techniques and methodologies can be exploited
to help address sustainability problems and questions, for example to
increase the efficiency and effectiveness of the way we manage and
allocate our natural and societal resources. The study of
sustainability questions will also enrich and transform AI, by
providing new challenges. The conference will include a special track
dedicated to papers concerned with all these aspects (see below the
call for paper for this track).
Important dates
Abstract submission: January 26, 2013 (11:59PM, UTC-12)
Paper submission: January 31, 2013 (11:59PM, UTC-12)
Author feedback: March 4-6, 2013 (11:59PM, UTC-12).
Notification of acceptance/rejection: April 2, 2013
Camera-ready copy due: Apr 23, 2013
Technical sessions: August 3-9, 2013
For full details, please visit:
http://ijcai13.org/calls/call_for_papers
*** IJCAI 2013 AI and Computational Sustainability (AICS) Track: Call
for Papers ***
Computational Sustainability aims to apply computational techniques to
the balancing of environmental, economic, and societal needs, in order
to support sustainable development and a sustainable future. Research
in computational sustainability is inherently interdisciplinary: It
brings together computational sciences and other fields such as
environmental sciences, biology, economics, and sociology. AI
techniques and methodologies can be instrumental in addressing
sustainability problems and questions, for example to increase the
efficiency and effectiveness of the way we manage and allocate our
natural and societal resources. This will also enrich and transform
AI, by providing new challenges.
Sustainability domains include the following:
Natural resources and the environment (such as water, atmosphere,
oceans, forest, land, etc.)
Economics and human behavior (such as well-being, poverty, diseases,
over-population, etc.)
Energy resources (for example, renewable energy, smart grid, and so on.)
Human-built systems and land use (such as transportation, cities,
buildings, agriculture, etc.)
Climate (such as climate prediction, impact of and on climate, etc.)
This special track is dedicated to papers concerned with innovative
notions, models, algorithms, techniques, methodologies, and systems,
in order to address problems in computational sustainability. Papers
can range from formal analysis to applied research. Papers describing
interesting sustainability problems and data sets, or papers proposing
general challenges and competitions for computational sustainability,
are also welcome.
The AICS track welcomes two types of articles:
technical AICS papers, showing how AI can be instrumental in
addressing sustainability questions;
data challenge papers,providing the description of a new
sustainability problem as well as the corresponding data set to be
made available to the AI community.
Technical AICS papers must follow the instructions given in the
general call for technical conference papers. Dataset papers should be
up to three pages in length, included figures and references. Please
indicate that your paper is a dataset paper by selecting this paper
type in the submission site.
There will be specific keywords for the AICS track. When registering a
paper, authors should select at least one keyword from the AICS list
and at least one keyword from the general IJCAI 2013 list.
Submitted papers in the AICS track will be reviewed by qualified
reviewers drawn from a special track committee as well as the general
program committee. AICS papers will be judged based on the usual
measures of quality, with consideration of the relevance to the theme
and the potential impact on sustainability problems. Submissions to
this special track that are deemed not to be relevant may be
considered for review in the general technical papers track at the
discretion of the chairs. Papers are submitted via the same submission
Web site as the main technical track, where the "Special Track on
Artificial Intelligence and Computational Sustainability" option
should be selected after logging in. For more submission details,
please consult http://ijcai13.org/calls/call_for_papers. For
questions, please email the AICS Track Chair, Carla Gomes, at
aicschair13@ijcai.org.
Computational Sustainability Awards
IJCAI 2013 is joining with the Computing Community Consortium (CCC) to
promote work at the intersection of computing and sustainability on
principles and applications that address environmental, economic, and
societal needs in support of a sustainable future. An IJCAI 2013
committee will select outstanding papers in this area to receive CCC
travel awards provided by CCC to the authors of the papers
http://www.cra.org/ccc/csus.php).
**********************************************************
*
* 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/
*
**********************************************************
Subscribe to:
Posts (Atom)
Posts
