ISCO 2014 and Spring School in Stochastic Programming (1st announcement)
The 3rd International Symposium in Combinatorial Optimization (ISCO 2014) will take place in Lisbon, March 5-7 2014, in Campo Grande, Lisboa, Portugal.
ISCO is a biannual symposium whose aim is to gather researchers from combinatorial optimization and other related fields of operations research.
Conference Chairs: Luis Gouveia (Univ of Lisbon-CIO) and Ridha Mahjoub (University Paris-Dauphine)
Plenary Speakers: Matteo Fischetti (Univ. of Padova), Martin Grotschel (ZIB-Berlin) and Adam Letchford (University of Lancaster)
Abstract submission deadline: December 15, 2013
This symposium is preceded by a spring school titled "Stochastic Programs with Integer Variables: Theory, Algorithms, and Applications"
School lecturers - Rüdiger Schultz (University of Duisburg) and Jonas Schweiger (ZIB-Berlin)
For more information on the Symposium and School, see ISCO2014.fc.ul.pt.
The 12th INFORMS Telecommunications Conference (2014) will also be held from the 2nd to the 4th of March, just before ISCO 2014, also at Campo Grande, Lisbon.
See the registration (to be updated) on a reduced conference for people attending the two conferences.
**********************************************************
*
* 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, July 8, 2013
[DMANET] INFORMS Telecommunications 2014 - 1st announcement
INFORMS Telecommunications 2014 (www.informstelecom2014.fc.ul.pt<http://www.informstelecom2014.fc.ul.pt/>) - 1st announcement
The 12th INFORMS Telecommunications Conference will be held March 2 - 4, 2014 in Campo Grande, Lisboa, Portugal.
In the tradition of the previous conferences, the 12th Conference will focus on the theory and application of operations research and management science to problems in telecommunications, with particular emphasis on new and emerging technologies. The conference is organized by the INFORMS Technical Section on Telecommunications.
Conference chair: Luís Gouveia
Conference co-chairs: Maurício Resende and Youngho Lee
Plenary speakers: Thomas Bonald (Telecom Paris Tech), Martin Grötschel (Zuse Institut Berlin) and Guy Leduc (Université de Liège)
2014 Doctoral Dissertation Award for Operations Research in Telecommunications
Abstract submission: January 3rd, 2014
The 3rd International Symposium in Combinatorial Optimization (ISCO 2014) will also be held from the 5th to the 7th of March, just after the INFORMS Telecommunications Conference, also at Campo Grande, Lisbon.
See the registration (to be updated) on a reduced conference fee for attending both conferences.
**********************************************************
*
* 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 12th INFORMS Telecommunications Conference will be held March 2 - 4, 2014 in Campo Grande, Lisboa, Portugal.
In the tradition of the previous conferences, the 12th Conference will focus on the theory and application of operations research and management science to problems in telecommunications, with particular emphasis on new and emerging technologies. The conference is organized by the INFORMS Technical Section on Telecommunications.
Conference chair: Luís Gouveia
Conference co-chairs: Maurício Resende and Youngho Lee
Plenary speakers: Thomas Bonald (Telecom Paris Tech), Martin Grötschel (Zuse Institut Berlin) and Guy Leduc (Université de Liège)
2014 Doctoral Dissertation Award for Operations Research in Telecommunications
Abstract submission: January 3rd, 2014
The 3rd International Symposium in Combinatorial Optimization (ISCO 2014) will also be held from the 5th to the 7th of March, just after the INFORMS Telecommunications Conference, also at Campo Grande, Lisbon.
See the registration (to be updated) on a reduced conference fee for attending both conferences.
**********************************************************
*
* 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] Knowledge Transfer Partnership Research Assistant: Computational Modelling and Optimisation (Fixed-term)
Knowledge Transfer Partnership Research Assistant: Computational Modelling and Optimisation (Fixed-term)
Reference SCI1202x2
Closing Date Sunday, 4th August 2013
Job Type Research & Teaching
Department School of Computer Science
Salary £25000 to £27000 per annum, depending on skills and experience
Applicants are invited to apply for the above role which is a Knowledge Transfer Partnership (KTP) between the University of Nottingham (School of Computer Science) and Webroster Ltd. This project will focus on improving homecare workforce utilisation by developing an adaptable software optimisation engine to tackle workforce scheduling and routing. A software developer with skills and experience in computational modelling and optimisation is required to join our team to develop web-based optimisation software for Webroster Ltd.
This is an exciting opportunity for a graduate in Computer Science or related discipline to work in a dynamic commercial environment, with the benefit of access to academic research, supervision, support and advice. A comprehensive and tailored training and development package will enable the person appointed to meet the professional demands of the project and their personal aspirations.
The successful candidate will design and implement various software modules working in collaboration with other developers at the company while also interacting with the academic team at the University of Nottingham.
Candidates should have a good MSc degree, or equivalent, in Computer Science or a closely related discipline. BSc (or equivalent) graduates with skills and experience in computational modelling and optimisation are welcome to apply. The required knowledge and skills for this post include solving optimisation problems, programming tools such as C#, Visual Basic, Java, JavaScript, ASP.NET or similar and relational database design and SQL.
Candidates must have experience using techniques for solving optimisation problems, full development lifecycle from specifications through to testing and flexible problem solving skills to develop creative solutions to changes in a dynamic business. Candidates should also have excellent communication skills to deal with a variety of people at different levels.
This post will be offered on a fixed-term contract for a period of two years.
Knowledge Transfer Partnerships is a government funded technology transfer initiative that supports partnerships between business and universities, placing graduates on challenging, high profile projects. Further information is available at: http://www.ktponline.org.uk.
This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham.
This message has been checked for viruses but the contents of an attachment
may still contain software viruses which could damage your computer system, you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation.
**********************************************************
*
* 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/
*
**********************************************************
Reference SCI1202x2
Closing Date Sunday, 4th August 2013
Job Type Research & Teaching
Department School of Computer Science
Salary £25000 to £27000 per annum, depending on skills and experience
Applicants are invited to apply for the above role which is a Knowledge Transfer Partnership (KTP) between the University of Nottingham (School of Computer Science) and Webroster Ltd. This project will focus on improving homecare workforce utilisation by developing an adaptable software optimisation engine to tackle workforce scheduling and routing. A software developer with skills and experience in computational modelling and optimisation is required to join our team to develop web-based optimisation software for Webroster Ltd.
This is an exciting opportunity for a graduate in Computer Science or related discipline to work in a dynamic commercial environment, with the benefit of access to academic research, supervision, support and advice. A comprehensive and tailored training and development package will enable the person appointed to meet the professional demands of the project and their personal aspirations.
The successful candidate will design and implement various software modules working in collaboration with other developers at the company while also interacting with the academic team at the University of Nottingham.
Candidates should have a good MSc degree, or equivalent, in Computer Science or a closely related discipline. BSc (or equivalent) graduates with skills and experience in computational modelling and optimisation are welcome to apply. The required knowledge and skills for this post include solving optimisation problems, programming tools such as C#, Visual Basic, Java, JavaScript, ASP.NET or similar and relational database design and SQL.
Candidates must have experience using techniques for solving optimisation problems, full development lifecycle from specifications through to testing and flexible problem solving skills to develop creative solutions to changes in a dynamic business. Candidates should also have excellent communication skills to deal with a variety of people at different levels.
This post will be offered on a fixed-term contract for a period of two years.
Knowledge Transfer Partnerships is a government funded technology transfer initiative that supports partnerships between business and universities, placing graduates on challenging, high profile projects. Further information is available at: http://www.ktponline.org.uk.
This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham.
This message has been checked for viruses but the contents of an attachment
may still contain software viruses which could damage your computer system, you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation.
**********************************************************
*
* 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, July 7, 2013
[DMANET] tenure track positions Optimization
Two tenure-track assistant professor positions at Delft
University of Technology
The Optimization section of Delft Institute of Applied Mathematics
invites applications for two full-time, tenure-track positions.
The successful candidate will have demonstrated excellence in
research and preferably some experience in teaching, and will
participate in both research and teaching activities. The
teaching activities will involve guidance of MSc and BSc projects,
teaching existing courses, and development of new courses. The
candidate will also participate in acquiring externally funded
research projects. The area of research can be any area of
deterministic optimization.
This vacancy is part of an incentive in which twelve tenure-track
positions in mathematics will become available at Dutch universities
and research institutes. This is made possible by the Ministry of
Education, Culture and Science via the Netherlands Organisation for
Scientific Research (NWO). For more information, please visit
http://www.nwo.nl/math.
For more details on job conditions and how to apply, go to
http://www.tudelft.nl/en/about-tu-delft/working-at-tu-delft/
Choose the following options subsequently in the left margin menu:
Jobs
Academic jobs
Professors
Then, scroll down for Mathematics.
Karen Aardal
**********************************************************
*
* 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
The Optimization section of Delft Institute of Applied Mathematics
invites applications for two full-time, tenure-track positions.
The successful candidate will have demonstrated excellence in
research and preferably some experience in teaching, and will
participate in both research and teaching activities. The
teaching activities will involve guidance of MSc and BSc projects,
teaching existing courses, and development of new courses. The
candidate will also participate in acquiring externally funded
research projects. The area of research can be any area of
deterministic optimization.
This vacancy is part of an incentive in which twelve tenure-track
positions in mathematics will become available at Dutch universities
and research institutes. This is made possible by the Ministry of
Education, Culture and Science via the Netherlands Organisation for
Scientific Research (NWO). For more information, please visit
http://www.nwo.nl/math.
For more details on job conditions and how to apply, go to
http://www.tudelft.nl/en/about-tu-delft/working-at-tu-delft/
Choose the following options subsequently in the left margin menu:
Jobs
Academic jobs
Professors
Then, scroll down for Mathematics.
Karen Aardal
**********************************************************
*
* 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, July 6, 2013
[DMANET] 2 post-docs positions at IT University of Copenhagen in Verification of Highly Configurable Software Systems
Two projects, VARIES and VARIETE, seek excellent post-doc candidates to
work on analysis methods for code and models found in highly
configurable software systems (software product lines).
work on analysis methods for code and models found in highly
configurable software systems (software product lines).
The objectives are to work on extensions of model checking and static
analysis techniques for verification of software systems implemented
using model transformations.
An ideal candidate has a solid background in semantics of programming
languages and in algorithmic verification techniques (model checking,
type checking, static analysis, satisfiability solving), combined with
appreciation for solving problems stemming from practice of software
development.
Both projects develop theories as well as tools. We are particularly
interested in applicants with good research potential, oriented at
publishing, interested in developing research independence and in
working with PhD and MSc students.
VARIETE is a highly prestigious research project awarded by the Danish
Independent Research Council, within the Sapere Aude program.
VARIES is a consortium of about 20 European partners, a mixture of high
profile academic partners, research labs and companies developing
safety-critical embedded or modeling tools. VARIES is funded by European
Commission and national governments via the ARTEMIS Joint Undertaking.
There are two openings: 36 months (mixed VARIES and VARIETE), and 19
months (VARIES); either with possibility of extension by another 6
months. Expected starting date is October 1st, 2013.
The post-docs will be given opportunity to collaborate with the MTLAB
Research Centre as well (www.mtlab.dk).
More information is available at
(or http://itu.dk/en/Om-IT-Universitetet/stillinger and choose post.doc
to VARIES and VARIETE)
Application deadline: 4th August, 2013 at 23.59 CET.
You must apply via the above website. You are encouraged to contact the
project leader at wasowski@itu.dk before applying.
Please spread this announcement to interested parties. Thank you.
--
associate prof. Andrzej Wąsowski, http://www.itu.dk/~wasowski
IT University, Rued Langgaards Vej 7, 2300 Copenhagen, Denmark
room 4D10 phone +45 7218 5086 fax *5001 skype wasowski_andrzej
**********************************************************
*
* 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/
*
**********************************************************
Three Phd Studentships at Department of Computer Science University of Leicester
The department of computer science at the university of Leicester (UK) is offering 3 Graduate Teaching Assistant (GTA) positions.
These are 4 year PhD studentships with some teaching obligations.
Studentships are funded (at the European level) and include a stipend.
Further details are available at:
http://www2.le.ac.uk/study/research/funding/computerscience-gta
These are 4 year PhD studentships with some teaching obligations.
Studentships are funded (at the European level) and include a stipend.
Further details are available at:
http://www2.le.ac.uk/study/research/funding/computerscience-gta
Friday, July 5, 2013
MobiCom 2013: Announcing the First MobiCom Mobile App Competition
Dear Colleagues,
MobiCom is introducing the Mobile App competition this year. Please read the details bellow and notice the first deadline is July 26th
Apologies for the multiple posting
Announcing the First MobiCom Mobile App Competition.
http://www.sigmobile.org/mobicom/2013/app.html
MobiCom 2013 is pleased to organize the first Mobile App competition in conjunction with the main conference. The competition is for novel and innovative mobile applications utilizing any computing architecture (stand-alone, client/server, client/proxy/server, peer-to-peer/ad-hoc, cloud/mobile, others). It is intended as a platform-neutral Contest. Applications can be developed for, but not limited to, Android, iOS, Windows Phone, Blackberry OS 10 and HTML5.
The competition consists of three phases. First you submit your app idea, and if invited to proceed, you submit your app for evaluation and selection as Finalists. Only Finalists advance to enter the third and last phase of selecting the three top winners. More details about the requirements and rules for the three phases of this competition should be carefully read in thecompetition rules document.
All applications must be demonstrated on real devices. Network services that are part of the application should also be real services embodying no mock-up components.
Finalists are required to register and attend the conference in order to be considered by the jury for first, second and third place winners. Given the tight timeline of this competition, an exception will be granted in which late registration of entrants will be charged at early registration rates if needed.
For any further information, email: mobicom2013appoutlook.com with subject line "Inquiry"
Important Dates:
- App idea submission deadline: July 26, 2013
- Developed app submission deadline: September 6, 2013
----------------------
------------------------------
Pei Zhang
Associate Research Professor
Pei Zhang
Associate Research Professor
MobiCom 2013: Announcing the First MobiCom Mobile App Competition
Dear Colleagues,
MobiCom is introducing the Mobile App competition this year. Please read the details bellow and notice the first deadline is July 26th
Apologies for the multiple posting
Announcing the First MobiCom Mobile App Competition.
http://www.sigmobile.org/mobicom/2013/app.html
MobiCom 2013 is pleased to organize the first Mobile App competition in conjunction with the main conference. The competition is for novel and innovative mobile applications utilizing any computing architecture (stand-alone, client/server, client/proxy/server, peer-to-peer/ad-hoc, cloud/mobile, others). It is intended as a platform-neutral Contest. Applications can be developed for, but not limited to, Android, iOS, Windows Phone, Blackberry OS 10 and HTML5.
The competition consists of three phases. First you submit your app idea, and if invited to proceed, you submit your app for evaluation and selection as Finalists. Only Finalists advance to enter the third and last phase of selecting the three top winners. More details about the requirements and rules for the three phases of this competition should be carefully read in thecompetition rules document.
All applications must be demonstrated on real devices. Network services that are part of the application should also be real services embodying no mock-up components.
Finalists are required to register and attend the conference in order to be considered by the jury for first, second and third place winners. Given the tight timeline of this competition, an exception will be granted in which late registration of entrants will be charged at early registration rates if needed.
For any further information, email: mobicom2013appoutlook.com with subject line "Inquiry"
Important Dates:
- App idea submission deadline: July 26, 2013
- Developed app submission deadline: September 6, 2013
----------------------
------------------------------
Pei Zhang
Associate Research Professor
Pei Zhang
Associate Research Professor
MobiCom 2013: Call for NSF Student Travel Grant Applications
Dear Colleagues,
The NSF Student Travel Grant for MobiCom 2013 has just been announced. Please see the attached call for more detail.
Apologies for the multiple postings.
Grants are available only for full-time students attending US colleges and universities (not necessarily US citizens or permanent residents).
Please read the attached call carefully for important instructions about the grant application process and requirements.
Call for Travel Grant Applications
NSF Student Travel Grants for ACM MobiCom 2013
Application Deadline: 11:55pm Eastern Standard Time, August 19, 2013
The 19th Annual International Conference on Mobile Computing and Networking (MobiCom 2013) is pleased to announce travel grants for students to attend the conference and its co-located workshops to be held in Miami, Florida, Sept. 30 – Oct. 4, 2013. Funds for these travel grants are provided by a generous award from the National Science Foundation, USA.
Grants are available only for full-time students attending US colleges and universities (not necessarily US citizens or permanent residents).
Please read the attached call carefully for important instructions about the grant application process and requirements.
MobiCom 2013: Call for NSF Student Travel Grant Applications
Dear Colleagues,
The NSF Student Travel Grant for MobiCom 2013 has just been announced. Please see the attached call for more detail.
Apologies for the multiple postings.
Grants are available only for full-time students attending US colleges and universities (not necessarily US citizens or permanent residents).
Please read the attached call carefully for important instructions about the grant application process and requirements.
Call for Travel Grant Applications
NSF Student Travel Grants for ACM MobiCom 2013
Application Deadline: 11:55pm Eastern Standard Time, August 19, 2013
The 19th Annual International Conference on Mobile Computing and Networking (MobiCom 2013) is pleased to announce travel grants for students to attend the conference and its co-located workshops to be held in Miami, Florida, Sept. 30 – Oct. 4, 2013. Funds for these travel grants are provided by a generous award from the National Science Foundation, USA.
Grants are available only for full-time students attending US colleges and universities (not necessarily US citizens or permanent residents).
Please read the attached call carefully for important instructions about the grant application process and requirements.
GRAPHITE 2013: Final Call for Papers - Post-Proceedings
Second Workshop on GRAPH Inspection and Traversal Engineering (GRAPHITE 2013)
http://www.win.tue.nl/~awijs/graphite
Objectives
---------------
The topic of the GRAPHITE workshop is graph analysis in all its forms in computer science. Graphs are used to represent data in many application areas, and they are subjected to various computational algorithms in order to acquire the desired information. These graph algorithms tend to have common characteristics, such as duplicate detection to guarantee their termination, independent of their application domain. Over the past few years, it has been shown that the scalability of such algorithms can be dramatically improved by using, e.g., external memory, by exploiting parallel architectures, such as clusters, multi-core CPUs, and graphics processing units, and by using heuristics to guide the search. Novel techniques to further scale graph search algorithms, and new applications of graph search are within the scope of this workshop. Another topic of interest of the event is more related to the structural properties of graphs: which kind of graph characteristics are relevant for a particular application area, and how can these be measured? Finally, any novel way of using graphs for a particular application area is on topic. The goal of this event is to gather scientists from different communities, such as model checking, artificial intelligence planning, game playing, and algorithm engineering, who do research on graph search algorithms, such that awareness of each others' work is increased.
The workshop has been held as a satellite event of ETAPS 2013, the 16th edition of The European Joint Conferences on Theory and Practice of Software (ETAPS). ETAPS is a primary European forum for academic and industrial researchers working on topics relating to Software Science.
The current call is for submissions for the post-proceedings, which will contain the papers presented at the workshop in addition to the accepted submissions of the current call, and will be published in the second half of 2013. As such, authors of accepted papers will not be invited to present their work, but their papers will be included in the proceedings.
Workshop Specific Topics
------------------------------------
We encourage submission of works which include but are not limited to the following topics:
* Algorithms for the verification of hardware and software based on graph exploration (e.g. the computation of an explicit state space based on an implicit description)
* Application of graph based techniques originating in one application domain, applied on a problem in another domain (e.g. verification algorithms on artificial intelligence problems)
* Techniques to deal with potentially infinite graphs and infinite families of graphs
* Innovative or otherwise particularly significant case studies of applications of graph based methods
* Theoretical results on the limits and possibilities of graph based methods
* Parallel algorithms for graph exploration for distributed and shared memory systems (e.g. clusters, multi-core CPUs, GPGPUs)
* Graph algorithms in artificial intelligence; planning; game playing; social network analysis; biological network analysis, and similar
* Graph minimisation and abstraction techniques as a preprocessing step for analysis (e.g. bisimulation reduction, transitive reduction)
* Computation on graphs through graph transformation techniques
* I/O Efficient graph algorithms using external memory
Papers on applications and papers bridging multiple application domains are strongly encouraged. In addition, this call also encourages the submission of short papers, either presenting a new tool or new scientific results that can be described succinctly.
Solicited Contributions
-------------------------------
The submitted papers should contain original work which has not been submitted or accepted for publication elsewhere. Submissions should adhere to the EPTCS format. All accepted papers will be included in
the workshop proceedings.
We solicit two kinds of papers:
*Tool Papers or Short Technical Papers no longer than 7 pages. Tool papers should describe the contribution of a new tool, how it works, and how it is implemented. Experimental results are encouraged. Short technical papers are intended to succinctly present new scientific results related to the GRAPHITE topics.
*Full Technical Papers no longer than 15 pages.
Submission and Publication
--------------------------------------
Submission can be done via the Easy Chair web-based conference management system. (Follow the link from the workshop web page.) All papers will be peer reviewed.
The proceedings will appear in the Electronic Proceedings in Theoretical Computer Science (EPTCS) as post-proceedings.
Important Dates
----------------------
July 21, 2013, submission deadline
August 11, 2013, Notification of acceptance/rejection
August 25, 2013, Camera-ready version deadline
Organization
------------------
Anton Wijs (Eindhoven University of Technology, Netherlands)
Dragan Bosnacki (Eindhoven University of Technology, Netherlands)
Stefan Edelkamp (University of Bremen, Germany)
Programme Committee
---------------------------------
Henri Bal (VU University Amsterdam, The Netherlands)
Dragan Bosnacki (Eindhoven University of Technology, The Netherlands) (co-chair)
Alastair Donaldson (Imperial College London, England)
Stefan Edelkamp (University of Bremen, Germany) (co-chair)
Ansgar Fehnker (The University of the South Pacific, Fiji)
Wan Fokkink (VU University Amsterdam, The Netherlands)
Keijo Heljanko (Aalto University, Finland)
Gerard Holzmann (NASA / Jet Propulsion Laboratory, USA)
Gunnar Klau (Centrum Wiskunde & Informatica, The Netherlands)
Juan de Lara (Universidad Autónoma de Madrid, Spain)
Stefan Leue (University of Konstanz, Germany)
Ulrich Meyer (Goethe University Frankfurt am Main, Germany)
Jun Pang (Université du Luxembourg, Luxembourg)
David Parker (University of Birmingham, England)
Arend Rensink (University of Twente, The Netherlands)
Anton Wijs (Eindhoven University of Technology, The Netherlands) (co-chair)
http://www.win.tue.nl/~awijs/graphite
Objectives
---------------
The topic of the GRAPHITE workshop is graph analysis in all its forms in computer science. Graphs are used to represent data in many application areas, and they are subjected to various computational algorithms in order to acquire the desired information. These graph algorithms tend to have common characteristics, such as duplicate detection to guarantee their termination, independent of their application domain. Over the past few years, it has been shown that the scalability of such algorithms can be dramatically improved by using, e.g., external memory, by exploiting parallel architectures, such as clusters, multi-core CPUs, and graphics processing units, and by using heuristics to guide the search. Novel techniques to further scale graph search algorithms, and new applications of graph search are within the scope of this workshop. Another topic of interest of the event is more related to the structural properties of graphs: which kind of graph characteristics are relevant for a particular application area, and how can these be measured? Finally, any novel way of using graphs for a particular application area is on topic. The goal of this event is to gather scientists from different communities, such as model checking, artificial intelligence planning, game playing, and algorithm engineering, who do research on graph search algorithms, such that awareness of each others' work is increased.
The workshop has been held as a satellite event of ETAPS 2013, the 16th edition of The European Joint Conferences on Theory and Practice of Software (ETAPS). ETAPS is a primary European forum for academic and industrial researchers working on topics relating to Software Science.
The current call is for submissions for the post-proceedings, which will contain the papers presented at the workshop in addition to the accepted submissions of the current call, and will be published in the second half of 2013. As such, authors of accepted papers will not be invited to present their work, but their papers will be included in the proceedings.
Workshop Specific Topics
------------------------------------
We encourage submission of works which include but are not limited to the following topics:
* Algorithms for the verification of hardware and software based on graph exploration (e.g. the computation of an explicit state space based on an implicit description)
* Application of graph based techniques originating in one application domain, applied on a problem in another domain (e.g. verification algorithms on artificial intelligence problems)
* Techniques to deal with potentially infinite graphs and infinite families of graphs
* Innovative or otherwise particularly significant case studies of applications of graph based methods
* Theoretical results on the limits and possibilities of graph based methods
* Parallel algorithms for graph exploration for distributed and shared memory systems (e.g. clusters, multi-core CPUs, GPGPUs)
* Graph algorithms in artificial intelligence; planning; game playing; social network analysis; biological network analysis, and similar
* Graph minimisation and abstraction techniques as a preprocessing step for analysis (e.g. bisimulation reduction, transitive reduction)
* Computation on graphs through graph transformation techniques
* I/O Efficient graph algorithms using external memory
Papers on applications and papers bridging multiple application domains are strongly encouraged. In addition, this call also encourages the submission of short papers, either presenting a new tool or new scientific results that can be described succinctly.
Solicited Contributions
-------------------------------
The submitted papers should contain original work which has not been submitted or accepted for publication elsewhere. Submissions should adhere to the EPTCS format. All accepted papers will be included in
the workshop proceedings.
We solicit two kinds of papers:
*Tool Papers or Short Technical Papers no longer than 7 pages. Tool papers should describe the contribution of a new tool, how it works, and how it is implemented. Experimental results are encouraged. Short technical papers are intended to succinctly present new scientific results related to the GRAPHITE topics.
*Full Technical Papers no longer than 15 pages.
Submission and Publication
--------------------------------------
Submission can be done via the Easy Chair web-based conference management system. (Follow the link from the workshop web page.) All papers will be peer reviewed.
The proceedings will appear in the Electronic Proceedings in Theoretical Computer Science (EPTCS) as post-proceedings.
Important Dates
----------------------
July 21, 2013, submission deadline
August 11, 2013, Notification of acceptance/rejection
August 25, 2013, Camera-ready version deadline
Organization
------------------
Anton Wijs (Eindhoven University of Technology, Netherlands)
Dragan Bosnacki (Eindhoven University of Technology, Netherlands)
Stefan Edelkamp (University of Bremen, Germany)
Programme Committee
---------------------------------
Henri Bal (VU University Amsterdam, The Netherlands)
Dragan Bosnacki (Eindhoven University of Technology, The Netherlands) (co-chair)
Alastair Donaldson (Imperial College London, England)
Stefan Edelkamp (University of Bremen, Germany) (co-chair)
Ansgar Fehnker (The University of the South Pacific, Fiji)
Wan Fokkink (VU University Amsterdam, The Netherlands)
Keijo Heljanko (Aalto University, Finland)
Gerard Holzmann (NASA / Jet Propulsion Laboratory, USA)
Gunnar Klau (Centrum Wiskunde & Informatica, The Netherlands)
Juan de Lara (Universidad Autónoma de Madrid, Spain)
Stefan Leue (University of Konstanz, Germany)
Ulrich Meyer (Goethe University Frankfurt am Main, Germany)
Jun Pang (Université du Luxembourg, Luxembourg)
David Parker (University of Birmingham, England)
Arend Rensink (University of Twente, The Netherlands)
Anton Wijs (Eindhoven University of Technology, The Netherlands) (co-chair)
[DMANET] GRAPHITE 2013: Final Call for Papers - Post-Proceedings
Second Workshop on GRAPH Inspection and Traversal Engineering (GRAPHITE 2013)
http://www.win.tue.nl/~awijs/graphite
Objectives
--------------
The topic of the GRAPHITE workshop is graph analysis in all its forms in computer science. Graphs are used to represent data in many application areas, and they are subjected to various computational algorithms in order to acquire the desired information. These graph algorithms tend to have common characteristics, such as duplicate detection to guarantee their termination, independent of their application domain. Over the past few years, it has been shown that the scalability of such algorithms can be dramatically improved by using, e.g., external memory, by exploiting parallel architectures, such as clusters, multi-core CPUs, and graphics processing units, and by using heuristics to guide the search. Novel techniques to further scale graph search algorithms, and new applications of graph search are within the scope of this workshop. Another topic of interest of the event is more related to the structural properties of graphs: which kind of graph characteristics are relevant for a particular application area, and how can these be measured? Finally, any novel way of using graphs for a particular application area is on topic. The goal of this event is to gather scientists from different communities, such as model checking, artificial intelligence planning, game playing, and algorithm engineering, who do research on graph search algorithms, such that awareness of each others' work is increased.
The workshop has been held as a satellite event of ETAPS 2013, the 16th edition of The European Joint Conferences on Theory and Practice of Software (ETAPS). ETAPS is a primary European forum for academic and industrial researchers working on topics relating to Software Science.
The current call is for submissions for the post-proceedings, which will contain the papers presented at the workshop in addition to the accepted submissions of the current call, and will be published in the second half of 2013. As such, authors of accepted papers will not be invited to present their work, but their papers will be included in the proceedings.
Workshop Specific Topics
------------------------------------
We encourage submission of works which include but are not limited to the following topics:
* Algorithms for the verification of hardware and software based on graph exploration (e.g. the computation of an explicit state space based on an implicit description)
* Application of graph based techniques originating in one application domain, applied on a problem in another domain (e.g. verification algorithms on artificial intelligence problems)
* Techniques to deal with potentially infinite graphs and infinite families of graphs
* Innovative or otherwise particularly significant case studies of applications of graph based methods
* Theoretical results on the limits and possibilities of graph based methods
* Parallel algorithms for graph exploration for distributed and shared memory systems (e.g. clusters, multi-core CPUs, GPGPUs)
* Graph algorithms in artificial intelligence; planning; game playing; social network analysis; biological network analysis, and similar
* Graph minimisation and abstraction techniques as a preprocessing step for analysis (e.g. bisimulation reduction, transitive reduction)
* Computation on graphs through graph transformation techniques
* I/O Efficient graph algorithms using external memory
Papers on applications and papers bridging multiple application domains are strongly encouraged. In addition, this call also encourages the submission of short papers, either presenting a new tool or new scientific results that can be described succinctly.
Solicited Contributions
-------------------------------
The submitted papers should contain original work which has not been submitted or accepted for publication elsewhere. Submissions should adhere to the EPTCS format. All accepted papers will be included in
the workshop proceedings.
We solicit two kinds of papers:
* Tool Papers or Short Technical Papers no longer than 7 pages. Tool papers should describe the contribution of a new tool, how it works, and how it is implemented. Experimental results are encouraged. Short technical papers are intended to succinctly present new scientific results related to the GRAPHITE topics.
* Full Technical Papers no longer than 15 pages.
Submission and Publication
--------------------------------------
Submission can be done via the Easy Chair web-based conference management system. (Follow the link from the workshop web page.) All papers will be peer reviewed.
The proceedings will appear in the Electronic Proceedings in Theoretical Computer Science (EPTCS) as post-proceedings.
Important Dates
----------------------
July 21, 2013, submission deadline
August 11, 2013, Notification of acceptance/rejection
August 25, 2013, Camera-ready version deadline
Organization
------------------
Anton Wijs (Eindhoven University of Technology, Netherlands)
Dragan Bosnacki (Eindhoven University of Technology, Netherlands)
Stefan Edelkamp (University of Bremen, Germany)
Programme Committee
--------------------------------
Henri Bal (VU University Amsterdam, The Netherlands)
Dragan Bosnacki (Eindhoven University of Technology, The Netherlands) (co-chair)
Alastair Donaldson (Imperial College London, England)
Stefan Edelkamp (University of Bremen, Germany) (co-chair)
Ansgar Fehnker (The University of the South Pacific, Fiji)
Wan Fokkink (VU University Amsterdam, The Netherlands)
Keijo Heljanko (Aalto University, Finland)
Gerard Holzmann (NASA / Jet Propulsion Laboratory, USA)
Gunnar Klau (Centrum Wiskunde & Informatica, The Netherlands)
Juan de Lara (Universidad Autónoma de Madrid, Spain)
Stefan Leue (University of Konstanz, Germany)
Ulrich Meyer (Goethe University Frankfurt am Main, Germany)
Jun Pang (Université du Luxembourg, Luxembourg)
David Parker (University of Birmingham, England)
Arend Rensink (University of Twente, The Netherlands)
Anton Wijs (Eindhoven University of Technology, The Netherlands) (co-chair)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
http://www.win.tue.nl/~awijs/graphite
Objectives
--------------
The topic of the GRAPHITE workshop is graph analysis in all its forms in computer science. Graphs are used to represent data in many application areas, and they are subjected to various computational algorithms in order to acquire the desired information. These graph algorithms tend to have common characteristics, such as duplicate detection to guarantee their termination, independent of their application domain. Over the past few years, it has been shown that the scalability of such algorithms can be dramatically improved by using, e.g., external memory, by exploiting parallel architectures, such as clusters, multi-core CPUs, and graphics processing units, and by using heuristics to guide the search. Novel techniques to further scale graph search algorithms, and new applications of graph search are within the scope of this workshop. Another topic of interest of the event is more related to the structural properties of graphs: which kind of graph characteristics are relevant for a particular application area, and how can these be measured? Finally, any novel way of using graphs for a particular application area is on topic. The goal of this event is to gather scientists from different communities, such as model checking, artificial intelligence planning, game playing, and algorithm engineering, who do research on graph search algorithms, such that awareness of each others' work is increased.
The workshop has been held as a satellite event of ETAPS 2013, the 16th edition of The European Joint Conferences on Theory and Practice of Software (ETAPS). ETAPS is a primary European forum for academic and industrial researchers working on topics relating to Software Science.
The current call is for submissions for the post-proceedings, which will contain the papers presented at the workshop in addition to the accepted submissions of the current call, and will be published in the second half of 2013. As such, authors of accepted papers will not be invited to present their work, but their papers will be included in the proceedings.
Workshop Specific Topics
------------------------------------
We encourage submission of works which include but are not limited to the following topics:
* Algorithms for the verification of hardware and software based on graph exploration (e.g. the computation of an explicit state space based on an implicit description)
* Application of graph based techniques originating in one application domain, applied on a problem in another domain (e.g. verification algorithms on artificial intelligence problems)
* Techniques to deal with potentially infinite graphs and infinite families of graphs
* Innovative or otherwise particularly significant case studies of applications of graph based methods
* Theoretical results on the limits and possibilities of graph based methods
* Parallel algorithms for graph exploration for distributed and shared memory systems (e.g. clusters, multi-core CPUs, GPGPUs)
* Graph algorithms in artificial intelligence; planning; game playing; social network analysis; biological network analysis, and similar
* Graph minimisation and abstraction techniques as a preprocessing step for analysis (e.g. bisimulation reduction, transitive reduction)
* Computation on graphs through graph transformation techniques
* I/O Efficient graph algorithms using external memory
Papers on applications and papers bridging multiple application domains are strongly encouraged. In addition, this call also encourages the submission of short papers, either presenting a new tool or new scientific results that can be described succinctly.
Solicited Contributions
-------------------------------
The submitted papers should contain original work which has not been submitted or accepted for publication elsewhere. Submissions should adhere to the EPTCS format. All accepted papers will be included in
the workshop proceedings.
We solicit two kinds of papers:
* Tool Papers or Short Technical Papers no longer than 7 pages. Tool papers should describe the contribution of a new tool, how it works, and how it is implemented. Experimental results are encouraged. Short technical papers are intended to succinctly present new scientific results related to the GRAPHITE topics.
* Full Technical Papers no longer than 15 pages.
Submission and Publication
--------------------------------------
Submission can be done via the Easy Chair web-based conference management system. (Follow the link from the workshop web page.) All papers will be peer reviewed.
The proceedings will appear in the Electronic Proceedings in Theoretical Computer Science (EPTCS) as post-proceedings.
Important Dates
----------------------
July 21, 2013, submission deadline
August 11, 2013, Notification of acceptance/rejection
August 25, 2013, Camera-ready version deadline
Organization
------------------
Anton Wijs (Eindhoven University of Technology, Netherlands)
Dragan Bosnacki (Eindhoven University of Technology, Netherlands)
Stefan Edelkamp (University of Bremen, Germany)
Programme Committee
--------------------------------
Henri Bal (VU University Amsterdam, The Netherlands)
Dragan Bosnacki (Eindhoven University of Technology, The Netherlands) (co-chair)
Alastair Donaldson (Imperial College London, England)
Stefan Edelkamp (University of Bremen, Germany) (co-chair)
Ansgar Fehnker (The University of the South Pacific, Fiji)
Wan Fokkink (VU University Amsterdam, The Netherlands)
Keijo Heljanko (Aalto University, Finland)
Gerard Holzmann (NASA / Jet Propulsion Laboratory, USA)
Gunnar Klau (Centrum Wiskunde & Informatica, The Netherlands)
Juan de Lara (Universidad Autónoma de Madrid, Spain)
Stefan Leue (University of Konstanz, Germany)
Ulrich Meyer (Goethe University Frankfurt am Main, Germany)
Jun Pang (Université du Luxembourg, Luxembourg)
David Parker (University of Birmingham, England)
Arend Rensink (University of Twente, The Netherlands)
Anton Wijs (Eindhoven University of Technology, The Netherlands) (co-chair)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] PostDoc in Approximation Algorithms at IDSIA, University of Lugano, Switzerland
The Algorithms and Complexity Group of IDSIA, University of Lugano
(Switzerland), opens one PostDoc position in approximation algorithms.
The
position is supported by the European Research Council Starting Grant
"New Approaches to Network Design".
The appointment is for up to 3 years, and it should tentatively start
in Autumn 2013. The salary is roughly 75.000 CHF per year (taxes
~20-25%). There are no teaching duties and there is a (very) generous
travel support. An ideal candidate should have (or be close to
obtaining) a Ph.D. in Computer Science or in a related area, and
should have a strong publication record in top Theoretical Computer
Science conferences such as STOC, FOCS, SODA, ICALP, ESA etc.
Further details about the position can be found at:
www.idsia.ch/~grandoni/ERC2010.html
Applicants should email a detailed CV, including a list of
publications and the email addresses of 3 references, to:
Prof. Fabrizio Grandoni, fabrizio@idsia.ch
The deadline for the application (with moderate flexibility) is August
31st, 2013.
For any question, do not hesitate to contact Prof. Grandoni.
**********************************************************
*
* 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/
*
**********************************************************
(Switzerland), opens one PostDoc position in approximation algorithms.
The
position is supported by the European Research Council Starting Grant
"New Approaches to Network Design".
The appointment is for up to 3 years, and it should tentatively start
in Autumn 2013. The salary is roughly 75.000 CHF per year (taxes
~20-25%). There are no teaching duties and there is a (very) generous
travel support. An ideal candidate should have (or be close to
obtaining) a Ph.D. in Computer Science or in a related area, and
should have a strong publication record in top Theoretical Computer
Science conferences such as STOC, FOCS, SODA, ICALP, ESA etc.
Further details about the position can be found at:
www.idsia.ch/~grandoni/ERC2010.html
Applicants should email a detailed CV, including a list of
publications and the email addresses of 3 references, to:
Prof. Fabrizio Grandoni, fabrizio@idsia.ch
The deadline for the application (with moderate flexibility) is August
31st, 2013.
For any question, do not hesitate to contact Prof. Grandoni.
**********************************************************
*
* 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, July 4, 2013
[DMANET] Book Announcement: Algorithmics of Matching Under Preferences
--- Book announcement ---
Title: Algorithmics of Matching Under Preferences
Author: David F Manlove (University of Glasgow, UK)
Series: Series on Theoretical Computer Science: Volume 2
Publisher: World Scientific
Date: April 2013
ISBN: 978-981-4425-24-7
URL: http://www.worldscientific.com/worldscibooks/10.1142/8591
--- About the book ---
Matching problems with preferences are all around us: they arise when
agents seek to be allocated to one another on the basis of ranked
preferences over potential outcomes. Efficient algorithms are needed
for producing matchings that optimise the satisfaction of the agents
according to their preference lists.
In recent years there has been a sharp increase in the study of
algorithmic aspects of matching problems with preferences, partly
reflecting the growing number of applications of these problems
worldwide. The importance of the research area was recognised in 2012
through the award of the Nobel Prize in Economic Sciences to Alvin
Roth and Lloyd Shapley.
This book describes the most important results in this area, providing
a timely update to The Stable Marriage Problem: Structure and
Algorithms (D Gusfield and R W Irving, MIT Press, 1989) in connection
with stable matching problems, whilst also broadening the scope to
include matching problems with preferences under a range of
alternative optimality criteria.
--- Sample material ---
Table of Contents:
http://www.worldscientific.com/doi/pdf/10.1142/9789814425254_fmatter
Foreword (by Kurt Mehlhorn):
http://www.worldscientific.com/doi/suppl/10.1142/8591/suppl_file/8591_foreword.pdf
Chapter 1 (Preliminary definitions, results and motivation):
http://www.worldscientific.com/doi/suppl/10.1142/8591/suppl_file/8591_chap01.pdf
--- Availability ---
Available in hardcover, e-book and kindle editions from on-line
booksellers such as Amazon.
**********************************************************
*
* 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/
*
**********************************************************
Title: Algorithmics of Matching Under Preferences
Author: David F Manlove (University of Glasgow, UK)
Series: Series on Theoretical Computer Science: Volume 2
Publisher: World Scientific
Date: April 2013
ISBN: 978-981-4425-24-7
URL: http://www.worldscientific.com/worldscibooks/10.1142/8591
--- About the book ---
Matching problems with preferences are all around us: they arise when
agents seek to be allocated to one another on the basis of ranked
preferences over potential outcomes. Efficient algorithms are needed
for producing matchings that optimise the satisfaction of the agents
according to their preference lists.
In recent years there has been a sharp increase in the study of
algorithmic aspects of matching problems with preferences, partly
reflecting the growing number of applications of these problems
worldwide. The importance of the research area was recognised in 2012
through the award of the Nobel Prize in Economic Sciences to Alvin
Roth and Lloyd Shapley.
This book describes the most important results in this area, providing
a timely update to The Stable Marriage Problem: Structure and
Algorithms (D Gusfield and R W Irving, MIT Press, 1989) in connection
with stable matching problems, whilst also broadening the scope to
include matching problems with preferences under a range of
alternative optimality criteria.
--- Sample material ---
Table of Contents:
http://www.worldscientific.com/doi/pdf/10.1142/9789814425254_fmatter
Foreword (by Kurt Mehlhorn):
http://www.worldscientific.com/doi/suppl/10.1142/8591/suppl_file/8591_foreword.pdf
Chapter 1 (Preliminary definitions, results and motivation):
http://www.worldscientific.com/doi/suppl/10.1142/8591/suppl_file/8591_chap01.pdf
--- Availability ---
Available in hardcover, e-book and kindle editions from on-line
booksellers such as Amazon.
**********************************************************
*
* 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 iOS and Adobe eBook editions for Graph Theory (R.Diestel)
I am pleased to announce several new eBook editions of my book, Graph Theory.
The English edition is now available
- as an iOS app for iPhones and iPads
- as an Adobe eBook for Computers (Mac and Windows) and tablets (Android and iOS)
- as an iBook for Macs and iOS devices
- as a personalized PDF that can be freely installed on any platform.
Its translations (Chinese, Japanese, Russian, German) are avialable
- from within the same iOS app as above
- as an Adobe eBook, as above
The eBook costs between EUR 4.50 and 15.00 depending on country and platform, or 0.89 per chapter (iOS app only). The prices for the iOS app and the personalized PDF include free updates to all future editions.
See the book's website,
http://diestel-graph-theory.com
for details. The free basic edition for online viewing also remains accessible from that site.
RD, 4 July 2013
PS. If anyone knows how to make a PDF-based Android app like the new iOS app, please get in touch...
**********************************************************
*
* 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 English edition is now available
- as an iOS app for iPhones and iPads
- as an Adobe eBook for Computers (Mac and Windows) and tablets (Android and iOS)
- as an iBook for Macs and iOS devices
- as a personalized PDF that can be freely installed on any platform.
Its translations (Chinese, Japanese, Russian, German) are avialable
- from within the same iOS app as above
- as an Adobe eBook, as above
The eBook costs between EUR 4.50 and 15.00 depending on country and platform, or 0.89 per chapter (iOS app only). The prices for the iOS app and the personalized PDF include free updates to all future editions.
See the book's website,
http://diestel-graph-theory.com
for details. The free basic edition for online viewing also remains accessible from that site.
RD, 4 July 2013
PS. If anyone knows how to make a PDF-based Android app like the new iOS app, please get in touch...
**********************************************************
*
* 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] EPSRC Studentship in Operational Research
There is a great opportunity at the Kent Business School for someone
looking to do a PhD in Operational Research.
Applications are due Sunday14 July.
Note that the studentship is restricted to students who have "settled
status" in the UK, including UK students and EU students who have lived
in the UK for 3 or more years.
Details of the studentship are provided below and can also be found in
the following link.
http://www.jobs.ac.uk/job/AGV692/epsrc-studentship-optimising-river-infrastructure-mitigation/
I would invite any interested candidates to contact me.
Sincerely,
Dr Jesse O'Hanley
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Dr. Jesse R. O'Hanley
Senior Lecturer in Envir. Systems Mgmt.
Management Science Group
Kent Business School, University of Kent
Canterbury, Kent CT2 7PE, United Kingdom
Office: +44 (0)1227 824286
Reception: +44 (0)1227 827726
Fax: +44 (0)1227 761187
Email: j.ohanley@kent.ac.uk
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
EPSRC STUDENTSHIP: OPTIMISING RIVER INFRASTRUCTURE MITIGATION
UNIVERSITY OF KENT
The Management Science group within Kent Business School invites
applications for a three-year EPSRC-funded PhD studentship. The
scholarship starts on 1/10/13 and includes tuition fees and a
maintenance grant of £13,590 (at 2012/13 rates)
The Management Science research group is a leading UK centre for
Operational Research and Systems Thinking and is a member of NATCOR.
ELIGIBILITY
Due to funding, this studentship competition is only open to applicants
who have settled status in the UK and no restrictions on how long they
can stay in the country. In addition, applicants must have been resident
in the UK for three years prior to the start of their scholarship. Other
EU students may apply on a fees only basis.
QUALIFICATIONS
Candidates must hold the following qualifications:
- A Distinction at MSc level in a quantitative subject (see project
descriptions for more details).
- Exceptional candidates with First at undergraduate level in a
quantitative subject (see project descriptions for more details) will
also be considered.
- Score of 7.0 in IELT test for students who are non-native English
speakers and who did not gain their academic qualifications in the UK.
PROJECT DESCRIPTION
The successful candidate will work on the formulation and solution of
optimisation models applied to river infrastructure mitigation under the
supervision of Dr Jesse O'Hanley. Potential areas of research include
mixed integer linear programming, stochastic and multi-objective
optimisation, decomposition methods and heuristic algorithms.
Candidates are required to have an excellent undergraduate Honours
degree in a quantitative subject such as Operational Research,
Mathematics, Statistics, Computer Science, Engineering or a closely
allied discipline. Good English communication skills, both oral and
written, are essential. Computer programming ability in C/C++, Java or
similar is highly desirable. Knowledge of optimisation techniques (in
particular integer programming) and/or optimisation software is
desirable but not essential.
HOW TO APPLY
Applicants should apply online as part of Kent Business School PhD
programme application. A research proposal is not needed for this scheme
but applicants should ensure that their application is complete (and
references have been received by Kent Business School) by the deadline,
as follows:
- CV
- A short statement in support of your application (maximum 500 words)
- Official transcripts of MSc and undergraduate degrees
- Two academic references from an institution where you have studied
- English qualifications obtained (if relevant)
DEADLINES
Applicants must apply for this scholarship online by 5pm (GMT) on Sunday
14 July 2013 and the application must be complete with all references
also received by this date.
For more information please contact Dr Jesse O'Hanley
(j.ohanley@kent.ac.uk), our admissions team PhDinfo@kent.ac.uk.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
looking to do a PhD in Operational Research.
Applications are due Sunday14 July.
Note that the studentship is restricted to students who have "settled
status" in the UK, including UK students and EU students who have lived
in the UK for 3 or more years.
Details of the studentship are provided below and can also be found in
the following link.
http://www.jobs.ac.uk/job/AGV692/epsrc-studentship-optimising-river-infrastructure-mitigation/
I would invite any interested candidates to contact me.
Sincerely,
Dr Jesse O'Hanley
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Dr. Jesse R. O'Hanley
Senior Lecturer in Envir. Systems Mgmt.
Management Science Group
Kent Business School, University of Kent
Canterbury, Kent CT2 7PE, United Kingdom
Office: +44 (0)1227 824286
Reception: +44 (0)1227 827726
Fax: +44 (0)1227 761187
Email: j.ohanley@kent.ac.uk
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
EPSRC STUDENTSHIP: OPTIMISING RIVER INFRASTRUCTURE MITIGATION
UNIVERSITY OF KENT
The Management Science group within Kent Business School invites
applications for a three-year EPSRC-funded PhD studentship. The
scholarship starts on 1/10/13 and includes tuition fees and a
maintenance grant of £13,590 (at 2012/13 rates)
The Management Science research group is a leading UK centre for
Operational Research and Systems Thinking and is a member of NATCOR.
ELIGIBILITY
Due to funding, this studentship competition is only open to applicants
who have settled status in the UK and no restrictions on how long they
can stay in the country. In addition, applicants must have been resident
in the UK for three years prior to the start of their scholarship. Other
EU students may apply on a fees only basis.
QUALIFICATIONS
Candidates must hold the following qualifications:
- A Distinction at MSc level in a quantitative subject (see project
descriptions for more details).
- Exceptional candidates with First at undergraduate level in a
quantitative subject (see project descriptions for more details) will
also be considered.
- Score of 7.0 in IELT test for students who are non-native English
speakers and who did not gain their academic qualifications in the UK.
PROJECT DESCRIPTION
The successful candidate will work on the formulation and solution of
optimisation models applied to river infrastructure mitigation under the
supervision of Dr Jesse O'Hanley. Potential areas of research include
mixed integer linear programming, stochastic and multi-objective
optimisation, decomposition methods and heuristic algorithms.
Candidates are required to have an excellent undergraduate Honours
degree in a quantitative subject such as Operational Research,
Mathematics, Statistics, Computer Science, Engineering or a closely
allied discipline. Good English communication skills, both oral and
written, are essential. Computer programming ability in C/C++, Java or
similar is highly desirable. Knowledge of optimisation techniques (in
particular integer programming) and/or optimisation software is
desirable but not essential.
HOW TO APPLY
Applicants should apply online as part of Kent Business School PhD
programme application. A research proposal is not needed for this scheme
but applicants should ensure that their application is complete (and
references have been received by Kent Business School) by the deadline,
as follows:
- CV
- A short statement in support of your application (maximum 500 words)
- Official transcripts of MSc and undergraduate degrees
- Two academic references from an institution where you have studied
- English qualifications obtained (if relevant)
DEADLINES
Applicants must apply for this scholarship online by 5pm (GMT) on Sunday
14 July 2013 and the application must be complete with all references
also received by this date.
For more information please contact Dr Jesse O'Hanley
(j.ohanley@kent.ac.uk), our admissions team PhDinfo@kent.ac.uk.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Wednesday, July 3, 2013
[DMANET] RTA'13 Proceedings published open access (LIPIcs,Vol.21)
= Book Announcement =
Title: 24th International Conference on Rewriting Techniques and
Applications (RTA 2013)
Editor: Femke van Raamsdonk
Series: LIPIcs (Leibniz International Proceedings in Informatics)
Volume: 21
Publisher: Schloss Dagstuhl - Dagstuhl Publishing
ISBN: 978-3-939897-53-8
== Access ==
Open access (online & free of charge) at
http://www.dagstuhl.de/dagpub/978-3-939897-53-8
You may also check the DBLP page at
http://dblp.uni-trier.de/db/conf/rta/rta2013.html
== About the Proceedings ==
RTA 2013 received 50 submissions from 16 countries. The programme
committee selected 20 regular papers and 1 system description for
presentation at the conference. The selection process greatly benefitted
from the conscientious and excellent work of in total 71 external
reviewers, some of whom reviewed more than one paper. The programme
committee selected the contributions Linear Logic and Strong
Normalization by Beniamino Accattoli and A Homotopical Completion
Procedure with Applications to Coherence of Monoids by Yves Guiraud,
Philippe Malbos, and Samuel Mimram together for the best paper award.
Jarkko Kari, Mitsuhiro Okada, and Simon Peyton Jones presented invited
talks at RTA 2013. The talk by Simon Peyton Jones was joint with TLCA
2013. It is a great pleasure to thank the invited speakers for enriching
the conference with their talks and their participation, and for their
contributions to the present proceedings.
See also:
* Frontmatter incl. table of contents and preface:
http://dx.doi.org/10.4230/LIPIcs.RTA.2013.i
== About the RTA conference ==
RTA is the major conference on rewriting and covers all aspects related
to rewriting such as termination, equational reasoning, theorem proving,
Lambda calculus, higher-order rewriting, unification, verification,
constraints, and software tools.
See also:
* http://rewriting.loria.fr/rta/
== About the LIPIcs Series ==
"LIPIcs: Leibniz International Proceedings in Informatics" is a series
of high-quality conference proceedings across all fields in informatics
established in cooperation with "Schloss Dagstuhl--Leibniz Center of
Informatics". LIPIcs volumes are published according to the principle
of OpenAccess, i.e., they are available online and free of charge.
See also:
* http://www.dagstuhl.de/lipics/
--
Dr. Marc Herbstritt
Schloss Dagstuhl - Leibniz Center for Informatics
\\\/ Dagstuhl Publishing | LIPIcs Editorial Office
Email: publishing@dagstuhl.de
http://www.dagstuhl.de/lipics
**********************************************************
*
* 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/
*
**********************************************************
Title: 24th International Conference on Rewriting Techniques and
Applications (RTA 2013)
Editor: Femke van Raamsdonk
Series: LIPIcs (Leibniz International Proceedings in Informatics)
Volume: 21
Publisher: Schloss Dagstuhl - Dagstuhl Publishing
ISBN: 978-3-939897-53-8
== Access ==
Open access (online & free of charge) at
http://www.dagstuhl.de/dagpub/978-3-939897-53-8
You may also check the DBLP page at
http://dblp.uni-trier.de/db/conf/rta/rta2013.html
== About the Proceedings ==
RTA 2013 received 50 submissions from 16 countries. The programme
committee selected 20 regular papers and 1 system description for
presentation at the conference. The selection process greatly benefitted
from the conscientious and excellent work of in total 71 external
reviewers, some of whom reviewed more than one paper. The programme
committee selected the contributions Linear Logic and Strong
Normalization by Beniamino Accattoli and A Homotopical Completion
Procedure with Applications to Coherence of Monoids by Yves Guiraud,
Philippe Malbos, and Samuel Mimram together for the best paper award.
Jarkko Kari, Mitsuhiro Okada, and Simon Peyton Jones presented invited
talks at RTA 2013. The talk by Simon Peyton Jones was joint with TLCA
2013. It is a great pleasure to thank the invited speakers for enriching
the conference with their talks and their participation, and for their
contributions to the present proceedings.
See also:
* Frontmatter incl. table of contents and preface:
http://dx.doi.org/10.4230/LIPIcs.RTA.2013.i
== About the RTA conference ==
RTA is the major conference on rewriting and covers all aspects related
to rewriting such as termination, equational reasoning, theorem proving,
Lambda calculus, higher-order rewriting, unification, verification,
constraints, and software tools.
See also:
* http://rewriting.loria.fr/rta/
== About the LIPIcs Series ==
"LIPIcs: Leibniz International Proceedings in Informatics" is a series
of high-quality conference proceedings across all fields in informatics
established in cooperation with "Schloss Dagstuhl--Leibniz Center of
Informatics". LIPIcs volumes are published according to the principle
of OpenAccess, i.e., they are available online and free of charge.
See also:
* http://www.dagstuhl.de/lipics/
--
Dr. Marc Herbstritt
Schloss Dagstuhl - Leibniz Center for Informatics
\\\/ Dagstuhl Publishing | LIPIcs Editorial Office
Email: publishing@dagstuhl.de
http://www.dagstuhl.de/lipics
**********************************************************
*
* 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] LMS-EPSRC short instructional course on random graphs, geometry and asymptotic structure (19-23 August 2013)
This is the final announcement of a short course on aspects of the theory of random structures that will take place at the School of Mathematics, University of Birmingham later this summer.
Title: LMS-EPSRC short instructional course on Random Graphs, Geometry and Asymptotic Structure
Dates: 19 - 23 August 2013
Venue: School of Mathematics, University of Birmingham
Lecturers: Michael Krivelevich (Tel Aviv University)
Konstantinos Panagiotou (Ludwig-Maximilians-Universität, München)
Mathew Penrose (University of Bath)
Special guest speaker: Colin McDiarmid (University of Oxford)
Organizers: Nikolaos Fountoulakis and Dan Hefetz (University of Birmingham)
Application deadline: 8 July 2013 (notification of acceptance will be sent within two weeks after the deadline)
The themes that will be covered by the lecturers are:
• Long paths and hamiltonicity in random graphs (M. Krivelevich, Tel Aviv University)
• Random graphs from restricted classes (K. Panagiotou, Ludwig-Maximilians-Universität)
• Random geometric graphs (M. D. Penrose, University of Bath)
Special guest lecture: Random planar graphs (C. McDiarmid, University of Oxford)
This short course is aimed at research students, post-docs and those working in industry. The number of participants is restricted and a successful application is necessary for an invitation. An application form can be found here: http://www.surveymonkey.com/s/3CDNQ6L
Registration fees:
UK-based students: £100
UK-based postdoctoral fellows: £250 (registration) + £150 (subsistence)
Everyone else: £250 (registration) + £300 (subsistence)
The above fees will cover accommodation costs as well as breakfasts, lunches and coffee breaks.
The objectives of this course are two-fold:
1. to provide an introduction to recent developments and techniques for classical problems in the theory of random graphs;
2. to cover geometric and topological aspects of the theory of random graphs and introduce participants to the diversity and the depth of the combinatorial, probabilistic and analytical methods that have been invented in this context.
Additional information can be found here: http://web.mat.bham.ac.uk/combinatorics/LMS-EPSRC/index.html
as well as through the LMS webpage: http://www.lms.ac.uk/events/forthcoming-short-courses
The generous financial support of the LMS and the EPSRC is kindly acknowledged.
**********************************************************
*
* 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/
*
**********************************************************
Title: LMS-EPSRC short instructional course on Random Graphs, Geometry and Asymptotic Structure
Dates: 19 - 23 August 2013
Venue: School of Mathematics, University of Birmingham
Lecturers: Michael Krivelevich (Tel Aviv University)
Konstantinos Panagiotou (Ludwig-Maximilians-Universität, München)
Mathew Penrose (University of Bath)
Special guest speaker: Colin McDiarmid (University of Oxford)
Organizers: Nikolaos Fountoulakis and Dan Hefetz (University of Birmingham)
Application deadline: 8 July 2013 (notification of acceptance will be sent within two weeks after the deadline)
The themes that will be covered by the lecturers are:
• Long paths and hamiltonicity in random graphs (M. Krivelevich, Tel Aviv University)
• Random graphs from restricted classes (K. Panagiotou, Ludwig-Maximilians-Universität)
• Random geometric graphs (M. D. Penrose, University of Bath)
Special guest lecture: Random planar graphs (C. McDiarmid, University of Oxford)
This short course is aimed at research students, post-docs and those working in industry. The number of participants is restricted and a successful application is necessary for an invitation. An application form can be found here: http://www.surveymonkey.com/s/3CDNQ6L
Registration fees:
UK-based students: £100
UK-based postdoctoral fellows: £250 (registration) + £150 (subsistence)
Everyone else: £250 (registration) + £300 (subsistence)
The above fees will cover accommodation costs as well as breakfasts, lunches and coffee breaks.
The objectives of this course are two-fold:
1. to provide an introduction to recent developments and techniques for classical problems in the theory of random graphs;
2. to cover geometric and topological aspects of the theory of random graphs and introduce participants to the diversity and the depth of the combinatorial, probabilistic and analytical methods that have been invented in this context.
Additional information can be found here: http://web.mat.bham.ac.uk/combinatorics/LMS-EPSRC/index.html
as well as through the LMS webpage: http://www.lms.ac.uk/events/forthcoming-short-courses
The generous financial support of the LMS and the EPSRC is kindly acknowledged.
**********************************************************
*
* 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, July 2, 2013
[DMANET] Call for papers : special issue of Annals of Operations Research on Machine Reassignment Problems
Call for Papers
Annals of Operations Research
Special Volume: ROADEF/EURO challenge 2012
on Machine Reassignment Problems.
Application migration and machine reassignment are key issues in modern management of enterprise data centers. The ROADEF/EURO challenge 2012, devoted to this important topic, focused on a machine reassignment problem proposed by Google.
The aim of this challenge was to improve the usage of a set of machines. A machine has several resources as for example RAM and CPU, and runs processes that consume these resources. Initially each process is assigned to a machine. In order to improve machine usage, processes can be moved from one machine to another. Possible moves are limited by hard constraints, as for example resource capacity constraints, and have a cost. A solution to this problem is a new process-machine assignment that satisfies all hard constraints and minimizes a composite cost involving load, balance and move costs. More details can be found on the subject at http://challenge.roadef.org/2012/en/
We invite papers for a special issue of Annals of Operations Research on the machine reassignment problem. All participants to the ROADEF/EURO challenge 2012 are invited to submit a paper. Papers addressing optimization methods for closely related problems are welcome as well.
Instructions for authors can be found at:
http://www.springer.com/business/operations+research/journal/10479
Please see the Author Instructions on the web site if you have not yet submitted a paper through Springer's web-based system, Editorial Manager. Be sure to note in the Manuscript Comment text that your work is intended for the special volume and to select the article type "S.I. : Machine Reassignment Problem".
Papers will be subject to a strict review process managed by the Guest Editors and accepted papers will be published online individually, before print publication. The deadline for submission is October 1, 2013.
We look forward to receiving your paper.
Guest editors:
Murat Afsar, Christian Artigues, Eric Bourreau, Emmanuel Guere and Safia Kedad-Sidhoum
**********************************************************
*
* 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/
*
**********************************************************
Annals of Operations Research
Special Volume: ROADEF/EURO challenge 2012
on Machine Reassignment Problems.
Application migration and machine reassignment are key issues in modern management of enterprise data centers. The ROADEF/EURO challenge 2012, devoted to this important topic, focused on a machine reassignment problem proposed by Google.
The aim of this challenge was to improve the usage of a set of machines. A machine has several resources as for example RAM and CPU, and runs processes that consume these resources. Initially each process is assigned to a machine. In order to improve machine usage, processes can be moved from one machine to another. Possible moves are limited by hard constraints, as for example resource capacity constraints, and have a cost. A solution to this problem is a new process-machine assignment that satisfies all hard constraints and minimizes a composite cost involving load, balance and move costs. More details can be found on the subject at http://challenge.roadef.org/2012/en/
We invite papers for a special issue of Annals of Operations Research on the machine reassignment problem. All participants to the ROADEF/EURO challenge 2012 are invited to submit a paper. Papers addressing optimization methods for closely related problems are welcome as well.
Instructions for authors can be found at:
http://www.springer.com/business/operations+research/journal/10479
Please see the Author Instructions on the web site if you have not yet submitted a paper through Springer's web-based system, Editorial Manager. Be sure to note in the Manuscript Comment text that your work is intended for the special volume and to select the article type "S.I. : Machine Reassignment Problem".
Papers will be subject to a strict review process managed by the Guest Editors and accepted papers will be published online individually, before print publication. The deadline for submission is October 1, 2013.
We look forward to receiving your paper.
Guest editors:
Murat Afsar, Christian Artigues, Eric Bourreau, Emmanuel Guere and Safia Kedad-Sidhoum
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Deadline PhD positions in Computer Science - Gran Sasso Institute, , L'Aquila, Italy
Dear Colleagues,
I would like to ask for your help in spreading around the call for
application for PhD candidates in Computer Science at the Gran Sasso
Science Institute (GSSI)
http://www.gssi.infn.it/index.php/en/announcements-all/400-ph-d-call-forapplications.
We are particularly interested in attracting foreign students. So it
would be great if you can deliver this announcement through your
emailing lists in your countries.
The deadline for applying to the program is 15th july.
Students will be offered free housing and meals plus the standard three
years PhD grant.
Official language is English.
GSSI is a new initiative that is starting in L'Aquila as a consequence
of the redevelopment plan after the earthquake. The school is managed by
INFN (http://www.infn.it/index.php?lang=en) and will start a PhD program
in Computer science that is centered around new generation computing,
including distributed, autonomous and ubiquitous systems, with emphasis
on three main disciplinary pillars: algorithms, specification and
analysis, and software engineering.
There will be other three Phd programs offered by GSSI, one concerning
urban studies, one in Phisics mainly centered around astro-particles
phisics because of the proximity with the famous Lab
(http://www.lngs.infn.it/), and another in Mathematics centered around
mathematical modeling.
The school is supported by other three Italian already established
graduate schools, IMT in Lucca for computer science (www.imtlucca.it),
SISSA in Trieste for mathematics and physics (http://www.sissa.it/), and
Scuola Superiore S. Anna in Pisa for urban studies (www.sssup.it).
I hope you can give us some help.
Thank you in advance for your attention and your support.
Best regards,
Michele Flammini
---------
Department of Information Engineering, Computer Science, and Mathematics
University of L'Aquila
Italy
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] PhD and postdoc positions in Osnabrück, Germany
The DFG Graduate School "Combinatorial Structures in Geometry" at the
University of Osnabrueck invites applications for
8 positions for PhD candidates and
2 postdoctoral positions.
The starting date for these positions is October 1st, 2013. All
positions are
within the TV-L E13 German public sector pay scale. The PhD positions are
offered at a 75% base, the contracts are given for 1 year and are
extended to
3 years after a successful evaluation at the end of the first year. The
postdoctoral positions are offered at a 100% base and the contracts are
given
for 2 years, with the option of an extension by another 2.5 years.
The central research idea behind the Graduate School concerns the
interaction
of combinatorics and geometry, and collaborations between researchers from
different disciplines, such as commutative algebra, combinatorial
optimization,
harmonic analysis, homotopy theory, K-theory, and stochastic geometry.
The research program is based on associated projects which can be found at
http://www.mathematik.uni-osnabrueck.de/graduiertenkolleg
Applicants for the PhD positions should hold an excellent master/diploma
degree in mathematics or computer science. Good English language skills are
mandatory. PhD candidates should finish their dissertation within the time
frame of 3 years. Requirements for the postdoctoral positions are an
excellent
PhD in one of the mentioned areas.
The University of Osnabrueck aims at increasing the proportion of female
employees in the involved departments substantially. Therefore applications
from women are particularly welcome, and will be treated with preference
subject to equal qualification. The same applies to qualified disabled
people.
Applications should include the relevant documents (curriculum vitae,
list of
publications if available, certificates of academic qualifications), a
reference letter written by a professor and an accompanying statement
mentioning one or several research projects the applicant wants to work on.
Applications should be sent via email in PDF format to
Prof. Dr. Matthias Reitzner: gkmath@uni-osnabrueck.de, by July 28th, 2013.
--
-------------------------------------------------------------------
Prof. Dr. Sigrid Knust
Universitaet Osnabrueck
Institut fuer Informatik
Albrechtstr. 28
D-49069 Osnabrueck
Tel.: +49 541 969 2483
Fax.: +49 541 969 2799
sigrid@informatik.uni-osnabrueck.de
http://www.informatik.uni-osnabrueck.de/knust/
-------------------------------------------------------------------
**********************************************************
*
* 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 Osnabrueck invites applications for
8 positions for PhD candidates and
2 postdoctoral positions.
The starting date for these positions is October 1st, 2013. All
positions are
within the TV-L E13 German public sector pay scale. The PhD positions are
offered at a 75% base, the contracts are given for 1 year and are
extended to
3 years after a successful evaluation at the end of the first year. The
postdoctoral positions are offered at a 100% base and the contracts are
given
for 2 years, with the option of an extension by another 2.5 years.
The central research idea behind the Graduate School concerns the
interaction
of combinatorics and geometry, and collaborations between researchers from
different disciplines, such as commutative algebra, combinatorial
optimization,
harmonic analysis, homotopy theory, K-theory, and stochastic geometry.
The research program is based on associated projects which can be found at
http://www.mathematik.uni-osnabrueck.de/graduiertenkolleg
Applicants for the PhD positions should hold an excellent master/diploma
degree in mathematics or computer science. Good English language skills are
mandatory. PhD candidates should finish their dissertation within the time
frame of 3 years. Requirements for the postdoctoral positions are an
excellent
PhD in one of the mentioned areas.
The University of Osnabrueck aims at increasing the proportion of female
employees in the involved departments substantially. Therefore applications
from women are particularly welcome, and will be treated with preference
subject to equal qualification. The same applies to qualified disabled
people.
Applications should include the relevant documents (curriculum vitae,
list of
publications if available, certificates of academic qualifications), a
reference letter written by a professor and an accompanying statement
mentioning one or several research projects the applicant wants to work on.
Applications should be sent via email in PDF format to
Prof. Dr. Matthias Reitzner: gkmath@uni-osnabrueck.de, by July 28th, 2013.
--
-------------------------------------------------------------------
Prof. Dr. Sigrid Knust
Universitaet Osnabrueck
Institut fuer Informatik
Albrechtstr. 28
D-49069 Osnabrueck
Tel.: +49 541 969 2483
Fax.: +49 541 969 2799
sigrid@informatik.uni-osnabrueck.de
http://www.informatik.uni-osnabrueck.de/knust/
-------------------------------------------------------------------
**********************************************************
*
* 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, July 1, 2013
[DMANET] Last days for registering for PCC 2013
-------------------------------------------------------------------------------------------------------------
23rd Postgraduate Combinatorial Conference
14th-16th August 2013, Royal Holloway, University of London, UK
-------------------------------------------------------------------------------------------------------------
The 23rd Postgraduate Combinatorial Conference will be held at Royal
Holloway, University of London on 14th-16th August 2013.
The Postgraduate Combinatorial Conference (PCC) is an established
annual conference organised by, and for, current research students in
all areas of combinatorial and discrete mathematics, under the
auspices of the British Combinatorial Committee. The PCC is mainly
aimed at UK-based students, but also open to those from abroad.
The aim of the conference is to allow research students to meet and
discuss their research in a relaxed environment, to gain practice at
presenting their research outside of their own department, and to meet
pre-eminent researchers in their area. Each student is encouraged to
contribute by giving a talk which will last 25 minutes (including 5
minutes question and answer time).
The invited speakers will include;
Dr Julia Böttcher, LSE
Dr Carolyn Chun, Brunel University London
Professor Daniel Kráľ, Warwick
To register, and for further details, visit the website at
Registration will close on the 7th July.
The conference is supported by an LMS Postgraduate Research Conference
Scheme 8 grant and a grant from the British Combinatorial Committee.
-------------------------------------------------------------------------------------------------------------
The British Combinatorial Committee is a charity registered in
Scotland, number SC019723
**********************************************************
*
* 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] FCT 2013 Call for Participation (Aug 19-21) reminder
FCT 2013, University of Liverpool
The 19th International Symposium on Fundamentals of Computation
Theory (FCT 2013) will be hosted by the Department of Computer
Science at the University of Liverpool.
Dates: Aug 19-21, 2013
Website: http://fct2013.csc.liv.ac.uk/
Registration page: http://cgi.csc.liv.ac.uk/~fct2013/register.html
Early registration (until July 15) is £300 (£225 for students).
The invited speakers at FCT 2013 are Marek Chrobak (UC Riverside),
Joël Ouaknine (Oxford University), and David Peleg (Weizmann Institute).
List of accepted papers: http://cgi.csc.liv.ac.uk/~fct2013/accepted.html
Program chairs: Leszek Gasieniec, University of Liverpool
Frank Wolter, University of Liverpool
Conference scope
----------------
FCT covers
Algorithms, including algorithm design, optimization,
approximation and randomized algorithms, computational
complexity, computational geometry, machine learning, artificial
intelligence, computational algebra, online algorithms,
and parallel and distributed computing.
Formal methods, including algebraic and categorical
methods, automata and formal languages, database theory,
foundations of concurrency, logic and model checking,
principles of programming languages, program analysis
and transformation, specification, refinement and verification,
and security.
Emerging fields, including algorithmic game theory,
computational biology, foundations of cloud computing, and
quantum computing.
**********************************************************
*
* 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 19th International Symposium on Fundamentals of Computation
Theory (FCT 2013) will be hosted by the Department of Computer
Science at the University of Liverpool.
Dates: Aug 19-21, 2013
Website: http://fct2013.csc.liv.ac.uk/
Registration page: http://cgi.csc.liv.ac.uk/~fct2013/register.html
Early registration (until July 15) is £300 (£225 for students).
The invited speakers at FCT 2013 are Marek Chrobak (UC Riverside),
Joël Ouaknine (Oxford University), and David Peleg (Weizmann Institute).
List of accepted papers: http://cgi.csc.liv.ac.uk/~fct2013/accepted.html
Program chairs: Leszek Gasieniec, University of Liverpool
Frank Wolter, University of Liverpool
Conference scope
----------------
FCT covers
Algorithms, including algorithm design, optimization,
approximation and randomized algorithms, computational
complexity, computational geometry, machine learning, artificial
intelligence, computational algebra, online algorithms,
and parallel and distributed computing.
Formal methods, including algebraic and categorical
methods, automata and formal languages, database theory,
foundations of concurrency, logic and model checking,
principles of programming languages, program analysis
and transformation, specification, refinement and verification,
and security.
Emerging fields, including algorithmic game theory,
computational biology, foundations of cloud computing, and
quantum computing.
**********************************************************
*
* 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] SSTiC 2013: last call
*To be removed from our mailing list, please respond to this message with
UNSUBSCRIBE in the subject line*
*********************************************************************
2013 INTERNATIONAL SUMMER SCHOOL ON TRENDS IN COMPUTING
SSTiC 2013
Tarragona, Spain
July 22-26, 2013
Organized by
Rovira i Virgili University
http://grammars.grlmc.com/SSTiC2013/
*********************************************************************
AIM:
SSTiC 2013 will be an open forum for the convergence of top class well
recognized computer scientists and people at the beginning of their research
career (typically PhD students) as well as consolidated researchers.
SSTiC 2013 will cover the whole spectrum of computer science by means of 54
six-hour courses dealing with hot topics at the frontiers of the field. By
actively participating, lecturers and attendees will share the idea of
scientific excellence as the main motto of their research work.
ADDRESSED TO:
Graduate students from around the world. There are no pre-requisites in
terms of the academic degree the attendee must hold. However, since there
will be several levels among the courses, in the description of some of them
reference may be made to specific knowledge background.
SSTiC 2013 is appropriate also for people more advanced in their career who
want to keep themselves updated on developments in the field.
Finally, senior researchers will find it fruitful to listen and discuss with
people who are main references of the diverse branches of computing
nowadays.
REGIME:
6 parallel sessions will be held during the whole event. Participants will
be able to freely choose the courses they will be willing to attend as well
as to move from one to another.
VENUE:
Campus Catalunya
Universitat Rovira i Virgili
Av. Catalunya, 35
43002 Tarragona
COURSES AND PROFESSORS:
Shun-ichi Amari (Riken) [introductory] Information Geometry and Its
Applications
James Anderson (Chapel Hill) [intermediate] Scheduling and Synchronization
in Real-Time Multicore Systems
Pierre Baldi (Irvine) [intermediate] Big Data Informatics Challenges and
Opportunities in the Life Sciences
Yoshua Bengio (Montréal) [introductory/intermediate] Deep Learning of
Representations
Stephen Brewster (Glasgow) [advanced] Multimodal Human-Computer Interaction
Bruno Buchberger (Linz) [introductory] Groebner Bases: An Algorithmic Method
for Multivariate Polynomial Systems. Foundations and Applications
Rajkumar Buyya (Melbourne) [intermediate] Cloud Computing
Jan Camenisch (IBM Zurich) [intermediate] Cryptography for Privacy
Larry S. Davis (College Park) [intermediate] Video Analysis of Human
Activities
Paul De Bra (Eindhoven) [intermediate] Adaptive Systems
Paul Dourish (Irvine) [introductory] Ubiquitous Computing in a Social
Context
Max J. Egenhofer (Maine) [introductory/intermediate] Qualitative Spatial
Relations: Formalizations and Inferences
Richard M. Fujimoto (Georgia Tech) [introductory] Parallel and Distributed
Simulation
David Garlan (Carnegie Mellon) [advanced] Software Architecture: Past,
Present and Future
Mario Gerla (Los Angeles) [intermediate] Vehicle Cloud Computing
Ralph Grishman (New York) [intermediate] Information Extraction from Natural
Language
Francisco Herrera (Granada) [intermediate] Imbalanced Classification:
Current Approaches and Open Problems
Paul Hudak (Yale) [introductory] Euterpea: From Signals to Symphonies Using
Haskell
Niraj K. Jha (Princeton) [intermediate] FinFET Circuit Design
George Karypis (Minnesota) [introductory] Introduction to Parallel
Computing: Architectures, Algorithms, and Programming
Aggelos K. Katsaggelos (Northwestern) [intermediate/advanced] Sparsity-based
Advances in Image Processing
Arie E. Kaufman (Stony Brook) [advanced] Advances in Visualization
Hugo Krawczyk (IBM Research) [intermediate] An Introduction to the Design
and Analysis of Authenticated Key Exchange Protocols
Pierre L'Ecuyer (Montréal) [intermediate] Quasi-Monte Carlo Methods in
Simulation: Theory and Practice
Laks Lakshmanan (British Columbia) [intermediate/advanced] Information and
Influence Spread in Social Networks
Wenke Lee (Georgia Tech) [introductory] DNS-based Monitoring of Malware
Activities
Maurizio Lenzerini (Roma La Sapienza) [intermediate] Ontology-based Data
Integration
Ming C. Lin (Chapel Hill) [introductory/intermediate] Physically-based
Modeling and Simulation
Jane W.S. Liu (Academia Sinica) [intermediate] Critical Information and
Communication Technologies for Disaster Preparedness and Response
Satoru Miyano (Tokyo) [intermediate] How to Hack Cancer Systems with
Computational Methods
Aloysius K. Mok (Austin) [intermediate] From Real-time Systems to
Cyber-physical Systems
Hermann Ney (Aachen) [intermediate/advanced] Probabilistic Modelling for
Natural Language Processing - with Applications to Speech Recognition,
Handwriting Recognition and Machine Translation
Cathleen A. Norris (North Texas) & Elliot Soloway (Ann Arbor) [introductory]
Primary & Secondary Educational Computing in the Age of Mobilism
Jeff Offutt (George Mason) [intermediate] Cutting Edge Research in
Engineering of Web Applications
Bijan Parsia (Manchester) [introductory] The Semantic Web: Conceptual and
Technical Foundations
Charles E. Perkins (FutureWei) [intermediate/advanced] Beyond 4G
Prabhakar Raghavan (Google) [introductory/intermediate] Web Search and
Advertising
Phillip Rogaway (Davis) [introductory/intermediate] Provably Secure
Symmetric Encryption
Gustavo Rossi (La Plata) [intermediate] Topics in Model Driven Web
Engineering
Kaushik Roy (Purdue) [introductory/intermediate] Low-energy Computing
Robert Sargent (Syracuse) [introductory] Validating Models
Douglas C. Schmidt (Vanderbilt) [intermediate] Patterns and Frameworks for
Concurrent and Networked Software
Bart Selman (Cornell) [intermediate] Fast Large-scale Probabilistic and
Logical Inference Methods
Mubarak Shah (Central Florida) [intermediate/advanced] Visual Crowd
Surveillance
Ron Shamir (Tel Aviv) [introductory] Revealing Structure in Disease
Regulation and Networks
Dawn Xiaodong Song (Berkeley) [introductory] Selected Topics in Computer
Security
Mike Thelwall (Wolverhampton) [introductory] Sentiment Strength Detection
for the Social Web
Julita Vassileva (Saskatchewan) [introductory/intermediate] Engaging Users
in Social Computing Systems
Philip Wadler (Edinburgh) [introductory] Topics in Lambda Calculus and Life
Yao Wang (Polytechnic New York) [introductory/advanced] Video Compression:
Fundamentals and Recent Development
Gio Wiederhold (Stanford) [introductory] Software Economics: How Do the
Results of the Intellectual Efforts Enter the Global Market Place
Limsoon Wong (National Singapore) [introductory/intermediate] The Use of
Context in Gene Expression and Proteomic Profile Analysis
Michael Wooldridge (Oxford) [introductory] Autonomous Agents and Multi-Agent
Systems
Ronald R. Yager (Iona) [introductory/intermediate] Fuzzy Sets and Soft
Computing
Philip S. Yu (Illinois Chicago) [advanced] Mining Big Data
REGISTRATION:
It has to be done at
http://grammars.grlmc.com/SSTiC2013/Registration.php
Since the capacity of the venue is limited, registration requests will be
processed on a first come first served basis. The registration period will
be closed when the capacity of the venue will be complete. It is highly
convenient to register prior to the event.
FEES:
Fees may be for the whole week (full-time participant) or per blocks of days
(part-time participant). They are a flat rate allowing one to attend all
courses within the time window set: 5, 4, 3 or 2 days. Fees vary depending
on the deadline.
ACCOMMODATION:
Information about accommodation is available on the website of the School.
CERTIFICATE:
Participants will be delivered a certificate of attendance.
QUESTIONS AND FURTHER INFORMATION:
Lilica Voicu:
florentinalilica.voicu@urv.cat
POSTAL ADDRESS:
SSTiC 2013
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
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/
*
**********************************************************
UNSUBSCRIBE in the subject line*
*********************************************************************
2013 INTERNATIONAL SUMMER SCHOOL ON TRENDS IN COMPUTING
SSTiC 2013
Tarragona, Spain
July 22-26, 2013
Organized by
Rovira i Virgili University
http://grammars.grlmc.com/SSTiC2013/
*********************************************************************
AIM:
SSTiC 2013 will be an open forum for the convergence of top class well
recognized computer scientists and people at the beginning of their research
career (typically PhD students) as well as consolidated researchers.
SSTiC 2013 will cover the whole spectrum of computer science by means of 54
six-hour courses dealing with hot topics at the frontiers of the field. By
actively participating, lecturers and attendees will share the idea of
scientific excellence as the main motto of their research work.
ADDRESSED TO:
Graduate students from around the world. There are no pre-requisites in
terms of the academic degree the attendee must hold. However, since there
will be several levels among the courses, in the description of some of them
reference may be made to specific knowledge background.
SSTiC 2013 is appropriate also for people more advanced in their career who
want to keep themselves updated on developments in the field.
Finally, senior researchers will find it fruitful to listen and discuss with
people who are main references of the diverse branches of computing
nowadays.
REGIME:
6 parallel sessions will be held during the whole event. Participants will
be able to freely choose the courses they will be willing to attend as well
as to move from one to another.
VENUE:
Campus Catalunya
Universitat Rovira i Virgili
Av. Catalunya, 35
43002 Tarragona
COURSES AND PROFESSORS:
Shun-ichi Amari (Riken) [introductory] Information Geometry and Its
Applications
James Anderson (Chapel Hill) [intermediate] Scheduling and Synchronization
in Real-Time Multicore Systems
Pierre Baldi (Irvine) [intermediate] Big Data Informatics Challenges and
Opportunities in the Life Sciences
Yoshua Bengio (Montréal) [introductory/intermediate] Deep Learning of
Representations
Stephen Brewster (Glasgow) [advanced] Multimodal Human-Computer Interaction
Bruno Buchberger (Linz) [introductory] Groebner Bases: An Algorithmic Method
for Multivariate Polynomial Systems. Foundations and Applications
Rajkumar Buyya (Melbourne) [intermediate] Cloud Computing
Jan Camenisch (IBM Zurich) [intermediate] Cryptography for Privacy
Larry S. Davis (College Park) [intermediate] Video Analysis of Human
Activities
Paul De Bra (Eindhoven) [intermediate] Adaptive Systems
Paul Dourish (Irvine) [introductory] Ubiquitous Computing in a Social
Context
Max J. Egenhofer (Maine) [introductory/intermediate] Qualitative Spatial
Relations: Formalizations and Inferences
Richard M. Fujimoto (Georgia Tech) [introductory] Parallel and Distributed
Simulation
David Garlan (Carnegie Mellon) [advanced] Software Architecture: Past,
Present and Future
Mario Gerla (Los Angeles) [intermediate] Vehicle Cloud Computing
Ralph Grishman (New York) [intermediate] Information Extraction from Natural
Language
Francisco Herrera (Granada) [intermediate] Imbalanced Classification:
Current Approaches and Open Problems
Paul Hudak (Yale) [introductory] Euterpea: From Signals to Symphonies Using
Haskell
Niraj K. Jha (Princeton) [intermediate] FinFET Circuit Design
George Karypis (Minnesota) [introductory] Introduction to Parallel
Computing: Architectures, Algorithms, and Programming
Aggelos K. Katsaggelos (Northwestern) [intermediate/advanced] Sparsity-based
Advances in Image Processing
Arie E. Kaufman (Stony Brook) [advanced] Advances in Visualization
Hugo Krawczyk (IBM Research) [intermediate] An Introduction to the Design
and Analysis of Authenticated Key Exchange Protocols
Pierre L'Ecuyer (Montréal) [intermediate] Quasi-Monte Carlo Methods in
Simulation: Theory and Practice
Laks Lakshmanan (British Columbia) [intermediate/advanced] Information and
Influence Spread in Social Networks
Wenke Lee (Georgia Tech) [introductory] DNS-based Monitoring of Malware
Activities
Maurizio Lenzerini (Roma La Sapienza) [intermediate] Ontology-based Data
Integration
Ming C. Lin (Chapel Hill) [introductory/intermediate] Physically-based
Modeling and Simulation
Jane W.S. Liu (Academia Sinica) [intermediate] Critical Information and
Communication Technologies for Disaster Preparedness and Response
Satoru Miyano (Tokyo) [intermediate] How to Hack Cancer Systems with
Computational Methods
Aloysius K. Mok (Austin) [intermediate] From Real-time Systems to
Cyber-physical Systems
Hermann Ney (Aachen) [intermediate/advanced] Probabilistic Modelling for
Natural Language Processing - with Applications to Speech Recognition,
Handwriting Recognition and Machine Translation
Cathleen A. Norris (North Texas) & Elliot Soloway (Ann Arbor) [introductory]
Primary & Secondary Educational Computing in the Age of Mobilism
Jeff Offutt (George Mason) [intermediate] Cutting Edge Research in
Engineering of Web Applications
Bijan Parsia (Manchester) [introductory] The Semantic Web: Conceptual and
Technical Foundations
Charles E. Perkins (FutureWei) [intermediate/advanced] Beyond 4G
Prabhakar Raghavan (Google) [introductory/intermediate] Web Search and
Advertising
Phillip Rogaway (Davis) [introductory/intermediate] Provably Secure
Symmetric Encryption
Gustavo Rossi (La Plata) [intermediate] Topics in Model Driven Web
Engineering
Kaushik Roy (Purdue) [introductory/intermediate] Low-energy Computing
Robert Sargent (Syracuse) [introductory] Validating Models
Douglas C. Schmidt (Vanderbilt) [intermediate] Patterns and Frameworks for
Concurrent and Networked Software
Bart Selman (Cornell) [intermediate] Fast Large-scale Probabilistic and
Logical Inference Methods
Mubarak Shah (Central Florida) [intermediate/advanced] Visual Crowd
Surveillance
Ron Shamir (Tel Aviv) [introductory] Revealing Structure in Disease
Regulation and Networks
Dawn Xiaodong Song (Berkeley) [introductory] Selected Topics in Computer
Security
Mike Thelwall (Wolverhampton) [introductory] Sentiment Strength Detection
for the Social Web
Julita Vassileva (Saskatchewan) [introductory/intermediate] Engaging Users
in Social Computing Systems
Philip Wadler (Edinburgh) [introductory] Topics in Lambda Calculus and Life
Yao Wang (Polytechnic New York) [introductory/advanced] Video Compression:
Fundamentals and Recent Development
Gio Wiederhold (Stanford) [introductory] Software Economics: How Do the
Results of the Intellectual Efforts Enter the Global Market Place
Limsoon Wong (National Singapore) [introductory/intermediate] The Use of
Context in Gene Expression and Proteomic Profile Analysis
Michael Wooldridge (Oxford) [introductory] Autonomous Agents and Multi-Agent
Systems
Ronald R. Yager (Iona) [introductory/intermediate] Fuzzy Sets and Soft
Computing
Philip S. Yu (Illinois Chicago) [advanced] Mining Big Data
REGISTRATION:
It has to be done at
http://grammars.grlmc.com/SSTiC2013/Registration.php
Since the capacity of the venue is limited, registration requests will be
processed on a first come first served basis. The registration period will
be closed when the capacity of the venue will be complete. It is highly
convenient to register prior to the event.
FEES:
Fees may be for the whole week (full-time participant) or per blocks of days
(part-time participant). They are a flat rate allowing one to attend all
courses within the time window set: 5, 4, 3 or 2 days. Fees vary depending
on the deadline.
ACCOMMODATION:
Information about accommodation is available on the website of the School.
CERTIFICATE:
Participants will be delivered a certificate of attendance.
QUESTIONS AND FURTHER INFORMATION:
Lilica Voicu:
florentinalilica.voicu@urv.cat
POSTAL ADDRESS:
SSTiC 2013
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
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] Calll for participation:: Conference on Space Efficient Data Structures, Streams and Algorithms -- Ianfest
Call for participation
Conference on Space Efficient Data Structures, Streams and Algorithms
Ianfest
(University of Waterloo, August 15-16, 2013)
The University of Waterloo will host a conference to honour one of its
distinguished professors Ian Munro, who is turning 66 in July
2013. The conference will be held at the ICR conference venue in
Waterloo, during August 15th and 16th.
The registration is open, so please, register.
We hope that you can come and we look forward to your early
confirmation and to see you at the conference!
Programme:
----------
The conference will have several invited talks on recent developments
in data structures and algorithms.
(Partial) list of confirmed participants:
-----------------------------------------
Jeremy Barbay (Universidad de Chile, Chile)
Allan Borodin (University of Toronto, Canada)
Prosenjit Bose (Carleton University, Canada)
Gerth Brodal (Aarhus University, Denmark)
Timothy M. Chan (University of Waterloo, Canada)
Jean Cardinal (Universite Libre de Bruxxelles, Belgium)
Erik Demaine (MIT, USA)
Stephan Durocher (University of Manitoba, Canada)
Faith Ellen (University of Toronto, Canada)
Rudolf Fleischer (GUtech, Oman)
Gaston Gonnet (ETH Zurich, Switzerland)
Roberto Grossi (University of Pisa, Italy)
Meng He (Dalhousie, Canada)
John Iacano (NYU/Poly, USA)
David Kirkpatrick (University of British Columbia, Canada)
Moshe Lewenstein (Bar Ilan University, Israel)
Kurt Mehlhorn (MPI, Germany)
S. Muthukrishnan (Microsoft Research, USA)
Rajeev Raman (University of Leicester, UK)
Srinivasa Rao (Seoul National University, Korea)
Matthew Skala (University of Manitoba, Canada)
Sharma Thankachan (Louisiana State University, USA)
Frank Tompa (University of Waterloo, Canada)
Schedule: TBA -- please, follow the website
Registration:
-------------
Early registration: (ends July 15th, 2013)
Student 100 CAD, Regular 160 CAD
Late registration (after July 15th, 2013)
Student 150 CAD, Regular 220 CAD
Registration fee includes Conference Banquet and Meeting Materials
(including LNCS Festschrift)
Affiliated Activity:
--------------------
- Summer School in Geometry and Data Structures
August 5-7, 2013, Waterloo, Ontario
- CCCG 2013 The 25th Canadian Conference on Computational Geometry
August 8th-10th, 2013 Waterloo, Ontario, Canada
- Algorithms and Data Structures Symposium (WADS)
August 12-14, 2013, London, Ontario
Website and Contacts:
---------------------
More detailed on-line information is displayed at
http://www.fields.utoronto.ca/programs/scientific/13-14/efficient/
Personal inquires should be sent to andrej.brodnik@fri.uni-lj.si.
All lectures will be held in the ICR conference venue in Davis centre,
University of Waterloo
Organizing Committee:
---------------------
Andy Brodnik
Alex Lopez-Ortiz
Venkatesh Raman
Alfredo Viola
--
Andrej (Andy) Brodnik
University of Ljubljana
Faculty of Computer and Information Science
**********************************************************
*
* 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/
*
**********************************************************
Conference on Space Efficient Data Structures, Streams and Algorithms
Ianfest
(University of Waterloo, August 15-16, 2013)
The University of Waterloo will host a conference to honour one of its
distinguished professors Ian Munro, who is turning 66 in July
2013. The conference will be held at the ICR conference venue in
Waterloo, during August 15th and 16th.
The registration is open, so please, register.
We hope that you can come and we look forward to your early
confirmation and to see you at the conference!
Programme:
----------
The conference will have several invited talks on recent developments
in data structures and algorithms.
(Partial) list of confirmed participants:
-----------------------------------------
Jeremy Barbay (Universidad de Chile, Chile)
Allan Borodin (University of Toronto, Canada)
Prosenjit Bose (Carleton University, Canada)
Gerth Brodal (Aarhus University, Denmark)
Timothy M. Chan (University of Waterloo, Canada)
Jean Cardinal (Universite Libre de Bruxxelles, Belgium)
Erik Demaine (MIT, USA)
Stephan Durocher (University of Manitoba, Canada)
Faith Ellen (University of Toronto, Canada)
Rudolf Fleischer (GUtech, Oman)
Gaston Gonnet (ETH Zurich, Switzerland)
Roberto Grossi (University of Pisa, Italy)
Meng He (Dalhousie, Canada)
John Iacano (NYU/Poly, USA)
David Kirkpatrick (University of British Columbia, Canada)
Moshe Lewenstein (Bar Ilan University, Israel)
Kurt Mehlhorn (MPI, Germany)
S. Muthukrishnan (Microsoft Research, USA)
Rajeev Raman (University of Leicester, UK)
Srinivasa Rao (Seoul National University, Korea)
Matthew Skala (University of Manitoba, Canada)
Sharma Thankachan (Louisiana State University, USA)
Frank Tompa (University of Waterloo, Canada)
Schedule: TBA -- please, follow the website
Registration:
-------------
Early registration: (ends July 15th, 2013)
Student 100 CAD, Regular 160 CAD
Late registration (after July 15th, 2013)
Student 150 CAD, Regular 220 CAD
Registration fee includes Conference Banquet and Meeting Materials
(including LNCS Festschrift)
Affiliated Activity:
--------------------
- Summer School in Geometry and Data Structures
August 5-7, 2013, Waterloo, Ontario
- CCCG 2013 The 25th Canadian Conference on Computational Geometry
August 8th-10th, 2013 Waterloo, Ontario, Canada
- Algorithms and Data Structures Symposium (WADS)
August 12-14, 2013, London, Ontario
Website and Contacts:
---------------------
More detailed on-line information is displayed at
http://www.fields.utoronto.ca/programs/scientific/13-14/efficient/
Personal inquires should be sent to andrej.brodnik@fri.uni-lj.si.
All lectures will be held in the ICR conference venue in Davis centre,
University of Waterloo
Organizing Committee:
---------------------
Andy Brodnik
Alex Lopez-Ortiz
Venkatesh Raman
Alfredo Viola
--
Andrej (Andy) Brodnik
University of Ljubljana
Faculty of Computer and Information Science
**********************************************************
*
* 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 / PhD position
University of Rostock
Institute for Mathematics
Discrete Geometry Group
http://www.geometrie.uni-rostock.de/
**********************************************************
we offer a full time 3-year Postdoc or PhD position
(with an option for additional 3 years)
**********************************************************
we look for candidates with a strong background on topics from
Discrete Mathematics, Optimization, Geometry and Algebra,
and with a research interest in Algorithms and Discrete Geometry
A more detailed description (in German) can be found under the following link:
http://www.uni-rostock.de/uploads/media/W55-13.ma-schuermann40.pdf
Deadline: July 31st, 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/
*
**********************************************************
Institute for Mathematics
Discrete Geometry Group
http://www.geometrie.uni-rostock.de/
**********************************************************
we offer a full time 3-year Postdoc or PhD position
(with an option for additional 3 years)
**********************************************************
we look for candidates with a strong background on topics from
Discrete Mathematics, Optimization, Geometry and Algebra,
and with a research interest in Algorithms and Discrete Geometry
A more detailed description (in German) can be found under the following link:
http://www.uni-rostock.de/uploads/media/W55-13.ma-schuermann40.pdf
Deadline: July 31st, 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/
*
**********************************************************
Subscribe to:
Posts (Atom)
Posts
