INVITATION:
=================
Please consider to contribute to and/or forward to the appropriate groups the
following opportunity to submit and publish original scientific results to ICNS
2013.
The submission deadline is extended to November 12, 2012.
Authors of selected papers will be invited to submit extended article versions to
one of the IARIA Journals: http://www.iariajournals.org
=================
============== ICNS 2013 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
ICNS 2013, The Ninth International Conference on Networking and Services
March 24 - 29, 2013 - Lisbon, Portugal
General page: http://www.iaria.org/conferences2013/ICNS13.html
Call for Papers: http://www.iaria.org/conferences2013/CfPICNS13.html
- regular papers
- short papers (work in progress)
- posters
Submission page: http://www.iaria.org/conferences2013/SubmitICNS13.html
Submission deadline: November 12, 2012
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
ICNS 2013 Topics (topics and submission details: see CfP on the site)
ENCOT: Emerging Network Communications and Technologies
Access and home networks; Ad hoc networks; Application-specific networks (e.g.
SANs); Autonomic Networks; Delay-tolerant Networking; Distributed communications
systems & applications; Energy-efficient networking; High-speed & optical networks;
Mobile networking and systems; MPLS-VPN & IPSec-VPN networks; Multimedia and
multicast communications; Networking Communication theory; Network modeling &
simulation; Network monitoring techniques; Network security; Next Generation
Networks (NGN); Overlay networks; Peer-to-peer networking; Programmable and Active
Networks; Sensor networks; Switching and routing; Wireless and Satellite Networks
COMAN: Network Control and Management
Network, control and service architectures; Network signaling, pricing and billing;
Network middleware; Network management, monitoring and control; Network resource
scheduling; Networks policy-based management; Management of autonomic networks and
systems; Telecommunication networks architectures; On-demand networks, utility
computing architectures; Applications and case studies
SERVI: Multi-technology service deployment and assurance
Service-oriented architectures; Service definition, creation, bundling, deployment;
Service reuse, composition and service feature interaction; Service orchestration
and federation; Inter-provider service dependency; Intra-provider service
dependency and service interaction; Service middleware and service development
platforms (SDPs); Service open architecture (SOA); Profiling and service
adaptation; Service privacy and security; Quality of service, service level
agreement [QoS/SLA]; Service agreement violations; Mobile services and service
migration; Reliability, availability, serviceability [RAS]; Service performance
metrics; Traffic engineering, metering, monitoring; Voice over IP services; IP
Multimedia services; Real-time/not-real-rime services; real-time services over
IP/IPv6; Service performance evaluation, tools, simulation
NGNUS: Next Generation Networks and Ubiquitous Services
Methodologies, development support, and tools for NGN and converging services; NGN
and convergence of ubiquitous services; NGN frameworks, architectures, and
concepts; NGN technologies and mechanisms; QoS/SLA, traffic in NGN; NGN
transport/service layered capabilities and operations; NGN concepts for active, ad
hoc, mobile, and wireless networks; 3G and 4G Mobile networks; Fixed/mobile
networks integration and internetworking; Services and service differentiation over
NGN; Managing ubiquitous services in NGN; NGN interworking, non-NGN
interoperability, migration; Regulatory services in NGN and standard activities;
NGN device instrumentation; NGN policy-based control; Next Generation Internet
MPQSI: Multi Provider QoS/SLA Internetworking
Architectures, frameworks, mechanisms for admission control and measurement; QoS in
multi-provider and multi-technology networks; Service classes and multi-provider
service class discovery; Service level agreement and service assurance in
multi-provider environments; Carrier-class end-to-end SLA and QoS monitoring and
management; Multi provider accounting/billing/cost sharing; Management, monitoring,
and measurements in multi-provider networks; End-to-end QoS/SLA advanced network
services in multi-provider networks; End-to-end QoS/SLA for multimedia applications
and services in multi-provider networks; Security issues in multi-service provider
networks; Business models for multi-providers under QoS/SLA constraints; Standards
and fora activities
GRIDNS: Grid Networks and Services
GRID theory, frameworks, methodologies, architecture, ontology; GRID infrastructure
and technologies; GRID middleware; GRID protocols and networking; GRID computing,
utility computing, autonomic computing, metacomputing; Programmable GRID; Data
GRID; Context ontology and management in GRIDs; Distributed decisions in GRID
networks; GRID services and applications; Virtualization, modeling, and metadata in
GRID; Resource management, scheduling, and scalability in GRID; GRID monitoring,
control, and management; Traffic and load balancing in GRID; User profiles and
priorities in GRID; Performance and security in GRID systems; Fault tolerance,
resilience, survivability, robustness in GRID; QoS/SLA in GRID networks; GRID fora,
standards, development, evolution; GRID case studies, validation testbeds,
prototypes, and lessons learned
EDNA: Emergency Services and Disaster Recovery of Networks and Applications
Theory on disaster-tolerant robust networks; Recovery by disruption resource
procedures; Security issues with emergency services and disaster recovery; Networks
resiliency methods; Formal methods for safety-critical systems; Networks emergency
services; Public safety, reliable emergency communications, and applications;
Response to the networks emergency services; Disaster prevention and recovery;
Fighting mechanisms for disaster of networks and applications; Notifications and
recovery in various network technologies; Customer protection and serviceability
perception; Cost models and business impact; Cultural and legal aspects; Future
advanced network development and evolution; Standards and guidelines; Lawful
interception and defense strategies;
IPv6DFI: Deploying the Future Infrastructure
IP Upgrade - An Engineering Exercise or a Necessity?; Worldwide IPv6 Adoption -
Trends and Policies; National Strategies in Stimulating IPv6 Adoption; IPv6 in
Government Infrastructures - Specific Requirements; IPv6 Infrastructures for
Emergency Response and Law Enforcement - MetroNet6; Communications Equipment
Certification for IPv6 Support; IPv6 in Broadband Networks; IPv6 Programs, from
Research to Knowledge Dissemination; IPv6 Technology - Practical Information;
Advanced Topics and Latest Developments in IPv6; IPv6 Deployment Experiences and
Case Studies; IPv6 Enabled Applications and Devices
IPDy: Internet Packet Dynamics
Measurement of stream characteristics (reordering, delay, losses, jitter, etc.);
Measurement and estimation of network characteristics; Tools, metrics and
benchmarks; End-to-end packet dynamics; Timing aspects in packet dynamics; Impact
of load balancing, parallelism within nodes, etc. on packet dynamics; QoS
mechanisms and their impact on packet dynamics; Models (e.g., relating protocols,
resources and architectures to packet dynamics); Mitigation of adverse effects of
reordering, jitter, etc.; Traffic engineering; Impact of packet dynamics on
application performance
GOBS: GRID over Optical Burst Switching Networks
Terabit burst switching; Burst assembly for IP DiffServ over optical burst
switching networks; Optical network infrastructure for Grid; Synchronous stream
optical burst switching; Optical burst switching based GRID architecture; Reliable
optical burst switching for next-generation Grid networks; Throughput for Grid
optical burst switching Grid networks; Resiliency paths over the optical Grid
networks; Consumer oriented Grids using optical burst switching; Protocols for
optical burst switched Grid networks; Hybrid optical switching for data-intensive
media Grid; Anycast routing in optical burst switched Grid networks; Optical burst
switching for IP-over-WDM/DWDM; Customizable Grid-to-optical network; Ultra high
capacity optical networks; Hybrid optical burst/circuit switched for Grid-enabled
optical networks; Job scheduling in optical burst switching Grid networks;
Architecture and middleware for Grid-Over-OBS
----------------------------
Committee: http://www.iaria.org/conferences2013/ComICNS13.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/
*
**********************************************************
Wednesday, October 31, 2012
[DMANET] IJRIE Call for Paper (Vol. 1, No. 3, December 2012)
CALL FOR Paper
Call for Paper of the International Journal of Research in industrial
Engineering (IJRIE).
Greetings and call for paper for Vol. 1, No.3.
International Journal of Research in Industrial Engineering
ISSN: 1925-7805; E-ISSN: 1925-7813
Publisher: Novel Science Inc.
Submissions open for Volume 1, Number 3, December 2012.
Dear researchers
Let me introduce about IJRIE. International Journal of Research in
Industrial Engineering (IJRIE) is an international academic online
journal which publishes global research in the areas of Industrial
Engineering. The journal provides a forum for dispersion of research
and review articles related to all fields of Industrial Engineering.
With an open access publication model of this journal, all interested
readers around the world can freely access articles online without
subscription.
Submitted papers will be reviewed by technical committees of the
journal and association. All submitted articles should report
original, previously unpublished research results, experimental or
theoretical, and will be peer-reviewed. Articles submitted to the
journal should meet these criteria and must not be under consideration
for publication elsewhere. Manuscripts should follow the style of the
journal and are subject to both review and editing.
Frequency: 4 Number per year
Status: published Online
Subject Category: All aspects of Industrial Engineering
The journal provides relevant theoretical frameworks and the latest
empirical research findings in the areas of (not limited to):
Supply Chain Management & Logistic Risk Management
Operations Research Reliability & Maintenance
Manufacturing Systems Project management
Flexible Manufacturing System Application of meta-heuristics
Production Planning & Management Strategic management
Knowledge Management Data Mining
Project Control Scheduling
Mathematical Modeling Telecommunications
Network management Human resources management
Economics Other Related Subject
Kindly Visit our website www.nvlscience.com/index.php/ijrie for more details.
(It is mandatory for authors to submit their papers via above
mentioned website address).
Final paper submission should be done at E-mail: ijrie.admin@nvlscienc.com
Reviewer Response should be done at E-mail: ijrie.editor@nvlscience.com
Any query response should be done at E-mail: ijrie.info@nvlscience.com
We are looking forward to receiving quality submissions from you and
your colleagues in near future.
Please consider forwarding this call for papers to the appropriate groups
or
individuals.
Best Regards
IJRIE Office
www.nvlscience.com/index.php/ijrie
**********************************************************
*
* 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 Paper of the International Journal of Research in industrial
Engineering (IJRIE).
Greetings and call for paper for Vol. 1, No.3.
International Journal of Research in Industrial Engineering
ISSN: 1925-7805; E-ISSN: 1925-7813
Publisher: Novel Science Inc.
Submissions open for Volume 1, Number 3, December 2012.
Dear researchers
Let me introduce about IJRIE. International Journal of Research in
Industrial Engineering (IJRIE) is an international academic online
journal which publishes global research in the areas of Industrial
Engineering. The journal provides a forum for dispersion of research
and review articles related to all fields of Industrial Engineering.
With an open access publication model of this journal, all interested
readers around the world can freely access articles online without
subscription.
Submitted papers will be reviewed by technical committees of the
journal and association. All submitted articles should report
original, previously unpublished research results, experimental or
theoretical, and will be peer-reviewed. Articles submitted to the
journal should meet these criteria and must not be under consideration
for publication elsewhere. Manuscripts should follow the style of the
journal and are subject to both review and editing.
Frequency: 4 Number per year
Status: published Online
Subject Category: All aspects of Industrial Engineering
The journal provides relevant theoretical frameworks and the latest
empirical research findings in the areas of (not limited to):
Supply Chain Management & Logistic Risk Management
Operations Research Reliability & Maintenance
Manufacturing Systems Project management
Flexible Manufacturing System Application of meta-heuristics
Production Planning & Management Strategic management
Knowledge Management Data Mining
Project Control Scheduling
Mathematical Modeling Telecommunications
Network management Human resources management
Economics Other Related Subject
Kindly Visit our website www.nvlscience.com/index.php/ijrie for more details.
(It is mandatory for authors to submit their papers via above
mentioned website address).
Final paper submission should be done at E-mail: ijrie.admin@nvlscienc.com
Reviewer Response should be done at E-mail: ijrie.editor@nvlscience.com
Any query response should be done at E-mail: ijrie.info@nvlscience.com
We are looking forward to receiving quality submissions from you and
your colleagues in near future.
Please consider forwarding this call for papers to the appropriate groups
or
individuals.
Best Regards
IJRIE Office
www.nvlscience.com/index.php/ijrie
**********************************************************
*
* 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] PIMS postdoc positions (Canada)
Several Postdoctoral fellowships in theoretical computer science are available in the PIMS Collaborative Research Group "Algorithmic Theory of Networks"
(http://www.pims.math.ca/scientific/collaborative-research-groups/algorithmic-theory-networks-2012-2015).
Areas of specific interest include but are not limited to randomized algorithms, sublinear
and streaming algorithms, data structures and their lower bounds, and algorithms related to communication networks, and distributed algorithms. The fellowships are for one year with a possibility of renewal for a second year.
The postdoctoral fellowships are offered by Profs. Petra Berenbrink (Simon Fraser University), Funda Ergun (Simon Fraser University), Valerie King (University of Victoria)
and Philipp Woelfel (University of Calgary). The annual stipend for PIMS
postdocs is no less than Cdn $40,000 (inclusive of benefits). Travel funds will
also be allocated. More information about PIMS is available at http://www.pims.math.ca.
Inquiries and applications including a curriculum vitae, a one page research statement and the names and contact information for at least two references should be forwarded to
pims.crg.alg@gmail.com
The application deadline is December 15, 2012. We will continue to accept applications until the posts are filled.
**********************************************************
*
* 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/
*
**********************************************************
(http://www.pims.math.ca/scientific/collaborative-research-groups/algorithmic-theory-networks-2012-2015).
Areas of specific interest include but are not limited to randomized algorithms, sublinear
and streaming algorithms, data structures and their lower bounds, and algorithms related to communication networks, and distributed algorithms. The fellowships are for one year with a possibility of renewal for a second year.
The postdoctoral fellowships are offered by Profs. Petra Berenbrink (Simon Fraser University), Funda Ergun (Simon Fraser University), Valerie King (University of Victoria)
and Philipp Woelfel (University of Calgary). The annual stipend for PIMS
postdocs is no less than Cdn $40,000 (inclusive of benefits). Travel funds will
also be allocated. More information about PIMS is available at http://www.pims.math.ca.
Inquiries and applications including a curriculum vitae, a one page research statement and the names and contact information for at least two references should be forwarded to
pims.crg.alg@gmail.com
The application deadline is December 15, 2012. We will continue to accept applications until the posts are filled.
**********************************************************
*
* 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] NetSys 2013 - Deadline Extension: PhD Forum - Call for Submissions
Call for Submissions - please apologize multiple copies
***************************************
* Networked Systems 2013 *
* PhD Forum
*
* NetSys 2013, Stuttgart, Germany *
* March 11-15, 2013
*
*
*
* http://www.netsys2013.de *
***************************************
The doctoral colloquium at NetSys 2013 follows
the format of similar events at international
conferences such as PerCom, UbiComp, and Pervasive.
The aim is twofold. First, it should provide PhD
students in an early phase of their career with
the opportunity to discuss these with experts and
gain general feedback as well as specific comments
on their proposal. Second, this is an excellent
opportunity for a young researcher to start a
personal network with other PhD students as
well as with already established experts.
Format
------
The aim of the doctoral colloquium is to discuss research
ideas and PhD projects at different - typically - early
stages. The colloquium aims at a friendly atmosphere which
shall inspire the participants and put them - and their
research - in the focus. A panel of experts will discuss
the research based on a short presentation. Interactivity
and discussion are the goal.
In addition to the colloquium a presentation of all participants
at the main conference will take place as a poster session.
A brief introduction of the topics (One-Minute-Madness)
is used to attract conference participants.
Submissions
-----------
Prospective participants are required to submit three different
documents via email at phd-chair@netsys2013.de:
at the point of submission:
1. Research Statement: a two-page abstract that sketches the
research proposal of the PhD student, the contribution to
knowledge and how the research will advance the state of the art.
2. Curriculum Vitae: a one brief CV that lists the education,
research interests and - if available - publications.
at the point of acceptance:
3. a poster that will be presented at the conference
Chairs
------
Christian Becker (University of Mannheim)
Klaus Wehrle (RWTH Aaachen)
Important Dates
---------------
07.Nov.2012 submission (new)
14.Dec.2012 notification
**********************************************************
*
* 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/
*
**********************************************************
***************************************
* Networked Systems 2013 *
* PhD Forum
*
* NetSys 2013, Stuttgart, Germany *
* March 11-15, 2013
*
*
*
* http://www.netsys2013.de *
***************************************
The doctoral colloquium at NetSys 2013 follows
the format of similar events at international
conferences such as PerCom, UbiComp, and Pervasive.
The aim is twofold. First, it should provide PhD
students in an early phase of their career with
the opportunity to discuss these with experts and
gain general feedback as well as specific comments
on their proposal. Second, this is an excellent
opportunity for a young researcher to start a
personal network with other PhD students as
well as with already established experts.
Format
------
The aim of the doctoral colloquium is to discuss research
ideas and PhD projects at different - typically - early
stages. The colloquium aims at a friendly atmosphere which
shall inspire the participants and put them - and their
research - in the focus. A panel of experts will discuss
the research based on a short presentation. Interactivity
and discussion are the goal.
In addition to the colloquium a presentation of all participants
at the main conference will take place as a poster session.
A brief introduction of the topics (One-Minute-Madness)
is used to attract conference participants.
Submissions
-----------
Prospective participants are required to submit three different
documents via email at phd-chair@netsys2013.de:
at the point of submission:
1. Research Statement: a two-page abstract that sketches the
research proposal of the PhD student, the contribution to
knowledge and how the research will advance the state of the art.
2. Curriculum Vitae: a one brief CV that lists the education,
research interests and - if available - publications.
at the point of acceptance:
3. a poster that will be presented at the conference
Chairs
------
Christian Becker (University of Mannheim)
Klaus Wehrle (RWTH Aaachen)
Important Dates
---------------
07.Nov.2012 submission (new)
14.Dec.2012 notification
**********************************************************
*
* 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: IEEE PerSeNS 2013 - - Submission Deadline Extended to: NOV. 12, 2012
---------------------------------------------------------------------
----------Apologies for multiple copies of this announcement---------
---------------------------------------------------------------------
----------Apologies for multiple copies of this announcement---------
---------------------------------------------------------------------
The Ninth IEEE PerCom International Workshop on
Sensor Networks and Systems for Pervasive Computing (PerSeNS 2013)
http://www.dicgim.unipa.it/~networks/persens2013/
in conjunction with IEEE PerCom 2013 (http://www.percom.org)
March 18-22, 2013
San Diego, California
*************************************************************************
****** PAPER SUBMISSION DEADLINE EXTENDED TO: NOVEMBER 12, 2012 *****
*************************************************************************
CALL FOR PAPERS
Wireless sensor networks are expected to be the basic building block
of pervasive computing environments. Aggregating sensor nodes into
sophisticated sensing, computational and communication infrastructures
to form wireless sensor networks will have a significant impact on a
wide array of applications ranging from military, to scientific, to
industrial, to health-care, to domestic, establishing ubiquitous
computing that will pervade society redefining the way in which we
live and work.
The purpose of this workshop is to bring together the main researchers
working on different aspects of sensor networking for supporting
pervasive computing environments. This is a very challenging task, as
it involves several technological issues (sensor architectures,
efficient networking protocol design, power management, security and
dependability, etc.), as well as the socio-economic aspects related to
the introduction of such novel paradigms and their benefits for the
community. The objective of the workshop is to provide a forum to
exchange ideas, discuss solutions, and share experiences among
researchers, professionals, and application developers both from the
industry and academia.
Papers describing original research on both theoretical and practical
aspects of sensor networks for pervasive computing are solicited. We
particularly welcome submissions that present implementation and
deployment results. Particular topics of interest include, but are not
limited to:
- Sensor-based systems and applications
- Operating systems for Sensor Networks
- Middleware and software tools
- Networking architectures and protocols
- Data gathering, aggregation and dissemination
- Topology control
- Power Management and energy-efficient design
- Time synchronization
- Location management
- Sensor networks with mobile elements
- Cross-layer architectures
- Intelligent sensor nodes
- Security and dependability issues
- Modeling and performance evaluation
- Measurements
PAPER SUBMISSION
Papers should contain original material and not be previously
published, or currently submitted for consideration elsewhere.
Papers must be submitted in PDF format.
Maximum length: 6 pages.
Papers must be prepared using the template available at the following page:
http://www.computer.org/portal/web/cscps/formatting/
All submissions will be handled via EDAS.
Accepted papers will be published by the IEEE Computer Society Press
in the combined PerCom 2013 workshops proceedings. At least one
author of each accepted paper must register to PerCom 2013 (there is
no workshop-only registration) and attend the workshop to present the
paper. Failure to present the paper at the workshop will result in the
withdrawal of the paper from the Proceedings as well as from IEEE
Xplore.
IMPORTANT DATES
Paper submission deadline: EXTENDED TO NOVEMBER 12, 2012
Notification of acceptance: December 21, 2012
Camera-ready papers due: January 25, 2013
GENERAL CO-CHAIRS
Giuseppe Anastasi, University of Pisa, Italy
Silvia Giordano, University of Applied Sciences of Southern
Switzerland (SUPSI), Switzerland
PROGRAM CHAIR
Giuseppe Lo Re, University of Palermo, Italy
PUBLICITY CHAIR
Alessandra De Paola, University of Palermo, Italy
TECHNICAL PROGRAM COMMITTEE
Ozgur Akan, Koc University, Turkey
Cesare Alippi, Politecnico di Milano, Italy
M·rio Alves, PolitÈcnico do Porto, Portugal
Eleonora Borgia, IIT-CNR, Italy
Raffaele Bruno, IIT-CNR, Italy
Levente Buttyan, Budapest Univ. of Tech. & Econ., Hungary
Jiannong Cao, Hong Kong Polytechnic Univ, Hong Kong
Carla-Fabiana Chiasserini, Politecnico di Torino, Italy
Diane Cook, Washington State University, USA
Mario Di Francesco, Aalto University, Finland
Tassos Dimitriou, Athens Information Technology, Greece
Mohamed Eltoweissy, Virginia Tech, USA
Federico Ferrari, ETH Zurich, Switzerland
Giancarlo Fortino, Universit‡ della Calabria, Italy
Luca Foschini, University of Bologna, Italy
Salvatore Gaglio, University of Palermo, Italy
Omprakash Gnawali, University of Houston, USA
Isabelle GuÈrin Lassous, UniversitÈ de Lyon - LIP, France
Qi Han, Colorado School of Mines, USA
Wendi Heinzelman, University of Rochester, USA
Mohan Kumar, The University of Texas at Arlington, USA
Yonghe Liu, The University of Texas at Arlington, USA
Sanglu Lu, Nanjing University, China
Francesco Marcelloni, University of Pisa, Italy
Alan Marchiori, United Technologies Research Center, USA
Janise McNair, University of Florida, USA
Marco Ortolani, University of Palermo, Italy
Symeon Papavassiliou, National Tech. Univ. of Athens, Greece
Andrea Passarella, IIT-CNR, Italy
Gian Pietro Picco, University of Trento, Italy
Cristina M. Pinotti, University of Perugia, Italy
Ravi Prakash, University of Texas at Dallas, USA
Daniele Puccinelli, SUPSI, Switzerland
Cormac Sreenan, University College Cork, Ireland
Ivan Stojmenovic, University of Ottawa, Canada
Damla Turgut, University of Central Florida, USA
Alessio Vecchio, University of Pisa, Italy
Weigang Wu, Sun Yat-sen University, China
**********************************************************
*
* 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] application of metaheuristics on large scale problems
Dear Colleague,
On behalf of the Organizing Committee, we invite you to participate in
the special session (workshop) on "APPLICATIONS OF METAHEURISTICS TO
LARGE-SCALE PROBLEMS" at the 9th International Conference on Large
Scale Scientific Computation - LSSC'13, June 3 - 7, 2013, Sozopol,
Bulgaria, with arrival: June 2 and departure: noon June 7.
The session is organized by:
Assoc. Prof. Stefka Fidanova (stefka@parallel.bas.bg)
from the Institut of Information and Communication Technologies
(former Institute for Parallel Processing), Bulgarian Academy of
Sciences and
Gabriel Luque (gabriel@lcc.uma.es) from University of Malaga, Spain.
Topics
The list of topics includes, but is not limited to:
combinatorial optimization
global optimization
multiobjective optimization
optimization in dynamic and/or noisy environments
large scale optimization
parallel and distributed approaches in optimization
random search algorithms,
simulated annealing,
tabu search
other derivative free optimization methods
nature inspired optimization methods (evolutionary algorithms, ant
colony optimization, particle swarm optimization, immune artificial
systems etc)
hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
optimization methods for learning processes and data mining
computational optimization methods in statistics, econometrics,
finance, physics, medicine, biology, engineering etc
Proceedings
We plan to continue publishing the proceedings of only refereed and
presented papers as a special volume of Springer Lecture Notes in
Computer Science (LNCS).
Important deadlines
Deadline for submission of abstracts
January 15, 2013
Notification of acceptance of the talks on the basis of the submitted abstract
January 31, 2013
Deadline for submission of full papers
March 15, 2013
Notification of acceptance of full papers
April 30, 2013
Abstracts and contributed papers
The abstracts (up to 1 page stating clearly the originality of the
results) are to be written in standard LaTeX. The length of the
contributed papers is limited up to 8 pages. It is assumed that one
participant will present not more than one talk.
Send the abstracts and papers to special session organizers and
conference organizers, indicating the name of the special session.
After sending the abstract go to the conference web page and fill in
the registration form (personal data of the participants, minimum one
per paper, and the name of the special session).
Information about abstract and paper preparation, accommodation,
transportation, registration form and conference location you can find
at the conference web page
http://parallel.bas.bg/Conferences/SciCom13.html
After the conference, extended versions of selected number of
accepted and presented papers will be published in special issue of
the International Journal of Metaheuristics.
Special session organizers
Prof. Stefka Fidanova
Prof. Gabriel Luque
--
Assoc. Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* 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/
*
**********************************************************
On behalf of the Organizing Committee, we invite you to participate in
the special session (workshop) on "APPLICATIONS OF METAHEURISTICS TO
LARGE-SCALE PROBLEMS" at the 9th International Conference on Large
Scale Scientific Computation - LSSC'13, June 3 - 7, 2013, Sozopol,
Bulgaria, with arrival: June 2 and departure: noon June 7.
The session is organized by:
Assoc. Prof. Stefka Fidanova (stefka@parallel.bas.bg)
from the Institut of Information and Communication Technologies
(former Institute for Parallel Processing), Bulgarian Academy of
Sciences and
Gabriel Luque (gabriel@lcc.uma.es) from University of Malaga, Spain.
Topics
The list of topics includes, but is not limited to:
combinatorial optimization
global optimization
multiobjective optimization
optimization in dynamic and/or noisy environments
large scale optimization
parallel and distributed approaches in optimization
random search algorithms,
simulated annealing,
tabu search
other derivative free optimization methods
nature inspired optimization methods (evolutionary algorithms, ant
colony optimization, particle swarm optimization, immune artificial
systems etc)
hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
optimization methods for learning processes and data mining
computational optimization methods in statistics, econometrics,
finance, physics, medicine, biology, engineering etc
Proceedings
We plan to continue publishing the proceedings of only refereed and
presented papers as a special volume of Springer Lecture Notes in
Computer Science (LNCS).
Important deadlines
Deadline for submission of abstracts
January 15, 2013
Notification of acceptance of the talks on the basis of the submitted abstract
January 31, 2013
Deadline for submission of full papers
March 15, 2013
Notification of acceptance of full papers
April 30, 2013
Abstracts and contributed papers
The abstracts (up to 1 page stating clearly the originality of the
results) are to be written in standard LaTeX. The length of the
contributed papers is limited up to 8 pages. It is assumed that one
participant will present not more than one talk.
Send the abstracts and papers to special session organizers and
conference organizers, indicating the name of the special session.
After sending the abstract go to the conference web page and fill in
the registration form (personal data of the participants, minimum one
per paper, and the name of the special session).
Information about abstract and paper preparation, accommodation,
transportation, registration form and conference location you can find
at the conference web page
http://parallel.bas.bg/Conferences/SciCom13.html
After the conference, extended versions of selected number of
accepted and presented papers will be published in special issue of
the International Journal of Metaheuristics.
Special session organizers
Prof. Stefka Fidanova
Prof. Gabriel Luque
--
Assoc. Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Tuesday, October 30, 2012
[DMANET] Deadline Extension: ICAS 2013 || March 24 - 29, 2013 - Lisbon, Portugal
INVITATION:
=================
Please consider to contribute to and/or forward to the appropriate groups the
following opportunity to submit and publish original scientific results to ICAS
2013.
The submission deadline is extended to November 12, 2012.
Authors of selected papers will be invited to submit extended article versions to
one of the IARIA Journals: http://www.iariajournals.org
=================
============== ICAS 2013 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
ICAS 2013, The Ninth International Conference on Autonomic and Autonomous Systems
March 24 - 29, 2013 - Lisbon, Portugal
General page: http://www.iaria.org/conferences2013/ICAS13.html
Call for Papers: http://www.iaria.org/conferences2013/CfPICAS13.html
- regular papers
- short papers (work in progress)
- posters
Submission page: http://www.iaria.org/conferences2013/SubmitICAS13.html
Submission deadline: November 12, 2012
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
ICAS 2013 Topics (topics and submission details: see CfP on the site)
SYSAT: Advances in system automation
Methods, techniques ant tools for automation features; Methodologies for automating
of design systems; Industrial automation for production chains; Nonlinear
optimization and automation control; Nonlinearities and system stabilization;
Automation in safety systems; Structured uncertainty; Open and closed automation
loops; Test systems automation; Theory on systems robustness; Fault-tolerant
systems
AUTSY: Theory and Practice of Autonomous Systems
Design, implementation and deployment of autonomous systems; Frameworks and
architectures for component and system autonomy; Design methodologies for
autonomous systems; Composing autonomous systems; Formalisms and languages for
autonomous systems; Logics and paradigms for autonomous systems; Ambient and
real-time paradigms for autonomous systems; Delegation and trust in autonomous
systems; Centralized and distributed autonomous systems; Collocation and
interaction between autonomous and non-autonomous systems; Dependability in
autonomous systems; Survivability and recovery in autonomous systems; Monitoring
and control in autonomous systems; Performance and security in autonomous systems;
Management of autonomous systems; Testing autonomous systems; Maintainability of
autonomous systems
AWARE: Design and Deployment of Context-awareness Networks, Services and
Applications
Context-aware fundamental concepts, mechanisms, and applications; Modeling
context-aware systems; Specification and implementation of awareness behavioral
contexts; Development and deployment of large-scale context-aware systems and
subsystems; User awareness requirements and design techniques for interfaces and
systems; Methodologies, metrics, tools, and experiments for specifying
context-aware systems; Tools evaluations, Experiment evaluations
AUTONOMIC: Autonomic Computing: Design and Management of Self-behavioral Networks
and Services
Theory, architectures, frameworks and practice of self-adaptive management
mechanisms; Modeling and techniques for specifying self-ilities; Self-stabilization
and dynamic stability criteria and mechanisms; Tools, languages and platforms for
designing self-driven systems; Autonomic computing and GRID networking; Autonomic
computing and proactive computing for autonomous systems; Practices, criteria and
methods to implement, test, and evaluate industrial autonomic systems; Experiences
with autonomic computing systems
CLOUD: Cloud computing and Virtualization
Hardware-as-a-service; Software-as-a-service [SaaS applicaitions];
Platform-as-service; On-demand computing models; Cloud Computing programming and
application development; Scalability, discovery of services and data in Cloud
computing infrastructures; Privacy, security, ownership and reliability issues;
Performance and QoS; Dynamic resource provisioning; Power-efficiency and Cloud
computing; Load balancing; Application streaming; Cloud SLAs, business models and
pricing policies; Custom platforms; Large-scale compute infrastructures; Managing
applications in the clouds; Data centers; Process in the clouds; Content and
service distribution in Cloud computing infrastructures; Multiple applications can
run on one computer (virtualization a la VMWare); Grid computing (multiple
computers can be used to run one application); Virtualization platforms; Open
virtualization format; Cloud-computing vendor governance and regulatory compliance
MCMAC: Monitoring, Control, and Management of Autonomous Self-aware and
Context-aware Systems
Agent-based autonomous systems; Policy-driven self-awareness mechanisms and their
applicability in autonomic systems; Autonomy in GRID networking and utility
computing; Studies on autonomous industrial applications, services, and their
developing environment; Prototypes, experimental systems, tools for autonomous
systems, GRID middleware
CASES: Automation in specialized mobile environments
Theory, frameworks, mechanisms and case studies for satellite systems;
Spatial/temporal constraints in satellites systems; Trajectory corrections, speed,
and path accuracy in satellite systems; Mechanisms and case studies for nomadic
code systems; Platforms for mobile agents and active mobile code; Performance in
nomadic code systems; Case studies systems for mobile robot systems; Guidance in an
a priori unknown environment; Coaching/learning techniques; Pose maintenance, and
mapping; Sensing for autonomous vehicles; Planning for autonomous vehicles; Mobile
networks, Ad hoc networks and self-reconfigurable networks
ALCOC: Algorithms and theory for control and computation
Control theory and specific characteristics; Types of computation theories; Tools
for computation and control; Algorithms and data structures; Special algorithmic
techniques; Algorithmic applications; Domain case studies; Technologies case
studies for computation and control; Application-aware networking
MODEL: Modeling, virtualization, any-on-demand, MDA, SOA
Modeling techniques, tools, methodologies, languages; Model-driven architectures
(MDA); Service-oriented architectures (SOA); Utility computing frameworks and
fundamentals; Enabled applications through virtualization; Small-scale
virtualization methodologies and techniques; Resource containers, physical resource
multiplexing, and segmentation; Large-scale virtualization methodologies and
techniques; Management of virtualized systems; Platforms, tools, environments, and
case studies; Making virtualization real; On-demand utilities; Adaptive enterprise;
Managing utility-based systems; Development environments, tools, prototypes
SELF: Self-adaptability and self-management of context-aware systems
Novel approaches to modeling and representing context adaptability,
self-adaptability, and self-manageability; Models of computation for
self-management context-aware systems; Use of MDA/MDD (Model Driven Architecture /
Model Driven Development) for context-aware systems; Design methods for
self-adaptable context-aware systems; Applications of advanced modeling languages
to context self-adaptability; Methods for managing adding context to existing
systems and context-conflict free systems; Architectures and middleware models for
self-adaptable context-aware systems; Models of different adaptation and
self-adaptation mechanisms (component-based adaptation approach, aspect oriented
approach, etc.); System stability in the presence of context inconsistency;
Learning and self-adaptability of context-aware systems; Business considerations
and organizational modeling of self-adaptable context-aware systems; Performance
evaluation of self-adaptable context-aware systems; Scalability of self-adaptable
context-aware systems
KUI: Knowledge-based user interface
Evolving intelligent user interface for WWW; User interface design in autonomic
systems; Adaptive interfaces in a knowledge-based design; Knowledge-based support
for the user interface design process; Built-in knowledge in adaptive user
interfaces; Requirements for interface knowledge representation; Levels for
knowledge-based user interface; User interface knowledge on the dynamic behavior;
Support techniques for knowledge-based user interfaces; Intelligent user interface
for real-time systems; Planning-based control of interface animation; Model-based
user interface design; Knowledge-based user interface migration; Automated user
interface requirements discovery for scientific computing; Knowledge-based user
interface management systems; 3D User interface design; Task-oriented knowledge
user interfaces; User-interfaces in a domestic environment; Centralised control in
the home; User-interfaces for the elderly or disabled; User-interfaces for the
visually, aurally, or mobility impaired; Interfacing with ambient intelligence
systems; Assisted living interfaces; Interfaces for security/alarm systems
AMMO: Adaptive management and mobility
QoE and adaptation in mobile environments; Content marking and management (i.e.
MPEG21); Adaptive coding (H.265, FEC schemes, etc.. ); Admission control resource
allocation algorithms; Monitoring and feedback systems; Link adaptation mechanisms;
Cross layer approaches; Adaptation protocols (with IMS and NGNs scenarios); QoE vs
NQoS mapping systems; Congestion control mechanisms; Fairness issues (fair sharing,
bandwidth allocation...); Optimization/management mechanisms (MOO, fuzzy logic,
machine learning, etc.)
-------------------------
Committee: http://www.iaria.org/conferences2013/ComICAS13.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 ICAS
2013.
The submission deadline is extended to November 12, 2012.
Authors of selected papers will be invited to submit extended article versions to
one of the IARIA Journals: http://www.iariajournals.org
=================
============== ICAS 2013 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
ICAS 2013, The Ninth International Conference on Autonomic and Autonomous Systems
March 24 - 29, 2013 - Lisbon, Portugal
General page: http://www.iaria.org/conferences2013/ICAS13.html
Call for Papers: http://www.iaria.org/conferences2013/CfPICAS13.html
- regular papers
- short papers (work in progress)
- posters
Submission page: http://www.iaria.org/conferences2013/SubmitICAS13.html
Submission deadline: November 12, 2012
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
ICAS 2013 Topics (topics and submission details: see CfP on the site)
SYSAT: Advances in system automation
Methods, techniques ant tools for automation features; Methodologies for automating
of design systems; Industrial automation for production chains; Nonlinear
optimization and automation control; Nonlinearities and system stabilization;
Automation in safety systems; Structured uncertainty; Open and closed automation
loops; Test systems automation; Theory on systems robustness; Fault-tolerant
systems
AUTSY: Theory and Practice of Autonomous Systems
Design, implementation and deployment of autonomous systems; Frameworks and
architectures for component and system autonomy; Design methodologies for
autonomous systems; Composing autonomous systems; Formalisms and languages for
autonomous systems; Logics and paradigms for autonomous systems; Ambient and
real-time paradigms for autonomous systems; Delegation and trust in autonomous
systems; Centralized and distributed autonomous systems; Collocation and
interaction between autonomous and non-autonomous systems; Dependability in
autonomous systems; Survivability and recovery in autonomous systems; Monitoring
and control in autonomous systems; Performance and security in autonomous systems;
Management of autonomous systems; Testing autonomous systems; Maintainability of
autonomous systems
AWARE: Design and Deployment of Context-awareness Networks, Services and
Applications
Context-aware fundamental concepts, mechanisms, and applications; Modeling
context-aware systems; Specification and implementation of awareness behavioral
contexts; Development and deployment of large-scale context-aware systems and
subsystems; User awareness requirements and design techniques for interfaces and
systems; Methodologies, metrics, tools, and experiments for specifying
context-aware systems; Tools evaluations, Experiment evaluations
AUTONOMIC: Autonomic Computing: Design and Management of Self-behavioral Networks
and Services
Theory, architectures, frameworks and practice of self-adaptive management
mechanisms; Modeling and techniques for specifying self-ilities; Self-stabilization
and dynamic stability criteria and mechanisms; Tools, languages and platforms for
designing self-driven systems; Autonomic computing and GRID networking; Autonomic
computing and proactive computing for autonomous systems; Practices, criteria and
methods to implement, test, and evaluate industrial autonomic systems; Experiences
with autonomic computing systems
CLOUD: Cloud computing and Virtualization
Hardware-as-a-service; Software-as-a-service [SaaS applicaitions];
Platform-as-service; On-demand computing models; Cloud Computing programming and
application development; Scalability, discovery of services and data in Cloud
computing infrastructures; Privacy, security, ownership and reliability issues;
Performance and QoS; Dynamic resource provisioning; Power-efficiency and Cloud
computing; Load balancing; Application streaming; Cloud SLAs, business models and
pricing policies; Custom platforms; Large-scale compute infrastructures; Managing
applications in the clouds; Data centers; Process in the clouds; Content and
service distribution in Cloud computing infrastructures; Multiple applications can
run on one computer (virtualization a la VMWare); Grid computing (multiple
computers can be used to run one application); Virtualization platforms; Open
virtualization format; Cloud-computing vendor governance and regulatory compliance
MCMAC: Monitoring, Control, and Management of Autonomous Self-aware and
Context-aware Systems
Agent-based autonomous systems; Policy-driven self-awareness mechanisms and their
applicability in autonomic systems; Autonomy in GRID networking and utility
computing; Studies on autonomous industrial applications, services, and their
developing environment; Prototypes, experimental systems, tools for autonomous
systems, GRID middleware
CASES: Automation in specialized mobile environments
Theory, frameworks, mechanisms and case studies for satellite systems;
Spatial/temporal constraints in satellites systems; Trajectory corrections, speed,
and path accuracy in satellite systems; Mechanisms and case studies for nomadic
code systems; Platforms for mobile agents and active mobile code; Performance in
nomadic code systems; Case studies systems for mobile robot systems; Guidance in an
a priori unknown environment; Coaching/learning techniques; Pose maintenance, and
mapping; Sensing for autonomous vehicles; Planning for autonomous vehicles; Mobile
networks, Ad hoc networks and self-reconfigurable networks
ALCOC: Algorithms and theory for control and computation
Control theory and specific characteristics; Types of computation theories; Tools
for computation and control; Algorithms and data structures; Special algorithmic
techniques; Algorithmic applications; Domain case studies; Technologies case
studies for computation and control; Application-aware networking
MODEL: Modeling, virtualization, any-on-demand, MDA, SOA
Modeling techniques, tools, methodologies, languages; Model-driven architectures
(MDA); Service-oriented architectures (SOA); Utility computing frameworks and
fundamentals; Enabled applications through virtualization; Small-scale
virtualization methodologies and techniques; Resource containers, physical resource
multiplexing, and segmentation; Large-scale virtualization methodologies and
techniques; Management of virtualized systems; Platforms, tools, environments, and
case studies; Making virtualization real; On-demand utilities; Adaptive enterprise;
Managing utility-based systems; Development environments, tools, prototypes
SELF: Self-adaptability and self-management of context-aware systems
Novel approaches to modeling and representing context adaptability,
self-adaptability, and self-manageability; Models of computation for
self-management context-aware systems; Use of MDA/MDD (Model Driven Architecture /
Model Driven Development) for context-aware systems; Design methods for
self-adaptable context-aware systems; Applications of advanced modeling languages
to context self-adaptability; Methods for managing adding context to existing
systems and context-conflict free systems; Architectures and middleware models for
self-adaptable context-aware systems; Models of different adaptation and
self-adaptation mechanisms (component-based adaptation approach, aspect oriented
approach, etc.); System stability in the presence of context inconsistency;
Learning and self-adaptability of context-aware systems; Business considerations
and organizational modeling of self-adaptable context-aware systems; Performance
evaluation of self-adaptable context-aware systems; Scalability of self-adaptable
context-aware systems
KUI: Knowledge-based user interface
Evolving intelligent user interface for WWW; User interface design in autonomic
systems; Adaptive interfaces in a knowledge-based design; Knowledge-based support
for the user interface design process; Built-in knowledge in adaptive user
interfaces; Requirements for interface knowledge representation; Levels for
knowledge-based user interface; User interface knowledge on the dynamic behavior;
Support techniques for knowledge-based user interfaces; Intelligent user interface
for real-time systems; Planning-based control of interface animation; Model-based
user interface design; Knowledge-based user interface migration; Automated user
interface requirements discovery for scientific computing; Knowledge-based user
interface management systems; 3D User interface design; Task-oriented knowledge
user interfaces; User-interfaces in a domestic environment; Centralised control in
the home; User-interfaces for the elderly or disabled; User-interfaces for the
visually, aurally, or mobility impaired; Interfacing with ambient intelligence
systems; Assisted living interfaces; Interfaces for security/alarm systems
AMMO: Adaptive management and mobility
QoE and adaptation in mobile environments; Content marking and management (i.e.
MPEG21); Adaptive coding (H.265, FEC schemes, etc.. ); Admission control resource
allocation algorithms; Monitoring and feedback systems; Link adaptation mechanisms;
Cross layer approaches; Adaptation protocols (with IMS and NGNs scenarios); QoE vs
NQoS mapping systems; Congestion control mechanisms; Fairness issues (fair sharing,
bandwidth allocation...); Optimization/management mechanisms (MOO, fuzzy logic,
machine learning, etc.)
-------------------------
Committee: http://www.iaria.org/conferences2013/ComICAS13.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] Not to miss: 3rd conference on “Complex Systems Design & Management” in December 2012 (Paris)
Dear All,
The 3rd edition of the conference "Complex Systems Design and Management"
will take place soon in December 12/14 in Paris.
By participating to the conference, you will get the opportunity to listen
to international keynote speakers coming from both industrial and academic
fields. The program this year is enriched by a special focus on the "risk"
on the 1st day, a Tools Session with important and new editors, 2
tutorials "CSS" and "MBSE" and a new session dedicated to the European
vision in complex systems. The maturity of the CSD&M 2012 and its
qualified participants promise fruitful exchanges and rich results during
3 days of the conference in perspective.
Please find more details here below and the conference full program here
attached or on
http://www.csdm2012.csdm.fr/IMG/pdf/CSD_M_2012_Full_Program-14.pdf
You are invited to send an e-mail to contact@csdm.fr if any question or need.
We look forward to welcoming you in December!
Best regards,
The Organizing Team of the CSD&M 2012
---------------------------------------------------------------------------
3rd International Conference on Complex Systems Design and Management
(CSD&M 2012)
4th CALL FOR PARTICIPATION: PROGRAM & REGISTRATION
---------------------------------------------------------------------------
December 12-14, 2012 - Cite Internationale Universitaire de Paris (France)
---------------------------------------------------------------------------
Web: http://www.csdm2012.csdm.fr – Email: contact@csdm.fr
Registration: http://www.csdm2012.csdm.fr/-Registration-.html
---------------------------------------------------------------------------
CONFERENCE OVERVIEW
The CSD&M conference is the annual meeting point for industrial & academic
actors working
on all dimensions of design and management of complex industrial systems.
It addresses
societal & industrial challenges and covers the main industrial areas
dealing with complex
systems and technical & scientific methods used to model and master these
types of systems.
- 280 participants & 17 keynote speakers from academic and industrial
world leading organizations
- 18 contributed talks and 1 poster session to discuss & share your vision
on topics related to
complex systems
- 2 open discussions and 2 tutorials with invited speakers and recognized
outstanding experts
- 1 software and engineering tool session to share the latest
technological news
- 1 conference dinner to gather speakers, partners & participants for a
unique moment in the
prestigious Musée d'Orsay
17 INTERNATIONAL SPEAKERS
Societal Challenges: Risk & Safety
- Nuclear risk: Akira Yamaguchi, professor, Osaka University - Japan
- Financial risk: Raphaël Douady, founder, RiskData - France
- Energetical risk: Pierre Bornard, vice-president, RTE - France
- Insurance risk: Bernard Laporte, head of R&D and Training, AXA – France
Industrial Challenges: Risk & Safety
- Systems engineering: David Walden, chairman, Sysnovation & INCOSE - USA
- City risk: Olivier Flous, Technical Director of Transport & Safety,
Thales Communications & Security S.A. - France
- Risk and control: Jean-Christophe Visier, head of the sustainable
development department, CSTB - France
- Avation safety: Pascal Medal, head of Certification Experts Dpt- EASA –
Germany
Scientific State of the Art
- Systems theory: Wolter Fabrycky, professor, Viriginia Tech. – USA
- Systems modelling: Manfred Broy, professor, Technische Universität
Munchen - Germany
- Systems design: Dinesh Verma, professor, Stevens University - USA
- Systems simulation: Yves Caseau, executive vice president «
Technologies, Services & Innovation », Bouygues Telecom – France
Methodological State of the Art
- Systems risk: Antoine Rauzy, professor, Ecole Polytechnique - France
- Systems architecture: Patrick Godfrey, professor, University of Bristol
- UK
- Systems development: Anas Alfaris, co-director of the Center for Complex
Engineering Systems (CCES) at KACST and MIT - Saudi Arabia/USA
- Systems safety: Pierre-Etienne Labeau, professor, Ecole Polytechnique de
Bruxelles - Belgium
EEC Session
- EEC Systems Vision: Khalil Rouhana, director of "Components & Systems"
in the directorate – General for Communications Networks, Content &
Technology" - European Commission
ONLINE REGISTRATION
You can register either for the conference and / or for the tutorials here
after: http://www.csdm2012.csdm.fr/Electronic-Registration.html.
PARTNERS & SPONSORS
CESAMES, Ecole Polytechnique, Digiteo, Supélec, ENSTA ParisTech, MEGA
International, Ecole Centrale de Paris, Telecom ParisTech, Bouygues
Télécom, CEA, IBM Rational Software, Dassault Aviation, Dassault Systemes,
Thales, DCNS, Knowledge Inside, DGA, EDF, Esterel Technologies, INCOSE,
AFIS, Chaire OSD de l'Ecole Polytechnique, EADS, Chaire Orange de Télécom
ParisTech, Institut de la Maîtrise des risques, Atego, Systematic,
Ministère de l'Education Supérieure et de la Recherche, Obeo, MathWorks
and The CosMo Company, PragmaDev.
**********************************************************
*
* 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 3rd edition of the conference "Complex Systems Design and Management"
will take place soon in December 12/14 in Paris.
By participating to the conference, you will get the opportunity to listen
to international keynote speakers coming from both industrial and academic
fields. The program this year is enriched by a special focus on the "risk"
on the 1st day, a Tools Session with important and new editors, 2
tutorials "CSS" and "MBSE" and a new session dedicated to the European
vision in complex systems. The maturity of the CSD&M 2012 and its
qualified participants promise fruitful exchanges and rich results during
3 days of the conference in perspective.
Please find more details here below and the conference full program here
attached or on
http://www.csdm2012.csdm.fr/IMG/pdf/CSD_M_2012_Full_Program-14.pdf
You are invited to send an e-mail to contact@csdm.fr if any question or need.
We look forward to welcoming you in December!
Best regards,
The Organizing Team of the CSD&M 2012
---------------------------------------------------------------------------
3rd International Conference on Complex Systems Design and Management
(CSD&M 2012)
4th CALL FOR PARTICIPATION: PROGRAM & REGISTRATION
---------------------------------------------------------------------------
December 12-14, 2012 - Cite Internationale Universitaire de Paris (France)
---------------------------------------------------------------------------
Web: http://www.csdm2012.csdm.fr – Email: contact@csdm.fr
Registration: http://www.csdm2012.csdm.fr/-Registration-.html
---------------------------------------------------------------------------
CONFERENCE OVERVIEW
The CSD&M conference is the annual meeting point for industrial & academic
actors working
on all dimensions of design and management of complex industrial systems.
It addresses
societal & industrial challenges and covers the main industrial areas
dealing with complex
systems and technical & scientific methods used to model and master these
types of systems.
- 280 participants & 17 keynote speakers from academic and industrial
world leading organizations
- 18 contributed talks and 1 poster session to discuss & share your vision
on topics related to
complex systems
- 2 open discussions and 2 tutorials with invited speakers and recognized
outstanding experts
- 1 software and engineering tool session to share the latest
technological news
- 1 conference dinner to gather speakers, partners & participants for a
unique moment in the
prestigious Musée d'Orsay
17 INTERNATIONAL SPEAKERS
Societal Challenges: Risk & Safety
- Nuclear risk: Akira Yamaguchi, professor, Osaka University - Japan
- Financial risk: Raphaël Douady, founder, RiskData - France
- Energetical risk: Pierre Bornard, vice-president, RTE - France
- Insurance risk: Bernard Laporte, head of R&D and Training, AXA – France
Industrial Challenges: Risk & Safety
- Systems engineering: David Walden, chairman, Sysnovation & INCOSE - USA
- City risk: Olivier Flous, Technical Director of Transport & Safety,
Thales Communications & Security S.A. - France
- Risk and control: Jean-Christophe Visier, head of the sustainable
development department, CSTB - France
- Avation safety: Pascal Medal, head of Certification Experts Dpt- EASA –
Germany
Scientific State of the Art
- Systems theory: Wolter Fabrycky, professor, Viriginia Tech. – USA
- Systems modelling: Manfred Broy, professor, Technische Universität
Munchen - Germany
- Systems design: Dinesh Verma, professor, Stevens University - USA
- Systems simulation: Yves Caseau, executive vice president «
Technologies, Services & Innovation », Bouygues Telecom – France
Methodological State of the Art
- Systems risk: Antoine Rauzy, professor, Ecole Polytechnique - France
- Systems architecture: Patrick Godfrey, professor, University of Bristol
- UK
- Systems development: Anas Alfaris, co-director of the Center for Complex
Engineering Systems (CCES) at KACST and MIT - Saudi Arabia/USA
- Systems safety: Pierre-Etienne Labeau, professor, Ecole Polytechnique de
Bruxelles - Belgium
EEC Session
- EEC Systems Vision: Khalil Rouhana, director of "Components & Systems"
in the directorate – General for Communications Networks, Content &
Technology" - European Commission
ONLINE REGISTRATION
You can register either for the conference and / or for the tutorials here
after: http://www.csdm2012.csdm.fr/Electronic-Registration.html.
PARTNERS & SPONSORS
CESAMES, Ecole Polytechnique, Digiteo, Supélec, ENSTA ParisTech, MEGA
International, Ecole Centrale de Paris, Telecom ParisTech, Bouygues
Télécom, CEA, IBM Rational Software, Dassault Aviation, Dassault Systemes,
Thales, DCNS, Knowledge Inside, DGA, EDF, Esterel Technologies, INCOSE,
AFIS, Chaire OSD de l'Ecole Polytechnique, EADS, Chaire Orange de Télécom
ParisTech, Institut de la Maîtrise des risques, Atego, Systematic,
Ministère de l'Education Supérieure et de la Recherche, Obeo, MathWorks
and The CosMo Company, PragmaDev.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] CALL FOR PARTICIPATION: 2nd Dutch Day on Computational Game Theory
The
2nd Dutch Day on Computational Game Theory
will take place on
Thursday, November 22, 2012 at the
Conference Hotel Drienerburght, University of Twente.
In addition to invited talks by Berthold Vöcking (RWTH Aachen
University) and Hans Peters (Maastricht University), there will be a
couple of contributed talks. See
"http://www.utwente.nl/ewi/dmmp/events/cgtday/" for a preliminary program.
Lunch will be provided, and we are organizing a dinner close to Enschede
station.
There is no registration fee, but if you want to attend, please register
no later than November 12, 2012, by sending an email to
"b.manthey@utwente.nl" . Please indicate if you attend the dinner after
the workshop.
Best regards,
Bodo Manthey, Marc Uetz, Mathijs de Weerdt, Nikhil Bansal
**********************************************************
*
* 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/
*
**********************************************************
2nd Dutch Day on Computational Game Theory
will take place on
Thursday, November 22, 2012 at the
Conference Hotel Drienerburght, University of Twente.
In addition to invited talks by Berthold Vöcking (RWTH Aachen
University) and Hans Peters (Maastricht University), there will be a
couple of contributed talks. See
"http://www.utwente.nl/ewi/dmmp/events/cgtday/" for a preliminary program.
Lunch will be provided, and we are organizing a dinner close to Enschede
station.
There is no registration fee, but if you want to attend, please register
no later than November 12, 2012, by sending an email to
"b.manthey@utwente.nl" . Please indicate if you attend the dinner after
the workshop.
Best regards,
Bodo Manthey, Marc Uetz, Mathijs de Weerdt, Nikhil Bansal
**********************************************************
*
* 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] Simons Institute for the Theory of Computing: Announcements
The newly created Simons Institute for the Theory of Computing at UC
Berkeley has recently posted the following announcements:
1. Details of programs for academic year
2013-14: http://simons.berkeley.edu <http://simons.berkeley.edu/>
2. Research Fellow positions (application deadline Jan 15,
2013): http://simons.berkeley.edu/fellows.html
[Opportunities for outstanding junior scientists to spend one or two
semesters at the Institute in academic year 2013-14, in connection with
one of its programs.]
3. Call for program proposals (deadline Dec 15,
2012): http://simons.berkeley.edu/submit_proposal.html
[An invitation for groups of researchers to submit proposals for
programs - typically one semester in length - to run at the Institute
during Fall 2014, Spring 2015 or Fall 2015.]
Please follow the links above for details.
Alistair Sinclair
Associate Director, Simons Institute
**********************************************************
*
* 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/
*
**********************************************************
Berkeley has recently posted the following announcements:
1. Details of programs for academic year
2013-14: http://simons.berkeley.edu <http://simons.berkeley.edu/>
2. Research Fellow positions (application deadline Jan 15,
2013): http://simons.berkeley.edu/fellows.html
[Opportunities for outstanding junior scientists to spend one or two
semesters at the Institute in academic year 2013-14, in connection with
one of its programs.]
3. Call for program proposals (deadline Dec 15,
2012): http://simons.berkeley.edu/submit_proposal.html
[An invitation for groups of researchers to submit proposals for
programs - typically one semester in length - to run at the Institute
during Fall 2014, Spring 2015 or Fall 2015.]
Please follow the links above for details.
Alistair Sinclair
Associate Director, Simons Institute
**********************************************************
*
* 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] EuroGP 2013: Submission deadline extended to Nov 11
Due to numerous requests, the submission deadline for EuroGP 2013 has
been extended to Sunday, 11 November 2012. There will be no further
extensions, and 11 November will be the very FINAL date that papers can
be accepted.
Please distribute. Apologies for cross posting.
*****************************************************************************
EuroGP 2013, 16th European Conference on Genetic Programming
3-5 April 2013, Vienna, Austria
www.evostar.org
CALL FOR PAPERS
*****************************************************************************
EXTENDED SUBMISSION DEADLINE: 11 November 2012
EuroGP is the premier annual conference on Genetic Programming,
attracting participants from all over the world. High quality papers
describing new original research are sought on topics strongly related
to the evolution of computer programs, ranging from theoretical work to
innovative applications. Topics include but are not limited to:
* Theoretical developments
* Empirical studies of GP performance and behavior
* Algorithms, representations and operators
* Applications of GP to real-world problems
* Tree-based, Linear, Graph-based, Grammar-based GP
* Evolutionary design
* Evolutionary robotics
* Evolvable hardware
* Self-reproducing programs
* Fast/Parallel GP
* Probabilistic GP
* Evolution of various classes of automata or machine
* GP for evolving meta- and hyper-heuristic algorithms
* Software Engineering and GP
* Unconventional evolvable computation
In 2012, EuroGP acceptance rate was 50% (39% for oral presentations).
Accepted papers will be included in the proceedings published by
Springer Verlag in the Lecture Notes in Computer Science (LNCS) series.
The papers which receive the best reviews will be nominated for the Best
Paper Award. Authors of selected papers may be invited to submit
extended versions of their work to the Springer journal Genetic
Programming and Evolvable Machines (GPEM).
EuroGP 2013 will be co-located within the EvoStar event with four
related conferences: EvoBIO, EvoCOP, EvoMUSART, and EvoApplications.
Visit http://www.evostar.org/cfpEuroGP.html or join the EVOstar group on
LinkedIn for more details and updates.
EuroGP programme chairs
Krzysztof Krawiec, Poznan University of Technology, Poland
Alberto Moraglio, University of Birmingham, UK
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
been extended to Sunday, 11 November 2012. There will be no further
extensions, and 11 November will be the very FINAL date that papers can
be accepted.
Please distribute. Apologies for cross posting.
*****************************************************************************
EuroGP 2013, 16th European Conference on Genetic Programming
3-5 April 2013, Vienna, Austria
www.evostar.org
CALL FOR PAPERS
*****************************************************************************
EXTENDED SUBMISSION DEADLINE: 11 November 2012
EuroGP is the premier annual conference on Genetic Programming,
attracting participants from all over the world. High quality papers
describing new original research are sought on topics strongly related
to the evolution of computer programs, ranging from theoretical work to
innovative applications. Topics include but are not limited to:
* Theoretical developments
* Empirical studies of GP performance and behavior
* Algorithms, representations and operators
* Applications of GP to real-world problems
* Tree-based, Linear, Graph-based, Grammar-based GP
* Evolutionary design
* Evolutionary robotics
* Evolvable hardware
* Self-reproducing programs
* Fast/Parallel GP
* Probabilistic GP
* Evolution of various classes of automata or machine
* GP for evolving meta- and hyper-heuristic algorithms
* Software Engineering and GP
* Unconventional evolvable computation
In 2012, EuroGP acceptance rate was 50% (39% for oral presentations).
Accepted papers will be included in the proceedings published by
Springer Verlag in the Lecture Notes in Computer Science (LNCS) series.
The papers which receive the best reviews will be nominated for the Best
Paper Award. Authors of selected papers may be invited to submit
extended versions of their work to the Springer journal Genetic
Programming and Evolvable Machines (GPEM).
EuroGP 2013 will be co-located within the EvoStar event with four
related conferences: EvoBIO, EvoCOP, EvoMUSART, and EvoApplications.
Visit http://www.evostar.org/cfpEuroGP.html or join the EVOstar group on
LinkedIn for more details and updates.
EuroGP programme chairs
Krzysztof Krawiec, Poznan University of Technology, Poland
Alberto Moraglio, University of Birmingham, UK
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Monday, October 29, 2012
[DMANET] postdoc position in optimization
========================================
Postdoctoral position in optimization
Los Alamos National Laboratory
========================================
The Information Sciences group at the Los Alamos National Laboratory has
an opening at a postdoctoral level. The research will involve elements of
mathematical optimization, algorithm design, and software engineering. It
will be a part of a multi-year project on developing optimization
techniques and tools for mapping algorithms onto hardware while optimizing
hardware architecture parameters.
Candidates are expected to have a strong background in optimization and
algorithm design and excellent programming skills. Experience in parallel
computing will be a plus. This is a long-term appointment (up to three
years), so candidates who can commit to a longer time frame will be
preferred. However, candidates available for shorter periods may be
considered for internships.
Qualifications:
(1) An MS or PhD in Computer Science, Computer Engineering, or
Mathematics; (2) Background in graph theory, combinatorial algorithm
design, mathematical optimization, or automatic parallelization; (3) Very
strong programming skills; (4) Demonstrated ability to publish research in
peer-reviewed journals or conference proceedings.
Interested candidates should send their resumes including a brief
description of their research interests to Hristo Djidjev,
djidjev@lanl.gov.
US citizenship is NOT required for this position.
**********************************************************
*
* 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/
*
**********************************************************
Postdoctoral position in optimization
Los Alamos National Laboratory
========================================
The Information Sciences group at the Los Alamos National Laboratory has
an opening at a postdoctoral level. The research will involve elements of
mathematical optimization, algorithm design, and software engineering. It
will be a part of a multi-year project on developing optimization
techniques and tools for mapping algorithms onto hardware while optimizing
hardware architecture parameters.
Candidates are expected to have a strong background in optimization and
algorithm design and excellent programming skills. Experience in parallel
computing will be a plus. This is a long-term appointment (up to three
years), so candidates who can commit to a longer time frame will be
preferred. However, candidates available for shorter periods may be
considered for internships.
Qualifications:
(1) An MS or PhD in Computer Science, Computer Engineering, or
Mathematics; (2) Background in graph theory, combinatorial algorithm
design, mathematical optimization, or automatic parallelization; (3) Very
strong programming skills; (4) Demonstrated ability to publish research in
peer-reviewed journals or conference proceedings.
Interested candidates should send their resumes including a brief
description of their research interests to Hristo Djidjev,
djidjev@lanl.gov.
US citizenship is NOT required for this position.
**********************************************************
*
* 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] EvoCOP 2013 -- deadline extension
Please note: The deadline for paper submissions has been extended to **
November 11, 2012 **
Note also that no further deadline extensions will be granted.
** Apologies for multiple copies **
----------------------------------------------------------------
EvoCOP 2013 - 13th European Conference on Evolutionary Computation in
Combinatorial Optimisation
3th - 5th April, 2012
Vienna, Austria
Part of EVO* 2013 (http://www.evostar.org) including: EuroGP, EvoCOP,
EvoBIO, EvoMUSART and EvoApplications
The 13th European Conference on Evolutionary Computation in
Combinatorial Optimisation is a multidisciplinary conference that brings
together researchers working on metaheuristics that are used to solve
difficult combinatorial optimization problems appearing in various
industrial, economic, and scientific domains. Prominent examples of
metaheuristics include: evolutionary algorithms, simulated annealing,
tabu search, scatter search and path relinking, memetic algorithms, ant
colony and bee colony optimization, particle swarm optimization,
variable neighbourhood search, iterated local search, greedy randomized
adaptive search procedures, estimation of distribution algorithms, and
hyperheuristics. Successfully solved problems include scheduling,
timetabling, network design, transportation and distribution problems,
vehicle routing, travelling salesman, graph problems, satisfiability,
energy optimization problems, packing problems, planning problems, and
general mixed integer programming.
The EvoCOP 2013 conference will be held in Vienna, Austria. The
conference will be held in conjunction with EuroGP (the 16th European
Conference on Genetic Programming), EvoBio (the 11th European Conference
on Evolutionary Computation, Machine Learning and Data Mining in
Computational Biology), EvoMUSART (11th European conference on
evolutionary and biologically inspired music, sound, art and design) and
EvoApplications (specialist events on a range of evolutionary
computation topics and applications), in a joint event collectively
known as EVO*.
For more information see the EvoCOP 2013 webpage
http://www.evostar.org/
Areas of Interest and Contributions
Topics of interest include, but are not limited to:
Applications of metaheuristics to combinatorial optimization problems
Novel application domains for metaheuristic optimisation methods
Representation techniques
Neighborhoods and efficient algorithms for searching them
Variation operators for stochastic search methods
Constraint-handling techniques
Hybrid methods and hybridization techniques
Parallelization
Theoretical developments
Search space and landscape analyses
Comparisons between different (also exact) techniques
Metaheuristics and machine learning
Ant colony optimisation
Artificial immune systems
Bee colony optimization
Genetic programming and Genetic algorithms
(Meta-)heuristics
Scatter search
Particle swarm optimisation
Tabu search, iterated local search and variable neighborhood search
Memetic algorithms and hyperheuristics
Estimation of distribution algorithms
String processing
Scheduling and timetabling
Network design
Vehicle routing
Graph problems
Satisfiability
Packing and cutting problems
Energy optimization problems
Practical solving of NP-hard problems
Mixed integer programming
Multi-objective optimisation
Grid computing
Combinatorial optimisation
Nature and Bio-inspired methods
Quantum computing and quantum annealing
Optimization in Cloud computing
Publication Details
All accepted papers will be presented orally at the conference and
printed in the proceedings published by Springer in the LNCS series (see
LNCS volumes 2037, 2279, 2611, 3004, 3448, 3906, 4446, 4972, 5482, 6022,
6622, and 7245 for the previous proceedings).
Submission Details
Submissions must be original and not published elsewhere. The
submissions will be peer reviewed by at least three members of the
program committee. The authors of accepted papers will have to improve
their paper on the basis of the reviewers comments and will be asked to
send a camera ready version of their manuscripts. At least one author of
each accepted work has to register for the conference, attend the
conference and present the work.
The reviewing process will be double-blind, please omit information
about the authors in the submitted paper. Submit your manuscript in
Springer LNCS format.
Submission link: http://myreview.csregistry.org/evocop13/
Page limit: 12 pages
Important Dates
Submission deadline: 1. November 2012
EVO* event: 3-5 April 2013
Programme Chairs
Martin Middendorf (University of Leipzig, Germany)
middendorf(at)informatik.uni-leipzig.de
Christian Blum (Ikerbasque, Basque Foundation for Science, Spain)
christian.c.blum(at)gmail.com
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
November 11, 2012 **
Note also that no further deadline extensions will be granted.
** Apologies for multiple copies **
----------------------------------------------------------------
EvoCOP 2013 - 13th European Conference on Evolutionary Computation in
Combinatorial Optimisation
3th - 5th April, 2012
Vienna, Austria
Part of EVO* 2013 (http://www.evostar.org) including: EuroGP, EvoCOP,
EvoBIO, EvoMUSART and EvoApplications
The 13th European Conference on Evolutionary Computation in
Combinatorial Optimisation is a multidisciplinary conference that brings
together researchers working on metaheuristics that are used to solve
difficult combinatorial optimization problems appearing in various
industrial, economic, and scientific domains. Prominent examples of
metaheuristics include: evolutionary algorithms, simulated annealing,
tabu search, scatter search and path relinking, memetic algorithms, ant
colony and bee colony optimization, particle swarm optimization,
variable neighbourhood search, iterated local search, greedy randomized
adaptive search procedures, estimation of distribution algorithms, and
hyperheuristics. Successfully solved problems include scheduling,
timetabling, network design, transportation and distribution problems,
vehicle routing, travelling salesman, graph problems, satisfiability,
energy optimization problems, packing problems, planning problems, and
general mixed integer programming.
The EvoCOP 2013 conference will be held in Vienna, Austria. The
conference will be held in conjunction with EuroGP (the 16th European
Conference on Genetic Programming), EvoBio (the 11th European Conference
on Evolutionary Computation, Machine Learning and Data Mining in
Computational Biology), EvoMUSART (11th European conference on
evolutionary and biologically inspired music, sound, art and design) and
EvoApplications (specialist events on a range of evolutionary
computation topics and applications), in a joint event collectively
known as EVO*.
For more information see the EvoCOP 2013 webpage
http://www.evostar.org/
Areas of Interest and Contributions
Topics of interest include, but are not limited to:
Applications of metaheuristics to combinatorial optimization problems
Novel application domains for metaheuristic optimisation methods
Representation techniques
Neighborhoods and efficient algorithms for searching them
Variation operators for stochastic search methods
Constraint-handling techniques
Hybrid methods and hybridization techniques
Parallelization
Theoretical developments
Search space and landscape analyses
Comparisons between different (also exact) techniques
Metaheuristics and machine learning
Ant colony optimisation
Artificial immune systems
Bee colony optimization
Genetic programming and Genetic algorithms
(Meta-)heuristics
Scatter search
Particle swarm optimisation
Tabu search, iterated local search and variable neighborhood search
Memetic algorithms and hyperheuristics
Estimation of distribution algorithms
String processing
Scheduling and timetabling
Network design
Vehicle routing
Graph problems
Satisfiability
Packing and cutting problems
Energy optimization problems
Practical solving of NP-hard problems
Mixed integer programming
Multi-objective optimisation
Grid computing
Combinatorial optimisation
Nature and Bio-inspired methods
Quantum computing and quantum annealing
Optimization in Cloud computing
Publication Details
All accepted papers will be presented orally at the conference and
printed in the proceedings published by Springer in the LNCS series (see
LNCS volumes 2037, 2279, 2611, 3004, 3448, 3906, 4446, 4972, 5482, 6022,
6622, and 7245 for the previous proceedings).
Submission Details
Submissions must be original and not published elsewhere. The
submissions will be peer reviewed by at least three members of the
program committee. The authors of accepted papers will have to improve
their paper on the basis of the reviewers comments and will be asked to
send a camera ready version of their manuscripts. At least one author of
each accepted work has to register for the conference, attend the
conference and present the work.
The reviewing process will be double-blind, please omit information
about the authors in the submitted paper. Submit your manuscript in
Springer LNCS format.
Submission link: http://myreview.csregistry.org/evocop13/
Page limit: 12 pages
Important Dates
Submission deadline: 1. November 2012
EVO* event: 3-5 April 2013
Programme Chairs
Martin Middendorf (University of Leipzig, Germany)
middendorf(at)informatik.uni-leipzig.de
Christian Blum (Ikerbasque, Basque Foundation for Science, Spain)
christian.c.blum(at)gmail.com
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Saturday, October 27, 2012
[DMANET] >> CFP (due: Nov. 12): ICDCS 2013 (33rd Intl. Conf. on Distributed Computing Systems) in Philadelphia, July 8-11, 2013 <<
********************************************************************
We apologize in advance if you receive multiple copies of this CFP.
Please disseminate CFP to your colleagues that might be interested.
********************************************************************
---------------------------------------------------------------------
CALL FOR PAPERS
>> Deadline: November 12 <<
ICDCS 2013
The 33rd International Conference on Distributed Computing Systems
Philadelphia, USA, July 8-11, 2013
http://www.temple.edu/cis/icdcs2013
---------------------------------------------------------------------
1. SCOPE
The conference provides a forum for engineers and scientists in
academia, industry, and government to present their latest research
findings in any aspects of distributed and parallel computing. Papers
are solicited on a wide range of distributed systems and solutions,
including:
- Algorithms and Theory
- Security and Privacy
- Fault Tolerance and Dependability
- Wireless, Mobile, Sensors, and Ubiquitous Computing
- Big Data, Data Management, and Analytics
- Cloud Computing and Data-Center Systems
- P2P, Distributed OS, and Middleware
- Web-based Systems and Applications
- Energy Management and Green computing
- Crowdsourcing, Social Networks, and Reputation Systems
NOTE: To build a broad program and to encourage a diverse set of
submissions, a limited number of papers will be accepted within each
topic area, and every topic area will accept a minimum quota of papers.
2. PAPER SUBMISSION
Form of Manuscript: All paper submissions should follow the IEEE 8.5" x
11" two-column format. When using the LaTeX style file, we recommend
using the following format options:
\documentclass[10pt,conference,compsocconf,letterpaper]{IEEEtran}
Each submission can have up to 10 pages; papers exceeding this limit may
be rejected without review. If the paper is accepted for publication, up
to 2 over-length pages may be purchased for the final camera-ready
version. Submitted papers should NOT be blinded for review.
Electronic Submission: Submissions will be handled via the conference
web page.
The proceedings of the conference and the workshops will be published on
CDs by the IEEE-CS Conference Publishing Services (CPS).
3. IMPORTANT DEADLINES
Paper submission - Monday, November 12, 2012, 11:59pm UTC
Author notification - Monday, February 25, 2013
Final manuscript due - Monday, March 25, 2013
4. FURTHER INFORMATION
For further information, please contact General Chair, Jie Wu at
jiewu@temple.edu or Program Chair, John Douceur at johndo@microsoft.com
--[CFP v.12.10.27a] --------------------------------------------------
**********************************************************
*
* 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/
*
**********************************************************
We apologize in advance if you receive multiple copies of this CFP.
Please disseminate CFP to your colleagues that might be interested.
********************************************************************
---------------------------------------------------------------------
CALL FOR PAPERS
>> Deadline: November 12 <<
ICDCS 2013
The 33rd International Conference on Distributed Computing Systems
Philadelphia, USA, July 8-11, 2013
http://www.temple.edu/cis/icdcs2013
---------------------------------------------------------------------
1. SCOPE
The conference provides a forum for engineers and scientists in
academia, industry, and government to present their latest research
findings in any aspects of distributed and parallel computing. Papers
are solicited on a wide range of distributed systems and solutions,
including:
- Algorithms and Theory
- Security and Privacy
- Fault Tolerance and Dependability
- Wireless, Mobile, Sensors, and Ubiquitous Computing
- Big Data, Data Management, and Analytics
- Cloud Computing and Data-Center Systems
- P2P, Distributed OS, and Middleware
- Web-based Systems and Applications
- Energy Management and Green computing
- Crowdsourcing, Social Networks, and Reputation Systems
NOTE: To build a broad program and to encourage a diverse set of
submissions, a limited number of papers will be accepted within each
topic area, and every topic area will accept a minimum quota of papers.
2. PAPER SUBMISSION
Form of Manuscript: All paper submissions should follow the IEEE 8.5" x
11" two-column format. When using the LaTeX style file, we recommend
using the following format options:
\documentclass[10pt,conference,compsocconf,letterpaper]{IEEEtran}
Each submission can have up to 10 pages; papers exceeding this limit may
be rejected without review. If the paper is accepted for publication, up
to 2 over-length pages may be purchased for the final camera-ready
version. Submitted papers should NOT be blinded for review.
Electronic Submission: Submissions will be handled via the conference
web page.
The proceedings of the conference and the workshops will be published on
CDs by the IEEE-CS Conference Publishing Services (CPS).
3. IMPORTANT DEADLINES
Paper submission - Monday, November 12, 2012, 11:59pm UTC
Author notification - Monday, February 25, 2013
Final manuscript due - Monday, March 25, 2013
4. FURTHER INFORMATION
For further information, please contact General Chair, Jie Wu at
jiewu@temple.edu or Program Chair, John Douceur at johndo@microsoft.com
--[CFP v.12.10.27a] --------------------------------------------------
**********************************************************
*
* 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] CPAIOR 2013 deadline extended (abstract due Oct 29, paper due Nov 11)
The paper deadline has been extended from Nov 2 to Nov 11 due to
multiple requests.
IMPORTANT: The abstract deadline is still on Oct 29. So if you plan to
submit a paper, do not miss the abstract deadline.
Call for Papers ***** EXTENDED PAPER DEADLINE **********
CPAIOR 2013
Tenth International Conference on Integration of Artificial
Intelligence and Operations Research Techniques in Constraint
Programming
web: http://www.cis.cornell.edu/ics/cpaior2013/
cpaior series: http://www.andrew.cmu.edu/user/vanhoeve/cpaior/
IBM Research, Yorktown Heights, NY, USA
MAY 18 - 22, 2013
=============================================================================
DEADLINES (beware EARLIER than usual)
=============================================================================
PAPER SUBMISSION (identical for long and short papers):
Abstract due: OCT 29, 2012 11.59 P.M. PST
Paper due: NOV 11, 2012 11.59 P.M. PST
Notification: DEC 3, 2012
Rebuttal due: DEC 5, 2012
Final Notification:DEC 17, 2012
Final version due: JAN 11, 2013
PRESENTATION-ONLY ABSTRACT SUBMISSIONS:
Abstract due: Feb 1, 2013 11.59 P.M. PST
Notification: Feb 22, 2013
=============================================================================
The Tenth International Conference on Integration of Artificial
Intelligence and Operations Research Techniques in Constraint
Programming will be held in Yorktown Heights, NY, USA, May 18-22, 2013
with a Master Class on CP and OR on May 18, Workshops on May 19 and
Main Program on May 20-22, 2013.
The aim of the conference is to bring together interested researchers
from Constraint Programming (CP), Artificial Intelligence (AI), and
Operations Research (OR) to present new techniques or new applications
in combinatorial optimization and to provide an opportunity for
researchers in one area to learn about techniques in the others. A
main objective of this conference series is also to give these
researchers the opportunity to show how the integration of techniques
from different fields can lead to interesting results on large and
complex problems. Therefore papers that actively combine, integrate,
or contrast approaches from more than one of the areas are especially
solicited. High quality papers from a single area are also welcome,
provided that they are of interest to other communities involved.
Finally, application papers showcasing CP/AI/OR techniques on
innovative and challenging applications or experience reports on such
applications are strongly encouraged.
The program committee invites submissions that include but are not
limited to the following topics:
* Inference and relaxation methods: constraint propagation, cutting
planes, global constraints, graph algorithms, dynamic programming,
Lagrangean and convex relaxations, heuristic functions based on
constraint relaxation.
* Search methods: branch and bound, intelligent backtracking,
incomplete search, randomized search, column generation and other
decomposition methods, local search, meta-heuristics.
* Integration methods: static/dynamic problem decomposition, solver
communication, transformations between models and solvers,
collaboration between concurrent methods, models, and solvers.
* Modeling methods: comparison of models, symmetry breaking,
uncertainty, dominance relationships.
* Innovative Applications of CP/AI/OR techniques.
* Implementation of CP/AI/OR techniques and optimization systems.
PAPER SUBMISSION
Paper submissions are of two types: Long papers and short papers.
INSTRUCTION FOR LONG PAPERS:
Long papers should present original unpublished work and be at most 15
pages plus references in length, and should be prepared in the format
used for the Springer Lecture Notes in Computer Science series
(http://www.springer.de/comp/lncs/authors.html). These papers will
undergo rigorous review. The proceedings will be published in the
Springer Lecture Notes in Computer Science series.
NOTE: Unlike previous CPAIOR conferences the page limit for long
papers is 15 LNCS pages *plus references*.
INSTRUCTION FOR SHORT PAPERS: Short papers are also encouraged,
limited to 5 LNCS pages plus references and should be prepared with
the same format as long papers
(http://www.springer.de/comp/lncs/authors.html). Although containing
less material, short papers should describe original unpublished work
and will be reviewed to the same criteria of quality as long papers.
It is also encouraged to submit short papers about work in progress on
ideas that are interesting but for which the practical or theoretical
relevance is not yet fully identified. Short papers will be presented
at the conference and published in the conference proceedings.
SUBMISSION NOTES:
All papers are to be submitted electronically in PDF format by
following the instructions at the URL
http://www.easychair.org/conferences/?conf=cpaior2013
PRESENTATION-ONLY ABSTRACT SUBMISSION
An abstract of no more than 200 words should be submitted through the
submission page. Names and affiliations of all authors should be
provided, with the presenting author listed first. All accepted
presentation-only abstracts will be printed in the conference program.
For any queries on the submission process, please contact the Program
Chairs using the email cpaior2013@gmail.com .
PROGRAM CHAIRS:
Carla Gomes
Meinolf Sellmann
**********************************************************
*
* 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/
*
**********************************************************
multiple requests.
IMPORTANT: The abstract deadline is still on Oct 29. So if you plan to
submit a paper, do not miss the abstract deadline.
Call for Papers ***** EXTENDED PAPER DEADLINE **********
CPAIOR 2013
Tenth International Conference on Integration of Artificial
Intelligence and Operations Research Techniques in Constraint
Programming
web: http://www.cis.cornell.edu/ics/cpaior2013/
cpaior series: http://www.andrew.cmu.edu/user/vanhoeve/cpaior/
IBM Research, Yorktown Heights, NY, USA
MAY 18 - 22, 2013
=============================================================================
DEADLINES (beware EARLIER than usual)
=============================================================================
PAPER SUBMISSION (identical for long and short papers):
Abstract due: OCT 29, 2012 11.59 P.M. PST
Paper due: NOV 11, 2012 11.59 P.M. PST
Notification: DEC 3, 2012
Rebuttal due: DEC 5, 2012
Final Notification:DEC 17, 2012
Final version due: JAN 11, 2013
PRESENTATION-ONLY ABSTRACT SUBMISSIONS:
Abstract due: Feb 1, 2013 11.59 P.M. PST
Notification: Feb 22, 2013
=============================================================================
The Tenth International Conference on Integration of Artificial
Intelligence and Operations Research Techniques in Constraint
Programming will be held in Yorktown Heights, NY, USA, May 18-22, 2013
with a Master Class on CP and OR on May 18, Workshops on May 19 and
Main Program on May 20-22, 2013.
The aim of the conference is to bring together interested researchers
from Constraint Programming (CP), Artificial Intelligence (AI), and
Operations Research (OR) to present new techniques or new applications
in combinatorial optimization and to provide an opportunity for
researchers in one area to learn about techniques in the others. A
main objective of this conference series is also to give these
researchers the opportunity to show how the integration of techniques
from different fields can lead to interesting results on large and
complex problems. Therefore papers that actively combine, integrate,
or contrast approaches from more than one of the areas are especially
solicited. High quality papers from a single area are also welcome,
provided that they are of interest to other communities involved.
Finally, application papers showcasing CP/AI/OR techniques on
innovative and challenging applications or experience reports on such
applications are strongly encouraged.
The program committee invites submissions that include but are not
limited to the following topics:
* Inference and relaxation methods: constraint propagation, cutting
planes, global constraints, graph algorithms, dynamic programming,
Lagrangean and convex relaxations, heuristic functions based on
constraint relaxation.
* Search methods: branch and bound, intelligent backtracking,
incomplete search, randomized search, column generation and other
decomposition methods, local search, meta-heuristics.
* Integration methods: static/dynamic problem decomposition, solver
communication, transformations between models and solvers,
collaboration between concurrent methods, models, and solvers.
* Modeling methods: comparison of models, symmetry breaking,
uncertainty, dominance relationships.
* Innovative Applications of CP/AI/OR techniques.
* Implementation of CP/AI/OR techniques and optimization systems.
PAPER SUBMISSION
Paper submissions are of two types: Long papers and short papers.
INSTRUCTION FOR LONG PAPERS:
Long papers should present original unpublished work and be at most 15
pages plus references in length, and should be prepared in the format
used for the Springer Lecture Notes in Computer Science series
(http://www.springer.de/comp/lncs/authors.html). These papers will
undergo rigorous review. The proceedings will be published in the
Springer Lecture Notes in Computer Science series.
NOTE: Unlike previous CPAIOR conferences the page limit for long
papers is 15 LNCS pages *plus references*.
INSTRUCTION FOR SHORT PAPERS: Short papers are also encouraged,
limited to 5 LNCS pages plus references and should be prepared with
the same format as long papers
(http://www.springer.de/comp/lncs/authors.html). Although containing
less material, short papers should describe original unpublished work
and will be reviewed to the same criteria of quality as long papers.
It is also encouraged to submit short papers about work in progress on
ideas that are interesting but for which the practical or theoretical
relevance is not yet fully identified. Short papers will be presented
at the conference and published in the conference proceedings.
SUBMISSION NOTES:
All papers are to be submitted electronically in PDF format by
following the instructions at the URL
http://www.easychair.org/conferences/?conf=cpaior2013
PRESENTATION-ONLY ABSTRACT SUBMISSION
An abstract of no more than 200 words should be submitted through the
submission page. Names and affiliations of all authors should be
provided, with the presenting author listed first. All accepted
presentation-only abstracts will be printed in the conference program.
For any queries on the submission process, please contact the Program
Chairs using the email cpaior2013@gmail.com .
PROGRAM CHAIRS:
Carla Gomes
Meinolf Sellmann
**********************************************************
*
* 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] postdoctoral positions at LIAFA, Paris, France
The Algorithms and Complexity group of LIAFA (CNRS and University Paris
Diderot), Paris, France, is seeking excellent candidates for one or more
postdoctoral positions in classical and quantum computing. Topics of
interest
include (but are not limited to): algorithms, online algorithms,
streaming algorithms,
approximation algorithms, communication complexity, cryptography,
computational game theory, quantum computing, computational applications
of logic, randomness in computing, privacy.
LIAFA is a joint laboratory of the CNRS (the French National Center
for Scientfic Research) and University Paris Diderot - Paris 7.
For more information about LIAFA, please see
http://www.liafa.univ-paris-diderot.fr ,
and for more information about the Algorithms and Complexity group
please see http://www.liafa.univ-paris-diderot.fr/algocomp .
Further information may be obtained from any of the permanent
members of the group.
To apply please send a CV, a summary of research and names of at
least three references to algocomp-apply@liafa.univ-paris-diderot.fr.
For a starting date of September 2013, applications should be received
by February 1st, 2013.
**********************************************************
*
* 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/
*
**********************************************************
Diderot), Paris, France, is seeking excellent candidates for one or more
postdoctoral positions in classical and quantum computing. Topics of
interest
include (but are not limited to): algorithms, online algorithms,
streaming algorithms,
approximation algorithms, communication complexity, cryptography,
computational game theory, quantum computing, computational applications
of logic, randomness in computing, privacy.
LIAFA is a joint laboratory of the CNRS (the French National Center
for Scientfic Research) and University Paris Diderot - Paris 7.
For more information about LIAFA, please see
http://www.liafa.univ-paris-diderot.fr ,
and for more information about the Algorithms and Complexity group
please see http://www.liafa.univ-paris-diderot.fr/algocomp .
Further information may be obtained from any of the permanent
members of the group.
To apply please send a CV, a summary of research and names of at
least three references to algocomp-apply@liafa.univ-paris-diderot.fr.
For a starting date of September 2013, applications should be received
by February 1st, 2013.
**********************************************************
*
* 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/
*
**********************************************************
postdoctoral positions at LIAFA, Paris, France
The Algorithms and Complexity group of LIAFA (CNRS and University Paris
Diderot), Paris, France, is seeking excellent candidates for one or more
postdoctoral positions in classical and quantum computing. Topics of
interest
include (but are not limited to): algorithms, online algorithms,
streaming algorithms,
approximation algorithms, communication complexity, cryptography,
computational game theory, quantum computing, computational applications
of logic, randomness in computing, privacy.
LIAFA is a joint laboratory of the CNRS (the French National Center
for Scientfic Research) and University Paris Diderot - Paris 7.
For more information about LIAFA, please see
http://www.liafa.univ-paris-diderot.fr ,
and for more information about the Algorithms and Complexity group
please see http://www.liafa.univ-paris-diderot.fr/algocomp .
Further information may be obtained from any of the permanent
members of the group.
To apply please send a CV, a summary of research and names of at
least three references to algocomp-apply@liafa.univ-paris-diderot.fr.
For a starting date of September 2013, applications should be received
by February 1st, 2013.
Diderot), Paris, France, is seeking excellent candidates for one or more
postdoctoral positions in classical and quantum computing. Topics of
interest
include (but are not limited to): algorithms, online algorithms,
streaming algorithms,
approximation algorithms, communication complexity, cryptography,
computational game theory, quantum computing, computational applications
of logic, randomness in computing, privacy.
LIAFA is a joint laboratory of the CNRS (the French National Center
for Scientfic Research) and University Paris Diderot - Paris 7.
For more information about LIAFA, please see
http://www.liafa.univ-paris-diderot.fr ,
and for more information about the Algorithms and Complexity group
please see http://www.liafa.univ-paris-diderot.fr/algocomp .
Further information may be obtained from any of the permanent
members of the group.
To apply please send a CV, a summary of research and names of at
least three references to algocomp-apply@liafa.univ-paris-diderot.fr.
For a starting date of September 2013, applications should be received
by February 1st, 2013.
Friday, October 26, 2012
[DMANET] GRAPHITE 2013: First Call for Papers
GRAPHITE 2013
Second Workshop on GRAPH Inspection and Traversal Engineering
March 24, 2013, Rome, Italy
(affiliated with ETAPS 2013)
http://www.win.tue.nl/~awijs/graphite
First Call for Papers
---------------------------
Objectives
----------
The topic of the GRAPHITE workshop is graph analysis in all its forms in computer science.
Graphs are used to represent data in many application areas, and they are subjected to
various computational algorithms in order to acquire the desired information. These graph
algorithms tend to have common characteristics, such as duplicate detection to guarantee
their termination, independent of their application domain. Over the past few years, it has
been shown that the scalability of such algorithms can be dramatically improved by using,
e.g., external memory, by exploiting parallel architectures, such as clusters, multi-core
CPUs, and graphics processing units, and by using heuristics to guide the search. Novel
techniques to further scale graph search algorithms, and new applications of graph search
are within the scope of this workshop. Another topic of interest of the event is more
related to the structural properties of graphs: which kind of graph characteristics are
relevant for a particular application area, and how can these be measured? Finally, any
novel way of using graphs for a particular application area is on topic. The goal of this
event is to gather scientists from different communities, such as model checking, artificial
intelligence planning, game playing, and algorithm engineering, who do research on graph
search algorithms, such that awareness of each others' work is increased.
The workshop will be held as a satellite event of ETAPS 2013, the
16-th edition of The European Joint Conferences on Theory and Practice
of Software (ETAPS). ETAPS is a primary European forum for academic
and industrial researchers working on topics relating to Software Science.
Workshop Specific Topics
------------------------
We encourage submission of works which include but are not limited to the following topics:
* Algorithms for the verification of hardware and software based on graph exploration
(e.g. the computation of an explicit state space based on an implicit description)
* Application of graph based techniques originating in one application domain, applied on
a problem in another domain (e.g. verification algorithms on artificial intelligence problems)
* Techniques to deal with potentially infinite graphs and infinite families of graphs
* Innovative or otherwise particularly significant case studies of applications of graph based
methods
* Theoretical results on the limits and possibilities of graph based methods
* Parallel algorithms for graph exploration for distributed and shared memory systems (e.g.
clusters, multi-core CPUs, GPGPUs)
* Graph algorithms in artificial intelligence; planning; game playing; social network analysis;
biological network analysis, and similar
* Graph minimisation and abstraction techniques as a preprocessing step for analysis (e.g.
bisimulation reduction, transitive reduction)
* Computation on graphs through graph transformation techniques
* I/O Efficient graph algorithms using external memory
Papers on applications and papers bridging multiple application domains are strongly encouraged.
Solicited Contributions
---------------------------------------
The submitted papers should contain original work which has not been
submitted or accepted for publication elsewhere. Submissions should
adhere to the EPTCS format and should be no longer than 15 pages.
All accepted papers will be included in the workshop proceedings.
We solicit two kinds of papers:
*Technical Papers no longer than 15 pages. All accepted technical papers
will be included in the proceedings.
*Tool Presentations. This kind of submission should consist of
two parts. The first part is at most a 5 page description of the tool.
If accepted, this part will be published in the workshop proceedings.
The second part should describe an informal plan for an oral presentation
of the tool. This part will not be included in the proceedings.
Submission and Publication
--------------------------
Submission can be done via the Easy Chair web-based conference management
system. (Follow the link from the workshop web page.) All papers will be
peer reviewed.
The proceedings will likely appear in
the Electronic Proceedings in Theoretical Computer Science (EPTCS)
as post-proceedings.
Important Dates
---------------
January 6, 2013, Submission deadline
January 23, 2013, Notification of acceptance/rejection
February 13, 2013, Camera ready copy for local proceedings
March 24, 2013, Workshop
Organization
------------
Anton Wijs (Eindhoven University of Technology, Netherlands)
Dragan Bosnacki (Eindhoven University of Technology, Netherlands)
Stefan Edelkamp (University of Bremen, Germany)
Programme Committee
-------------------
Henri Bal (VU University Amsterdam, The Netherlands)
Dragan Bosnacki (Eindhoven University of Technology, The Netherlands) (co-chair)
Alastair Donaldson (Imperial College London, England)
Stefan Edelkamp (University of Bremen, Germany) (co-chair)
Ansgar Fehnker (The University of the South Pacific, Fiji)
Wan Fokkink (VU University Amsterdam, The Netherlands)
Keijo Heljanko (Aalto University, Finland)
Gerard Holzmann (NASA / Jet Propulsion Laboratory, USA)
Gunnar Klau (Centrum Wiskunde & Informatica, The Netherlands)
Juan de Lara (Universidad Autónoma de Madrid, Spain)
Stefan Leue (University of Konstanz, Germany)
Ulrich Meyer (Goethe University Frankfurt am Main, Germany)
Jun Pang (Université du Luxembourg, Luxembourg)
David Parker (University of Birmingham, England)
Arend Rensink (University of Twente, The Netherlands)
Anton Wijs (Eindhoven University of Technology, The Netherlands) (co-chair)
**********************************************************
*
* 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/
*
**********************************************************
Second Workshop on GRAPH Inspection and Traversal Engineering
March 24, 2013, Rome, Italy
(affiliated with ETAPS 2013)
http://www.win.tue.nl/~awijs/graphite
First Call for Papers
---------------------------
Objectives
----------
The topic of the GRAPHITE workshop is graph analysis in all its forms in computer science.
Graphs are used to represent data in many application areas, and they are subjected to
various computational algorithms in order to acquire the desired information. These graph
algorithms tend to have common characteristics, such as duplicate detection to guarantee
their termination, independent of their application domain. Over the past few years, it has
been shown that the scalability of such algorithms can be dramatically improved by using,
e.g., external memory, by exploiting parallel architectures, such as clusters, multi-core
CPUs, and graphics processing units, and by using heuristics to guide the search. Novel
techniques to further scale graph search algorithms, and new applications of graph search
are within the scope of this workshop. Another topic of interest of the event is more
related to the structural properties of graphs: which kind of graph characteristics are
relevant for a particular application area, and how can these be measured? Finally, any
novel way of using graphs for a particular application area is on topic. The goal of this
event is to gather scientists from different communities, such as model checking, artificial
intelligence planning, game playing, and algorithm engineering, who do research on graph
search algorithms, such that awareness of each others' work is increased.
The workshop will be held as a satellite event of ETAPS 2013, the
16-th edition of The European Joint Conferences on Theory and Practice
of Software (ETAPS). ETAPS is a primary European forum for academic
and industrial researchers working on topics relating to Software Science.
Workshop Specific Topics
------------------------
We encourage submission of works which include but are not limited to the following topics:
* Algorithms for the verification of hardware and software based on graph exploration
(e.g. the computation of an explicit state space based on an implicit description)
* Application of graph based techniques originating in one application domain, applied on
a problem in another domain (e.g. verification algorithms on artificial intelligence problems)
* Techniques to deal with potentially infinite graphs and infinite families of graphs
* Innovative or otherwise particularly significant case studies of applications of graph based
methods
* Theoretical results on the limits and possibilities of graph based methods
* Parallel algorithms for graph exploration for distributed and shared memory systems (e.g.
clusters, multi-core CPUs, GPGPUs)
* Graph algorithms in artificial intelligence; planning; game playing; social network analysis;
biological network analysis, and similar
* Graph minimisation and abstraction techniques as a preprocessing step for analysis (e.g.
bisimulation reduction, transitive reduction)
* Computation on graphs through graph transformation techniques
* I/O Efficient graph algorithms using external memory
Papers on applications and papers bridging multiple application domains are strongly encouraged.
Solicited Contributions
---------------------------------------
The submitted papers should contain original work which has not been
submitted or accepted for publication elsewhere. Submissions should
adhere to the EPTCS format and should be no longer than 15 pages.
All accepted papers will be included in the workshop proceedings.
We solicit two kinds of papers:
*Technical Papers no longer than 15 pages. All accepted technical papers
will be included in the proceedings.
*Tool Presentations. This kind of submission should consist of
two parts. The first part is at most a 5 page description of the tool.
If accepted, this part will be published in the workshop proceedings.
The second part should describe an informal plan for an oral presentation
of the tool. This part will not be included in the proceedings.
Submission and Publication
--------------------------
Submission can be done via the Easy Chair web-based conference management
system. (Follow the link from the workshop web page.) All papers will be
peer reviewed.
The proceedings will likely appear in
the Electronic Proceedings in Theoretical Computer Science (EPTCS)
as post-proceedings.
Important Dates
---------------
January 6, 2013, Submission deadline
January 23, 2013, Notification of acceptance/rejection
February 13, 2013, Camera ready copy for local proceedings
March 24, 2013, Workshop
Organization
------------
Anton Wijs (Eindhoven University of Technology, Netherlands)
Dragan Bosnacki (Eindhoven University of Technology, Netherlands)
Stefan Edelkamp (University of Bremen, Germany)
Programme Committee
-------------------
Henri Bal (VU University Amsterdam, The Netherlands)
Dragan Bosnacki (Eindhoven University of Technology, The Netherlands) (co-chair)
Alastair Donaldson (Imperial College London, England)
Stefan Edelkamp (University of Bremen, Germany) (co-chair)
Ansgar Fehnker (The University of the South Pacific, Fiji)
Wan Fokkink (VU University Amsterdam, The Netherlands)
Keijo Heljanko (Aalto University, Finland)
Gerard Holzmann (NASA / Jet Propulsion Laboratory, USA)
Gunnar Klau (Centrum Wiskunde & Informatica, The Netherlands)
Juan de Lara (Universidad Autónoma de Madrid, Spain)
Stefan Leue (University of Konstanz, Germany)
Ulrich Meyer (Goethe University Frankfurt am Main, Germany)
Jun Pang (Université du Luxembourg, Luxembourg)
David Parker (University of Birmingham, England)
Arend Rensink (University of Twente, The Netherlands)
Anton Wijs (Eindhoven University of Technology, The Netherlands) (co-chair)
**********************************************************
*
* 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] A PostDoc Position at AOC team - LIPN, LIX Ecole Polytechnique and EDF is open
Postdoctoral fellowship in the field of "Optimization of huge stochastic
combinatorial problem"
combinatorial problem"
LIX, the Laboratory for Computer Science of the "Ecole Polytechnique"
(France), and LIPN, the Laboratory for Computer Science of the
"University Paris Nord" (France) offer a postdoctoral position for 12
months starting from January 2013.
The project deals with the optimization of large-scaled combinatorial
problems the parameters of which are uncertain, particularly with
"multi-stage robust" approaches of these class of problems. In this
context, an emphasis will be made on the modelisation of future
"recourses" available through re-optimisations on a sliding horizon, and
on the stability of the solutions generated in this framework.
The problem of scheduling maintenance and refuelling outages of the
Nuclear Power Plants of Electricité de France (the French utility for
electricity supply), which is a large-scaled industrial instance of this
kind of problems, will serve as an application.
This problem was the topic of the : "2010 EURO/ROADEF Challenge" (see
http://challenge.roadef.org/2010/en/)
The project will also involve researchers from EDF R&D, the research
center of Electricité de France, and will contribute to a PHD on this
subject currently in progress in collaboration with the National
Institute of Research In Computer Science and Automatics (INRIA RealOPt
and Dolphin research groups).
This position is financed by the "Fondation Mathematique Jacques
Hadamard" as part of the "Gaspard Monge Program for Optimization and
Operation Research" (see, http://www.fondation-hadamard.fr/PGMO )
The candidate should preferably have: a PhD in Operations Research,
Mathematics, Computer Science, Engineering with experience in
mathematical programming, and large-scale mixed integer linear problems;
experience in using and implementing through the most common OR tools
(mathematical programming languages (AMPL/OPL), commercial and
open-source optimization solvers, C/C++ language).
The postdoctoral fellow will work at LIX, Ecole Polytechnique
(www.lix.polytechnique.fr) within the SYSMO team
(http://www.lix.polytechnique.fr/sysmo/) and at LIPN, Université Paris13
(http://lipn.univ-paris13.fr/fr/) within the AOC team
(http://lipn.univ-paris13.fr/fr/aoc).
Moreover he/she will interact and collaborate with all the people
involved within the project.
The salary, after taxes, is in the range 1800-2200EUR/month. The
contract comes with funds for buying material and for travels.
Please contact Roberto Wolfler Calvo (wolfler@lipn.fr) for
questions and to apply for the position.
The required documents (in pdf format) are:
- Detailed CV including a complete list of publications.
- PhD thesis.
- Motivation letter.
- Recommendation letters
CONTACTS
==========
Vincent Jost
LIX Ecole Polytechnique
France
vincent.jost@lix.polytechnique.fr
Roberto Wolfler Calvo
LIPN, UMR CNRS 7030
Université Paris 13
France
wolfler@lipn.fr
**********************************************************
*
* 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] EuroCG 2013 - First Call for Abstracts
=======================================================================
Call for Papers
EuroCG 2013:
29th European Workshop on Computational Geometry
March 18-20, 2013 - Braunschweig, Germany
http://www.ibr.cs.tu-bs.de/alg/eurocg13/
=======================================================================
The 29th European Workshop on Computational Geometry (EuroCG 2013) will be
held on March 18 - 20, 2012 in the "House of Science" at TU Braunschweig, in old
city of Braunschweig, right in the heart
of Germany. EuroCG is an annual workshop that
combines a strong scientific tradition with a friendly and informal
atmosphere. The workshop is a forum where researchers can meet, present their results,
discuss their work, and establish scientific collaborations.
Topics of interest cover all aspects of computational geometry, including
the following:
* discrete and combinatorial geometry and topology
* design and analysis of geometric algorithms and data structures
* implementation and experimental evaluation of geometric algorithms
* numerical and algebraic issues arising from implementations
* analysis of geometric configurations
* geometric modeling, visualization and simulation
* combinatorial optimization
* graph drawing
* computer-aided design and manufacturing
* structural molecular biology
* geographic information systems
* robotics and virtual worlds
SUBMISSIONS AND PROCEEDINGS
---------------------------
We invite authors to submit extended abstracts (4 pages, two columns) of
original research. Submissions will be handled through EasyChair.
We remark that EuroCG does not have formally reviewed proceedings. A booklet
of abstracts, without ISBN number, is distributed at the conference for the
benefit of the community and must be regarded as a collection of preprints
rather than a formally reviewed selection of papers. Results presented at
EuroCG are expected to appear in other conferences with formal proceedings
and/or in journals.
IMPORTANT DATES
---------------
* Submission Deadline : January, 7
* Acceptance Notification : January, 28
* Camera-ready version : February, 18
* Early Registration : February, 18
INVITED SPEAKERS
----------------
* Marcus Magnor, TU Braunschweig
* James McLurkin, Rice University
* Konrad Polthier, Freie Universität Berlin.
PROGRAM COMMITTEE
-----------------
* Dominique Attali, CNRS, France
* Erin Chambers, Saint Louis U., USA
* Tamal Dey, Ohio State U., USA
* Sándor Fekete, TU Braunschweig (chair), Germany
* Jie Gao, Stony Brook U., USA
* Joachim Giesen, Jena U., Germany
* Sariel Har-Peled, U. Illinois at Urbana-Champaign, USA
* Michael Hemmer, Tel-Aviv U., Israel
* Ferran Hurtado, U. Politècnica de Catalunya, Spain
* Michael Kerber, Stanford U., USA
* David Kirkpatrick, Simon Fraser U., Canada
* Christian Knauer, U. Bayreuth, Germany
* Alexander Kröller, TU Braunschweig, Germany
* Marc van Kreveld, U. Utrecht, The Netherlands
* Sylvain Lazard, INRIA Nancy, France
* Maarten Löffler, U. Utrecht, The Netherlands
* Alejandro López-Ortiz, U. of Waterloo, Canada
* Henk Meijer, Roosevelt Academy, The Netherlands
* Joe Mitchell, Stony Brook University, USA
* Christiane Schmidt, TU Braunschweig, Germany
* Bettina Speckmann, TU Eindhoven, The Netherlands
* Monique Teillaud, INRIA Sophia Antipolis, France
* Jan Vahrenhold, U. Münster, Germany
* Carola Wenk, Tulane U., USA
ORGANIZING COMMITTEE
--------------------
* Sabine Anthony, TU Braunschweig
* Sándor Fekete, TU Braunschweig
* Christiane Schmidt, TU Braunschweig
**********************************************************
*
* 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
EuroCG 2013:
29th European Workshop on Computational Geometry
March 18-20, 2013 - Braunschweig, Germany
http://www.ibr.cs.tu-bs.de/alg/eurocg13/
=======================================================================
The 29th European Workshop on Computational Geometry (EuroCG 2013) will be
held on March 18 - 20, 2012 in the "House of Science" at TU Braunschweig, in old
city of Braunschweig, right in the heart
of Germany. EuroCG is an annual workshop that
combines a strong scientific tradition with a friendly and informal
atmosphere. The workshop is a forum where researchers can meet, present their results,
discuss their work, and establish scientific collaborations.
Topics of interest cover all aspects of computational geometry, including
the following:
* discrete and combinatorial geometry and topology
* design and analysis of geometric algorithms and data structures
* implementation and experimental evaluation of geometric algorithms
* numerical and algebraic issues arising from implementations
* analysis of geometric configurations
* geometric modeling, visualization and simulation
* combinatorial optimization
* graph drawing
* computer-aided design and manufacturing
* structural molecular biology
* geographic information systems
* robotics and virtual worlds
SUBMISSIONS AND PROCEEDINGS
---------------------------
We invite authors to submit extended abstracts (4 pages, two columns) of
original research. Submissions will be handled through EasyChair.
We remark that EuroCG does not have formally reviewed proceedings. A booklet
of abstracts, without ISBN number, is distributed at the conference for the
benefit of the community and must be regarded as a collection of preprints
rather than a formally reviewed selection of papers. Results presented at
EuroCG are expected to appear in other conferences with formal proceedings
and/or in journals.
IMPORTANT DATES
---------------
* Submission Deadline : January, 7
* Acceptance Notification : January, 28
* Camera-ready version : February, 18
* Early Registration : February, 18
INVITED SPEAKERS
----------------
* Marcus Magnor, TU Braunschweig
* James McLurkin, Rice University
* Konrad Polthier, Freie Universität Berlin.
PROGRAM COMMITTEE
-----------------
* Dominique Attali, CNRS, France
* Erin Chambers, Saint Louis U., USA
* Tamal Dey, Ohio State U., USA
* Sándor Fekete, TU Braunschweig (chair), Germany
* Jie Gao, Stony Brook U., USA
* Joachim Giesen, Jena U., Germany
* Sariel Har-Peled, U. Illinois at Urbana-Champaign, USA
* Michael Hemmer, Tel-Aviv U., Israel
* Ferran Hurtado, U. Politècnica de Catalunya, Spain
* Michael Kerber, Stanford U., USA
* David Kirkpatrick, Simon Fraser U., Canada
* Christian Knauer, U. Bayreuth, Germany
* Alexander Kröller, TU Braunschweig, Germany
* Marc van Kreveld, U. Utrecht, The Netherlands
* Sylvain Lazard, INRIA Nancy, France
* Maarten Löffler, U. Utrecht, The Netherlands
* Alejandro López-Ortiz, U. of Waterloo, Canada
* Henk Meijer, Roosevelt Academy, The Netherlands
* Joe Mitchell, Stony Brook University, USA
* Christiane Schmidt, TU Braunschweig, Germany
* Bettina Speckmann, TU Eindhoven, The Netherlands
* Monique Teillaud, INRIA Sophia Antipolis, France
* Jan Vahrenhold, U. Münster, Germany
* Carola Wenk, Tulane U., USA
ORGANIZING COMMITTEE
--------------------
* Sabine Anthony, TU Braunschweig
* Sándor Fekete, TU Braunschweig
* Christiane Schmidt, TU Braunschweig
**********************************************************
*
* 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
