Latin American Theoretical INformatics (LATIN 2014)
March 31-April 4, 2014, Montevideo, Uruguay
==============================================================================
A series of Symposia in Theoretical Computer Science was launched in 1992, to
be held in Latin America: LATIN (Latin American Theoretical INformatics).
This
is the eleventh event of the series, after Sao Paulo, Brazil (1992),
Valparaiso, Chile (1995), Campinas, Brazil (1998), Punta del Este, Uruguay
(2000), Cancun, Mexico (2002), Buenos Aires, Argentina (2004), Valdivia,
Chile (2006), Buzios, Brazil (2008), Oaxaca, Mexico (2010), and Arequipa,
Peru (2012).
We seek papers presenting original research in theoretical computer science,
including, but not limited to: algorithms (approximation, online, randomized,
algorithmic game theory, etc.), analytic combinatorics and analysis of
algorithms, automata theory and formal languages, coding theory and data
compression, combinatorial algorithms, combinatorial optimization,
combinatorics and graph theory, complexity theory, computational algebra,
computational biology, computational geometry, computational number theory,
cryptology, databases and information retrieval, data structures, formal
methods and security, Internet and the web, parallel and distributed
computing, pattern matching, programming language theory, and random
structures.
Proceedings containing the accepted extended abstracts will be published
by Springer-Verlag, in the Lecture Notes in Computer Science (LNCS) series.
Printed versions will be available at the conference.
---- SUBMISSION ----
Authors are invited to submit an extended abstract in English no longer than 12
pages (including the bibliography) on letter-size paper using at least
11-point
font in Springer LNCS format. If more space is needed, a clearly marked
appendix, to be read at the discretion of the program committee, may be
included if desired. Simultaneous submission of papers to any other
conference with published proceedings, as well as the submission of
previously published papers, is not allowed. Instructions for electronic
submissions will be posted at the conference web site,
http://www.fing.edu.uy/eventos/latin2014.
The deadline for submissions is September 17, 2013 (firm deadline).
If needed, a short 1 page abstract of the paper can be submitted by
this deadline, and later the final extended abstract
can be submitted by September 22, 2013 (also firm deadline).
Neither short abstracts nor new extended abstracts submitted after
September 17 will be evaluated. Moreover, short abstracts not
replaced by their extended version before September 22, will neither be
evaluated.
---- CONFIRMED PLENARY SPEAKERS ----
Gilles Barthe, IMDEA Software Institute.
Ian Munro, University of Waterloo.
Gonzalo Navarro, Universidad de Chile.
Ronitt Rubinfeld, MIT.
Robert Sedgewick, Princeton University.
---- IMPORTANT DATES ----
Short abstract submission: Sep. 17, 2013
Final Submission: Sep. 22, 2013
Notification: Dec. 2, 2013
Final version: Dec. 20, 2013
---- IMRE SIMON TEST-OF-TIME AWARD ----
Starting in 2012, an award is given to the LATIN paper deemed to be most
influential among all those published at least ten years prior to the current
edition of the conference. Papers published in the LATIN proceedings up to
and including 2004 are eligible for the 2014 award.
---- CONTACT ----
Alfredo Viola
latin2014-chair@fing.edu.uy
--
Joan Boyar Email: joan@imada.sdu.dk
Dept. of Math. and Comp. Sci. URL: http://www.imada.sdu.dk/~joan/
University of Southern Denmark
Campusvej 55 phone: +45 6550 2338
DK-5230 Odense M, Denmark fax: +45 6593 2325
**********************************************************
*
* 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, September 7, 2013
[DMANET] Post-doc positions at Adam Mickiewicz University in Poznan
Post-doc fellowship competition in the frames of POKL 4.3
Faculty of Mathematics and Computer Science of Adam Mickiewicz
University in Poznań within the Human Capital Operational Programme
measure 4.3 Improving the performance of the educational system of
education institutions in the key areas of Europe 2020 Strategy targets
announces the post-doc fellowship competition in the academic year
2013/2014 for young doctors of Computer Science. The 10-month
scholarship will commence in October/November. The scholarship amount
will stem from the budget of project: Integrated development program
of Adam Mickiewicz University in Poznań: „Advanced technologies for the
development of highly qualified staff for the economy", i.e. 4000
PLN/month and accommodation costs defrayal to the amount of 1800
PLN/month.
Requirements:
1. PhD degree in Computer Science or in related sciences, obtained
within last 5 years, postdoctoral reasearch not started yet; age: not
more than 35 years.
2. Documented scientific achievements.
3. Knowledge of Polish or English language with ability of teaching
lectures.
4. Reasearch plan.
5. Up to 120 hours of teaching.
6. At least two letters of recommendation.
We ask every candidate to submit the following files:
1. Curriculum Vitae with publications list, scientific achievements
information and languages knowledge confirmation, as well as information
concerning teaching experience,
2. motivation letter,
3. at least two letters of recommendation,
4. reasearch plan.
The files should be sent until September 15, 2013 to the email address
of the coordinator: jesz@amu.edu.pl and the hard copy should be
delivered to the following address: Wydział Matematyki i Informatyki,
Uniwersytet im. Adama Mickiewicza w Poznaniu, ul. Umultowska 87, 61-614
Poznań.
The candidates may be invited for a direct interview or an interview
over Skype according to the place where they live.
Applications for shorter, 5-months scholarships, may be also
considered.
For additional information please contact the coordinator, email:
jesz@amu.edu.pl, tel. +48 519 340 481.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Friday, September 6, 2013
[DMANET] 2nd CFP: Special Issue on "Heuristics for Reliable and Efficient Wireless Sensor Networks Deployments" (J. of Heuristics, Springer, Q1)
[Apologies if you got multiple copies of this email]
SECOND CALL FOR PAPERS:
Special Issue on "HEURISTICS FOR RELIABLE AND EFFICIENT WIRELESS SENSOR
NETWORKS DEPLOYMENTS"
PDF: http://arco.unex.es/hrewsn
http://www.springer.com/mathematics/applications/journal/10732
Journal of Heuristics
Springer, ISSN: 1381-1231. Editor-in-Chief: Manuel Laguna.
Impact factor (2012): 1.471 (Q1, COMPUTER SCIENCE, THEORY & METHODS).
Aims and Scope:
==============
Wireless Sensor Networks are nowadays an extended engineering technology
for many markets due to the great amount of their possibilities in
collecting data from complex environments and processing them for
different purposes. Nevertheless, this interest is not enough to apply
this kind of networks as trustworthy solution for many real-world
environments, such as industrial processes and critical infrastructures,
where high reliability is required, together with other related key
aspects as energy, security and efficiency. Many companies could
overcome their reluctances if economic, reliable and easily deployed
solutions are provided in this field. In this scenario, the heuristics
and computational intelligence play an important role to solve many
involved optimization problems, doing necessary the research on advanced
solutions that result in a successful product. In this sense, there are
many challenges, trends and open possibilities in this area that deserve
to be known. In this special issue, we seek original, high quality
articles, clearly focused on theoretical or practical aspects of the
heuristics and mathematical optimization methods for obtaining reliable
and efficient wireless sensor networks, including but not limited to the
topics shown below.
Topics of Interest:
==================
The topics related to heuristics for reliable and efficient Wireless
Sensor Networks deployments that are relevant to this special issue
include but are not limited to:
* Energy minimization aspects: network lifetime and power savings.
* Efficient networks deployments.
* Heuristics and computational intelligence applied for solving
optimization problems.
* Multiobjective optimization problems.
* Fault tolerance and quality of service.
* Robust routing algorithms, network protocols and operating systems.
* Security and privacy aspects of the communications.
* Microprocessors, circuits, and embedded applications.
* Application cases, user studies and experiences.
Papers must be tailored to the problem of the wireless sensor networks
and explicitly consider heuristics and mathematical optimization
methods. The editors maintain the right to reject papers they deem to be
out of scope of this special issue. Only originally unpublished
contributions and invited articles will be considered for the issue.
Authors should submit their manuscripts through Editorial Manager
http://www.editorialmanager.com/heur/, selecting "SI - HREWSN" as the
article type.
Important Dates:
===============
Submission deadline: December 1st, 2013.
Acceptation notification: April 1st, 2014.
Final Papers: June 1st, 2014.
Guest Editors:
=============
Lead Editor:
Dr. Juan A. Gomez-Pulido
Dept. of Technologies of Computers and Communications, Univ. of
Extremadura, Spain
http://arco.unex.es/jangomez
E-mail: jangomez@unex.es
Editor#2:
Jose M. Lanza-Gutierrez
Dept. of Technologies of Computers and Communications, Univ. of
Extremadura, Spain
E-mail: jmlanza@unex.es
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
SECOND CALL FOR PAPERS:
Special Issue on "HEURISTICS FOR RELIABLE AND EFFICIENT WIRELESS SENSOR
NETWORKS DEPLOYMENTS"
PDF: http://arco.unex.es/hrewsn
http://www.springer.com/mathematics/applications/journal/10732
Journal of Heuristics
Springer, ISSN: 1381-1231. Editor-in-Chief: Manuel Laguna.
Impact factor (2012): 1.471 (Q1, COMPUTER SCIENCE, THEORY & METHODS).
Aims and Scope:
==============
Wireless Sensor Networks are nowadays an extended engineering technology
for many markets due to the great amount of their possibilities in
collecting data from complex environments and processing them for
different purposes. Nevertheless, this interest is not enough to apply
this kind of networks as trustworthy solution for many real-world
environments, such as industrial processes and critical infrastructures,
where high reliability is required, together with other related key
aspects as energy, security and efficiency. Many companies could
overcome their reluctances if economic, reliable and easily deployed
solutions are provided in this field. In this scenario, the heuristics
and computational intelligence play an important role to solve many
involved optimization problems, doing necessary the research on advanced
solutions that result in a successful product. In this sense, there are
many challenges, trends and open possibilities in this area that deserve
to be known. In this special issue, we seek original, high quality
articles, clearly focused on theoretical or practical aspects of the
heuristics and mathematical optimization methods for obtaining reliable
and efficient wireless sensor networks, including but not limited to the
topics shown below.
Topics of Interest:
==================
The topics related to heuristics for reliable and efficient Wireless
Sensor Networks deployments that are relevant to this special issue
include but are not limited to:
* Energy minimization aspects: network lifetime and power savings.
* Efficient networks deployments.
* Heuristics and computational intelligence applied for solving
optimization problems.
* Multiobjective optimization problems.
* Fault tolerance and quality of service.
* Robust routing algorithms, network protocols and operating systems.
* Security and privacy aspects of the communications.
* Microprocessors, circuits, and embedded applications.
* Application cases, user studies and experiences.
Papers must be tailored to the problem of the wireless sensor networks
and explicitly consider heuristics and mathematical optimization
methods. The editors maintain the right to reject papers they deem to be
out of scope of this special issue. Only originally unpublished
contributions and invited articles will be considered for the issue.
Authors should submit their manuscripts through Editorial Manager
http://www.editorialmanager.com/heur/, selecting "SI - HREWSN" as the
article type.
Important Dates:
===============
Submission deadline: December 1st, 2013.
Acceptation notification: April 1st, 2014.
Final Papers: June 1st, 2014.
Guest Editors:
=============
Lead Editor:
Dr. Juan A. Gomez-Pulido
Dept. of Technologies of Computers and Communications, Univ. of
Extremadura, Spain
http://arco.unex.es/jangomez
E-mail: jangomez@unex.es
Editor#2:
Jose M. Lanza-Gutierrez
Dept. of Technologies of Computers and Communications, Univ. of
Extremadura, Spain
E-mail: jmlanza@unex.es
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] FACULTY POSITION at UNIVERSITY of CHILE
===================================================
FACULTY POSITION at UNIVERSITY of CHILE
The Department of Mathematical Engineering, DIM
(http://www.dim.uchile.cl) of the Universidad de Chile is offering a
tenure-track position in Mathematics, starting on March 1, 2014 or
soon thereafter.
Candidates should have a Ph.D. degree in Mathematics or equivalent by
the date of appointment (but preferably not before January 2008); and
exhibit evidence of strong research potential and commitment to
excellence in teaching. Appointments are expected to be made at the
Assistant Professor level.
Applications in Discrete Mathematics and Theoretical Computer Science
are encouraged (although applications are not limited to these areas).
Duties include teaching in Spanish five courses every two years at
undergraduate and graduate levels, and carrying out a strong research
program.
Applications should be submitted electronically to
search.committee2013@dim.uchile.cl and consist of the following
documents (in PDF): Curriculum Vitae, in English or Spanish; Research
Description, in English (approximately, 3-5 pages), including a
selection of the three (3) most relevant publications; Outline of
Research Project (1-2 pages) and Teaching Statement (1 page).
Reception of applicants will be acknowledged by email.
Applicants should arrange three (3) letters of recommendations which
should be sent by e-mail to search.committee2013@dim.uchile.cl,
mentioning as subject: Recommendation Letter for (name of the
candidate).
The closing date for receipt of applications, including recommendation
letters, is October 31, 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/
*
**********************************************************
FACULTY POSITION at UNIVERSITY of CHILE
The Department of Mathematical Engineering, DIM
(http://www.dim.uchile.cl) of the Universidad de Chile is offering a
tenure-track position in Mathematics, starting on March 1, 2014 or
soon thereafter.
Candidates should have a Ph.D. degree in Mathematics or equivalent by
the date of appointment (but preferably not before January 2008); and
exhibit evidence of strong research potential and commitment to
excellence in teaching. Appointments are expected to be made at the
Assistant Professor level.
Applications in Discrete Mathematics and Theoretical Computer Science
are encouraged (although applications are not limited to these areas).
Duties include teaching in Spanish five courses every two years at
undergraduate and graduate levels, and carrying out a strong research
program.
Applications should be submitted electronically to
search.committee2013@dim.uchile.cl and consist of the following
documents (in PDF): Curriculum Vitae, in English or Spanish; Research
Description, in English (approximately, 3-5 pages), including a
selection of the three (3) most relevant publications; Outline of
Research Project (1-2 pages) and Teaching Statement (1 page).
Reception of applicants will be acknowledged by email.
Applicants should arrange three (3) letters of recommendations which
should be sent by e-mail to search.committee2013@dim.uchile.cl,
mentioning as subject: Recommendation Letter for (name of the
candidate).
The closing date for receipt of applications, including recommendation
letters, is October 31, 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/
*
**********************************************************
[DMANET] Postdoc Position in Algorithms, Munich
Postdoctoral Position in Algorithms
University of Technology, Munich
A postdoctoral position in the area of efficient algorithms is
available in the research group of Prof. Susanne Albers. Department
of Computer Science, Technische Universitaet Muenchen (University of
Technology, Munich).
The postdoc may pursue his/her own line of research but a research
interest in approximation and online algorithms, algorithmic game
theory or algorithm engineering is very welcome. Susanne Albers is
still affiliated with Humboldt University Berlin but will join the
University of Technology Munich (TUM), in fall 2013. Information about
her research and TUM can be found at:
http://www2.informatik.hu-berlin.de/~albers/
http://www2.informatik.hu-berlin.de/alkox/group/
http://www.in.tum.de/en.html
The position is supported by a grant of the German Research Foundation
and provides a competitive 12 month salary with standard benefits. The
appointment is initially for one year and can be renewed for a second
year subject to satisfactory progress and mutual agreement. The
expected start date of the position is winter 2013/14.
The successful candidate should have a PhD degree in computer science
or mathematics. Furthermore, he/she should be interested in
collaborating with PhD students and participating in the teaching
activities of the group. The application material should include (1) a
cover letter describing the interest in the position, (2) a CV and list
of publications, (3) a short research summary, and (4) the names and
contact information of at least two references. The material should be
sent electronically to <albers@in.tum.de>.
Applications will be reviewed starting from September 23, 2013 until
the position is filled.
Susanne Albers
Department of Computer Science
Technische Universitaet Muenchen
Boltzmannstr. 3
85748 Garching Germany
E-mail: albers@in.tum.de
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
University of Technology, Munich
A postdoctoral position in the area of efficient algorithms is
available in the research group of Prof. Susanne Albers. Department
of Computer Science, Technische Universitaet Muenchen (University of
Technology, Munich).
The postdoc may pursue his/her own line of research but a research
interest in approximation and online algorithms, algorithmic game
theory or algorithm engineering is very welcome. Susanne Albers is
still affiliated with Humboldt University Berlin but will join the
University of Technology Munich (TUM), in fall 2013. Information about
her research and TUM can be found at:
http://www2.informatik.hu-berlin.de/~albers/
http://www2.informatik.hu-berlin.de/alkox/group/
http://www.in.tum.de/en.html
The position is supported by a grant of the German Research Foundation
and provides a competitive 12 month salary with standard benefits. The
appointment is initially for one year and can be renewed for a second
year subject to satisfactory progress and mutual agreement. The
expected start date of the position is winter 2013/14.
The successful candidate should have a PhD degree in computer science
or mathematics. Furthermore, he/she should be interested in
collaborating with PhD students and participating in the teaching
activities of the group. The application material should include (1) a
cover letter describing the interest in the position, (2) a CV and list
of publications, (3) a short research summary, and (4) the names and
contact information of at least two references. The material should be
sent electronically to <albers@in.tum.de>.
Applications will be reviewed starting from September 23, 2013 until
the position is filled.
Susanne Albers
Department of Computer Science
Technische Universitaet Muenchen
Boltzmannstr. 3
85748 Garching Germany
E-mail: albers@in.tum.de
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Call for application PhD Distributed Learning and EE
Call for Application for a PhD in Electrical Engineering and Distributed
Learning
Directors: Dominique Barth (University of Versailles) and Marceau
Coupechoux (Telecom ParisTech)
Title: Distributed Learning Algorithms for Interference Coordination in
LTE-A Networks
Short summary: The objective of the thesis is to propose new distributed
approaches for interference coordination in cellular LTE-A networks
(beyond 4G) based on two aspects not taken into account so far by the
literature: (1) an orchestration of a port-folio of existing algorithms
based on the approach 'learning with an expert advice', (2) the
possibility to learn in a stochastic environment (using stochastic
approximation for the convergence analysis).
Location: Paris, France
Contact (for applying or more information):
marceau.coupechou@telecom-paristech.fr
--
Marceau Coupechoux
Telecom ParisTech (ENST)
Département Informatique et Réseaux
23 Avenue d'Italie
CS 51327
75214 Paris cedex 13
**********************************************************
*
* 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/
*
**********************************************************
Learning
Directors: Dominique Barth (University of Versailles) and Marceau
Coupechoux (Telecom ParisTech)
Title: Distributed Learning Algorithms for Interference Coordination in
LTE-A Networks
Short summary: The objective of the thesis is to propose new distributed
approaches for interference coordination in cellular LTE-A networks
(beyond 4G) based on two aspects not taken into account so far by the
literature: (1) an orchestration of a port-folio of existing algorithms
based on the approach 'learning with an expert advice', (2) the
possibility to learn in a stochastic environment (using stochastic
approximation for the convergence analysis).
Location: Paris, France
Contact (for applying or more information):
marceau.coupechou@telecom-paristech.fr
--
Marceau Coupechoux
Telecom ParisTech (ENST)
Département Informatique et Réseaux
23 Avenue d'Italie
CS 51327
75214 Paris cedex 13
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Thursday, September 5, 2013
[DMANET] CfP ALENEX14 Short reminder.
Call for Papers -- ALENEX14
The meeting on Algorithm Engineering and Experimentation (ALENEX14)
will be held on January 5, 2014 in Portland Oregon, USA. This meeting
is co-located with SODA14 and ANALCO14.
Paper submission deadline is September 30, 2013.
Author notification date is October 23, 2013.
For more information please visit http://www.siam.org/meetings/alenex14/
Catherine McGeoch
Ulrich Meyer
Program Co-Chairs
--
Prof. Dr. Ulrich Meyer
Algorithm Engineering Group
Institute of Computer Science
Goethe University Frankfurt am Main
Robert-Mayer-Straße 11-15
60325 Frankfurt am Main, Germany
Tel: +49-69-798-28433
Fax: +49-69-798-28357
Email: umeyer@cs.uni-frankfurt.de
Web: http://www.uli-meyer.de
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
The meeting on Algorithm Engineering and Experimentation (ALENEX14)
will be held on January 5, 2014 in Portland Oregon, USA. This meeting
is co-located with SODA14 and ANALCO14.
Paper submission deadline is September 30, 2013.
Author notification date is October 23, 2013.
For more information please visit http://www.siam.org/meetings/alenex14/
Catherine McGeoch
Ulrich Meyer
Program Co-Chairs
--
Prof. Dr. Ulrich Meyer
Algorithm Engineering Group
Institute of Computer Science
Goethe University Frankfurt am Main
Robert-Mayer-Straße 11-15
60325 Frankfurt am Main, Germany
Tel: +49-69-798-28433
Fax: +49-69-798-28357
Email: umeyer@cs.uni-frankfurt.de
Web: http://www.uli-meyer.de
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] IPDPS 2014 - Call for Paper: Mark your calendar! Abstract due on October 11, 2013. Full paper due on October 18, 2013
IPDPS 2014 September 4, 2013 Release
----------------------------------------------
28th IEEE International Parallel & Distributed Processing Symposium
May 19-23, 2014
Arizona Grand Resort
PHOENIX (Arizona) USA
www.ipdps.org
----------------------------------------------
...Follow us on Facebook at https://www.facebook.com/IPDPS
...Follow us on Twitter at https://twitter.com/IPDPS
...See Report on IPDPS 2013 (Boston) at
http://www.ipdps.org/ipdps2013/index.html
----------------------------------------------
IPDPS 2014 ALERTS
...Full 2014 Program Committee membership listed at
http://www.ipdps.org/ipdps2014/2014_call_for_papers.html
...Submission portal now open at
http://www.ipdps.org/ipdps2014/2014_call_for_papers.html
...Submission deadline is October 18, 2013; authors need to register
by October 11, 2013.
...Due dates for most workshop submissions after December 09, 2013.
----------------------------------------------
IPDPS 2014 CALL FOR PAPERS
----------------------------------------------
----------------------------------------------
SCOPE: Authors are invited to submit manuscripts that present original
unpublished research in all areas of parallel and distributed
processing, including the development of experimental or commercial
systems. Work focusing on emerging technologies is especially welcome.
Topics of interest include, but are not limited to:
- Parallel and distributed algorithms, focusing on topics such as:
numerical, combinatorial, and data-intensive parallel algorithms,
scalability of algorithms and data structures for parallel and
distributed systems, communication and synchronization protocols,
network algorithms, scheduling, and load balancing.
- Applications of parallel and distributed computing, including
computational and data-enabled science and engineering, big data
applications, parallel crowd sourcing, large-scale social network
analysis, management of big data, cloud and grid computing, scientific
and biomedical applications, and mobile computing. Papers focusing on
applications using novel commercial or research architectures, big
data approaches, or discussing scalability toward the exascale level
are encouraged.
- Parallel and distributed architectures, including architectures for
instruction-level and thread-level parallelism; petascale and exascale
systems designs; novel big data architectures; special-purpose
architectures, including graphics processors, signal processors,
network processors, media accelerators, and other special purpose
processors and accelerators; impact of technology on architecture;
network and interconnect architectures; parallel I/O and storage
systems; architecture of the memory hierarchy; power-efficient and
green computing architectures; dependable architectures; and
performance modeling and evaluation.
- Parallel and distributed software, including parallel and multicore
programming languages and compilers, runtime systems, operating
systems, resource management including green computing, middleware for
grids, clouds, and data centers, libraries, performance modeling and
evaluation, parallel programming paradigms, and programming
environments and tools. Papers focusing on novel software systems for
big data and exascale systems are encouraged.
WHAT/WHERE TO SUBMIT
More details on submissions and instructions for submitting
manuscripts are available at www.ipdps.org. All submitted manuscripts
will be reviewed. Submitted papers should NOT have appeared in or be
under consideration for another conference, workshop or journal.
IMPORTANT DATES
- October 11, 2013......Abstracts due
- October 18, 2013......Submission deadline
- December 09, 2013...Author notification
- February 01, 2014.....Camera ready due
----------------------------------------------
IPDPS 2014 CALL FOR PARTICIPATION
---------------------------------------------------------
---------------------------------------------------------
The 28th IEEE International Parallel & Distributed Processing
Symposium will be held 19-23 May 2014 in Phoenix at the Arizona Grand
Resort, an all-suites family-friendly resort and meeting place.
Phoenix has an international airport and is the hub for several US
airlines. It is only a six hour drive from Los Angeles and Las Vegas
and the starting point for one day tours of the Grand Canyon as well
as other historic communities in the area. For those who come early or
stay late, there are boundless Southwest tourist attractions and
activities. For shorter trip times, AGR has a water-world, golf
course, and hiking and riding trails on the premises and an indoor
athletic club and spa for fitness training. Check the IPDPS Web pages
for updates and information on workshops, the PhD Forum, and other
events as the full program develops and see the full call for papers
for details on submitting papers for 2014.
GENERAL CHAIR
Manish PARASHAR (Rutgers University, USA)
PROGRAM CHAIR
David A. BADER (Georgia Institute of Technology, USA)
PROGRAM VICE-CHAIRS
- Algorithms
Anne BENOIT (ENS Lyon, France)
- Applications
Padma RAGHAVAN (Pennsylvania State University, USA)
- Architecture
Yan SOLIHIN (North Carolina State University, USA)
- Software
Ron BRIGHTWELL (Sandia National Laboratories, USA)
WORKSHOPS CHAIR
Ümit V. Çatalyürek (Ohio State University, USA)
WORKSHOPS VICE-CHAIR
Yogesh SIMMHAN (University of Southern California, USA)
----------------------------------------------
IPDPS 2014 WORKSHOPS
IPDPS workshops, held on the first and last days of the symposium,
provide attendees an opportunity to explore special topics. The
workshops planned for IPDPS 2014 in Phoenix will be announced shortly
athttp://www.ipdps.org/ipdps2014/2014_workshops.html. That page will
have a link to the call for papers for each workshop. Note that most
workshops have a due date for submissions later than the author
notification date ofDecember 9th for regular conference papers.
PhD FORUM CO-CHAIRS
Luc BOUG… (ENS Cachan, France)
Bo HONG (Georgia Institute of Technology, USA)
----------------------------------------------
ENHANCED STUDENT AUTHOR PROGRAM 2014
All student authors at IPDPS 2014 will have opportunity to present a
poster and participate in the TCPP-sponsored mentoring program.
Deadlines for PhD Forum poster proposals and mentoring program
enrollment will be afterJanuary 1, 2014.
28th IEEE International Parallel & Distributed Processing Symposium
----------------------------------------------------------------------------------------------
----------------------------------------------------------------------------------------------
Sponsored by IEEE Computer Society Technical Committee on Parallel Processing
In cooperation with ACM SIGARCH, IEEE Computer Society Technical
Committee on Computer Architecture, and IEEE Computer Society
Technical Committee on Distributed Processing
----------------------------------------------
**********************************************************
*
* 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/
*
**********************************************************
----------------------------------------------
28th IEEE International Parallel & Distributed Processing Symposium
May 19-23, 2014
Arizona Grand Resort
PHOENIX (Arizona) USA
www.ipdps.org
----------------------------------------------
...Follow us on Facebook at https://www.facebook.com/IPDPS
...Follow us on Twitter at https://twitter.com/IPDPS
...See Report on IPDPS 2013 (Boston) at
http://www.ipdps.org/ipdps2013/index.html
----------------------------------------------
IPDPS 2014 ALERTS
...Full 2014 Program Committee membership listed at
http://www.ipdps.org/ipdps2014/2014_call_for_papers.html
...Submission portal now open at
http://www.ipdps.org/ipdps2014/2014_call_for_papers.html
...Submission deadline is October 18, 2013; authors need to register
by October 11, 2013.
...Due dates for most workshop submissions after December 09, 2013.
----------------------------------------------
IPDPS 2014 CALL FOR PAPERS
----------------------------------------------
----------------------------------------------
SCOPE: Authors are invited to submit manuscripts that present original
unpublished research in all areas of parallel and distributed
processing, including the development of experimental or commercial
systems. Work focusing on emerging technologies is especially welcome.
Topics of interest include, but are not limited to:
- Parallel and distributed algorithms, focusing on topics such as:
numerical, combinatorial, and data-intensive parallel algorithms,
scalability of algorithms and data structures for parallel and
distributed systems, communication and synchronization protocols,
network algorithms, scheduling, and load balancing.
- Applications of parallel and distributed computing, including
computational and data-enabled science and engineering, big data
applications, parallel crowd sourcing, large-scale social network
analysis, management of big data, cloud and grid computing, scientific
and biomedical applications, and mobile computing. Papers focusing on
applications using novel commercial or research architectures, big
data approaches, or discussing scalability toward the exascale level
are encouraged.
- Parallel and distributed architectures, including architectures for
instruction-level and thread-level parallelism; petascale and exascale
systems designs; novel big data architectures; special-purpose
architectures, including graphics processors, signal processors,
network processors, media accelerators, and other special purpose
processors and accelerators; impact of technology on architecture;
network and interconnect architectures; parallel I/O and storage
systems; architecture of the memory hierarchy; power-efficient and
green computing architectures; dependable architectures; and
performance modeling and evaluation.
- Parallel and distributed software, including parallel and multicore
programming languages and compilers, runtime systems, operating
systems, resource management including green computing, middleware for
grids, clouds, and data centers, libraries, performance modeling and
evaluation, parallel programming paradigms, and programming
environments and tools. Papers focusing on novel software systems for
big data and exascale systems are encouraged.
WHAT/WHERE TO SUBMIT
More details on submissions and instructions for submitting
manuscripts are available at www.ipdps.org. All submitted manuscripts
will be reviewed. Submitted papers should NOT have appeared in or be
under consideration for another conference, workshop or journal.
IMPORTANT DATES
- October 11, 2013......Abstracts due
- October 18, 2013......Submission deadline
- December 09, 2013...Author notification
- February 01, 2014.....Camera ready due
----------------------------------------------
IPDPS 2014 CALL FOR PARTICIPATION
---------------------------------------------------------
---------------------------------------------------------
The 28th IEEE International Parallel & Distributed Processing
Symposium will be held 19-23 May 2014 in Phoenix at the Arizona Grand
Resort, an all-suites family-friendly resort and meeting place.
Phoenix has an international airport and is the hub for several US
airlines. It is only a six hour drive from Los Angeles and Las Vegas
and the starting point for one day tours of the Grand Canyon as well
as other historic communities in the area. For those who come early or
stay late, there are boundless Southwest tourist attractions and
activities. For shorter trip times, AGR has a water-world, golf
course, and hiking and riding trails on the premises and an indoor
athletic club and spa for fitness training. Check the IPDPS Web pages
for updates and information on workshops, the PhD Forum, and other
events as the full program develops and see the full call for papers
for details on submitting papers for 2014.
GENERAL CHAIR
Manish PARASHAR (Rutgers University, USA)
PROGRAM CHAIR
David A. BADER (Georgia Institute of Technology, USA)
PROGRAM VICE-CHAIRS
- Algorithms
Anne BENOIT (ENS Lyon, France)
- Applications
Padma RAGHAVAN (Pennsylvania State University, USA)
- Architecture
Yan SOLIHIN (North Carolina State University, USA)
- Software
Ron BRIGHTWELL (Sandia National Laboratories, USA)
WORKSHOPS CHAIR
Ümit V. Çatalyürek (Ohio State University, USA)
WORKSHOPS VICE-CHAIR
Yogesh SIMMHAN (University of Southern California, USA)
----------------------------------------------
IPDPS 2014 WORKSHOPS
IPDPS workshops, held on the first and last days of the symposium,
provide attendees an opportunity to explore special topics. The
workshops planned for IPDPS 2014 in Phoenix will be announced shortly
athttp://www.ipdps.org/ipdps2014/2014_workshops.html. That page will
have a link to the call for papers for each workshop. Note that most
workshops have a due date for submissions later than the author
notification date ofDecember 9th for regular conference papers.
PhD FORUM CO-CHAIRS
Luc BOUG… (ENS Cachan, France)
Bo HONG (Georgia Institute of Technology, USA)
----------------------------------------------
ENHANCED STUDENT AUTHOR PROGRAM 2014
All student authors at IPDPS 2014 will have opportunity to present a
poster and participate in the TCPP-sponsored mentoring program.
Deadlines for PhD Forum poster proposals and mentoring program
enrollment will be afterJanuary 1, 2014.
28th IEEE International Parallel & Distributed Processing Symposium
----------------------------------------------------------------------------------------------
----------------------------------------------------------------------------------------------
Sponsored by IEEE Computer Society Technical Committee on Parallel Processing
In cooperation with ACM SIGARCH, IEEE Computer Society Technical
Committee on Computer Architecture, and IEEE Computer Society
Technical Committee on Distributed Processing
----------------------------------------------
**********************************************************
*
* 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, September 4, 2013
[DMANET] open position (PhD candidate or Post-Doc) in the field of network optimization
For a project on communication network optimization in Chemnitz, Germany, we
have one open (PhD candidate or Post-Doc) full-time position. Employment
will be at the Chair for Communication Networks at TU Chemnitz. The position
will become available for a period of one year starting from 1st October
2013 at the earliest. Further continuation is possible.
Research Field:
The research project VINO (VIrtual Network Optimization) addresses two
problem statements related to communication network planning and
optimization:
- Optimum configuration and dynamic adaptation of Flexgrid optical transport
networks (Flexgrid Optical Network Design (FOND) problem)
- Embedding and dynamic adaptation of virtual networks within a physical
network infrastructure (Virtual Network Embedding (VNE) problem)
Responsibilities:
The following research tasks should be performed by the candidate in the
project:
- Design and evaluation of online algorithms to handle incoming resource
requests (i.e. optical connections in case of FOND and virtual network
requests in case of VNE) in real time (online optimization problem)
- Re-optimization of the network configuration while the network is in
service
Requirements:
- MSc or equivalent degree in Mathematics or Information Technology /
Computer Science
- Background in at least one of the following areas:
- discrete optimization (especially mixed-integer linear programming)
- online optimization
- communication network architectures and protocols
- Experience with solvers for linear optimization problems (e.g. CPLEX)
- Programming skills (e.g. C/C++)
- Good English language skills
Applicants should submit their documents (including a letter of interest,
CV, copies of academic certificates and previous scientific work such as
master or diploma thesis) preferentially via Email to:
Technische Universität Chemnitz
Chair for Communication Networks
Prof. Dr.-Ing. Thomas Bauschert
D-09107 Chemnitz, Germany
E-Mail: thomas.bauschert@etit.tu-chemnitz.de
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
have one open (PhD candidate or Post-Doc) full-time position. Employment
will be at the Chair for Communication Networks at TU Chemnitz. The position
will become available for a period of one year starting from 1st October
2013 at the earliest. Further continuation is possible.
Research Field:
The research project VINO (VIrtual Network Optimization) addresses two
problem statements related to communication network planning and
optimization:
- Optimum configuration and dynamic adaptation of Flexgrid optical transport
networks (Flexgrid Optical Network Design (FOND) problem)
- Embedding and dynamic adaptation of virtual networks within a physical
network infrastructure (Virtual Network Embedding (VNE) problem)
Responsibilities:
The following research tasks should be performed by the candidate in the
project:
- Design and evaluation of online algorithms to handle incoming resource
requests (i.e. optical connections in case of FOND and virtual network
requests in case of VNE) in real time (online optimization problem)
- Re-optimization of the network configuration while the network is in
service
Requirements:
- MSc or equivalent degree in Mathematics or Information Technology /
Computer Science
- Background in at least one of the following areas:
- discrete optimization (especially mixed-integer linear programming)
- online optimization
- communication network architectures and protocols
- Experience with solvers for linear optimization problems (e.g. CPLEX)
- Programming skills (e.g. C/C++)
- Good English language skills
Applicants should submit their documents (including a letter of interest,
CV, copies of academic certificates and previous scientific work such as
master or diploma thesis) preferentially via Email to:
Technische Universität Chemnitz
Chair for Communication Networks
Prof. Dr.-Ing. Thomas Bauschert
D-09107 Chemnitz, Germany
E-Mail: thomas.bauschert@etit.tu-chemnitz.de
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Final Call for Papers : Autonomic Clouds 2013, Dresden, Germany- Deadline September 10, 2013
The 3rd International Workshop on Intelligent Techniques and Architectures for Autonomic Clouds (ITAAC 2013)
http://www.derby.ac.uk/computing/itaac2013
In association with
The 6th IEEE/ACM International Conference on Utility and Cloud Computing (UCC 2013), December 9-12, 2013, Dresden, Germany
Call for Papers
Autonomic computing refers to principles and techniques for designing, building, deploying and managing computing systems with minimal human involvement. An autonomic system should be capable of adapting its behaviour to suit its context of use through methods of self-management, self-tuning, self-configuration, self-diagnosis, and self-healing.
Autonomic approaches are particularly suitable for use in Cloud Computing systems, where rapid scalability is required across a pool of resources to support various unpredictable demands, and where the system should automatically adapt to avoid failures in the underlying hardware impacting on the user experience. Autonomic Clouds emerge as a result of applying autonomic computing techniques to Cloud Computing, resulting into robust, fault tolerant and easy to manage and operate cloud architectures and deployments.
The application of intelligent approaches to Autonomic Clouds is gaining prominence in research and industry. Such intelligent approaches include evolutionary techniques, multi-objective and combinational optimization heuristics, genetic algorithms, neural networks, swarm intelligence, and multi-agents systems. Application of these intelligent approaches to Clouds can improve how computing systems and applications are built, used, managed and optimized, maximizing the benefits for users, applications and systems by reducing the operational, maintenance and usage costs of clouds. The interplay of intelligent approaches and Clouds offers numerous challenges.
The international workshop on Intelligent Techniques and Architectures for Autonomic Clouds (ITAAC 2013) aims to bring together researchers and practitioners across Cloud Computing, Intelligent Systems, and Autonomic Computing to discuss issues at the intersection of these disciplines. Key questions to be addressed include: How do emerging cloud architectures satisfy or contradict the vision of autonomic computing? How does the vision of autonomic computing satisfy the vision of self managing and self healing clouds? How do contemporary and emerging intelligent techniques support and enable both of these? Academics, researchers and practitioners are invited to submit original work on the theory and practice of intelligent and autonomic clouds.
Key topics
Topics of interest include (but are not limited to):
* Theory and foundations of Intelligent Clouds
* Quality of Service and Intelligent Clouds
* (auto)scaling of Clouds
* Self-organizing, self-healing and self-managing Cloud systems
* Intelligent deployment, configuration and maintenance approaches for Clouds
* Agent based techniques for Clouds
* Adaptive and Evolutionary Approaches for Clouds
* Intelligent Cloud Workflows, Planning and Scheduling
* Intelligent Cloud Resource Management and Discovery in Clouds
* Autonomic Clouds of Sensors
* Intelligent Management and Monitoring for Clouds
* Intelligent approaches to Cloud Service Level Agreement satisfaction
* Applications, Toolkits and frameworks for Intelligent and Autonomic Clouds
* Advances in Intelligent Data Analysis due to Clouds
Submissions that offer position statements, theoretical and industrial perspectives, lessons learned, comparisons, evaluations and technical contributions to intelligent autonomic clouds are also welcome.
Paper submission guidelines
All papers must be submitted electronically and in PDF format. The material presented should be original and not published or under submission elsewhere. Authors should submit full papers of up to 6 pages, following strictly the IEEE Computer Society Proceedings Manuscript style<http://www.computer.org/portal/web/cscps/formatting>, using two-column, single-space format, with 10-point font size. Figures and references must be included in the 6 pages. At least one of the authors of each accepted paper must register early to attend the conference, in order for the paper to appear in the conference proceedings.
Submitted papers must represent original unpublished research that is not currently under review for any other conference or journal. The proceedings will be published and will be made online through the IEEE Xplore.
All papers should be submitted online using EasyChair submission system https://www.easychair.org/account/signin.cgi?conf=itaac2013
High quality articles will be invited to become part of the Journal of Cloud Computing Advances, Systems and Applications (JoCCASA)
Workshop Chairs
* Professor Nick Antonopoulos, University of Derby, UK
Email: n.antonopoulos@derby.ac.uk<mailto:n.antonopoulos@derby.ac.uk>
* Dr Ashiq Anjum , University of Derby, UK
Email: a.anjum@derby.ac.uk<mailto:a.anjum@derby.ac.uk>
* Dr Lee Gillam, University of Surrey, UK
Email: l.gillam@surrey.ac.uk<mailto:l.gillam@surrey.ac.uk>.
Programme Committee
* Antonio Liotta, Eindhoven University of Technology, Netherlands
* Manish Parashar, Rutgers, The State University of New Jersey, USA
* Richard McClatchey, UWE Bristol, UK
* Morris Riedel, Jülich Supercomputing Centre (JSC), Forschungszentrum Jülich, Germany
* Omer Rana, Cardiff University, UK
* Rajkumar Buyya, University of Melbourne, Australia
* David Wallom, Oxford e-Research Centre, University of Oxford, UK
* Jianxin Li, Beihang University, China
* Kurt Stockinger, Zurich University of Applied Sciences, Switzerland
* Adel Taweel, Kings College London, UK
* Fatos Xhafa, Universitat Politècnica de Catalunya, Barcelona, Spain
* Daniel S. Katz, Computation Institute, University of Chicago, USA
* Ciprian Dobre, University Politehnica of Bucharest, Romania
* Richard Hill, University of Derby, UK
* Muhammad Atif, The Australian National University, Canberra, Australia
* Lu Liu, University of Derby, UK
* Peter Bloodsworth, National University of Sciences and Technology (NUST), Pakistan
* Saad Liaquat Kiani, University of the West of England, Bristol, UK
* Silvio Pardi, University of Naples, Naples, Italy
* Zaheer Khan, University of the West of England, Bristol, UK
* Liangmin Wang, Jiangsu University, China
* Taimoor Khan, Johannes Kepler University, Austria
Important Dates
* Manuscript Submission Due: 10 September 2013
* Notification of Acceptance: 20 September 2013
* Final Manuscript Due: 27 September 2013
* Author Registration Due: 27 September 2013
* Conference Dates: 9 - 12 December 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/
*
**********************************************************
http://www.derby.ac.uk/computing/itaac2013
In association with
The 6th IEEE/ACM International Conference on Utility and Cloud Computing (UCC 2013), December 9-12, 2013, Dresden, Germany
Call for Papers
Autonomic computing refers to principles and techniques for designing, building, deploying and managing computing systems with minimal human involvement. An autonomic system should be capable of adapting its behaviour to suit its context of use through methods of self-management, self-tuning, self-configuration, self-diagnosis, and self-healing.
Autonomic approaches are particularly suitable for use in Cloud Computing systems, where rapid scalability is required across a pool of resources to support various unpredictable demands, and where the system should automatically adapt to avoid failures in the underlying hardware impacting on the user experience. Autonomic Clouds emerge as a result of applying autonomic computing techniques to Cloud Computing, resulting into robust, fault tolerant and easy to manage and operate cloud architectures and deployments.
The application of intelligent approaches to Autonomic Clouds is gaining prominence in research and industry. Such intelligent approaches include evolutionary techniques, multi-objective and combinational optimization heuristics, genetic algorithms, neural networks, swarm intelligence, and multi-agents systems. Application of these intelligent approaches to Clouds can improve how computing systems and applications are built, used, managed and optimized, maximizing the benefits for users, applications and systems by reducing the operational, maintenance and usage costs of clouds. The interplay of intelligent approaches and Clouds offers numerous challenges.
The international workshop on Intelligent Techniques and Architectures for Autonomic Clouds (ITAAC 2013) aims to bring together researchers and practitioners across Cloud Computing, Intelligent Systems, and Autonomic Computing to discuss issues at the intersection of these disciplines. Key questions to be addressed include: How do emerging cloud architectures satisfy or contradict the vision of autonomic computing? How does the vision of autonomic computing satisfy the vision of self managing and self healing clouds? How do contemporary and emerging intelligent techniques support and enable both of these? Academics, researchers and practitioners are invited to submit original work on the theory and practice of intelligent and autonomic clouds.
Key topics
Topics of interest include (but are not limited to):
* Theory and foundations of Intelligent Clouds
* Quality of Service and Intelligent Clouds
* (auto)scaling of Clouds
* Self-organizing, self-healing and self-managing Cloud systems
* Intelligent deployment, configuration and maintenance approaches for Clouds
* Agent based techniques for Clouds
* Adaptive and Evolutionary Approaches for Clouds
* Intelligent Cloud Workflows, Planning and Scheduling
* Intelligent Cloud Resource Management and Discovery in Clouds
* Autonomic Clouds of Sensors
* Intelligent Management and Monitoring for Clouds
* Intelligent approaches to Cloud Service Level Agreement satisfaction
* Applications, Toolkits and frameworks for Intelligent and Autonomic Clouds
* Advances in Intelligent Data Analysis due to Clouds
Submissions that offer position statements, theoretical and industrial perspectives, lessons learned, comparisons, evaluations and technical contributions to intelligent autonomic clouds are also welcome.
Paper submission guidelines
All papers must be submitted electronically and in PDF format. The material presented should be original and not published or under submission elsewhere. Authors should submit full papers of up to 6 pages, following strictly the IEEE Computer Society Proceedings Manuscript style<http://www.computer.org/portal/web/cscps/formatting>, using two-column, single-space format, with 10-point font size. Figures and references must be included in the 6 pages. At least one of the authors of each accepted paper must register early to attend the conference, in order for the paper to appear in the conference proceedings.
Submitted papers must represent original unpublished research that is not currently under review for any other conference or journal. The proceedings will be published and will be made online through the IEEE Xplore.
All papers should be submitted online using EasyChair submission system https://www.easychair.org/account/signin.cgi?conf=itaac2013
High quality articles will be invited to become part of the Journal of Cloud Computing Advances, Systems and Applications (JoCCASA)
Workshop Chairs
* Professor Nick Antonopoulos, University of Derby, UK
Email: n.antonopoulos@derby.ac.uk<mailto:n.antonopoulos@derby.ac.uk>
* Dr Ashiq Anjum , University of Derby, UK
Email: a.anjum@derby.ac.uk<mailto:a.anjum@derby.ac.uk>
* Dr Lee Gillam, University of Surrey, UK
Email: l.gillam@surrey.ac.uk<mailto:l.gillam@surrey.ac.uk>.
Programme Committee
* Antonio Liotta, Eindhoven University of Technology, Netherlands
* Manish Parashar, Rutgers, The State University of New Jersey, USA
* Richard McClatchey, UWE Bristol, UK
* Morris Riedel, Jülich Supercomputing Centre (JSC), Forschungszentrum Jülich, Germany
* Omer Rana, Cardiff University, UK
* Rajkumar Buyya, University of Melbourne, Australia
* David Wallom, Oxford e-Research Centre, University of Oxford, UK
* Jianxin Li, Beihang University, China
* Kurt Stockinger, Zurich University of Applied Sciences, Switzerland
* Adel Taweel, Kings College London, UK
* Fatos Xhafa, Universitat Politècnica de Catalunya, Barcelona, Spain
* Daniel S. Katz, Computation Institute, University of Chicago, USA
* Ciprian Dobre, University Politehnica of Bucharest, Romania
* Richard Hill, University of Derby, UK
* Muhammad Atif, The Australian National University, Canberra, Australia
* Lu Liu, University of Derby, UK
* Peter Bloodsworth, National University of Sciences and Technology (NUST), Pakistan
* Saad Liaquat Kiani, University of the West of England, Bristol, UK
* Silvio Pardi, University of Naples, Naples, Italy
* Zaheer Khan, University of the West of England, Bristol, UK
* Liangmin Wang, Jiangsu University, China
* Taimoor Khan, Johannes Kepler University, Austria
Important Dates
* Manuscript Submission Due: 10 September 2013
* Notification of Acceptance: 20 September 2013
* Final Manuscript Due: 27 September 2013
* Author Registration Due: 27 September 2013
* Conference Dates: 9 - 12 December 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/
*
**********************************************************
[DMANET] COIN-OR Cup call for submissions: due Mon 16 Sep 2013
Apologies for cross-posting.
We are now seeking submissions for the ninth annual
COIN-OR INFORMS Cup
competition.
Rules:
- A submission or nomination must contain:
1. A synopsis of an effective use of COIN-OR or valuable
contribution to COIN-OR (or both!).
2. An explanation of its significance.
- The winner must accept the prize in person at the 2013 INFORMS
meeting - so we can all celebrate appropriately (see "Celebration"
below).
- Submission deadline: Monday, September 16, 2013
- Please email submissions to: coin-cup@coin-or.org
- Self-nomination is welcomed.
- We especially encourage nominations of effective use of COIN-OR that
the community may not know about.
Submissions will be judged by a committee including members of the
COIN-OR Foundation, Inc.
Celebration: The 2013 COIN-OR INFORMS Cup will be awarded during the
INFORMS Annual meeting in Minneapolis, MN. All entrants and their
supporters are welcome to join in the celebration and regale, rile, and
roast the prize winners.
- Celebration sponsorship: to be announced, see
http://www.coin-or.org/coinCup/coinCup13.html.
- Date, time and location: to be announced, see
http://www.coin-or.org/coinCup/coinCup13.html.
Details of the winning entry will be announced at this celebration
event, and posted on the COIN-OR Cup website
http://www.coin-or.org/coinCup/coinCup.html.
Please e-mail your submissions to coin-cup@coin-or.org
Previous Winners: http://www.coin-or.org/coinCup/coinCup.html
Enter, come, possibly win, and raise your cup with us!
**********************************************************
*
* 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 are now seeking submissions for the ninth annual
COIN-OR INFORMS Cup
competition.
Rules:
- A submission or nomination must contain:
1. A synopsis of an effective use of COIN-OR or valuable
contribution to COIN-OR (or both!).
2. An explanation of its significance.
- The winner must accept the prize in person at the 2013 INFORMS
meeting - so we can all celebrate appropriately (see "Celebration"
below).
- Submission deadline: Monday, September 16, 2013
- Please email submissions to: coin-cup@coin-or.org
- Self-nomination is welcomed.
- We especially encourage nominations of effective use of COIN-OR that
the community may not know about.
Submissions will be judged by a committee including members of the
COIN-OR Foundation, Inc.
Celebration: The 2013 COIN-OR INFORMS Cup will be awarded during the
INFORMS Annual meeting in Minneapolis, MN. All entrants and their
supporters are welcome to join in the celebration and regale, rile, and
roast the prize winners.
- Celebration sponsorship: to be announced, see
http://www.coin-or.org/coinCup/coinCup13.html.
- Date, time and location: to be announced, see
http://www.coin-or.org/coinCup/coinCup13.html.
Details of the winning entry will be announced at this celebration
event, and posted on the COIN-OR Cup website
http://www.coin-or.org/coinCup/coinCup.html.
Please e-mail your submissions to coin-cup@coin-or.org
Previous Winners: http://www.coin-or.org/coinCup/coinCup.html
Enter, come, possibly win, and raise your cup with us!
**********************************************************
*
* 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] COST Workshop on MINLP 2013 (CWMINLP13) / Posters and participation
COST Workshop on MINLP 2013 (CWMINLP13)
--------------------------------------------------------
CALL FOR POSTERS AND PARTICIPATION
Sept. 30 to Oct. 2, 2013
Institut Henri Poincare, Paris, France
Mixed-Integer Nonlinear Programming (MINLP) is concerned with finding
optimal solutions of optimization problems involving continuous and
integer variables, as well as nonlinear terms in the objective function
and constraints.
The EU COST Action TD1207 "Mathematical Optimization in the Decision
Support Systems for Efficient and Robust Energy Networks" sponsors the
event, so the broad topic of energy networks is one that we plan to
emphasize at the workshop.
Call for posters: if you want to present a poster, please send:
author names, title and a short abstract (max 1 page) to
cwminlp@gmail.com, BEFORE SEPT. 18.
To register, just send your name and affiliation to cwminlp@gmail.com
There is no registration fee. REGISTRATION DEADLINE: SEPT. 20.
Confirmed speakers so far:
Amir AHMADI (IBM Research, USA)
Aysegul ALTIN (TOBB University, Turkey)
Immanuel BOMZE (Universitaet Wien, Austria)
Christoph BUCHHEIM (TU Dortmund, Germany)
Sonia CAFIERI (Ecole Nationale de l'Aviation Civile, France)
Emilio CARRIZOSA (Universidad de Sevilla, Spain)
Sandrine CHAROUSSET (Electricite` de France)
Antonio FRANGIONI (Universita` di Pisa, Italy)
Joao GOUVEIA (Universidade de Coimbra, Portugal)
Christoph HELMBERG (TU Chemnitz, Germany)
Eligius HENDRIX (Wageningen University, The Netherlands)
Christian KIRCHES (Universitaet Heidelberg, Germany)
James LUEDTKE (University of Winsconsin-Madison, USA)
Martin MEVISSEN (IBM Research, Ireland)
Ruth MISENER (Imperial College London, UK)
Shmuel ONN (Israel Institute of Technology)
Frederic ROUPIN (Universite de Paris 13, France)
Nikolaos SAHINIDIS (Carnegie-Mellon University, USA)
Stefan VIGERSKE (GAMS)
Julius ZILINSKAS (Vilnius University, Lithuania)
Program/organizing Committee:
Andrea Cassioli (Ecole Polytechnique, France)
Claudia D'Ambrosio (CNRS & Ecole Polytechnique, France) -- Co-chair
Gustavo Dias (Ecole Polytechnique, France)
Thorsten Koch (Zuze-Institut Berlin, Germany)
Jon Lee (University of Michigan, USA)
Leo Liberti (Ecole Polytechnique, France & IBM Research, USA) -- Co-chair
Andrea Lodi (Universita` di Bologna, Italy)
Evelyne Rayssac (Ecole Polytechnique, France)
Sebastian Sager (Universitaet Magdeburg, Germany)
Angelika Wiegele (Alpen-Adria-Universitaet, Austria)
For more information: https://sites.google.com/site/cwminlp13/
Email: cwminlp@gmail.com
Supported by:
- EU COST action TD1207 (Mathematical Optimization in the Decision Support
Systems for Efficient and Robust Energy Networks)
http://www.cost.eu/domains_ actions/ict/Actions/TD1207
- Institut Henri Poincare (ihp.fr)
The CWMINLP13 will be followed by a related workshop (Optimization and
energy) organized by the "Programme Gaspard Monge pour l'Optimization"
(PGMO) on 3-4 Oct. 2013 at the Ecole Nationale Superieure de
Techniques Avancees (ENSTA), on the campus of Ecole Polytechnique
(http://www.fondation-hadamard.fr/pgmo/conferences/2013).
Participants to CWMINLP13 are encouraged to attend.
**********************************************************
*
* 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 POSTERS AND PARTICIPATION
Sept. 30 to Oct. 2, 2013
Institut Henri Poincare, Paris, France
Mixed-Integer Nonlinear Programming (MINLP) is concerned with finding
optimal solutions of optimization problems involving continuous and
integer variables, as well as nonlinear terms in the objective function
and constraints.
The EU COST Action TD1207 "Mathematical Optimization in the Decision
Support Systems for Efficient and Robust Energy Networks" sponsors the
event, so the broad topic of energy networks is one that we plan to
emphasize at the workshop.
Call for posters: if you want to present a poster, please send:
author names, title and a short abstract (max 1 page) to
cwminlp@gmail.com, BEFORE SEPT. 18.
To register, just send your name and affiliation to cwminlp@gmail.com
There is no registration fee. REGISTRATION DEADLINE: SEPT. 20.
Confirmed speakers so far:
Amir AHMADI (IBM Research, USA)
Aysegul ALTIN (TOBB University, Turkey)
Immanuel BOMZE (Universitaet Wien, Austria)
Christoph BUCHHEIM (TU Dortmund, Germany)
Sonia CAFIERI (Ecole Nationale de l'Aviation Civile, France)
Emilio CARRIZOSA (Universidad de Sevilla, Spain)
Sandrine CHAROUSSET (Electricite` de France)
Antonio FRANGIONI (Universita` di Pisa, Italy)
Joao GOUVEIA (Universidade de Coimbra, Portugal)
Christoph HELMBERG (TU Chemnitz, Germany)
Eligius HENDRIX (Wageningen University, The Netherlands)
Christian KIRCHES (Universitaet Heidelberg, Germany)
James LUEDTKE (University of Winsconsin-Madison, USA)
Martin MEVISSEN (IBM Research, Ireland)
Ruth MISENER (Imperial College London, UK)
Shmuel ONN (Israel Institute of Technology)
Frederic ROUPIN (Universite de Paris 13, France)
Nikolaos SAHINIDIS (Carnegie-Mellon University, USA)
Stefan VIGERSKE (GAMS)
Julius ZILINSKAS (Vilnius University, Lithuania)
Program/organizing Committee:
Andrea Cassioli (Ecole Polytechnique, France)
Claudia D'Ambrosio (CNRS & Ecole Polytechnique, France) -- Co-chair
Gustavo Dias (Ecole Polytechnique, France)
Thorsten Koch (Zuze-Institut Berlin, Germany)
Jon Lee (University of Michigan, USA)
Leo Liberti (Ecole Polytechnique, France & IBM Research, USA) -- Co-chair
Andrea Lodi (Universita` di Bologna, Italy)
Evelyne Rayssac (Ecole Polytechnique, France)
Sebastian Sager (Universitaet Magdeburg, Germany)
Angelika Wiegele (Alpen-Adria-Universitaet, Austria)
For more information: https://sites.google.com/site/cwminlp13/
Email: cwminlp@gmail.com
Supported by:
- EU COST action TD1207 (Mathematical Optimization in the Decision Support
Systems for Efficient and Robust Energy Networks)
http://www.cost.eu/domains_ actions/ict/Actions/TD1207
- Institut Henri Poincare (ihp.fr)
The CWMINLP13 will be followed by a related workshop (Optimization and
energy) organized by the "Programme Gaspard Monge pour l'Optimization"
(PGMO) on 3-4 Oct. 2013 at the Ecole Nationale Superieure de
Techniques Avancees (ENSTA), on the campus of Ecole Polytechnique
(http://www.fondation-hadamard.fr/pgmo/conferences/2013).
Participants to CWMINLP13 are encouraged to attend.
**********************************************************
*
* 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 position at LAAS-CNRS, Toulouse, France
Sorry for the multiple copies
-----------------------------
The SARA team (http://www.laas.fr/SARA-EN/) at LAAS-CNRS
(http://www.laas.fr/), Toulouse, France, is seeking a 1-year postdoc
(possible extension to 18 months) to work on the FP7 project PANACEA.
The project is to be started in October 2013. The main objective of
PANACEA is to provide Proactive Autonomic Management of Cloud Resources.
The position is to be filled by April 2014 at latest. The selected
candidate will join a research group composed of Olivier Brun
(http://homepages.laas.fr/brun/), Urtzi Ayesta
(http://homepages.laas.fr/urtzi/) and Balakrishna Prabhu
(http://homepages.laas.fr/bala/). The monthly gross salary is around €
2,500. The selected candidate will be encouraged to apply to CNRS and
Université de Toulouse in order to obtain a permanent appointment at LAAS.
Title: Design of autonomic communication overlays
-----
Context:
-------
It is now broadly admitted that the performances of individual Internet
flows could be improved by selecting alternate paths to the one proposed
by IP routing protocols. As well, a number of recent studies have shown
that the IP routing protocols are slow to react and recover from link
failure or congestion. Unfortunately, the routing infrastructure of the
Internet has become resistant to major changes. The use of overlay
networks has been proposed as an alternative solution that can
potentially provide the desirable flexibility and control over the
routing infrastructure. An overlay network instantiates a virtual
network on top of a physical network by deploying a set of overlay nodes
above the existing Internet routing substrate. Overlay nodes cooperate
with each other to route packets on behalf of any pair of communicating
nodes, forming an overlay network.
By monitoring the functioning and quality of the Internet paths and
using advanced machine-learning algorithms, the PANACEA architecture
will enable: (a) to predict traffic anomalies (e.g., traffic congestion,
link/node failures), and (b) to dynamically reconfigure the
communication paths so as to optimize application-specific routing
metrics before these anomalies happen. Our goals are thus to design an
architecture solution based on dynamic overlays that can enable the
users: (a) to specify the required application properties, (b) to design
the most adequate overlay for his application, and (c) to control how
the overlay is reconfigured in reaction to predicted adverse events.
Candidate Profile:
------------------
The candidate must have:
- a PhD degree in computer science or control theory,
- excellent skills in stochastic modelling (queueing theory, MDPs,...),
optimization or game theory,
- knowledge in the domain of communication networks,
- good organizational and communication skills.
Application:
-----------
Each application must contain the following documents:
- a detailed CV
- a cover letter with a short description of previous works
- one or two references with contact addresses
Applications should be sent electronically to Olivier Brun (brun@laas.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/
*
**********************************************************
-----------------------------
The SARA team (http://www.laas.fr/SARA-EN/) at LAAS-CNRS
(http://www.laas.fr/), Toulouse, France, is seeking a 1-year postdoc
(possible extension to 18 months) to work on the FP7 project PANACEA.
The project is to be started in October 2013. The main objective of
PANACEA is to provide Proactive Autonomic Management of Cloud Resources.
The position is to be filled by April 2014 at latest. The selected
candidate will join a research group composed of Olivier Brun
(http://homepages.laas.fr/brun/), Urtzi Ayesta
(http://homepages.laas.fr/urtzi/) and Balakrishna Prabhu
(http://homepages.laas.fr/bala/). The monthly gross salary is around €
2,500. The selected candidate will be encouraged to apply to CNRS and
Université de Toulouse in order to obtain a permanent appointment at LAAS.
Title: Design of autonomic communication overlays
-----
Context:
-------
It is now broadly admitted that the performances of individual Internet
flows could be improved by selecting alternate paths to the one proposed
by IP routing protocols. As well, a number of recent studies have shown
that the IP routing protocols are slow to react and recover from link
failure or congestion. Unfortunately, the routing infrastructure of the
Internet has become resistant to major changes. The use of overlay
networks has been proposed as an alternative solution that can
potentially provide the desirable flexibility and control over the
routing infrastructure. An overlay network instantiates a virtual
network on top of a physical network by deploying a set of overlay nodes
above the existing Internet routing substrate. Overlay nodes cooperate
with each other to route packets on behalf of any pair of communicating
nodes, forming an overlay network.
By monitoring the functioning and quality of the Internet paths and
using advanced machine-learning algorithms, the PANACEA architecture
will enable: (a) to predict traffic anomalies (e.g., traffic congestion,
link/node failures), and (b) to dynamically reconfigure the
communication paths so as to optimize application-specific routing
metrics before these anomalies happen. Our goals are thus to design an
architecture solution based on dynamic overlays that can enable the
users: (a) to specify the required application properties, (b) to design
the most adequate overlay for his application, and (c) to control how
the overlay is reconfigured in reaction to predicted adverse events.
Candidate Profile:
------------------
The candidate must have:
- a PhD degree in computer science or control theory,
- excellent skills in stochastic modelling (queueing theory, MDPs,...),
optimization or game theory,
- knowledge in the domain of communication networks,
- good organizational and communication skills.
Application:
-----------
Each application must contain the following documents:
- a detailed CV
- a cover letter with a short description of previous works
- one or two references with contact addresses
Applications should be sent electronically to Olivier Brun (brun@laas.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] IFIP/IEEE SUSTAINIT 2013: NSF Sponsored Travel Grant Application
-------------------------------------------------------------------
*** Our apologies if you receive multiple copies of this e-mail ***
-------------------------------------------------------------------
NSF SPONSORED TRAVEL GRANT STUDENT APPLICATIONS
The Third IFIP Conference on
Sustainable Internet and ICT for Sustainability
(SustainIT 2013)
http://www.dicgim.unipa.it/networks/sustainit2013
October 30-31, 2013
Palermo, Sicily, Italy
- Technically sponsored by the IFIP TC6 WG 6.3 (Performance of Communication Systems)
- Technically co-sponsored by IEEE Computer Society
- In cooperation with IEEE Communication Society TSGCC (Technical Subcommittee on Green Communications and Computing)
- Supported by EINS: The Network of Excellence in Internet Science
------------------------------------------------------------------------
SCOPE AND OVERVIEW
------------------------------------------------------------------------
The Third IFIP Conference on Sustainable Internet and ICT for Sustainability (SustainIT 2013) will be held in Palermo, Italy on October 30-31, 2013. For details on the conference, visit http://www.dicgim.unipa.it/networks/sustainit2013/. Pending sponsorship from the US National Science Foundation (www.nsf.gov), we are pleased to announce travel grants for US-based students to attend the SustainIT'13 conference and co-located events such as Ph.D. forum, WiP, poster, and demo sessions.
This funding is available only for full time students attending US colleges and universities (not necessarily US citizens or permanent residents). Minority and women students from diverse institutions in the US are particularly encouraged to apply. Although student authors will be given priority for travel awards, however, this is not a requirement. Young post-doctoral students and Master's students engaged in research may also be considered for support on a case-by-case basis. To be eligible, US-based students (referred to as "you") must apply via EDAS (https://edas.info/newPaper.php?c=14317) no later than September 15, 2013. To apply for travel support, please submit the following:
1. Obtain a letter from your advisor/professor confirming that:
a. You are currently a research student and working in areas related to sustainability.
b. You will be attending the entire SustainIT'13 conference.
c. The remainder of your travel support will be covered (indicate how).
2. Write a personal statement describing your research interests and how you will benefit from attending SustainIT 2013, your student status, and city you will be traveling from.
3. Upload the above documents, along with your two-page CV, on EDAS (https://edas.info/newPaper.php?c=14317) as part of the SustainIT 2013 NSF supported travel grant for US students.
4. Students granted with a SustainIT 2013 NSF supported travel grant are expected to present their research work in areas related to sustainability as a poster during one of the SustainIT Events.
Please note that the SustainIT'13 conference may not be able to reimburse you for all of your travel expenses due to limited budget. Eligible expenses for reimbursement include advance student registration fee, hotel, and travel (air, bus, or train). Expenses that are not eligible for reimbursement include regular and/or on-site registration, meals, car rental, or parking. Student travel grants are available in the form of reimbursements that are sent only after the completion of the conference and providing all required documentation and receipts. The reimbursement amount will be based on the number of awards and distance traveled, and will vary between $1,000 and $1,500 per student.
For any questions, please contact the General Co-Chair and NSF Travel Grant Award Chair, Prof. Sajal K. Das at sdas@mst.edu.
IMPORTANT DATES
------------------------------------------------------------------------
- September 15, 2013: Complete Application deadline (via EDAS at (https://edas.info/newPaper.php?c=14317))
- September 25, 2013: Award Decisions
- October 30-31, 2013: SustainIT Events
**********************************************************
*
* 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/
*
**********************************************************
*** Our apologies if you receive multiple copies of this e-mail ***
-------------------------------------------------------------------
NSF SPONSORED TRAVEL GRANT STUDENT APPLICATIONS
The Third IFIP Conference on
Sustainable Internet and ICT for Sustainability
(SustainIT 2013)
http://www.dicgim.unipa.it/networks/sustainit2013
October 30-31, 2013
Palermo, Sicily, Italy
- Technically sponsored by the IFIP TC6 WG 6.3 (Performance of Communication Systems)
- Technically co-sponsored by IEEE Computer Society
- In cooperation with IEEE Communication Society TSGCC (Technical Subcommittee on Green Communications and Computing)
- Supported by EINS: The Network of Excellence in Internet Science
------------------------------------------------------------------------
SCOPE AND OVERVIEW
------------------------------------------------------------------------
The Third IFIP Conference on Sustainable Internet and ICT for Sustainability (SustainIT 2013) will be held in Palermo, Italy on October 30-31, 2013. For details on the conference, visit http://www.dicgim.unipa.it/networks/sustainit2013/. Pending sponsorship from the US National Science Foundation (www.nsf.gov), we are pleased to announce travel grants for US-based students to attend the SustainIT'13 conference and co-located events such as Ph.D. forum, WiP, poster, and demo sessions.
This funding is available only for full time students attending US colleges and universities (not necessarily US citizens or permanent residents). Minority and women students from diverse institutions in the US are particularly encouraged to apply. Although student authors will be given priority for travel awards, however, this is not a requirement. Young post-doctoral students and Master's students engaged in research may also be considered for support on a case-by-case basis. To be eligible, US-based students (referred to as "you") must apply via EDAS (https://edas.info/newPaper.php?c=14317) no later than September 15, 2013. To apply for travel support, please submit the following:
1. Obtain a letter from your advisor/professor confirming that:
a. You are currently a research student and working in areas related to sustainability.
b. You will be attending the entire SustainIT'13 conference.
c. The remainder of your travel support will be covered (indicate how).
2. Write a personal statement describing your research interests and how you will benefit from attending SustainIT 2013, your student status, and city you will be traveling from.
3. Upload the above documents, along with your two-page CV, on EDAS (https://edas.info/newPaper.php?c=14317) as part of the SustainIT 2013 NSF supported travel grant for US students.
4. Students granted with a SustainIT 2013 NSF supported travel grant are expected to present their research work in areas related to sustainability as a poster during one of the SustainIT Events.
Please note that the SustainIT'13 conference may not be able to reimburse you for all of your travel expenses due to limited budget. Eligible expenses for reimbursement include advance student registration fee, hotel, and travel (air, bus, or train). Expenses that are not eligible for reimbursement include regular and/or on-site registration, meals, car rental, or parking. Student travel grants are available in the form of reimbursements that are sent only after the completion of the conference and providing all required documentation and receipts. The reimbursement amount will be based on the number of awards and distance traveled, and will vary between $1,000 and $1,500 per student.
For any questions, please contact the General Co-Chair and NSF Travel Grant Award Chair, Prof. Sajal K. Das at sdas@mst.edu.
IMPORTANT DATES
------------------------------------------------------------------------
- September 15, 2013: Complete Application deadline (via EDAS at (https://edas.info/newPaper.php?c=14317))
- September 25, 2013: Award Decisions
- October 30-31, 2013: SustainIT Events
**********************************************************
*
* 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, September 3, 2013
[DMANET] Stellenausschreibung am Institut für Informatik der Universität Köln
Im Institut für Informatik der Universität zu Köln ist zum
nächstmöglichen Zeitpunkt im Rahmen eines Drittmittelprojektes eine auf
2 Jahre befristete Stelle einer wissenschaftlichen Mitarbeiterin oder
eines wissenschaftlichen Mitarbeiters (TV-L13 - 39,83 Wochenstunden) zu
besetzen. Eine Verlängerung wird angestrebt.
In enger Zusammenarbeit mit den öffentlichen Bausparkassen entwickeln
wir Modelle zur Simulation komplexer wirtschaftlicher Vorgänge.
Neben einer optimalen Arbeitsumgebung bieten wir eine praxisorientierte
Tätigkeit mit vielfältigen Außenkontakten im Bankenbereich sowie eine
angenehme Arbeitsatmosphäre in einem netten Team. Durch die
interdisziplinäre Zusammensetzung unserer Arbeitsgruppe ergeben sich
darüber hinaus interessante Berührungspunkte zu anderen Fachrichtungen.
Die Möglichkeit zur Promotion ist ebenfalls gegeben.
Einstellungsvoraussetzung ist ein abgeschlossenes Master- oder
Diplomstudium der (Wirtschafts-) Informatik bzw. (Wirtschafts-)
Mathematik. Erwünscht sind fundierte Kenntnisse in einer höheren
Programmiersprache sowie Begeisterungsfähigkeit und Kommunikationsstärke.
Bewerbungen schwerbehinderter Menschen sind besonders willkommen.
Schwerbehinderte Menschen werden bei gleicher Eignung bevorzugt.
Bewerbungen von Frauen sind ausdrücklich erwünscht. Frauen werden bei
gleicher Eignung, Befähigung und fachlicher Leistung bevorzugt
berücksichtigt, sofern nicht in der Person eines Mitbewerbers liegende
Gründe überwiegen.
Bewerbungen mit den üblichen Unterlagen erbitten wir bis zum 20.09.2013 an:
Annette Koenen
Lehrstuhl Prof. Dr. Rainer Schrader
Institut für Informatik
Universität zu Köln
Weyertal 80, 50931 Köln
Tel.: (0221) 470-6030
koenen@zpr.uni-koeln.de
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
nächstmöglichen Zeitpunkt im Rahmen eines Drittmittelprojektes eine auf
2 Jahre befristete Stelle einer wissenschaftlichen Mitarbeiterin oder
eines wissenschaftlichen Mitarbeiters (TV-L13 - 39,83 Wochenstunden) zu
besetzen. Eine Verlängerung wird angestrebt.
In enger Zusammenarbeit mit den öffentlichen Bausparkassen entwickeln
wir Modelle zur Simulation komplexer wirtschaftlicher Vorgänge.
Neben einer optimalen Arbeitsumgebung bieten wir eine praxisorientierte
Tätigkeit mit vielfältigen Außenkontakten im Bankenbereich sowie eine
angenehme Arbeitsatmosphäre in einem netten Team. Durch die
interdisziplinäre Zusammensetzung unserer Arbeitsgruppe ergeben sich
darüber hinaus interessante Berührungspunkte zu anderen Fachrichtungen.
Die Möglichkeit zur Promotion ist ebenfalls gegeben.
Einstellungsvoraussetzung ist ein abgeschlossenes Master- oder
Diplomstudium der (Wirtschafts-) Informatik bzw. (Wirtschafts-)
Mathematik. Erwünscht sind fundierte Kenntnisse in einer höheren
Programmiersprache sowie Begeisterungsfähigkeit und Kommunikationsstärke.
Bewerbungen schwerbehinderter Menschen sind besonders willkommen.
Schwerbehinderte Menschen werden bei gleicher Eignung bevorzugt.
Bewerbungen von Frauen sind ausdrücklich erwünscht. Frauen werden bei
gleicher Eignung, Befähigung und fachlicher Leistung bevorzugt
berücksichtigt, sofern nicht in der Person eines Mitbewerbers liegende
Gründe überwiegen.
Bewerbungen mit den üblichen Unterlagen erbitten wir bis zum 20.09.2013 an:
Annette Koenen
Lehrstuhl Prof. Dr. Rainer Schrader
Institut für Informatik
Universität zu Köln
Weyertal 80, 50931 Köln
Tel.: (0221) 470-6030
koenen@zpr.uni-koeln.de
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Post-doc positions in Combinatorics / Discrete Mathematics at Tel Aviv University
The School of Mathematical Sciences at Tel Aviv University invites
applications for Post-doctoral Fellowships in Combinatorics and
Discrete Mathematics for one year, with a possibility of extension for
an additional year, starting October 1, 2014 (the starting date is
negotiable).
The School of Mathematical Sciences is a leading international
research institution in mathematics. It has a large and very active
research group in Combinatorics (four faculty members and many
research students), with a weekly research seminar.
Further information about the School, including a list of our faculty,
is available from our web site http://www.math.tau.ac.il.
We welcome applications from candidates specializing in Combinatorics,
who will have completed a Ph. D. degree in Mathematics or Computer
Science by September 30, 2014 (but not earlier than October 1, 2010).
Preference will be given to applicants whose research interests are
compatible with those of the relevant faculty in the School.
Post-doctoral Fellowships are strictly research positions and do not
carry any teaching responsibilities.
Stipends for a one year fellowship are approximately 120,000 Israeli
Shekels and are commensurable with entry level academic salaries in
Israel. Additional funds for research related travel will also be
available.
Candidates should arrange the following application materials to be
sent to Ms. Nurit Liberman at nuritl@tauex.tau.ac.il
- CV
- List of Publications
- Research statement
- Three letters of recommendation
Alternatively, all material may be sent by regular mail to
Nurit Liberman
School of Mathematical Sciences
Tel Aviv University
Tel Aviv 69978
ISRAEL
The deadline for applications is January 1, 2014. Applications
received after the deadline will be considered if positions remain open.
--
Noga Alon, Michael Krivelevich, Wojciech Samotij, and Asaf Shapira
**********************************************************
*
* 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/
*
**********************************************************
applications for Post-doctoral Fellowships in Combinatorics and
Discrete Mathematics for one year, with a possibility of extension for
an additional year, starting October 1, 2014 (the starting date is
negotiable).
The School of Mathematical Sciences is a leading international
research institution in mathematics. It has a large and very active
research group in Combinatorics (four faculty members and many
research students), with a weekly research seminar.
Further information about the School, including a list of our faculty,
is available from our web site http://www.math.tau.ac.il.
We welcome applications from candidates specializing in Combinatorics,
who will have completed a Ph. D. degree in Mathematics or Computer
Science by September 30, 2014 (but not earlier than October 1, 2010).
Preference will be given to applicants whose research interests are
compatible with those of the relevant faculty in the School.
Post-doctoral Fellowships are strictly research positions and do not
carry any teaching responsibilities.
Stipends for a one year fellowship are approximately 120,000 Israeli
Shekels and are commensurable with entry level academic salaries in
Israel. Additional funds for research related travel will also be
available.
Candidates should arrange the following application materials to be
sent to Ms. Nurit Liberman at nuritl@tauex.tau.ac.il
- CV
- List of Publications
- Research statement
- Three letters of recommendation
Alternatively, all material may be sent by regular mail to
Nurit Liberman
School of Mathematical Sciences
Tel Aviv University
Tel Aviv 69978
ISRAEL
The deadline for applications is January 1, 2014. Applications
received after the deadline will be considered if positions remain open.
--
Noga Alon, Michael Krivelevich, Wojciech Samotij, and Asaf Shapira
**********************************************************
*
* 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 - SenSys 2013 Doctoral Colloquium
[ ** Please excuse any duplicates you may receive ** ]
Note: Submission deadline extended to September 6th, 2013.
SenSys 2013 Doctoral Colloquium
November 13 November 2013 (afternoon), Rome, Italy.
http://sensys.acm.org/2013/doccol.html
The Doctoral Colloquium (DC) of SenSys'13 is to provide a friendly,
supportive, and constructive environment where PhD students can present
their research-in-progress for an open discussion guided by a panel of
experienced researchers and practitioners. Applicants should be far
enough into their PhD to have a concrete proposal, and have initially
outlined the salient issues and proposed research methodology.
Applicants should not be planning to submit their PhD thesis or
dissertation for at least four months after the DC, so that any advice
or input may still be incorporated into the doctoral work.
The DC will be a half-day, seminar-style event, consisting of short
presentations followed by round table discussion. Time will be allotted
to each student not only for the presentation, but also for careful,
in-depth consideration and discussion amongst the panelists and DC
participants.
In addition to the DC presentation, the participants will be given a
chance to present a poster at the poster session during the main
conference.
Submissions
Topic scope is the same as that listed in the SenSys call for papers. DC
submissions should consist of a single PDF document using the SenSys
paper template. The document should contain the following:
Research summary (3 pages) describing the work in progress and including
a 100-word abstract. Things to consider for inclusion in the research
summary might be: the expected contribution to the field of sensor
networking; the original idea or thesis statement; the problem domain
and the specific problem addressed; a brief overview of related work;
the methodological approach; research carried out and results so far.
Student biographical sketch, including the names and affiliations of the
research advisor(s), and expected date of dissertation submission.
The submission site can be found at:
https://sensys2013.cs.virginia.edu/doctoralCol/index.php
Research summaries will be reviewed by the chairs and panel members. If
the work is accepted, a student may be expected to make clarifications
and improvements to the research summary by the camera-ready deadline.
Note that the research summaries will not be formally published, but
hard copies will be made available to colloquium delegates.
A prize for best student presentation will be awarded by the panel.
Registration
Accepted participants of the doctoral colloquium shall register with the
SenSys workshop registration rate (if applicable at the student rate).
The registration is free if the student also attends and has registered
for the SenSys conference. Participants can also apply for SenSys travel
grants.
Important Dates (all at 11:59pm PDT)
Submission Deadline: September 6th, 2013
Notification of Acceptance: October 6, 2013
Camera-Ready: October 27, 2013
Colloquium: November 13, 2013
Organizers
Chair
Cecilia Mascolo, University of Cambridge
Committee:
Polly Huang, National Taiwan University, Taiwan
Nic Lane, Microsoft Research Asia , China
Andrew Markham, University of Oxford, UK
Emiliano Miluzzo, AT&T, USA
Luca Mottola, Politecnico di Milano Italy & SICS Sweden
Anthony Rowe, CMU, USA
Silvia Santini Technische Universitat Darmstadt, Germany
Sasu Tarkoma University of Helsinki, Finland
**********************************************************
*
* 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/
*
**********************************************************
Note: Submission deadline extended to September 6th, 2013.
SenSys 2013 Doctoral Colloquium
November 13 November 2013 (afternoon), Rome, Italy.
http://sensys.acm.org/2013/doccol.html
The Doctoral Colloquium (DC) of SenSys'13 is to provide a friendly,
supportive, and constructive environment where PhD students can present
their research-in-progress for an open discussion guided by a panel of
experienced researchers and practitioners. Applicants should be far
enough into their PhD to have a concrete proposal, and have initially
outlined the salient issues and proposed research methodology.
Applicants should not be planning to submit their PhD thesis or
dissertation for at least four months after the DC, so that any advice
or input may still be incorporated into the doctoral work.
The DC will be a half-day, seminar-style event, consisting of short
presentations followed by round table discussion. Time will be allotted
to each student not only for the presentation, but also for careful,
in-depth consideration and discussion amongst the panelists and DC
participants.
In addition to the DC presentation, the participants will be given a
chance to present a poster at the poster session during the main
conference.
Submissions
Topic scope is the same as that listed in the SenSys call for papers. DC
submissions should consist of a single PDF document using the SenSys
paper template. The document should contain the following:
Research summary (3 pages) describing the work in progress and including
a 100-word abstract. Things to consider for inclusion in the research
summary might be: the expected contribution to the field of sensor
networking; the original idea or thesis statement; the problem domain
and the specific problem addressed; a brief overview of related work;
the methodological approach; research carried out and results so far.
Student biographical sketch, including the names and affiliations of the
research advisor(s), and expected date of dissertation submission.
The submission site can be found at:
https://sensys2013.cs.virginia.edu/doctoralCol/index.php
Research summaries will be reviewed by the chairs and panel members. If
the work is accepted, a student may be expected to make clarifications
and improvements to the research summary by the camera-ready deadline.
Note that the research summaries will not be formally published, but
hard copies will be made available to colloquium delegates.
A prize for best student presentation will be awarded by the panel.
Registration
Accepted participants of the doctoral colloquium shall register with the
SenSys workshop registration rate (if applicable at the student rate).
The registration is free if the student also attends and has registered
for the SenSys conference. Participants can also apply for SenSys travel
grants.
Important Dates (all at 11:59pm PDT)
Submission Deadline: September 6th, 2013
Notification of Acceptance: October 6, 2013
Camera-Ready: October 27, 2013
Colloquium: November 13, 2013
Organizers
Chair
Cecilia Mascolo, University of Cambridge
Committee:
Polly Huang, National Taiwan University, Taiwan
Nic Lane, Microsoft Research Asia , China
Andrew Markham, University of Oxford, UK
Emiliano Miluzzo, AT&T, USA
Luca Mottola, Politecnico di Milano Italy & SICS Sweden
Anthony Rowe, CMU, USA
Silvia Santini Technische Universitat Darmstadt, Germany
Sasu Tarkoma University of Helsinki, Finland
**********************************************************
*
* 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] Position of junior research group leader for "Optimization under Uncertainty" at TU Berlin
In the framework of the Einstein Center for Mathematics Berlin (ECMath) we are looking for candidates to lead a junior research group "Optimization under Uncertainty" in the area of Algorithmic Discrete Mathematics. The position is paid according to "Entgeltgruppe 14 TV-L Berliner Hochschulen".
The area of Algorithmic Discrete Mathematics plays a key as a connecting link between mathematics, computer science, and applications in economics and industry. Candidates are expected to have a solid background in Algorithmic Discrete Mathematics with clear connections to Discrete Optimization and the ECMath Innovation Area "Mathematics in Metropolitan Infrastructure". Favored research areas are Optimization under Uncertainty, Robust Optimization, and Algorithmic Game Theory. Candidates should be interested in interdisciplinary projects with other scientific disciplines as well as industry.
We are looking for postdocs who have already proved their scientific independence and are about to establish their own research program. Initially the position is limited to 3 years and can be extended to 6 years upon positive evaluation. The junior research group also includes a position for a PhD student.
Please send your written application by September 26th, 2013 with appropriate documentation to
Technische Universität Berlin
- Der Präsident -
Fakultät II, Sekr. MA 3-1
Str. des 17. Juni 136
10623 Berlin
Germany
Please send copies only. Original documents will not be returned. The vacancy is also available on the internet at
http://www.personalabteilung.tu-berlin.de/menue/jobs/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
The area of Algorithmic Discrete Mathematics plays a key as a connecting link between mathematics, computer science, and applications in economics and industry. Candidates are expected to have a solid background in Algorithmic Discrete Mathematics with clear connections to Discrete Optimization and the ECMath Innovation Area "Mathematics in Metropolitan Infrastructure". Favored research areas are Optimization under Uncertainty, Robust Optimization, and Algorithmic Game Theory. Candidates should be interested in interdisciplinary projects with other scientific disciplines as well as industry.
We are looking for postdocs who have already proved their scientific independence and are about to establish their own research program. Initially the position is limited to 3 years and can be extended to 6 years upon positive evaluation. The junior research group also includes a position for a PhD student.
Please send your written application by September 26th, 2013 with appropriate documentation to
Technische Universität Berlin
- Der Präsident -
Fakultät II, Sekr. MA 3-1
Str. des 17. Juni 136
10623 Berlin
Germany
Please send copies only. Original documents will not be returned. The vacancy is also available on the internet at
http://www.personalabteilung.tu-berlin.de/menue/jobs/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Monday, September 2, 2013
[DMANET] Open Data Structures
I am pleased to announce that the undergraduate textbook
Open Data Structure
is now available in three formats:
PDF (free)
HTML (free)
Trade paperback ($29.95)
Links to all three can be found at book's website:
http://opendatastructures.org/
The PDF, HTML, and LaTeX source code for the book is released under a
Creative Commons Attribution License (CC-BY).
Table of Contents
1. Introduction
1.1. The Need for Efficiency
1.2. Interfaces
1.3. Mathematical Background
1.4. The Model of Computation
1.5. Correctness, Time Complexity, and Space Complexity
1.6. Code Samples
1.7. List of Data Structures
1.8. Discussion and Exercises
2. Array-Based Lists
2.1. ArrayStack: Fast Stack Operations Using an Array
2.2. FastArrayStack: An Optimized ArrayStack
2.3. ArrayQueue: An Array-Based Queue
2.4. ArrayDeque: Fast Deque Operations Using an Array
2.5. DualArrayDeque: Building a Deque from Two Stacks
2.6. RootishArrayStack: A Space-Efficient Array Stack
2.7. Discussion and Exercises
3. Linked Lists
3.1. SLList: A Singly-Linked List
3.2. DLList: A Doubly-Linked List
3.3. SEList: A Space-Efficient Linked List
3.4. Discussion and Exercises
4. Skiplists
4.1. The Basic Structure
4.2. SkiplistSSet: An Efficient SSet
4.3. SkiplistList: An Efficient Random-Access List
4.4. Analysis of Skiplists
4.5. Discussion and Exercises
5. Hash Tables
5.1. ChainedHashTable: Hashing with Chaining
5.2. LinearHashTable: Linear Probing
5.3. Hash Codes
5.4. Discussion and Exercises
6. Binary Trees
6.1. BinaryTree: A Basic Binary Tree
6.2. BinarySearchTree: An Unbalanced Binary Search Tree
6.3. Discussion and Exercises
7. Random Binary Search Trees
7.1. Random Binary Search Trees
7.2. Treap: A Randomized Binary Search Tree
7.3. Discussion and Exercises
8. Scapegoat Trees
8.1. ScapegoatTree: A Binary Search Tree with Partial Rebuilding
8.2. Discussion and Exercises
9. Red-Black Trees
9.1. 2-4 Trees
9.2. RedBlackTree: A Simulated 2-4 Tree
9.3. Summary
9.4. Discussion and Exercises
10. Heaps
10.1. BinaryHeap: An Implicit Binary Tree
10.2. MeldableHeap: A Randomized Meldable Heap
10.3. Discussion and Exercises
11. Sorting Algorithms
11.1. Comparison-Based Sorting
11.2. Counting Sort and Radix Sort
11.3. Discussion and Exercises
12. Graphs
12.1. AdjacencyMatrix: Representing a Graph by a Matrix
12.2. AdjacencyLists: A Graph as a Collection of Lists
12.3. Graph Traversal
12.4. Discussion and Exercises
13. Data Structures for Integers
13.1. BinaryTrie: A digital search tree
13.2. XFastTrie: Searching in Doubly-Logarithmic Time
13.3. YFastTrie: A Doubly-Logarithmic Time SSet
13.4. Discussion and Exercises
14. External Memory Searching
14.1. The Block Store
14.2. B-Trees
14.3. Discussion and Exercises
Bibliography
Index
**********************************************************
*
* 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/
*
**********************************************************
Open Data Structure
is now available in three formats:
PDF (free)
HTML (free)
Trade paperback ($29.95)
Links to all three can be found at book's website:
http://opendatastructures.org/
The PDF, HTML, and LaTeX source code for the book is released under a
Creative Commons Attribution License (CC-BY).
Table of Contents
1. Introduction
1.1. The Need for Efficiency
1.2. Interfaces
1.3. Mathematical Background
1.4. The Model of Computation
1.5. Correctness, Time Complexity, and Space Complexity
1.6. Code Samples
1.7. List of Data Structures
1.8. Discussion and Exercises
2. Array-Based Lists
2.1. ArrayStack: Fast Stack Operations Using an Array
2.2. FastArrayStack: An Optimized ArrayStack
2.3. ArrayQueue: An Array-Based Queue
2.4. ArrayDeque: Fast Deque Operations Using an Array
2.5. DualArrayDeque: Building a Deque from Two Stacks
2.6. RootishArrayStack: A Space-Efficient Array Stack
2.7. Discussion and Exercises
3. Linked Lists
3.1. SLList: A Singly-Linked List
3.2. DLList: A Doubly-Linked List
3.3. SEList: A Space-Efficient Linked List
3.4. Discussion and Exercises
4. Skiplists
4.1. The Basic Structure
4.2. SkiplistSSet: An Efficient SSet
4.3. SkiplistList: An Efficient Random-Access List
4.4. Analysis of Skiplists
4.5. Discussion and Exercises
5. Hash Tables
5.1. ChainedHashTable: Hashing with Chaining
5.2. LinearHashTable: Linear Probing
5.3. Hash Codes
5.4. Discussion and Exercises
6. Binary Trees
6.1. BinaryTree: A Basic Binary Tree
6.2. BinarySearchTree: An Unbalanced Binary Search Tree
6.3. Discussion and Exercises
7. Random Binary Search Trees
7.1. Random Binary Search Trees
7.2. Treap: A Randomized Binary Search Tree
7.3. Discussion and Exercises
8. Scapegoat Trees
8.1. ScapegoatTree: A Binary Search Tree with Partial Rebuilding
8.2. Discussion and Exercises
9. Red-Black Trees
9.1. 2-4 Trees
9.2. RedBlackTree: A Simulated 2-4 Tree
9.3. Summary
9.4. Discussion and Exercises
10. Heaps
10.1. BinaryHeap: An Implicit Binary Tree
10.2. MeldableHeap: A Randomized Meldable Heap
10.3. Discussion and Exercises
11. Sorting Algorithms
11.1. Comparison-Based Sorting
11.2. Counting Sort and Radix Sort
11.3. Discussion and Exercises
12. Graphs
12.1. AdjacencyMatrix: Representing a Graph by a Matrix
12.2. AdjacencyLists: A Graph as a Collection of Lists
12.3. Graph Traversal
12.4. Discussion and Exercises
13. Data Structures for Integers
13.1. BinaryTrie: A digital search tree
13.2. XFastTrie: Searching in Doubly-Logarithmic Time
13.3. YFastTrie: A Doubly-Logarithmic Time SSet
13.4. Discussion and Exercises
14. External Memory Searching
14.1. The Block Store
14.2. B-Trees
14.3. Discussion and Exercises
Bibliography
Index
**********************************************************
*
* 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] (new book) The Essential Knuth
Dear fellow computer scientist,
Just appeared. The Essential Knuth
A book about Donald E. Knuth, a pioneer in algorithms (and much more).
How, when, and why did mathematics and computing converge for Knuth during the 1960s?
To what extent were Turing machines and Chomsky's work relevant to Knuth?
More information:
www.lonelyscholar.com/Knuth
best wishes,
Edgar Daylight
**********************************************************
*
* 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/
*
**********************************************************
Just appeared. The Essential Knuth
A book about Donald E. Knuth, a pioneer in algorithms (and much more).
How, when, and why did mathematics and computing converge for Knuth during the 1960s?
To what extent were Turing machines and Chomsky's work relevant to Knuth?
More information:
www.lonelyscholar.com/Knuth
best wishes,
Edgar Daylight
**********************************************************
*
* 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] LATA 2014: 2nd call for papers
8th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND
APPLICATIONS
LATA 2014
Madrid, Spain
March 10-14, 2014
Organized by:
Research Group on Implementation of Language-Driven Software and
Applications (ILSA)
Complutense University of Madrid
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
http://grammars.grlmc.com/lata2014/
*********************************************************************
AIMS:
LATA is a yearly conference on theoretical computer science and its
applications. Following the tradition of the diverse PhD training events in
the field developed at Rovira i Virgili University in Tarragona since 2002,
LATA 2014 will reserve significant room for young scholars at the beginning
of their career. It will aim at attracting contributions from both classical
theory fields and application areas (bioinformatics, language technology,
artificial intelligence, etc.).
VENUE:
LATA 2014 will take place in Madrid, the capital of Spain. The venue will be
the School of Informatics of Complutense University.
SCOPE:
Topics of either theoretical or applied interest include, but are not
limited to:
algebraic language theory
algorithms for semi-structured data mining
algorithms on automata and words
automata and logic
automata for system analysis and programme verification
automata, concurrency and Petri nets
automatic structures
cellular automata
codes
combinatorics on words
compilers
computability
computational complexity
data and image compression
decidability issues on words and languages
descriptional complexity
DNA and other models of bio-inspired computing
digital libraries and document engineering
foundations of finite state technology
foundations of XML
fuzzy and rough languages
grammars (Chomsky hierarchy, contextual, unification, categorial, etc.)
grammatical inference and algorithmic learning
graphs and graph transformation
language varieties and semigroups
language-based cryptography
language-theoretic foundations of artificial intelligence and artificial
life
natural language and speech automatic processing
parallel and regulated rewriting
parsing
patterns
power series
quantum, chemical and optical computing
semantics
string and combinatorial issues in computational biology and bioinformatics
string processing algorithms
symbolic dynamics
symbolic neural networks
term rewriting
transducers
trees, tree languages and tree automata
weighted automata
STRUCTURE:
LATA 2014 will consist of:
invited talks
invited tutorials
peer-reviewed contributions
INVITED SPEAKERS:
Javier Esparza (Munich Tech, DE)
Leslie A. Goldberg (Oxford, UK)
Oscar H. Ibarra (Santa Barbara, US)
Sanjeev Khanna (Philadelphia, US)
Helmut Seidl (Munich Tech, DE)
PROGRAMME COMMITTEE:
Dana Angluin (Yale, US)
Eugene Asarin (Paris Diderot, FR)
Jos Baeten (Amsterdam, NL)
Christel Baier (Dresden, DE)
Jan Bergstra (Amsterdam, NL)
Jin-Yi Cai (Madison, US)
Marek Chrobak (Riverside, US)
Andrea Corradini (Pisa, IT)
Mariangiola Dezani (Turin, IT)
Ding-Zhu Du (Dallas, US)
Michael R. Fellows (Darwin, AU)
Jörg Flum (Freiburg, DE)
Nissim Francez (Technion, IL)
Jürgen Giesl (Aachen, DE)
Annegret Habel (Oldenburg, DE)
Kazuo Iwama (Kyoto, JP)
Sampath Kannan (Philadelphia, US)
Ming-Yang Kao (Northwestern, US)
Deepak Kapur (Albuquerque, US)
Joost-Pieter Katoen (Aachen, DE)
S. Rao Kosaraju (Johns Hopkins, US)
Evangelos Kranakis (Carleton, CA)
Gad M. Landau (Haifa, IL)
Andrzej Lingas (Lund, SE)
Jack Lutz (Iowa State, US)
Ian Mackie (École Polytechnique, FR)
Carlos Martín-Vide (Tarragona, ES, chair)
Giancarlo Mauri (Milan, IT)
Faron G. Moller (Swansea, UK)
Paliath Narendran (Albany, US)
Enno Ohlebusch (Ulm, DE)
Helmut Prodinger (Stellenbosch, ZA)
Jean-François Raskin (Brussels, BE)
Wolfgang Reisig (Humboldt Berlin, DE)
Marco Roveri (Bruno Kessler, Trento, IT)
Michaël Rusinowitch (LORIA, Nancy, FR)
Yasubumi Sakakibara (Keio, JP)
Davide Sangiorgi (Bologna, IT)
Colin Stirling (Edinburgh, UK)
Jianwen Su (Santa Barbara, US)
Jean-Pierre Talpin (IRISA, Rennes, FR)
Andrzej Tarlecki (Warsaw, PL)
Rick Thomas (Leicester, UK)
Sophie Tison (Lille, FR)
Rob van Glabbeek (NICTA, Sydney, AU)
Helmut Veith (Vienna Tech, AT)
ORGANIZING COMMITTEE:
Adrian Horia Dediu (Tarragona)
Ana Fernández-Pampillón (Madrid)
Carlos Martín-Vide (Tarragona, co-chair)
Antonio Sarasa (Madrid)
José-Luis Sierra (Madrid, co-chair)
Bianca Truthe (Magdeburg)
Florentina Lilica Voicu (Tarragona)
SUBMISSIONS:
Authors are invited to submit non-anonymized papers in English presenting
original and unpublished research. Papers should not exceed 12 single-spaced
pages (including eventual appendices) and should be formatted according to
the standard format for Springer Verlag's LNCS series (see
http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0).
Submissions have to be uploaded to:
https://www.easychair.org/conferences/?conf=lata2014
PUBLICATIONS:
A volume of proceedings published by Springer in the LNCS series will be
available by the time of the conference.
A special issue of a major journal will be later published containing
peer-reviewed extended versions of some of the papers contributed to the
conference. Submissions to it will be by invitation.
REGISTRATION:
The period for registration is open from July 15, 2013 to March 10, 2014.
The registration form can be found at:
http://grammars.grlmc.com/lata2014/Registration.php
DEADLINES:
Paper submission: October 14, 2013 (23:59 CET)
Notification of paper acceptance or rejection: November 25, 2013
Final version of the paper for the LNCS proceedings: December 2, 2013
Early registration: December 9, 2013
Late registration: February 24, 2014
Starting of the conference: March 10, 2014
End of the conference: March 14, 2014
Submission to the post-conference journal special issue: June 14, 2014
QUESTIONS AND FURTHER INFORMATION:
florentinalilica.voicu@urv.cat
POSTAL ADDRESS:
LATA 2014
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain
Phone: +34-977-559543
Fax: +34-977-558386
ACKNOWLEDGEMENTS:
Departament d'Economia i Coneixement, Generalitat de Catalunya
Universidad Complutense de Madrid
Universitat Rovira i Virgili
**********************************************************
*
* 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/
*
**********************************************************
APPLICATIONS
LATA 2014
Madrid, Spain
March 10-14, 2014
Organized by:
Research Group on Implementation of Language-Driven Software and
Applications (ILSA)
Complutense University of Madrid
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
http://grammars.grlmc.com/lata2014/
*********************************************************************
AIMS:
LATA is a yearly conference on theoretical computer science and its
applications. Following the tradition of the diverse PhD training events in
the field developed at Rovira i Virgili University in Tarragona since 2002,
LATA 2014 will reserve significant room for young scholars at the beginning
of their career. It will aim at attracting contributions from both classical
theory fields and application areas (bioinformatics, language technology,
artificial intelligence, etc.).
VENUE:
LATA 2014 will take place in Madrid, the capital of Spain. The venue will be
the School of Informatics of Complutense University.
SCOPE:
Topics of either theoretical or applied interest include, but are not
limited to:
algebraic language theory
algorithms for semi-structured data mining
algorithms on automata and words
automata and logic
automata for system analysis and programme verification
automata, concurrency and Petri nets
automatic structures
cellular automata
codes
combinatorics on words
compilers
computability
computational complexity
data and image compression
decidability issues on words and languages
descriptional complexity
DNA and other models of bio-inspired computing
digital libraries and document engineering
foundations of finite state technology
foundations of XML
fuzzy and rough languages
grammars (Chomsky hierarchy, contextual, unification, categorial, etc.)
grammatical inference and algorithmic learning
graphs and graph transformation
language varieties and semigroups
language-based cryptography
language-theoretic foundations of artificial intelligence and artificial
life
natural language and speech automatic processing
parallel and regulated rewriting
parsing
patterns
power series
quantum, chemical and optical computing
semantics
string and combinatorial issues in computational biology and bioinformatics
string processing algorithms
symbolic dynamics
symbolic neural networks
term rewriting
transducers
trees, tree languages and tree automata
weighted automata
STRUCTURE:
LATA 2014 will consist of:
invited talks
invited tutorials
peer-reviewed contributions
INVITED SPEAKERS:
Javier Esparza (Munich Tech, DE)
Leslie A. Goldberg (Oxford, UK)
Oscar H. Ibarra (Santa Barbara, US)
Sanjeev Khanna (Philadelphia, US)
Helmut Seidl (Munich Tech, DE)
PROGRAMME COMMITTEE:
Dana Angluin (Yale, US)
Eugene Asarin (Paris Diderot, FR)
Jos Baeten (Amsterdam, NL)
Christel Baier (Dresden, DE)
Jan Bergstra (Amsterdam, NL)
Jin-Yi Cai (Madison, US)
Marek Chrobak (Riverside, US)
Andrea Corradini (Pisa, IT)
Mariangiola Dezani (Turin, IT)
Ding-Zhu Du (Dallas, US)
Michael R. Fellows (Darwin, AU)
Jörg Flum (Freiburg, DE)
Nissim Francez (Technion, IL)
Jürgen Giesl (Aachen, DE)
Annegret Habel (Oldenburg, DE)
Kazuo Iwama (Kyoto, JP)
Sampath Kannan (Philadelphia, US)
Ming-Yang Kao (Northwestern, US)
Deepak Kapur (Albuquerque, US)
Joost-Pieter Katoen (Aachen, DE)
S. Rao Kosaraju (Johns Hopkins, US)
Evangelos Kranakis (Carleton, CA)
Gad M. Landau (Haifa, IL)
Andrzej Lingas (Lund, SE)
Jack Lutz (Iowa State, US)
Ian Mackie (École Polytechnique, FR)
Carlos Martín-Vide (Tarragona, ES, chair)
Giancarlo Mauri (Milan, IT)
Faron G. Moller (Swansea, UK)
Paliath Narendran (Albany, US)
Enno Ohlebusch (Ulm, DE)
Helmut Prodinger (Stellenbosch, ZA)
Jean-François Raskin (Brussels, BE)
Wolfgang Reisig (Humboldt Berlin, DE)
Marco Roveri (Bruno Kessler, Trento, IT)
Michaël Rusinowitch (LORIA, Nancy, FR)
Yasubumi Sakakibara (Keio, JP)
Davide Sangiorgi (Bologna, IT)
Colin Stirling (Edinburgh, UK)
Jianwen Su (Santa Barbara, US)
Jean-Pierre Talpin (IRISA, Rennes, FR)
Andrzej Tarlecki (Warsaw, PL)
Rick Thomas (Leicester, UK)
Sophie Tison (Lille, FR)
Rob van Glabbeek (NICTA, Sydney, AU)
Helmut Veith (Vienna Tech, AT)
ORGANIZING COMMITTEE:
Adrian Horia Dediu (Tarragona)
Ana Fernández-Pampillón (Madrid)
Carlos Martín-Vide (Tarragona, co-chair)
Antonio Sarasa (Madrid)
José-Luis Sierra (Madrid, co-chair)
Bianca Truthe (Magdeburg)
Florentina Lilica Voicu (Tarragona)
SUBMISSIONS:
Authors are invited to submit non-anonymized papers in English presenting
original and unpublished research. Papers should not exceed 12 single-spaced
pages (including eventual appendices) and should be formatted according to
the standard format for Springer Verlag's LNCS series (see
http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0).
Submissions have to be uploaded to:
https://www.easychair.org/conferences/?conf=lata2014
PUBLICATIONS:
A volume of proceedings published by Springer in the LNCS series will be
available by the time of the conference.
A special issue of a major journal will be later published containing
peer-reviewed extended versions of some of the papers contributed to the
conference. Submissions to it will be by invitation.
REGISTRATION:
The period for registration is open from July 15, 2013 to March 10, 2014.
The registration form can be found at:
http://grammars.grlmc.com/lata2014/Registration.php
DEADLINES:
Paper submission: October 14, 2013 (23:59 CET)
Notification of paper acceptance or rejection: November 25, 2013
Final version of the paper for the LNCS proceedings: December 2, 2013
Early registration: December 9, 2013
Late registration: February 24, 2014
Starting of the conference: March 10, 2014
End of the conference: March 14, 2014
Submission to the post-conference journal special issue: June 14, 2014
QUESTIONS AND FURTHER INFORMATION:
florentinalilica.voicu@urv.cat
POSTAL ADDRESS:
LATA 2014
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain
Phone: +34-977-559543
Fax: +34-977-558386
ACKNOWLEDGEMENTS:
Departament d'Economia i Coneixement, Generalitat de Catalunya
Universidad Complutense de Madrid
Universitat Rovira i Virgili
**********************************************************
*
* 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] visitor/postdoc position at Network Algorithms group at ASU
A short term visitor (Visiting Faculty or a Post-doc) position for about three months (Sept. 1 to Nov 30), hosted by Profs. Arun Sen and Andrea Richa, is available at Arizona State University to participate in a networking related project. We are looking for a person with strong background in Graph Algorithms, Combinatorial Optimization, Approximation Algorithms, Computational Geometry and Mathematical Programming. If interested, please contact Prof. Arun Sen or Prof. Andrea Richa, School of Computing, Informatics and Decision Systems Engineering (asen@asu.edu, aricha@asu.edu). The position may possibly be extended for another three months.
--
Prof. Andrea W. Richa |Phone: 480-965-7555
Computer Science & Eng., CIDSE |FAX: 480-965-2751
Arizona State University |E-mail: aricha@asu.edu
PO Box 878809, Tempe AZ 85287-8809|Homepage:www.public.asu.edu/~aricha
**********************************************************
*
* 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/
*
**********************************************************
--
Prof. Andrea W. Richa |Phone: 480-965-7555
Computer Science & Eng., CIDSE |FAX: 480-965-2751
Arizona State University |E-mail: aricha@asu.edu
PO Box 878809, Tempe AZ 85287-8809|Homepage:www.public.asu.edu/~aricha
**********************************************************
*
* 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] JAOR Special Issue on Optimization Methods in Logistics
JOURNAL OF APPLIED OPERATIONAL RESEARCH
Special Issue on Optimization Methods in Logistics
Guest Editor:
Prof. Roberto Montemanni
Dalle Molle Institute for Artificial Intelligence (IDSIA)
University of Applied Sciences of Southern Switzerland
(SUPSI)
roberto@idsia.ch
The use of operational research techniques has a long
tradition in logistics. The purpose of this special issue
is to present the most recent developments of applied
operations research methods for solving current problems
in logistics. The special issue welcomes contributions on
several areas of optimization in logistics such as exact
or approximation solution methods with particular emphasis
on real-world applications, including, but not limited to:
- Distribution
- Inventory
- Loading and handling
- Materials management
- Returns management
- Reverse logistics
- Supply chain management
- Warehousing
Submission Deadline: 15-Sep-2013
Paper Submission
Authors should submit their manuscripts in MS Word via
email to jaor@tadbir.ca. Each submission will be assigned
an identification code. Please quote this in all
correspondence. By submitting a manuscript you certify
that the contribution is original work and has not been
published or under consideration for publishing elsewhere
and that no part of the material breaches any right of
others. All articles will be peer reviewed by at least two
anonymous referees. Authors are advised to ensure that
they have conformed to JAOR's script requirements detailed
at http://www.tadbir.ca/jaor/authors.htm.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Special Issue on Optimization Methods in Logistics
Guest Editor:
Prof. Roberto Montemanni
Dalle Molle Institute for Artificial Intelligence (IDSIA)
University of Applied Sciences of Southern Switzerland
(SUPSI)
roberto@idsia.ch
The use of operational research techniques has a long
tradition in logistics. The purpose of this special issue
is to present the most recent developments of applied
operations research methods for solving current problems
in logistics. The special issue welcomes contributions on
several areas of optimization in logistics such as exact
or approximation solution methods with particular emphasis
on real-world applications, including, but not limited to:
- Distribution
- Inventory
- Loading and handling
- Materials management
- Returns management
- Reverse logistics
- Supply chain management
- Warehousing
Submission Deadline: 15-Sep-2013
Paper Submission
Authors should submit their manuscripts in MS Word via
email to jaor@tadbir.ca. Each submission will be assigned
an identification code. Please quote this in all
correspondence. By submitting a manuscript you certify
that the contribution is original work and has not been
published or under consideration for publishing elsewhere
and that no part of the material breaches any right of
others. All articles will be peer reviewed by at least two
anonymous referees. Authors are advised to ensure that
they have conformed to JAOR's script requirements detailed
at http://www.tadbir.ca/jaor/authors.htm.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Mini-Workshop "Phase Transition in Random Graphs", 20 Sept. 2013, TU Graz -- Call for Participation
We invite you to participate in
Mini-Workshop "Phase Transition in Random Graphs"
20th September 2013
Graz University of Technology, Austria
Plenary Speaker:
Oliver Riordan (University of Oxford)
Invited Speakers:
Oliver Cooley (Graz University of Technology)
Charilaos Efthymiou (Goethe University Frankfurt am Main)
Further details can be found at
http://www.math.tugraz.at/mathb/index.php?link=miniworkshop
**********************************************************
*
* 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/
*
**********************************************************
Mini-Workshop "Phase Transition in Random Graphs"
20th September 2013
Graz University of Technology, Austria
Plenary Speaker:
Oliver Riordan (University of Oxford)
Invited Speakers:
Oliver Cooley (Graz University of Technology)
Charilaos Efthymiou (Goethe University Frankfurt am Main)
Further details can be found at
http://www.math.tugraz.at/mathb/index.php?link=miniworkshop
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Sunday, September 1, 2013
[DMANET] CFP: SenseMine 2013 (co-located with SenSys'13)
[ ** Please excuse any duplicates you may receive ** ]
Note: Submission deadline fast approaching.
===============================================================
SenseMine 2013
First International Workshop on Sensing and Big Data Mining
in conjunction with SenSys 2013
November 14, 2013
Rome, Italy
Important Dates:
Submission deadline: September 6, 2013, 11:59 PM EDT
Notification of acceptance: October 10, 2013
Technical Program Committee Chairs:
Emiliano Miluzzo, AT&T Labs Research
Deepak S. Turaga, IBM Research
Technical Program Committee (Preliminary):
Deborah Estrin (Cornell)
Andrew Campbell (Dartmouth College)
Yanyong Zhang (Rutgers University)
Marco Conti (CNR Italy)
Immanuel Schweizer (Technische Universitat Darmstadt)
Jing Gao (SUNY Buffalo)
Wei Fan (Huawei)
Tarek Abdelzahar (UIUC)
Charu Aggarwal (IBM Research)
The numbers and modalities of digital information sources being captured
to monitor our traffic, weather, power, personal context, goods,
factories, utilities, ports, health, IT infrastructure, and social
networks, is continuing to grow at an incredible rate. Commercial,
government organizations, and individuals depend on the ability to
automatically mine data from different types of sensor platforms (from
large sensor networks to an individual's smartphone) in order to
monitor, alert, learn from, and in some cases affect and control our
surroundings.
The research involved in developing applications for these classes of
problems lies at the intersection of several diverse disciplines,
including sensing systems, signal processing, machine learning and data
mining, data management, and large-scale distributed systems - for both
online as well as offline analysis. †In this workshop, colocated with
AMC SenSys 2013, we will include state-of-the-art approaches and
technical solutions in the area of extracting knowledge, by mining data
from sensor networks in large-scale settings. The goal of the workshop
is to establish a new research community and a venue for researchers,
practitioners, and academics to present their results in these
disciplines. We expect this workshop to be a long-term, continued venue
for this research community, and to also lead to the setup of
appropriate special issues and journals.
As part of this workshop, we will include both peer-reviewed and invited
papers. All accepted papers will be included in the workshop proceedings
and the ACM digital library. Original contributions, previously
unpublished, and not currently under review by another journal or
conference, are solicited in relevant areas, including, but not limited
to:
* Mining data from large-scale sensor networks and smartphone sensing
deployments
- Distributed, parallel, and scalable mining algorithms
- Multi-modal mining algorithms
- Resource-adaptive (power, network, compute) mining
- Handling sparsely sampled data, noisy, and untrustworthy data
- Mining big data collected from large-scale smartphone sensing
deployments
- Supporting visualization and user interaction
* Distributed Processing for Sensor
- Network Data Distributed processing at edge and core of sensor
network
- Stream processing systems, Hadoop/MapReduce, cloud, cross-platform
computing
* Sensor Systems and Machine-to-Machine architecture Design
- Large-scale sensor networks and Machine-to-Machine architectures
- Smartphone sensing deployments for big data collection
* Novel Applications of Mining Sensor Network Data: Energy, Healthcare,
Security, Transportation, P2P Systems, Enterprise Environments, Social
Networks, Smartphones
Further Details: http://www2.research.att.com/sensemine2013/index.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/
*
**********************************************************
Note: Submission deadline fast approaching.
===============================================================
SenseMine 2013
First International Workshop on Sensing and Big Data Mining
in conjunction with SenSys 2013
November 14, 2013
Rome, Italy
Important Dates:
Submission deadline: September 6, 2013, 11:59 PM EDT
Notification of acceptance: October 10, 2013
Technical Program Committee Chairs:
Emiliano Miluzzo, AT&T Labs Research
Deepak S. Turaga, IBM Research
Technical Program Committee (Preliminary):
Deborah Estrin (Cornell)
Andrew Campbell (Dartmouth College)
Yanyong Zhang (Rutgers University)
Marco Conti (CNR Italy)
Immanuel Schweizer (Technische Universitat Darmstadt)
Jing Gao (SUNY Buffalo)
Wei Fan (Huawei)
Tarek Abdelzahar (UIUC)
Charu Aggarwal (IBM Research)
The numbers and modalities of digital information sources being captured
to monitor our traffic, weather, power, personal context, goods,
factories, utilities, ports, health, IT infrastructure, and social
networks, is continuing to grow at an incredible rate. Commercial,
government organizations, and individuals depend on the ability to
automatically mine data from different types of sensor platforms (from
large sensor networks to an individual's smartphone) in order to
monitor, alert, learn from, and in some cases affect and control our
surroundings.
The research involved in developing applications for these classes of
problems lies at the intersection of several diverse disciplines,
including sensing systems, signal processing, machine learning and data
mining, data management, and large-scale distributed systems - for both
online as well as offline analysis. †In this workshop, colocated with
AMC SenSys 2013, we will include state-of-the-art approaches and
technical solutions in the area of extracting knowledge, by mining data
from sensor networks in large-scale settings. The goal of the workshop
is to establish a new research community and a venue for researchers,
practitioners, and academics to present their results in these
disciplines. We expect this workshop to be a long-term, continued venue
for this research community, and to also lead to the setup of
appropriate special issues and journals.
As part of this workshop, we will include both peer-reviewed and invited
papers. All accepted papers will be included in the workshop proceedings
and the ACM digital library. Original contributions, previously
unpublished, and not currently under review by another journal or
conference, are solicited in relevant areas, including, but not limited
to:
* Mining data from large-scale sensor networks and smartphone sensing
deployments
- Distributed, parallel, and scalable mining algorithms
- Multi-modal mining algorithms
- Resource-adaptive (power, network, compute) mining
- Handling sparsely sampled data, noisy, and untrustworthy data
- Mining big data collected from large-scale smartphone sensing
deployments
- Supporting visualization and user interaction
* Distributed Processing for Sensor
- Network Data Distributed processing at edge and core of sensor
network
- Stream processing systems, Hadoop/MapReduce, cloud, cross-platform
computing
* Sensor Systems and Machine-to-Machine architecture Design
- Large-scale sensor networks and Machine-to-Machine architectures
- Smartphone sensing deployments for big data collection
* Novel Applications of Mining Sensor Network Data: Energy, Healthcare,
Security, Transportation, P2P Systems, Enterprise Environments, Social
Networks, Smartphones
Further Details: http://www2.research.att.com/sensemine2013/index.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] Utrecht Graphs Workshop, 31/10 & 1/11, a preliminary announcement
We are pleased to announce a workshop in graph theory to be held on
Thursday, 31 October and Friday, 1 November 2013. It will take place
in Utrecht, an ancient and beautiful city in the heart of the
Netherlands.
We anticipate an exciting programme. The provisional speakers list
includes Maria Axenovich (Karlsruhe), Aart Blokhuis (Eindhoven), Hajo
Broersma (Twente), Louis Esperet (CNRS), Tom Kaiser (West Bohemia),
Dan Král' (Warwick), Alex Scott (Oxford), Benny Sudakov (UCLA/ETH),
and Carsten Thomassen (DTU).
A limited number of slots for contributed talks will be made
available. Prospective participants are kindly asked to register their
interest by email to ross.kang@gmail.com. More information on the
event at http://www.staff.science.uu.nl/~Kang0002/UGW2013.html
Sincerely yours,
the organisers,
Ross Kang and Tobias Müller
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Thursday, 31 October and Friday, 1 November 2013. It will take place
in Utrecht, an ancient and beautiful city in the heart of the
Netherlands.
We anticipate an exciting programme. The provisional speakers list
includes Maria Axenovich (Karlsruhe), Aart Blokhuis (Eindhoven), Hajo
Broersma (Twente), Louis Esperet (CNRS), Tom Kaiser (West Bohemia),
Dan Král' (Warwick), Alex Scott (Oxford), Benny Sudakov (UCLA/ETH),
and Carsten Thomassen (DTU).
A limited number of slots for contributed talks will be made
available. Prospective participants are kindly asked to register their
interest by email to ross.kang@gmail.com. More information on the
event at http://www.staff.science.uu.nl/~Kang0002/UGW2013.html
Sincerely yours,
the organisers,
Ross Kang and Tobias Müller
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Friday, August 30, 2013
[DMANET] NIPS 2013 Workshop on Greedy Algorithms, Frank-Wolfe and Friends - Call for Contributions
We invite contributions to the first
International Workshop on
Greedy Algorithms, Frank-Wolfe and Friends - A modern perspective,
to be held as a part of the
26th Annual Conference on Neural Information Processing Systems
(NIPS 2013),
December 9 or 10, 2013, Lake Tahoe, Nevada, USA.
Website: http://sites.google.com/site/nips13greedyfrankwolfe/
Submission Deadline: 16th October 2013
__________________________________
The exciting program includes plenary talks by:
Francis Bach, ENS and INRIA, Paris
Arkadi Nemirovski, Georgia Tech (TBC)
Benjamin Recht, UC Berkeley
Shai Shalev-Shwartz, Hebrew University Jerusalem
Vladimir Temlyakov, University of South Carolina
Overview
-------------
Greedy algorithms and projection-free first-order optimization
algorithms are at the core of many of the state of the art sparse
methods in machine learning, signal processing, harmonic analysis,
statistics and other seemingly unrelated areas, with different goals
at first sight. Examples include matching pursuit, boosting, greedy
methods for sub-modular optimization, with applications ranging from
large-scale structured prediction to recommender systems. In the field
of optimization, the recent renewed interest in
Frank-Wolfe/conditional gradient algorithms opens up an interesting
perspective towards a unified understanding of these methods, with a
big potential to translate the rich existing knowledge about the
respective greedy methods between the different fields.
The goal of this workshop is to take a step towards building a modern
and consistent perspective on these related algorithms. The workshop
will gather renowned experts working on those algorithms in machine
learning, optimization, signal processing, statistics and harmonic
analysis, in order to engender a fruitful exchange of ideas and
discussions and to push further the boundaries of scalable and
efficient optimization for learning problems.
Scope
--------------
The main topics are, including, but not limited to:
* Convex Optimization
- Sparse greedy methods
- Sparse first and second order optimization
- Frank-Wolfe / conditional gradient type methods
- Extensions to non-smooth or special problem classes
- Acceleration techniques
- Theoretical convergence rates
* Sparse Methods in Signal Processing
- Atomic decompositions
- Matching pursuit and OMP
- Forward / backward selection methods
- Sparse recovery algorithms
* Statistics and Machine Learning
- Boosting methods
- Graphical model selection
- Sparse methods
* Linear algebra and Matrix analysis
- Matrix and tensor factorizations
- Sparse and low-rank matrix optimization problems
* Harmonic Analysis
- Greedy methods
- Sparse approximation
* Applications
- Empirical comparisons and applications of related methods
Special focus will be given to papers tackling "big data" problems.
Submission
------------------
We encourage attendees for contribution of an extended abstract (up to
4 pages using NIPS style). Abstracts should be sent via EasyChair
https://www.easychair.org/conferences/?conf=greedy2013
Accepted submissions will be presented as short talks or posters.
Important Dates
-------------------------
October 16 - Deadline for submission
October 30 - Notification of acceptance
December 9 or 10 (TBD) - Workshop day
Organizers
----------------
Zaid Harchaoui, INRIA Grenoble (France)
Martin Jaggi, Simons Institute, Berkeley (USA)
Federico Pierucci, LJK lab, Grenoble (France)
If you have any questions or comments please send an e-mail to
nips.greedy.2013@gmail.com
Website
---------------
http://sites.google.com/site/nips13greedyfrankwolfe/
**********************************************************
*
* 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/
*
**********************************************************
International Workshop on
Greedy Algorithms, Frank-Wolfe and Friends - A modern perspective,
to be held as a part of the
26th Annual Conference on Neural Information Processing Systems
(NIPS 2013),
December 9 or 10, 2013, Lake Tahoe, Nevada, USA.
Website: http://sites.google.com/site/nips13greedyfrankwolfe/
Submission Deadline: 16th October 2013
__________________________________
The exciting program includes plenary talks by:
Francis Bach, ENS and INRIA, Paris
Arkadi Nemirovski, Georgia Tech (TBC)
Benjamin Recht, UC Berkeley
Shai Shalev-Shwartz, Hebrew University Jerusalem
Vladimir Temlyakov, University of South Carolina
Overview
-------------
Greedy algorithms and projection-free first-order optimization
algorithms are at the core of many of the state of the art sparse
methods in machine learning, signal processing, harmonic analysis,
statistics and other seemingly unrelated areas, with different goals
at first sight. Examples include matching pursuit, boosting, greedy
methods for sub-modular optimization, with applications ranging from
large-scale structured prediction to recommender systems. In the field
of optimization, the recent renewed interest in
Frank-Wolfe/conditional gradient algorithms opens up an interesting
perspective towards a unified understanding of these methods, with a
big potential to translate the rich existing knowledge about the
respective greedy methods between the different fields.
The goal of this workshop is to take a step towards building a modern
and consistent perspective on these related algorithms. The workshop
will gather renowned experts working on those algorithms in machine
learning, optimization, signal processing, statistics and harmonic
analysis, in order to engender a fruitful exchange of ideas and
discussions and to push further the boundaries of scalable and
efficient optimization for learning problems.
Scope
--------------
The main topics are, including, but not limited to:
* Convex Optimization
- Sparse greedy methods
- Sparse first and second order optimization
- Frank-Wolfe / conditional gradient type methods
- Extensions to non-smooth or special problem classes
- Acceleration techniques
- Theoretical convergence rates
* Sparse Methods in Signal Processing
- Atomic decompositions
- Matching pursuit and OMP
- Forward / backward selection methods
- Sparse recovery algorithms
* Statistics and Machine Learning
- Boosting methods
- Graphical model selection
- Sparse methods
* Linear algebra and Matrix analysis
- Matrix and tensor factorizations
- Sparse and low-rank matrix optimization problems
* Harmonic Analysis
- Greedy methods
- Sparse approximation
* Applications
- Empirical comparisons and applications of related methods
Special focus will be given to papers tackling "big data" problems.
Submission
------------------
We encourage attendees for contribution of an extended abstract (up to
4 pages using NIPS style). Abstracts should be sent via EasyChair
https://www.easychair.org/conferences/?conf=greedy2013
Accepted submissions will be presented as short talks or posters.
Important Dates
-------------------------
October 16 - Deadline for submission
October 30 - Notification of acceptance
December 9 or 10 (TBD) - Workshop day
Organizers
----------------
Zaid Harchaoui, INRIA Grenoble (France)
Martin Jaggi, Simons Institute, Berkeley (USA)
Federico Pierucci, LJK lab, Grenoble (France)
If you have any questions or comments please send an e-mail to
nips.greedy.2013@gmail.com
Website
---------------
http://sites.google.com/site/nips13greedyfrankwolfe/
**********************************************************
*
* 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
