Two Post-Doctoral Positions in Algorithms and Machine Learning
(Aalto University, Helsinki)
The Department of Information and Computer Science at Aalto University in Espoo/Helsinki, Finland, pursues research on advanced computational methods for modelling, analysing, and solving complex tasks in technology and science. The research aims at the development of fundamental computer science methods for the analysis of large and high-dimensional data sets, and for the modelling and design of complex software, networking and other computational systems.
The appointment for two postdoctoral positions is for a fixed term of two (2) years. We expect the applicants to have a PhD degree (or close to completing one) in computer science, mathematics or statistics, with an excellent publication record. We expect solid research experience in one or more of the following fields:
- Algorithm theory
- Supervised machine learning
- Kernel methods
- Large-scale optimization
- Parsimonious modeling
Excellent technical and communications skills are required. Good command of English is a necessary prerequisite. In addition to research work, a postdoctoral researcher is expected to participate in the supervision of students and teaching related to their research topic.
Successful candidates will join Algorithmic Data Analysis Centre of Excellence in research teams lead by Professor Juho Rousu (Machine learning, kernel methods), Petteri Kaski (Algorithm theory) and Chief Research Scientist Jaakko Hollmen (Parsimonious modeling) to conduct high-quality research according to their research plan. The starting times for the positions are negotiable.
The salary level for a starting postdoctoral researcher at the Aalto ICS Department is typically, depending on experience and qualifications, between 3200 and 3600 EUR per month according to the salary system applied in Aalto University. The contract includes occupational health services and Finland has a comprehensive social security system.
Deadline for applications is October 31, 2012.
Further information & application procedure:
http://www.aalto.fi/en/current/jobs/teaching_and_research/algodan_postdocs/
--
Petteri Kaski, Academy Research Fellow, Assistant Professor, D.Sc.(Tech.)
HIIT & Department of Information and Computer Science, Aalto University
PO Box 15400, FI-00076 Aalto, FINLAND
petteri.kaski@aalto.fi, http://users.ics.aalto.fi/pkaski, +358 9 470 23260
Monday, October 8, 2012
Sunday, October 7, 2012
SPAA 2013 - First Call for Papers
Apologies for multiple postings
======================================================
SPAA 2013 First Call for Papers
======================================================
25th ACM Symposium on
Parallelism in Algorithms and Architectures (SPAA 2013)
July 23-25, 2013 Montreal, Quebec, Canada
http://www.spaa-conference.org
This year SPAA will be co-located with the ACM SIGACT-SIGOPS Symposium
on
Principles of Distributed Computing (PODC 2013)
======================================================
Important Dates:
Submission deadlines:
- Abstract: February 11, 2013, 11:59pm EST
- Full versions: February 13, 2013, 11:59pm EST
Notification: April 15, 2013
Camera-ready: May 14, 2013
======================================================
Contributed papers are sought in all areas of parallel algorithms and
architectures, encompassing any computation system that can perform
multiple
operations or tasks simultaneously. Topics of interest include, but
are not
limited to:
- parallel and distributed algorithms
- parallel and distributed data structures
- green computing & power-efficient architectures
- management of massive data sets
- parallel complexity theory
- parallel and distributed architectures
- multi-core architectures
- instruction level parallelism and VLSI
- compilers and tools for concurrent programming
- supercomputing architecture and computing
- transactional memory hardware and software
- the internet and the world wide web
- game theory and collaborative learning
- routing and information dissemination
- resource management and awareness
- peer-to-peer systems
- mobile, ad-hoc, and sensor networks
- robustness, self-stabilization, and security
- synergy of parallelism in algorithms, programming, and architecture
Conference presentations will have two formats:
Regular presentations will be allotted a 25-minute talk and up to 10
pages in the proceedings. This format is intended for contributions
reporting original research, submitted exclusively to this conference.
Brief announcements will be allotted a 10-minute talk and a 2-page
abstract in the proceedings. This format is a forum for brief
communications, which may be published later in other conferences.
Every regular paper is eligible for the best paper award. The program
committee may decline to make this award or may split the award among
multiple papers.
Submission:
Authors of contributed papers are encouraged to submit their manuscript
electronically. To submit electronically, visit http://www.spaa-conference.org
for instructions. This is the preferred method of submission. Authors
unable
to submit electronically should contact the program chair Berthold
Vocking at
voecking@cs.rwth-aachen.de to receive instructions.
The cover page should include (1) title, (2) authors and affiliation,
(3) postal and email address of the contact author, (4) a brief abstract
describing the content of the paper, and (5) an indication if this is a
regular presentation or a brief announcement. If requested by the
authors, an
extended abstract that is not selected for a regular presentation will
also be
considered for the SPAA brief announcements session. Such a request
will not
affect the consideration of the paper for a regular presentation.
Submissions for regular presentations should include an introduction
understandable to a nonspecialist including motivation and previous
work, and
a technical exposition directed to a specialist. A submission should not
exceed 10 printed pages in 11-point type or larger (excluding cover,
figures,
and references). More details may be supplied in a clearly marked
appendix to
be read at the discretion of the program committee. A submission for
brief
announcements should be no longer than three pages (excluding the cover
page) using at least 11-point font.
======================================================
Program Committee:
Matthew Andrews (Bell Labs) Hagit Attiya (Technion) Zhao jun Bai (UC
Davis)
Michael Bender (Stony Brook U.) George Bosilca (U. of Tennessee) Michael
Dinitz (Weizmann Inst.) Robert Elsasser (Salzburg U.) Thomas Erlebach
(Leicester U.) Magnus M. Halldorsson (Reykjavik U.) Torsten Hoefl‚er
(TU Berlin
& T-Labs) Giuseppe Persiano (U. Salerno) Cynthia A. Phillips (Sandia
Labs)
Rajmohan Rajaraman (Northeastern U.) Andrea W. Richa (Arizona State U.)
Andre Schiper (EPFL Lausanne) Stefan Schmid (TU Berlin) Ravi Sundaram
(Northeastern U.) Peter Varman (Rice U.) Berthold Vocking (RWTH Aachen
U.)
Jennifer L. Welch (Texas A&M U.) Norbert Zeh (Dalhousie U.)
======================================================
Conference Committee:
Program Chair
Berthold Vocking (RWTH Aachen U.)
Conference Chair
Guy Blelloch (Carnegie Mellon University)
Secretary
Christian Scheideler (University of Paderborn)
Treasurer
David Bunde (Knox College)
Publicity Chair
Jeremy Fineman (Georgetown University)
SPAA Local Arrangements
Lata Narayanan (Concordia University)
======================================================
SPAA 2013 First Call for Papers
======================================================
25th ACM Symposium on
Parallelism in Algorithms and Architectures (SPAA 2013)
July 23-25, 2013 Montreal, Quebec, Canada
http://www.spaa-conference.org
This year SPAA will be co-located with the ACM SIGACT-SIGOPS Symposium
on
Principles of Distributed Computing (PODC 2013)
======================================================
Important Dates:
Submission deadlines:
- Abstract: February 11, 2013, 11:59pm EST
- Full versions: February 13, 2013, 11:59pm EST
Notification: April 15, 2013
Camera-ready: May 14, 2013
======================================================
Contributed papers are sought in all areas of parallel algorithms and
architectures, encompassing any computation system that can perform
multiple
operations or tasks simultaneously. Topics of interest include, but
are not
limited to:
- parallel and distributed algorithms
- parallel and distributed data structures
- green computing & power-efficient architectures
- management of massive data sets
- parallel complexity theory
- parallel and distributed architectures
- multi-core architectures
- instruction level parallelism and VLSI
- compilers and tools for concurrent programming
- supercomputing architecture and computing
- transactional memory hardware and software
- the internet and the world wide web
- game theory and collaborative learning
- routing and information dissemination
- resource management and awareness
- peer-to-peer systems
- mobile, ad-hoc, and sensor networks
- robustness, self-stabilization, and security
- synergy of parallelism in algorithms, programming, and architecture
Conference presentations will have two formats:
Regular presentations will be allotted a 25-minute talk and up to 10
pages in the proceedings. This format is intended for contributions
reporting original research, submitted exclusively to this conference.
Brief announcements will be allotted a 10-minute talk and a 2-page
abstract in the proceedings. This format is a forum for brief
communications, which may be published later in other conferences.
Every regular paper is eligible for the best paper award. The program
committee may decline to make this award or may split the award among
multiple papers.
Submission:
Authors of contributed papers are encouraged to submit their manuscript
electronically. To submit electronically, visit http://www.spaa-conference.org
for instructions. This is the preferred method of submission. Authors
unable
to submit electronically should contact the program chair Berthold
Vocking at
voecking@cs.rwth-aachen.de to receive instructions.
The cover page should include (1) title, (2) authors and affiliation,
(3) postal and email address of the contact author, (4) a brief abstract
describing the content of the paper, and (5) an indication if this is a
regular presentation or a brief announcement. If requested by the
authors, an
extended abstract that is not selected for a regular presentation will
also be
considered for the SPAA brief announcements session. Such a request
will not
affect the consideration of the paper for a regular presentation.
Submissions for regular presentations should include an introduction
understandable to a nonspecialist including motivation and previous
work, and
a technical exposition directed to a specialist. A submission should not
exceed 10 printed pages in 11-point type or larger (excluding cover,
figures,
and references). More details may be supplied in a clearly marked
appendix to
be read at the discretion of the program committee. A submission for
brief
announcements should be no longer than three pages (excluding the cover
page) using at least 11-point font.
======================================================
Program Committee:
Matthew Andrews (Bell Labs) Hagit Attiya (Technion) Zhao jun Bai (UC
Davis)
Michael Bender (Stony Brook U.) George Bosilca (U. of Tennessee) Michael
Dinitz (Weizmann Inst.) Robert Elsasser (Salzburg U.) Thomas Erlebach
(Leicester U.) Magnus M. Halldorsson (Reykjavik U.) Torsten Hoefl‚er
(TU Berlin
& T-Labs) Giuseppe Persiano (U. Salerno) Cynthia A. Phillips (Sandia
Labs)
Rajmohan Rajaraman (Northeastern U.) Andrea W. Richa (Arizona State U.)
Andre Schiper (EPFL Lausanne) Stefan Schmid (TU Berlin) Ravi Sundaram
(Northeastern U.) Peter Varman (Rice U.) Berthold Vocking (RWTH Aachen
U.)
Jennifer L. Welch (Texas A&M U.) Norbert Zeh (Dalhousie U.)
======================================================
Conference Committee:
Program Chair
Berthold Vocking (RWTH Aachen U.)
Conference Chair
Guy Blelloch (Carnegie Mellon University)
Secretary
Christian Scheideler (University of Paderborn)
Treasurer
David Bunde (Knox College)
Publicity Chair
Jeremy Fineman (Georgetown University)
SPAA Local Arrangements
Lata Narayanan (Concordia University)
[DMANET] SPAA 2013 - First Call for Papers
Apologies for multiple postings
======================================================
SPAA 2013 First Call for Papers
======================================================
25th ACM Symposium on
Parallelism in Algorithms and Architectures (SPAA 2013)
July 23-25, 2013 Montreal, Quebec, Canada
http://www.spaa-conference.org
This year SPAA will be co-located with the ACM SIGACT-SIGOPS Symposium
on
Principles of Distributed Computing (PODC 2013)
======================================================
Important Dates:
Submission deadlines:
- Abstract: February 11, 2013, 11:59pm EST
- Full versions: February 13, 2013, 11:59pm EST
Notification: April 15, 2013
Camera-ready: May 14, 2013
======================================================
Contributed papers are sought in all areas of parallel algorithms and
architectures, encompassing any computation system that can perform
multiple
operations or tasks simultaneously. Topics of interest include, but
are not
limited to:
- parallel and distributed algorithms
- parallel and distributed data structures
- green computing & power-efficient architectures
- management of massive data sets
- parallel complexity theory
- parallel and distributed architectures
- multi-core architectures
- instruction level parallelism and VLSI
- compilers and tools for concurrent programming
- supercomputing architecture and computing
- transactional memory hardware and software
- the internet and the world wide web
- game theory and collaborative learning
- routing and information dissemination
- resource management and awareness
- peer-to-peer systems
- mobile, ad-hoc, and sensor networks
- robustness, self-stabilization, and security
- synergy of parallelism in algorithms, programming, and architecture
Conference presentations will have two formats:
Regular presentations will be allotted a 25-minute talk and up to 10
pages in the proceedings. This format is intended for contributions
reporting original research, submitted exclusively to this conference.
Brief announcements will be allotted a 10-minute talk and a 2-page
abstract in the proceedings. This format is a forum for brief
communications, which may be published later in other conferences.
Every regular paper is eligible for the best paper award. The program
committee may decline to make this award or may split the award among
multiple papers.
Submission:
Authors of contributed papers are encouraged to submit their manuscript
electronically. To submit electronically, visit http://www.spaa-conference.org
for instructions. This is the preferred method of submission. Authors
unable
to submit electronically should contact the program chair Berthold
Vocking at
voecking@cs.rwth-aachen.de to receive instructions.
The cover page should include (1) title, (2) authors and affiliation,
(3) postal and email address of the contact author, (4) a brief abstract
describing the content of the paper, and (5) an indication if this is a
regular presentation or a brief announcement. If requested by the
authors, an
extended abstract that is not selected for a regular presentation will
also be
considered for the SPAA brief announcements session. Such a request
will not
affect the consideration of the paper for a regular presentation.
Submissions for regular presentations should include an introduction
understandable to a nonspecialist including motivation and previous
work, and
a technical exposition directed to a specialist. A submission should not
exceed 10 printed pages in 11-point type or larger (excluding cover,
figures,
and references). More details may be supplied in a clearly marked
appendix to
be read at the discretion of the program committee. A submission for
brief
announcements should be no longer than three pages (excluding the cover
page) using at least 11-point font.
======================================================
Program Committee:
Matthew Andrews (Bell Labs) Hagit Attiya (Technion) Zhao jun Bai (UC
Davis)
Michael Bender (Stony Brook U.) George Bosilca (U. of Tennessee) Michael
Dinitz (Weizmann Inst.) Robert Elsasser (Salzburg U.) Thomas Erlebach
(Leicester U.) Magnus M. Halldorsson (Reykjavik U.) Torsten Hoefl‚er
(TU Berlin
& T-Labs) Giuseppe Persiano (U. Salerno) Cynthia A. Phillips (Sandia
Labs)
Rajmohan Rajaraman (Northeastern U.) Andrea W. Richa (Arizona State U.)
Andre Schiper (EPFL Lausanne) Stefan Schmid (TU Berlin) Ravi Sundaram
(Northeastern U.) Peter Varman (Rice U.) Berthold Vocking (RWTH Aachen
U.)
Jennifer L. Welch (Texas A&M U.) Norbert Zeh (Dalhousie U.)
======================================================
Conference Committee:
Program Chair
Berthold Vocking (RWTH Aachen U.)
Conference Chair
Guy Blelloch (Carnegie Mellon University)
Secretary
Christian Scheideler (University of Paderborn)
Treasurer
David Bunde (Knox College)
Publicity Chair
Jeremy Fineman (Georgetown University)
SPAA Local Arrangements
Lata Narayanan (Concordia University)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
======================================================
SPAA 2013 First Call for Papers
======================================================
25th ACM Symposium on
Parallelism in Algorithms and Architectures (SPAA 2013)
July 23-25, 2013 Montreal, Quebec, Canada
http://www.spaa-conference.org
This year SPAA will be co-located with the ACM SIGACT-SIGOPS Symposium
on
Principles of Distributed Computing (PODC 2013)
======================================================
Important Dates:
Submission deadlines:
- Abstract: February 11, 2013, 11:59pm EST
- Full versions: February 13, 2013, 11:59pm EST
Notification: April 15, 2013
Camera-ready: May 14, 2013
======================================================
Contributed papers are sought in all areas of parallel algorithms and
architectures, encompassing any computation system that can perform
multiple
operations or tasks simultaneously. Topics of interest include, but
are not
limited to:
- parallel and distributed algorithms
- parallel and distributed data structures
- green computing & power-efficient architectures
- management of massive data sets
- parallel complexity theory
- parallel and distributed architectures
- multi-core architectures
- instruction level parallelism and VLSI
- compilers and tools for concurrent programming
- supercomputing architecture and computing
- transactional memory hardware and software
- the internet and the world wide web
- game theory and collaborative learning
- routing and information dissemination
- resource management and awareness
- peer-to-peer systems
- mobile, ad-hoc, and sensor networks
- robustness, self-stabilization, and security
- synergy of parallelism in algorithms, programming, and architecture
Conference presentations will have two formats:
Regular presentations will be allotted a 25-minute talk and up to 10
pages in the proceedings. This format is intended for contributions
reporting original research, submitted exclusively to this conference.
Brief announcements will be allotted a 10-minute talk and a 2-page
abstract in the proceedings. This format is a forum for brief
communications, which may be published later in other conferences.
Every regular paper is eligible for the best paper award. The program
committee may decline to make this award or may split the award among
multiple papers.
Submission:
Authors of contributed papers are encouraged to submit their manuscript
electronically. To submit electronically, visit http://www.spaa-conference.org
for instructions. This is the preferred method of submission. Authors
unable
to submit electronically should contact the program chair Berthold
Vocking at
voecking@cs.rwth-aachen.de to receive instructions.
The cover page should include (1) title, (2) authors and affiliation,
(3) postal and email address of the contact author, (4) a brief abstract
describing the content of the paper, and (5) an indication if this is a
regular presentation or a brief announcement. If requested by the
authors, an
extended abstract that is not selected for a regular presentation will
also be
considered for the SPAA brief announcements session. Such a request
will not
affect the consideration of the paper for a regular presentation.
Submissions for regular presentations should include an introduction
understandable to a nonspecialist including motivation and previous
work, and
a technical exposition directed to a specialist. A submission should not
exceed 10 printed pages in 11-point type or larger (excluding cover,
figures,
and references). More details may be supplied in a clearly marked
appendix to
be read at the discretion of the program committee. A submission for
brief
announcements should be no longer than three pages (excluding the cover
page) using at least 11-point font.
======================================================
Program Committee:
Matthew Andrews (Bell Labs) Hagit Attiya (Technion) Zhao jun Bai (UC
Davis)
Michael Bender (Stony Brook U.) George Bosilca (U. of Tennessee) Michael
Dinitz (Weizmann Inst.) Robert Elsasser (Salzburg U.) Thomas Erlebach
(Leicester U.) Magnus M. Halldorsson (Reykjavik U.) Torsten Hoefl‚er
(TU Berlin
& T-Labs) Giuseppe Persiano (U. Salerno) Cynthia A. Phillips (Sandia
Labs)
Rajmohan Rajaraman (Northeastern U.) Andrea W. Richa (Arizona State U.)
Andre Schiper (EPFL Lausanne) Stefan Schmid (TU Berlin) Ravi Sundaram
(Northeastern U.) Peter Varman (Rice U.) Berthold Vocking (RWTH Aachen
U.)
Jennifer L. Welch (Texas A&M U.) Norbert Zeh (Dalhousie U.)
======================================================
Conference Committee:
Program Chair
Berthold Vocking (RWTH Aachen U.)
Conference Chair
Guy Blelloch (Carnegie Mellon University)
Secretary
Christian Scheideler (University of Paderborn)
Treasurer
David Bunde (Knox College)
Publicity Chair
Jeremy Fineman (Georgetown University)
SPAA Local Arrangements
Lata Narayanan (Concordia University)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Friday, October 5, 2012
LICS 2013 - Call for Workshop Proposals
Call for Workshop Proposals
LICS 2013
28th ACM/IEEE Symposium on Logic In Computer Science
http://www2.informatik.hu-berlin.de/lics/lics13/
The twenty-eighth ACM/IEEE Symposium on Logic In Computer Science
(LICS 2013) will be held in New Orleans, USA, 25--28 June 2013. It
will be colocated with MFPS (Mathematical Foundations of Programming
Semantics) and CSF (IEEE Computer Security Foundations). Possible
dates for workshops are Monday 24 June, Friday 28 June afternoon, and
Saturday 29 June.
Researchers and practitioners are invited to submit proposals for
workshops on topics relating logic - broadly construed - to computer
science or related fields. Typically, LICS workshops feature a number
of invited speakers and a number of contributed presentations. LICS
workshops do not usually produce formal proceedings. However, in the
past there have been special issues of journals based in part on
certain LICS workshops.
Proposals should include:
- A short scientific summary and justification of the proposed
topic. This should include a discussion of the particular benefits
of the topic to the LICS community.
- A discussion of the proposed format and agenda.
- The proposed duration, which is typically one day (two-day
workshops can be accommodated too).
- Your preferred dates. This is important!
- Let us know if you would like your workshop to be a joint
workshop with CSF. In that case you should submit to both.
- Procedures for selecting participants and papers.
- Expected number of participants. This is important!
- Potential invited speakers.
- Plans for dissemination (for example, special issues of journals).
Proposals should be submitted via Easychair at
https://www.easychair.org/conferences/?conf=licsworkshops2013
Important dates:
Submission deadline: November 26, 2012
Notification: December 20, 2012
Program of the workshops ready: April 30, 2013
Workshops: June 24, 2013 or June 28-29, 2013
LICS conference: June 25-28, 2013
The workshops selection committee consists of the LICS General Chair,
LICS Workshops Chair, LICS 2013 PC Chair and LICS 2013 Conference
Chair.
LICS 2013
28th ACM/IEEE Symposium on Logic In Computer Science
http://www2.informatik.hu-berlin.de/lics/lics13/
The twenty-eighth ACM/IEEE Symposium on Logic In Computer Science
(LICS 2013) will be held in New Orleans, USA, 25--28 June 2013. It
will be colocated with MFPS (Mathematical Foundations of Programming
Semantics) and CSF (IEEE Computer Security Foundations). Possible
dates for workshops are Monday 24 June, Friday 28 June afternoon, and
Saturday 29 June.
Researchers and practitioners are invited to submit proposals for
workshops on topics relating logic - broadly construed - to computer
science or related fields. Typically, LICS workshops feature a number
of invited speakers and a number of contributed presentations. LICS
workshops do not usually produce formal proceedings. However, in the
past there have been special issues of journals based in part on
certain LICS workshops.
Proposals should include:
- A short scientific summary and justification of the proposed
topic. This should include a discussion of the particular benefits
of the topic to the LICS community.
- A discussion of the proposed format and agenda.
- The proposed duration, which is typically one day (two-day
workshops can be accommodated too).
- Your preferred dates. This is important!
- Let us know if you would like your workshop to be a joint
workshop with CSF. In that case you should submit to both.
- Procedures for selecting participants and papers.
- Expected number of participants. This is important!
- Potential invited speakers.
- Plans for dissemination (for example, special issues of journals).
Proposals should be submitted via Easychair at
https://www.easychair.org/conferences/?conf=licsworkshops2013
Important dates:
Submission deadline: November 26, 2012
Notification: December 20, 2012
Program of the workshops ready: April 30, 2013
Workshops: June 24, 2013 or June 28-29, 2013
LICS conference: June 25-28, 2013
The workshops selection committee consists of the LICS General Chair,
LICS Workshops Chair, LICS 2013 PC Chair and LICS 2013 Conference
Chair.
10 PhD AND POST-DOC POSITIONS IN FORMAL METHODS AT TU VIENNA
Dear moderator of the THEORYNT mailing list,
I tried sending the below job annoucement to the THEORYNT on
14.09.2012, but it was not published so far. Please consider it for
publication.
Best regards
Florian Zuleger
--------------
10 PhD AND POST-DOC POSITIONS IN FORMAL METHODS
The Formal Methods in Systems Engineering Group at Vienna University
of Technology offers 10 funded PhD/PostDoc positions in three exciting
research projects addressing the reliability and correctness of
software. The topics range from model checking, abstract
interpretation, static analysis and automata theory to testing and
runtime verification, offering ample research opportunities for
talented scientists, from system enthusiasts to the more theoretically
minded. You can find more details below or on our website
http://www.forsyte.at/hiring. Please do not hestitate to contact us
(hiring@forsyte.at), if you have further questions.
REQUIREMENTS
We are looking for highly motivated students and scientists who are
willing to make outstanding contributions in the field of formal
methods and want to work in a team of world-class researchers.
Applicants are expected to hold a master's degree (for PhD positions)
or a doctorate (for PostDoc positions) in computer science, electrical
engineering, or a related discipline, and have excellent communication
skills in spoken and written English.
VIENNA - A great place to work on Formal Methods
Vienna has recently evolved into a major hub for formal methods. The
city is home to a number of renowned and highly visible researchers in
the field of automated verification and logic. Vienna, the capital of
Austria, is a beautiful city in the heart of Europe, and consistently
ranked no. 1 in the 'Quality of Living' study by Mercer.
HOW TO APPLY
We would be happy to receive an email with your resume at
hiring@forsyte.at. Please tell us why you think that you are a good
match for our group and whether there is a specific project you would
like to work on.
=============================================================
Proof Seeding for Software Verification (PROSEED)
Rigorous Systems Engineering (RiSE)
(principal investigator: Helmut Veith)
=============================================================
The PROSEED research project proposes an innovative approach to
verification which is based on the insight that program texts are
carrying important information which is directed at the human readers
of the program. We will utilize this human engineering information in
a logically sound framework for computer-aided verification. RiSE
investigates techniques beyond classical model checking and
a-posteriori verification. We are trying to answer the following
questions:
- How can we exploit informal information in program source code for
model checking?
- How can we model check distributed algorithms?
- How can we test concurrent software?
- How many processes/threads suffice to find an error?
- How can we combine abstraction and bit-precision?
- How can we build networks with guaranteed properties?
- How can we combine testing and model checking?
=============================================================
Heisenbugs: From Detection to Explanation
(principal investigator: Georg Weissenbacher)
=============================================================
Heisenbugs are software bugs that defy attempts to analyse their
causes. The Heisenbugs project is concerned with the detection,
reproduction, and explanation of intricate error scenarios in
concurrent programs and embedded systems (such as smartphones). To
tackle the problem, we will apply a wide spectrum of debugging
techniques, program analyses, and automated reasoning.
The project offers ample research opportunities for talented students
and postdocs, from system enthusiasts to logic buffs. We are looking
for outstanding (prospective) researchers who are excited about at
least one of the following areas:
- Static analysis, model checking, and abstract interpretation. If it
was always your dream to to keep that state space from exploding, this
might be the right job for you.
- Logic and automated decision procedures. You?re fascinated by
unsatisfiable cores and don?t shy away from logical abduction? Austria
is the right place for you.
- Compilers, debuggers, and run-time monitoring. If you?re an abstract
syntax tree hugger and don?t scare away from the nitty-gritty details
of multi-core architectures or virtual machines, we want you for our
team!
=============================================================
Automated Program Analysis for Bounds on Resource Consumption
(principal investigator: Florian Zuleger)
=============================================================
Computer programs are consuming physical resources such as time,
memory, power and bandwidth which are crucial for non-functional
correctness. To guarantee efficiency, energy use, accuracy of bid
placement by cloud providers etc. we need development tools that can
predict the resource consumption of a program in the form of upper
bounds. In this project we will develop a quantitative modeling
framework for bound analysis, and apply this framework as backbone for
practical bound analysis tools.
The project offers intriguing research challenges ranging from
practical to theoretical problems:
- The design and analysis of appropriate abstractions for bound
analysis using tools from logic, automata theory, formal methods, etc.
- The developement and implementation of new static analyses for bound
analysis problems using methods such as software model checking and
abstract interpretation.
- The extension and application of bound analyses to real-world
problems such as finding perfomance bugs through static program
analysis techniques.
=============================================================
Vienna: A thriving environment for working on Formal Methods
=============================================================
Vienna is home to a number of world-class researchers in the field of
automated verification and logic. The city has evolved into a hub in a
network of excellence on formal methods.
- World-class Faculty in Formal Methods and Logic at TU Vienna:
Radu Grosu, Laura Kovács, Ulrich Schmid, Uwe Egly, Thomas Eiter,
Stefan Szeider, Reinhard Pichler, Alex Leitsch, Matthias Baaz, Agata
Ciabattoni, and many more
- The Network of Excellence on Formal Methods in Austria (RiSE)
provides many opportunities to collaborate with renowned scientists
across Austria
- The Vienna Center for Logic and Algorithms (VCLA) invites visiting
researchers and hosts workshops and student schools such as the Winter
School on Verification.
- We have a joint weekly seminar with IST Austria with many
international guests
- We organize a joint workshop with the PUMA graduate school at TU
Munich once a year
- We organise CAV 2013 in St. Petersburg!
- We will host FLOC 2014 in Vienna!
=============================================================
Vienna: The best living standard in the world!
=============================================================
- A beautiful city in the heart of Europe
- No. 1 in 'Quality of Living' ranking by Mercer (since 2009)
- Enjoy the Viennese Coffee Houses listed as 'Intangible Cultural
Heritage' by the UNESCO
- Find out about the notorious 'Wiener Schmaeh' (Viennese charm)
I tried sending the below job annoucement to the THEORYNT on
14.09.2012, but it was not published so far. Please consider it for
publication.
Best regards
Florian Zuleger
--------------
10 PhD AND POST-DOC POSITIONS IN FORMAL METHODS
The Formal Methods in Systems Engineering Group at Vienna University
of Technology offers 10 funded PhD/PostDoc positions in three exciting
research projects addressing the reliability and correctness of
software. The topics range from model checking, abstract
interpretation, static analysis and automata theory to testing and
runtime verification, offering ample research opportunities for
talented scientists, from system enthusiasts to the more theoretically
minded. You can find more details below or on our website
http://www.forsyte.at/hiring. Please do not hestitate to contact us
(hiring@forsyte.at), if you have further questions.
REQUIREMENTS
We are looking for highly motivated students and scientists who are
willing to make outstanding contributions in the field of formal
methods and want to work in a team of world-class researchers.
Applicants are expected to hold a master's degree (for PhD positions)
or a doctorate (for PostDoc positions) in computer science, electrical
engineering, or a related discipline, and have excellent communication
skills in spoken and written English.
VIENNA - A great place to work on Formal Methods
Vienna has recently evolved into a major hub for formal methods. The
city is home to a number of renowned and highly visible researchers in
the field of automated verification and logic. Vienna, the capital of
Austria, is a beautiful city in the heart of Europe, and consistently
ranked no. 1 in the 'Quality of Living' study by Mercer.
HOW TO APPLY
We would be happy to receive an email with your resume at
hiring@forsyte.at. Please tell us why you think that you are a good
match for our group and whether there is a specific project you would
like to work on.
=============================================================
Proof Seeding for Software Verification (PROSEED)
Rigorous Systems Engineering (RiSE)
(principal investigator: Helmut Veith)
=============================================================
The PROSEED research project proposes an innovative approach to
verification which is based on the insight that program texts are
carrying important information which is directed at the human readers
of the program. We will utilize this human engineering information in
a logically sound framework for computer-aided verification. RiSE
investigates techniques beyond classical model checking and
a-posteriori verification. We are trying to answer the following
questions:
- How can we exploit informal information in program source code for
model checking?
- How can we model check distributed algorithms?
- How can we test concurrent software?
- How many processes/threads suffice to find an error?
- How can we combine abstraction and bit-precision?
- How can we build networks with guaranteed properties?
- How can we combine testing and model checking?
=============================================================
Heisenbugs: From Detection to Explanation
(principal investigator: Georg Weissenbacher)
=============================================================
Heisenbugs are software bugs that defy attempts to analyse their
causes. The Heisenbugs project is concerned with the detection,
reproduction, and explanation of intricate error scenarios in
concurrent programs and embedded systems (such as smartphones). To
tackle the problem, we will apply a wide spectrum of debugging
techniques, program analyses, and automated reasoning.
The project offers ample research opportunities for talented students
and postdocs, from system enthusiasts to logic buffs. We are looking
for outstanding (prospective) researchers who are excited about at
least one of the following areas:
- Static analysis, model checking, and abstract interpretation. If it
was always your dream to to keep that state space from exploding, this
might be the right job for you.
- Logic and automated decision procedures. You?re fascinated by
unsatisfiable cores and don?t shy away from logical abduction? Austria
is the right place for you.
- Compilers, debuggers, and run-time monitoring. If you?re an abstract
syntax tree hugger and don?t scare away from the nitty-gritty details
of multi-core architectures or virtual machines, we want you for our
team!
=============================================================
Automated Program Analysis for Bounds on Resource Consumption
(principal investigator: Florian Zuleger)
=============================================================
Computer programs are consuming physical resources such as time,
memory, power and bandwidth which are crucial for non-functional
correctness. To guarantee efficiency, energy use, accuracy of bid
placement by cloud providers etc. we need development tools that can
predict the resource consumption of a program in the form of upper
bounds. In this project we will develop a quantitative modeling
framework for bound analysis, and apply this framework as backbone for
practical bound analysis tools.
The project offers intriguing research challenges ranging from
practical to theoretical problems:
- The design and analysis of appropriate abstractions for bound
analysis using tools from logic, automata theory, formal methods, etc.
- The developement and implementation of new static analyses for bound
analysis problems using methods such as software model checking and
abstract interpretation.
- The extension and application of bound analyses to real-world
problems such as finding perfomance bugs through static program
analysis techniques.
=============================================================
Vienna: A thriving environment for working on Formal Methods
=============================================================
Vienna is home to a number of world-class researchers in the field of
automated verification and logic. The city has evolved into a hub in a
network of excellence on formal methods.
- World-class Faculty in Formal Methods and Logic at TU Vienna:
Radu Grosu, Laura Kovács, Ulrich Schmid, Uwe Egly, Thomas Eiter,
Stefan Szeider, Reinhard Pichler, Alex Leitsch, Matthias Baaz, Agata
Ciabattoni, and many more
- The Network of Excellence on Formal Methods in Austria (RiSE)
provides many opportunities to collaborate with renowned scientists
across Austria
- The Vienna Center for Logic and Algorithms (VCLA) invites visiting
researchers and hosts workshops and student schools such as the Winter
School on Verification.
- We have a joint weekly seminar with IST Austria with many
international guests
- We organize a joint workshop with the PUMA graduate school at TU
Munich once a year
- We organise CAV 2013 in St. Petersburg!
- We will host FLOC 2014 in Vienna!
=============================================================
Vienna: The best living standard in the world!
=============================================================
- A beautiful city in the heart of Europe
- No. 1 in 'Quality of Living' ranking by Mercer (since 2009)
- Enjoy the Viennese Coffee Houses listed as 'Intangible Cultural
Heritage' by the UNESCO
- Find out about the notorious 'Wiener Schmaeh' (Viennese charm)
Thursday, October 4, 2012
[DMANET] Deadline extension: October 19 || ACHI 2013 || February 24 - March 1, 2013 - Nice, France
INVITATION:
=================
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to
submit and publish original scientific results to ACHI 2013.
The submission deadline is October 19, 2012.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA
Journals: http://www.iariajournals.org
=================
============== ACHI 2013 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
ACHI 2013, The Sixth International Conference on Advances in Computer-Human Interactions
February 24 - March 1, 2013 - Nice, France
General page: http://www.iaria.org/conferences2013/ACHI13.html
Call for Papers: http://www.iaria.org/conferences2013/CfPACHI13.html
- regular papers
- short papers (work in progress)
- posters
Submission page: http://www.iaria.org/conferences2013/SubmitACHI13.html
Submission deadline: October 19, 2012
Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org
Print proceedings will be available via Curran Associates, Inc.: http://www.proceedings.com/9769.html
Articles will be archived in the free access ThinkMind Digital Library: http://www.thinkmind.org
Please note the Poster and Work in Progress options.
The topics suggested by the conference can be discussed in term of concepts, state of the art,
research, standards, implementations, running experiments, applications, and industrial case studies.
Authors are invited to submit complete unpublished papers, which are not under review in any other
conference or journal in the following, but not limited to, topic areas.
All tracks are open to both research and industry contributions, in terms of Regular papers, Posters,
Work in progress, Technical/marketing/business presentations, Demos, Tutorials, and Panels.
Before submission, please check and comply with the Editorial rules:
http://www.iaria.org/editorialrules.html
ACHI 2013 Topics (topics and submission details: see CfP on the site)
INTER: Interfaces
Graphical user interfaces; Intelligent user interfaces; Adaptive user interfaces; Multi-modal user
interfaces; Context-based interfaces; Virtual reality and 3D interfaces; Speech and natural language
interfaces; Interfaces for collaborative systems; Interfaces for restricted environments;
Internationalization and reflections of culture on interface design; Interfaces for disadvantaged
users; Interface specification and design; Interface prototyping; Interface testing; Interface
evaluation; Interface generators and other tools for developing interfaces; Data visualization;
Visualization techniques; Interactive visualization
OUI: Organic user interfaces
Interface-oriented materials and devices; Physical and digital representation; Sensing and display
technologies; Rollable and foldable displays with tactile properties; Skin-based input; Analog input
interaction design; Flexible display technologies; Functional-based display forms; Flexible-computing
and curve computer interactions; 3D continuous display interfaces
HAPTIC: Haptic interfaces
Fundamental of haptic interactions; Tangible user interfaces; Bidirectional information flow ;
Haptography; Haptic feedback and control; Bodyware (embedded sensors; flexible structures, associative
memories, actuation and power systems); Magnetic levitation haptic interfaces; Kinetic motion-based
interaction; Kinetic motion and haptic design; Mindware (learning, adaptation, head-hand coordination,
bimanual coordination; discovering affordance, interaction and imitation); Language of motion / Gesture
annotation; Interfaces with kinetic properties; Sensor actuator design, development and evaluation;
Linear haptic display; Fingertip haptic display; Pen based force display; High bandwidth force display;
Quality of experience model for haptic interactions; Haptics rendering;
SYSTEMS: Interactive systems
Highly interactive systems; Intelligent agents and systems; Adaptive systems; Context-aware systems;
Multi-user multi-interface systems; Collaborative systems; Computer-supported cooperative work;
Distributed information spaces; Communicators and advisory systems; Interaction through wireless
communication networks
DEVICES: Interaction devices
General input and output devices; Virtual reality input and output devices; Interaction devices for
immersive environments; Shareable devices and services; Mobile devices and services; Pervasive devices
and services; Small displays; Very large displays; Tangible user interfaces; Wearable computing;
Interaction devices for disadvantaged users; Interaction devices for computer games
DESIGN & EVAL: Interaction & interface design & evaluation
Interface metaphors; Interaction styles; Interaction paradigms; Requirements specification methods
and tools; Analysis methods and tools; Design methods and tools; Evaluation paradigms; Evaluation
methods and tools; Evaluation frameworks; Scenarios; Task analysis; Conceptual design; Physical design;
Information architecture; Information design for websites; Guidelines and heuristics; Experience
design; Environmental design; Ethnography; Contextual design; Service design;
MODELS: Principles, theories, and models
Cognitive models; Conceptual models; Mental models; Frameworks for cognition; Model-based design of
interactive systems; Formal methods in human-computer interaction
USER: User modeling and user focus
Usability and user experience goals; User testing; User modeling; User profiling; Predictive models
(e.g., for user delay prediction); Human perceptible thresholds; User support systems; Psychological
foundations for designing interactive system; Human information processing; Digital human modeling;
Engineering psychology; Ergonomics; Hearing and haptics; Affective computing
PARADIGMS: Traditional and emerging paradigms
Interaction paradigms; Mobile computing; Wearable computing; Location-aware computing; Context-aware
computing; Ubiquitous computing; Pervasive computing; Transparent computing; Attentive environments;
Virtual reality; Augmented reality and tangible bits; Immersive environments; Human-based computation;
Visual languages and environments; End-user programming; Hypermedia advances and applications; New
visions of human-computer interaction
ACCESS: Usability and universal accessibility
Interaction and interface design for people with disabilities; Interaction and interface design for
the young and the elderly; Universal access and usability; Usability engineering; Usability testing and
evaluation; Usability and internationalization
HUM-ROBOTS: Human-robot interaction
Fundamentals of human-robot cooperation; Cognitive models of human-robot interaction; Adaptable
autonomy and knowledge exchange; Autonomy and trust; Awareness and monitoring of humans; Task
allocation and coordination; Human guided robot learning; User evaluations of robot performance;
Metrics for human-robot interaction; Long-term interaction robotics; Health and personal care robotics;
Social Robotics; Multi-modal human-robot communication; Robot intermediaries; Experiments and
applications
HUM- AGENTS: Agents and human interaction
Principles of agent-to-human interaction; Models for human-agent interaction; Social persuasion in
human-agent interaction; Designing for human-agent interaction; Socially intelligent agents and the
human in the loop; Agents for human-human interaction; Agent-based human-computer-interaction; Human
cooperation and agent-based interaction; Human interaction with autonomous agents Agent-based
human-robot interaction; Human and artificial agents emotional interaction
SOCIAL: Social aspects of human-computer interaction
Societal implications of human-computer interactions; Social computing and software Online
communities Weblogs and other community building tools Online support for discovery and creativity;
Tool support for discovery and innovation Expressive and attentive interfaces and environments
Affective aspects of human-computer interaction Emotional design
GAMES: Computer games and gaming
Computer game technology; Computer game engineering; Foundations of computer game design and
development; Development processes and supporting tools; Management aspects of computer game
development; Architectures and frameworks for computer games; Game-based training and simulation;
Serious games; Multi-user games; Online games; Online gaming; Game theories; Audio, video and text in
digital games; New computer games and case studies; Performance improvements in computer games; Social
impact of games and gaming
EDUCATION: Human-computer interaction in education and training
Interactive systems for education and training; Online and communications support for education and
training; Interfaces, interactions and systems for distance education; Software tools for courseware
development and delivery; Collaborative systems for teaching, studying and learning; Handheld mobile
devices for education and training; Advisory and recommendation systems Techniques and tools for
information localization, retrieval & storage; Web annotation systems; Case studies and applications
MED APPS: Applications in medicine
Interactive systems for medical applications; Interactive systems for telemedicine; Interactive
systems for telehealth; Interactive systems for telepathology; Interactive systems for telecardiology;
Interactive systems for telesurgery; Interactive personal medical devices; Digital imagery and
visualization frameworks; Role of colors and color imaging in medicine; Multidimensional projections
with application to medicine; Data mining and image retrieval techniques for medical applications;
Imaging interfaces and navigation; Internet imaging localization, retrieval and archiving; Video
techniques for medical images; Internet support for remote medicine; Computer-controlled communications
for medical applications; Medical informatics; Software and devices for patient monitoring; Interactive
software for therapy and recovery
TELECONF: Teleconferencing
Fundamentals for teleconferencing; Platforms for teleconferencing; Devices for teleconferencing;
Videoconferencing, Web Conferencing; Performance in teleconference applications; Real-time aspects in
teleconferencing; Privacy and security in teleconference applications; QoS/SLA for teleconferencing
applications; Teleconferencing services; Business models for teleconferencing
APPLICATIONS: Other domain applications
Interactive interfaces and systems for scientific applications; Interactive interfaces and systems
for engineering applications; Interactive interfaces and systems for business applications; Interactive
interfaces and systems for activities in arts & humanities; Interactive interfaces and systems for
scientific research; Other applications of interactive interfaces and systems
------------------------------
Committee: http://www.iaria.org/conferences2013/ComACHI13.html
================================================
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
=================
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to
submit and publish original scientific results to ACHI 2013.
The submission deadline is October 19, 2012.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA
Journals: http://www.iariajournals.org
=================
============== ACHI 2013 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
ACHI 2013, The Sixth International Conference on Advances in Computer-Human Interactions
February 24 - March 1, 2013 - Nice, France
General page: http://www.iaria.org/conferences2013/ACHI13.html
Call for Papers: http://www.iaria.org/conferences2013/CfPACHI13.html
- regular papers
- short papers (work in progress)
- posters
Submission page: http://www.iaria.org/conferences2013/SubmitACHI13.html
Submission deadline: October 19, 2012
Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org
Print proceedings will be available via Curran Associates, Inc.: http://www.proceedings.com/9769.html
Articles will be archived in the free access ThinkMind Digital Library: http://www.thinkmind.org
Please note the Poster and Work in Progress options.
The topics suggested by the conference can be discussed in term of concepts, state of the art,
research, standards, implementations, running experiments, applications, and industrial case studies.
Authors are invited to submit complete unpublished papers, which are not under review in any other
conference or journal in the following, but not limited to, topic areas.
All tracks are open to both research and industry contributions, in terms of Regular papers, Posters,
Work in progress, Technical/marketing/business presentations, Demos, Tutorials, and Panels.
Before submission, please check and comply with the Editorial rules:
http://www.iaria.org/editorialrules.html
ACHI 2013 Topics (topics and submission details: see CfP on the site)
INTER: Interfaces
Graphical user interfaces; Intelligent user interfaces; Adaptive user interfaces; Multi-modal user
interfaces; Context-based interfaces; Virtual reality and 3D interfaces; Speech and natural language
interfaces; Interfaces for collaborative systems; Interfaces for restricted environments;
Internationalization and reflections of culture on interface design; Interfaces for disadvantaged
users; Interface specification and design; Interface prototyping; Interface testing; Interface
evaluation; Interface generators and other tools for developing interfaces; Data visualization;
Visualization techniques; Interactive visualization
OUI: Organic user interfaces
Interface-oriented materials and devices; Physical and digital representation; Sensing and display
technologies; Rollable and foldable displays with tactile properties; Skin-based input; Analog input
interaction design; Flexible display technologies; Functional-based display forms; Flexible-computing
and curve computer interactions; 3D continuous display interfaces
HAPTIC: Haptic interfaces
Fundamental of haptic interactions; Tangible user interfaces; Bidirectional information flow ;
Haptography; Haptic feedback and control; Bodyware (embedded sensors; flexible structures, associative
memories, actuation and power systems); Magnetic levitation haptic interfaces; Kinetic motion-based
interaction; Kinetic motion and haptic design; Mindware (learning, adaptation, head-hand coordination,
bimanual coordination; discovering affordance, interaction and imitation); Language of motion / Gesture
annotation; Interfaces with kinetic properties; Sensor actuator design, development and evaluation;
Linear haptic display; Fingertip haptic display; Pen based force display; High bandwidth force display;
Quality of experience model for haptic interactions; Haptics rendering;
SYSTEMS: Interactive systems
Highly interactive systems; Intelligent agents and systems; Adaptive systems; Context-aware systems;
Multi-user multi-interface systems; Collaborative systems; Computer-supported cooperative work;
Distributed information spaces; Communicators and advisory systems; Interaction through wireless
communication networks
DEVICES: Interaction devices
General input and output devices; Virtual reality input and output devices; Interaction devices for
immersive environments; Shareable devices and services; Mobile devices and services; Pervasive devices
and services; Small displays; Very large displays; Tangible user interfaces; Wearable computing;
Interaction devices for disadvantaged users; Interaction devices for computer games
DESIGN & EVAL: Interaction & interface design & evaluation
Interface metaphors; Interaction styles; Interaction paradigms; Requirements specification methods
and tools; Analysis methods and tools; Design methods and tools; Evaluation paradigms; Evaluation
methods and tools; Evaluation frameworks; Scenarios; Task analysis; Conceptual design; Physical design;
Information architecture; Information design for websites; Guidelines and heuristics; Experience
design; Environmental design; Ethnography; Contextual design; Service design;
MODELS: Principles, theories, and models
Cognitive models; Conceptual models; Mental models; Frameworks for cognition; Model-based design of
interactive systems; Formal methods in human-computer interaction
USER: User modeling and user focus
Usability and user experience goals; User testing; User modeling; User profiling; Predictive models
(e.g., for user delay prediction); Human perceptible thresholds; User support systems; Psychological
foundations for designing interactive system; Human information processing; Digital human modeling;
Engineering psychology; Ergonomics; Hearing and haptics; Affective computing
PARADIGMS: Traditional and emerging paradigms
Interaction paradigms; Mobile computing; Wearable computing; Location-aware computing; Context-aware
computing; Ubiquitous computing; Pervasive computing; Transparent computing; Attentive environments;
Virtual reality; Augmented reality and tangible bits; Immersive environments; Human-based computation;
Visual languages and environments; End-user programming; Hypermedia advances and applications; New
visions of human-computer interaction
ACCESS: Usability and universal accessibility
Interaction and interface design for people with disabilities; Interaction and interface design for
the young and the elderly; Universal access and usability; Usability engineering; Usability testing and
evaluation; Usability and internationalization
HUM-ROBOTS: Human-robot interaction
Fundamentals of human-robot cooperation; Cognitive models of human-robot interaction; Adaptable
autonomy and knowledge exchange; Autonomy and trust; Awareness and monitoring of humans; Task
allocation and coordination; Human guided robot learning; User evaluations of robot performance;
Metrics for human-robot interaction; Long-term interaction robotics; Health and personal care robotics;
Social Robotics; Multi-modal human-robot communication; Robot intermediaries; Experiments and
applications
HUM- AGENTS: Agents and human interaction
Principles of agent-to-human interaction; Models for human-agent interaction; Social persuasion in
human-agent interaction; Designing for human-agent interaction; Socially intelligent agents and the
human in the loop; Agents for human-human interaction; Agent-based human-computer-interaction; Human
cooperation and agent-based interaction; Human interaction with autonomous agents Agent-based
human-robot interaction; Human and artificial agents emotional interaction
SOCIAL: Social aspects of human-computer interaction
Societal implications of human-computer interactions; Social computing and software Online
communities Weblogs and other community building tools Online support for discovery and creativity;
Tool support for discovery and innovation Expressive and attentive interfaces and environments
Affective aspects of human-computer interaction Emotional design
GAMES: Computer games and gaming
Computer game technology; Computer game engineering; Foundations of computer game design and
development; Development processes and supporting tools; Management aspects of computer game
development; Architectures and frameworks for computer games; Game-based training and simulation;
Serious games; Multi-user games; Online games; Online gaming; Game theories; Audio, video and text in
digital games; New computer games and case studies; Performance improvements in computer games; Social
impact of games and gaming
EDUCATION: Human-computer interaction in education and training
Interactive systems for education and training; Online and communications support for education and
training; Interfaces, interactions and systems for distance education; Software tools for courseware
development and delivery; Collaborative systems for teaching, studying and learning; Handheld mobile
devices for education and training; Advisory and recommendation systems Techniques and tools for
information localization, retrieval & storage; Web annotation systems; Case studies and applications
MED APPS: Applications in medicine
Interactive systems for medical applications; Interactive systems for telemedicine; Interactive
systems for telehealth; Interactive systems for telepathology; Interactive systems for telecardiology;
Interactive systems for telesurgery; Interactive personal medical devices; Digital imagery and
visualization frameworks; Role of colors and color imaging in medicine; Multidimensional projections
with application to medicine; Data mining and image retrieval techniques for medical applications;
Imaging interfaces and navigation; Internet imaging localization, retrieval and archiving; Video
techniques for medical images; Internet support for remote medicine; Computer-controlled communications
for medical applications; Medical informatics; Software and devices for patient monitoring; Interactive
software for therapy and recovery
TELECONF: Teleconferencing
Fundamentals for teleconferencing; Platforms for teleconferencing; Devices for teleconferencing;
Videoconferencing, Web Conferencing; Performance in teleconference applications; Real-time aspects in
teleconferencing; Privacy and security in teleconference applications; QoS/SLA for teleconferencing
applications; Teleconferencing services; Business models for teleconferencing
APPLICATIONS: Other domain applications
Interactive interfaces and systems for scientific applications; Interactive interfaces and systems
for engineering applications; Interactive interfaces and systems for business applications; Interactive
interfaces and systems for activities in arts & humanities; Interactive interfaces and systems for
scientific research; Other applications of interactive interfaces and systems
------------------------------
Committee: http://www.iaria.org/conferences2013/ComACHI13.html
================================================
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] ELC PD positions
---------------------------------------------------------------------
Two-year post-doctoral positions, Tokyo and Kyoto, Computation Theory
---------------------------------------------------------------------
http://www.al.ics.saitama-u.ac.jp/elc/en/?pd
The newly established Center for Exploring the Limits of Computation
(CELC, Tokyo, Japan) seeks applications for four post-doctoral fellow
positions in Computational Complexity Theory and related areas. The
appointments are for two years starting in April 2013 (or as soon as
possible). A monthly salary of approximately 350,000 Japanese yen
plus a research allowance will be offered. Applicants should hold a
PhD in theoretical computer science or related fields (or be expected
to do so by July 2013).
Two of the fellows will be based at the Tokyo site (Tokyo Institute of
Technology and the CELC) and two at the Kyoto site (Kyoto University).
Collaboration with other research groups of the ELC project (including
visits for several months) will be encouraged and supported.
Applications should include
* a curriculum vitae,
* list of publications,
* a research statement, and
* three letters of referees (to be sent directly from the referees).
Applications and letters of referees should be sent via email to
elc-pd-application@is.titech.ac.jp. Priority will be given to
applications received by December 20, 2012. Applicants may be invited
to an interview in early 2013 (the travel expenses will be covered).
---------
About ELC
---------
Exploring the Limits of Computation (ELC) is a five-year research
project funded by the Japanese Ministry of Education, Culture, Sports,
Science and Technology.
Project Title (formal):
A multifaceted approach toward understanding the limitations of computation
Short Title: Exploring the Limits of Computation (ELC)
Project Term: 2012.7 - 2017.3
Researchers have proposed various techniques for investigating the
limits of computation, many of which have been sharpened in depth
during the last two decades. We may soon be entering the stage of
expecting some big breakthrough results toward understanding the
limits of computation.
In this project, we investigate these techniques and relationships
among them with the goal of finding the next steps toward a big
breakthrough. We propose the following three lines of research, each
of which will be conducted by three core research groups (i.e., nine
core research groups altogether).
A. Team for pushing the current frontier of research on the limits of
computation.
B. Team for investigating the limits of computation by using various
algorithmic/optimization techniques (even by using supercomputers).
C. Team for introducing new approaches to and interpretations of the
existing techniques for investigating the limits of computation.
We also create a research center (CELC) in Tokyo for investigating
computational complexity theory by stimulating worldwide
collaborations among researchers based on our core research groups,
hosting short/long term visitors and postdoctoral researchers, and
organizing various meetings and workshops. We welcome researchers
working on subjects related to computational complexity theory to join
us for various occasions.
Project webpage (currently under construction)
http://www.al.ics.saitama-u.ac.jp/elc/en/
％％％％％％％％％％％％％％％％％％％％％％％％％％％％％％％％％％％％
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Two-year post-doctoral positions, Tokyo and Kyoto, Computation Theory
---------------------------------------------------------------------
http://www.al.ics.saitama-u.ac.jp/elc/en/?pd
The newly established Center for Exploring the Limits of Computation
(CELC, Tokyo, Japan) seeks applications for four post-doctoral fellow
positions in Computational Complexity Theory and related areas. The
appointments are for two years starting in April 2013 (or as soon as
possible). A monthly salary of approximately 350,000 Japanese yen
plus a research allowance will be offered. Applicants should hold a
PhD in theoretical computer science or related fields (or be expected
to do so by July 2013).
Two of the fellows will be based at the Tokyo site (Tokyo Institute of
Technology and the CELC) and two at the Kyoto site (Kyoto University).
Collaboration with other research groups of the ELC project (including
visits for several months) will be encouraged and supported.
Applications should include
* a curriculum vitae,
* list of publications,
* a research statement, and
* three letters of referees (to be sent directly from the referees).
Applications and letters of referees should be sent via email to
elc-pd-application@is.titech.ac.jp. Priority will be given to
applications received by December 20, 2012. Applicants may be invited
to an interview in early 2013 (the travel expenses will be covered).
---------
About ELC
---------
Exploring the Limits of Computation (ELC) is a five-year research
project funded by the Japanese Ministry of Education, Culture, Sports,
Science and Technology.
Project Title (formal):
A multifaceted approach toward understanding the limitations of computation
Short Title: Exploring the Limits of Computation (ELC)
Project Term: 2012.7 - 2017.3
Researchers have proposed various techniques for investigating the
limits of computation, many of which have been sharpened in depth
during the last two decades. We may soon be entering the stage of
expecting some big breakthrough results toward understanding the
limits of computation.
In this project, we investigate these techniques and relationships
among them with the goal of finding the next steps toward a big
breakthrough. We propose the following three lines of research, each
of which will be conducted by three core research groups (i.e., nine
core research groups altogether).
A. Team for pushing the current frontier of research on the limits of
computation.
B. Team for investigating the limits of computation by using various
algorithmic/optimization techniques (even by using supercomputers).
C. Team for introducing new approaches to and interpretations of the
existing techniques for investigating the limits of computation.
We also create a research center (CELC) in Tokyo for investigating
computational complexity theory by stimulating worldwide
collaborations among researchers based on our core research groups,
hosting short/long term visitors and postdoctoral researchers, and
organizing various meetings and workshops. We welcome researchers
working on subjects related to computational complexity theory to join
us for various occasions.
Project webpage (currently under construction)
http://www.al.ics.saitama-u.ac.jp/elc/en/
％％％％％％％％％％％％％％％％％％％％％％％％％％％％％％％％％％％％
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Wednesday, October 3, 2012
[DMANET] PhD Position at The University of Newcastle
The University of Newcastle
Australian Postgraduate Award (Industry)
PhD scholarship
Australian Postgraduate Award (Industry)
PhD scholarship
The School of Mathematical and Physical Sciences at the University of
Newcastle is offering an APA(I) scholarship worth AUD $28,715 per annum.
The scholarship will be funded under an ARC Linkage Grant, and is
collaborative with researchers in Computer Science & Software
Engineering at the University of Melbourne, and with Newcastle-based
companies Hunter Valley Coal Chain Coordinator Limited (HVCCC)
www.hvccc.com.au and Triple Point Technologies (TPT) www.tpt.com.
Applications for this APA(I) scholarship close 1 December 2012.
Project Background
Blended mineral products are important for Australia's economy.
Blending is carried out in stockpiles, often at multiple points in the
mining supply chain, and complexities in stockyard and supply chain
operations can negatively impact the value sought from blending. Whilst
blending has long been tackled with mathematical programming techniques,
little has been done to integrate blending with stockyard management and
supply chain planning.
This project will develop new mathematical and computational tools for
operational stockyard and supply chain planning, to maximize the value
realised from blended products, and the efficiency with which they are
delivered through the supply chain.
This project will be supervised by Professors Natashia Boland and
Martin Savelsbergh.
Availability
This APA(I) scholarship will be offered for 3 years, with possible
extension of up to 6 months. If the successful candidate is an
international student a full tuition fee scholarship and single overseas
student health cover will be offered for the same period. Domestic
Research Higher Degree students are not liable for fees.
The scholarship is available for study in the School of Mathematical
and Physical Sciences at the University of Newcastle. It is expected
that your study will commence in Semester 1, 2013. For further
information on the School and the University, refer to sections below,
or go to
http://www.newcastle.edu.au/school/mathematical-physical-sciences/ or
http://www.newcastle.edu.au/students/research-higher-degree/. For
further information about Newcastle, refer to sections below, or visit
http://www.visitnewcastle.com.au/visitnewcastle.asp
Payment information
APA(I) scholarship awards include a living allowance of $28,715 per
annum. Note: Stipend rates are indexed annually. Provision also exists
for a relocation allowance and a thesis allowance.
Applicant attributes
The successful applicant will hold an undergraduate degree, and have
undertaken some form of preliminary research training in operations
research, engineering, mathematics, computer science, or related
discipline. Applicants from software engineering or industrial
engineering will find their skills particularly relevant. Strong
mathematical and computer programming skills are essential and knowledge
of operations research, constraint programming and/or artificial
intelligence techniques would be an asset. A can-do attitude, and
excellent communication skills, will also be highly valued.
Eligibility
This scholarship is for study in Australia for those who have achieved
Honours Class 2 Division I or equivalent, in their undergraduate
degrees, or who have an appropriate higher qualification. The
equivalency of international students' qualifications to Honours Class
2 Division 1 will be assessed on a case-by-case basis.
Application details
To apply for this scholarship please send your CV, together with an
academic transcript showing details of all courses you have taken, the
grades you were awarded, an interpretation of those grades, and the
names and contact details of at least two people who can provide
confidential references, to the address shown below. If your transcript
is not in English, please provide an English translation. If you have
completed a thesis or other publications, please feel free to include
them in the email application. Include details of your computer
programming skills and experience, your mathematical training and
background, and any experience you have with modelling and solving
industrial problems.
The University of Newcastle
The University of Newcastle is a major research university in
Australia, ranked in the top ten in Australia for overall research
funding and outcomes. Further, the University was the top-ranked in
Australia in the discipline of applied mathematics in the recent
Excellence in Research Australia (ERA) rankings.
The main University of Newcastle campus is located in the city of
Newcastle: on the East coast of Australia about two hours drive north
from Sydney. The School of Mathematical and Physical Sciences provides a
stimulating and supportive environment for research and teaching, with
ample opportunities for collaborative research partnerships both within
the university and with industry. Although well known for its beautiful
beaches and pleasant climate, Newcastle is home to a significant port,
and Australia's largest coal-handling terminal. Newcastle is also at the
gateway of one of Australia's largest wine-growing regions, the Hunter
valley. Thus opportunities for research in shipping, transportation,
and mineral resources abound.
Main Contact
Daniel Urquhart
School of Mathematical and Physical Sciences
The University of Newcastle
T +61 2 4921 5440
E Daniel.A.Urquhart@Newcastle.edu.au
W www.newcastle.edu.au/research/rhd/scholarships.html
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[fm-announcements] NASA Formal Methods - NFM 2013, Call for Papers
==================================================================
5th NASA Formal Methods Symposium (NFM) 2013
NASA Ames Research Center
Moffett Field, CA, USA
May 14-16, 2013
http://ti.arc.nasa.gov/events/nfm-2013/
==================================================================
Theme of the Conference:
The NASA Formal Methods Symposium is a forum for theoreticians and
practitioners from academia, industry, and government, with the goals
of identifying challenges and providing solutions to achieving
assurance in mission- and safety-critical systems. Within NASA, for
example, such systems include autonomous robots, separation assurance
algorithms for aircraft, Next Generation Air Transportation (NextGen),
and autonomous rendezvous and docking for spacecraft. Moreover,
emerging paradigms such as code generation and safety cases are
bringing with them new challenges and opportunities. The focus of the
symposium will be on formal techniques, their theory, current
capabilities, and limitations, as well as their application to
aerospace, robotics, and other safety-critical systems.
We encourage submissions on cross-cutting approaches that bring
together formal methods and techniques from other domains such as
probabilistic reasoning, machine learning, control theory, robotics,
and quantum computing among others. Topics of Interest
Topics of Interest:
* Formal verification, including theorem proving, model checking,
and static analysis
* Techniques and algorithms for scaling formal methods, including
but not restricted to abstraction and symbolic methods,
compositional techniques, as well as parallel and distributed
techniques
* Use of formal methods in automated software engineering and
testing Model-based development
* Formal program synthesis
* Runtime monitoring and verification
* Formal approaches to fault tolerance
* Formal analysis of cyber-physical systems, including hybrid and
embedded systems
* Formal methods in systems engineering, modeling, requirements
and specifications
* Applications of formal methods to aerospace systems
* Use of formal methods in safety cases
* Use of formal methods in human-machine interaction analysis
* Formal methods for multi-core, GPU-based implementations
* Application of formal methods to emerging technologies, e.g.,
mobile applications, autonomous systems, web-based application
Important Dates
Dec 7, 2012 Paper Submission Deadline
Jan 28 - Feb 1, 2013 Rebuttal phase
Feb 15, 2013 Acceptance Notification
March 15, 2013 Camera-Ready Version Submission
May 13 - 16, 2013 NFM Symposium
Submission
There are two categories of submissions:
* Regular papers describing fully developed work and complete
results (15 pages).
* Short papers describing tools, experience reports, or
descriptions of work in progress with preliminary results (6
pages)
All papers should be in English and describe original work that has
not been published or submitted elsewhere. All submissions will be
fully reviewed by members of the program committee. Papers must use
Springer’s Lecture Notes in Computer Science (LNCS) style and be put
in PDF format, as the papers will appear as a volume in Lecture Notes
of Computer Science. Submissions are now open through easychair.
easychair.org/conferences/?conf=nfm2013
Registration:
NFM 2013 will be held at NASA Ames Research Center, Moffett Field, CA
on May 14 to 16, 2013. There will not be a registration fee charged to
participants. All interested individuals, including non-US citizens,
are welcome to attend, to listen to the talks, and to participate in
discussions; however, all attendees must register. Details coming soon
on Registration. Program Chairs
Chairs:
Guillaume Brat, CMU/NASA Ames Research Center, USA
Neha Rungta, SGT Inc/NASA Ames Research Center, USA
Arnaud Venet, CMU/NASA Ames Research Center, USA
Program Committee:
Julia Badger, NASA, USA
Thomas Ball, Microsoft Research, USA
Ricky Butler, NASA Langley Research Center, USA
Patrice Chalin, Kansas State University, USA
Darren Cofer, Rockwell Collins, USA
Radhia Cousot, CNRS/École Normale Supérieure, France
Leonardo De Moura, Microsoft Research, USA
Ewen Denney, SGT Inc./NASA Ames, USA
Ben Di Vito, NASA Langley Research Center, USA
Jim Disbrow, NASA, USA
Gilles Dowek, INRIA, France
Matt Dwyer, University of Nebraska, USA
Eric Feron, Georgia Institute of Technology, USA
Jean-Christophe Filliatre, CNRS, France
Kathleen Fisher, Tufts University, USA
Pierre-Loic Garoche, ONERA, France
Eric Goubault, CEA/Saclay, France
Orna Grumberg, Technion, Israel
Klaus Havelund, JPL, USA
Gerard Holzmann, JPL, USA
JoeHurd, Galois, Inc., USA
Ranjit Jhala, University of California, San Diego, USA
Hadas Kress-Gazit, Cornell University, USA
Daniel Kroening, Oxford University, UK
Tiziana Margaria, Univ. Potsdam, Germany
Célia Martinie, University Paul Sabatier, France
Eric Mercer, Brigham Young University, USA
Paul Miner, NASA Langley Research Center, USA
Cesar Munoz, NASA Langley Research Center, USA
Natasha Neogi, National Institute of Aerospace, USA
Ganesh Pai, SGT/NASA Ames Research Center, USA
Corina Pasareanu CMU/NASA Ames Research Center, USA
Charles Pecheur, UC Louvain, Belgium
Suzette Person, NASA Langley Research Center, USA
Franco Raimondi, Middlesex University, UK
John Regehr, University of Utah, USA
Kristin Yvonne Rozier, NASA Ames, USA
Sriram Sankaranarayanan, University of Colorado, USA
Stephen F. Siegel, University of Delaware, USA
Radu Siminiceanu, National Institute of Aerospace, USA
Henny Sipma, Kestrel Technology, France
Sarah Thompson, SGT Inc./NASA Ames Research Center, USA
Cesare Tinelli, University of Iowa, USA
Oksana Tkachuk, SGT Inc./NASA Ames Research Center, USA
Helmut Veith, Vienna University of Technology, Austria
Willem Visser, Stellenbosch University, South Africa
Michael Whalen, University of Minnesota, USA
Virginie Wiels, ONERA/DTIM, France
Reinhard Wilhelm Saarland University, Germany
5th NASA Formal Methods Symposium (NFM) 2013
NASA Ames Research Center
Moffett Field, CA, USA
May 14-16, 2013
http://ti.arc.nasa.gov/events/nfm-2013/
==================================================================
Theme of the Conference:
The NASA Formal Methods Symposium is a forum for theoreticians and
practitioners from academia, industry, and government, with the goals
of identifying challenges and providing solutions to achieving
assurance in mission- and safety-critical systems. Within NASA, for
example, such systems include autonomous robots, separation assurance
algorithms for aircraft, Next Generation Air Transportation (NextGen),
and autonomous rendezvous and docking for spacecraft. Moreover,
emerging paradigms such as code generation and safety cases are
bringing with them new challenges and opportunities. The focus of the
symposium will be on formal techniques, their theory, current
capabilities, and limitations, as well as their application to
aerospace, robotics, and other safety-critical systems.
We encourage submissions on cross-cutting approaches that bring
together formal methods and techniques from other domains such as
probabilistic reasoning, machine learning, control theory, robotics,
and quantum computing among others. Topics of Interest
Topics of Interest:
* Formal verification, including theorem proving, model checking,
and static analysis
* Techniques and algorithms for scaling formal methods, including
but not restricted to abstraction and symbolic methods,
compositional techniques, as well as parallel and distributed
techniques
* Use of formal methods in automated software engineering and
testing Model-based development
* Formal program synthesis
* Runtime monitoring and verification
* Formal approaches to fault tolerance
* Formal analysis of cyber-physical systems, including hybrid and
embedded systems
* Formal methods in systems engineering, modeling, requirements
and specifications
* Applications of formal methods to aerospace systems
* Use of formal methods in safety cases
* Use of formal methods in human-machine interaction analysis
* Formal methods for multi-core, GPU-based implementations
* Application of formal methods to emerging technologies, e.g.,
mobile applications, autonomous systems, web-based application
Important Dates
Dec 7, 2012 Paper Submission Deadline
Jan 28 - Feb 1, 2013 Rebuttal phase
Feb 15, 2013 Acceptance Notification
March 15, 2013 Camera-Ready Version Submission
May 13 - 16, 2013 NFM Symposium
Submission
There are two categories of submissions:
* Regular papers describing fully developed work and complete
results (15 pages).
* Short papers describing tools, experience reports, or
descriptions of work in progress with preliminary results (6
pages)
All papers should be in English and describe original work that has
not been published or submitted elsewhere. All submissions will be
fully reviewed by members of the program committee. Papers must use
Springer’s Lecture Notes in Computer Science (LNCS) style and be put
in PDF format, as the papers will appear as a volume in Lecture Notes
of Computer Science. Submissions are now open through easychair.
easychair.org/conferences/?conf=nfm2013
Registration:
NFM 2013 will be held at NASA Ames Research Center, Moffett Field, CA
on May 14 to 16, 2013. There will not be a registration fee charged to
participants. All interested individuals, including non-US citizens,
are welcome to attend, to listen to the talks, and to participate in
discussions; however, all attendees must register. Details coming soon
on Registration. Program Chairs
Chairs:
Guillaume Brat, CMU/NASA Ames Research Center, USA
Neha Rungta, SGT Inc/NASA Ames Research Center, USA
Arnaud Venet, CMU/NASA Ames Research Center, USA
Program Committee:
Julia Badger, NASA, USA
Thomas Ball, Microsoft Research, USA
Ricky Butler, NASA Langley Research Center, USA
Patrice Chalin, Kansas State University, USA
Darren Cofer, Rockwell Collins, USA
Radhia Cousot, CNRS/École Normale Supérieure, France
Leonardo De Moura, Microsoft Research, USA
Ewen Denney, SGT Inc./NASA Ames, USA
Ben Di Vito, NASA Langley Research Center, USA
Jim Disbrow, NASA, USA
Gilles Dowek, INRIA, France
Matt Dwyer, University of Nebraska, USA
Eric Feron, Georgia Institute of Technology, USA
Jean-Christophe Filliatre, CNRS, France
Kathleen Fisher, Tufts University, USA
Pierre-Loic Garoche, ONERA, France
Eric Goubault, CEA/Saclay, France
Orna Grumberg, Technion, Israel
Klaus Havelund, JPL, USA
Gerard Holzmann, JPL, USA
JoeHurd, Galois, Inc., USA
Ranjit Jhala, University of California, San Diego, USA
Hadas Kress-Gazit, Cornell University, USA
Daniel Kroening, Oxford University, UK
Tiziana Margaria, Univ. Potsdam, Germany
Célia Martinie, University Paul Sabatier, France
Eric Mercer, Brigham Young University, USA
Paul Miner, NASA Langley Research Center, USA
Cesar Munoz, NASA Langley Research Center, USA
Natasha Neogi, National Institute of Aerospace, USA
Ganesh Pai, SGT/NASA Ames Research Center, USA
Corina Pasareanu CMU/NASA Ames Research Center, USA
Charles Pecheur, UC Louvain, Belgium
Suzette Person, NASA Langley Research Center, USA
Franco Raimondi, Middlesex University, UK
John Regehr, University of Utah, USA
Kristin Yvonne Rozier, NASA Ames, USA
Sriram Sankaranarayanan, University of Colorado, USA
Stephen F. Siegel, University of Delaware, USA
Radu Siminiceanu, National Institute of Aerospace, USA
Henny Sipma, Kestrel Technology, France
Sarah Thompson, SGT Inc./NASA Ames Research Center, USA
Cesare Tinelli, University of Iowa, USA
Oksana Tkachuk, SGT Inc./NASA Ames Research Center, USA
Helmut Veith, Vienna University of Technology, Austria
Willem Visser, Stellenbosch University, South Africa
Michael Whalen, University of Minnesota, USA
Virginie Wiels, ONERA/DTIM, France
Reinhard Wilhelm Saarland University, Germany
Apologies for multiple postings
==================================================================
5th NASA Formal Methods Symposium (NFM) 2013
NASA Ames Research Center
Moffett Field, CA, USA
May 14-16, 2013
http://ti.arc.nasa.gov/events/nfm-2013/
==================================================================
Theme of the Conference:
The NASA Formal Methods Symposium is a forum for theoreticians and
practitioners from academia, industry, and government, with the goals
of identifying challenges and providing solutions to achieving
assurance in mission- and safety-critical systems. Within NASA, for
example, such systems include autonomous robots, separation assurance
algorithms for aircraft, Next Generation Air Transportation (NextGen),
and autonomous rendezvous and docking for spacecraft. Moreover,
emerging paradigms such as code generation and safety cases are
bringing with them new challenges and opportunities. The focus of the
symposium will be on formal techniques, their theory, current
capabilities, and limitations, as well as their application to
aerospace, robotics, and other safety-critical systems.
We encourage submissions on cross-cutting approaches that bring
together formal methods and techniques from other domains such as
probabilistic reasoning, machine learning, control theory, robotics,
and quantum computing among others. Topics of Interest
Topics of Interest:
* Formal verification, including theorem proving, model checking,
and static analysis
* Techniques and algorithms for scaling formal methods, including
but not restricted to abstraction and symbolic methods,
compositional techniques, as well as parallel and distributed
techniques
* Use of formal methods in automated software engineering and
testing Model-based development
* Formal program synthesis
* Runtime monitoring and verification
* Formal approaches to fault tolerance
* Formal analysis of cyber-physical systems, including hybrid and
embedded systems
* Formal methods in systems engineering, modeling, requirements
and specifications
* Applications of formal methods to aerospace systems
* Use of formal methods in safety cases
* Use of formal methods in human-machine interaction analysis
* Formal methods for multi-core, GPU-based implementations
* Application of formal methods to emerging technologies, e.g.,
mobile applications, autonomous systems, web-based application
Important Dates
Dec 7, 2012 Paper Submission Deadline
Jan 28 - Feb 1, 2013 Rebuttal phase
Feb 15, 2013 Acceptance Notification
March 15, 2013 Camera-Ready Version Submission
May 13 - 16, 2013 NFM Symposium
Submission
There are two categories of submissions:
* Regular papers describing fully developed work and complete
results (15 pages).
* Short papers describing tools, experience reports, or
descriptions of work in progress with preliminary results (6
pages)
All papers should be in English and describe original work that has
not been published or submitted elsewhere. All submissions will be
fully reviewed by members of the program committee. Papers must use
Springer's Lecture Notes in Computer Science (LNCS) style and be put
in PDF format, as the papers will appear as a volume in Lecture Notes
of Computer Science. Submissions are now open through easychair.
easychair.org/conferences/?conf=nfm2013
Registration:
NFM 2013 will be held at NASA Ames Research Center, Moffett Field, CA
on May 14 to 16, 2013. There will not be a registration fee charged to
participants. All interested individuals, including non-US citizens,
are welcome to attend, to listen to the talks, and to participate in
discussions; however, all attendees must register. Details coming soon
on Registration. Program Chairs
Chairs:
Guillaume Brat, CMU/NASA Ames Research Center, USA
Neha Rungta, SGT Inc/NASA Ames Research Center, USA
Arnaud Venet, CMU/NASA Ames Research Center, USA
Program Committee:
Julia Badger, NASA, USA
Thomas Ball, Microsoft Research, USA
Ricky Butler, NASA Langley Research Center, USA
Patrice Chalin, Kansas State University, USA
Darren Cofer, Rockwell Collins, USA
Radhia Cousot, CNRS/École Normale Supérieure, France
Leonardo De Moura, Microsoft Research, USA
Ewen Denney, SGT Inc./NASA Ames, USA
Ben Di Vito, NASA Langley Research Center, USA
Jim Disbrow, NASA, USA
Gilles Dowek, INRIA, France
Matt Dwyer, University of Nebraska, USA
Eric Feron, Georgia Institute of Technology, USA
Jean-Christophe Filliatre, CNRS, France
Kathleen Fisher, Tufts University, USA
Pierre-Loic Garoche, ONERA, France
Eric Goubault, CEA/Saclay, France
Orna Grumberg, Technion, Israel
Klaus Havelund, JPL, USA
Gerard Holzmann, JPL, USA
JoeHurd, Galois, Inc., USA
Ranjit Jhala, University of California, San Diego, USA
Hadas Kress-Gazit, Cornell University, USA
Daniel Kroening, Oxford University, UK
Tiziana Margaria, Univ. Potsdam, Germany
Célia Martinie, University Paul Sabatier, France
Eric Mercer, Brigham Young University, USA
Paul Miner, NASA Langley Research Center, USA
Cesar Munoz, NASA Langley Research Center, USA
Natasha Neogi, National Institute of Aerospace, USA
Ganesh Pai, SGT/NASA Ames Research Center, USA
Corina Pasareanu CMU/NASA Ames Research Center, USA
Charles Pecheur, UC Louvain, Belgium
Suzette Person, NASA Langley Research Center, USA
Franco Raimondi, Middlesex University, UK
John Regehr, University of Utah, USA
Kristin Yvonne Rozier, NASA Ames, USA
Sriram Sankaranarayanan, University of Colorado, USA
Stephen F. Siegel, University of Delaware, USA
Radu Siminiceanu, National Institute of Aerospace, USA
Henny Sipma, Kestrel Technology, France
Sarah Thompson, SGT Inc./NASA Ames Research Center, USA
Cesare Tinelli, University of Iowa, USA
Oksana Tkachuk, SGT Inc./NASA Ames Research Center, USA
Helmut Veith, Vienna University of Technology, Austria
Willem Visser, Stellenbosch University, South Africa
Michael Whalen, University of Minnesota, USA
Virginie Wiels, ONERA/DTIM, France
Reinhard Wilhelm Saarland University, Germany
==================================================================
5th NASA Formal Methods Symposium (NFM) 2013
NASA Ames Research Center
Moffett Field, CA, USA
May 14-16, 2013
http://ti.arc.nasa.gov/events/nfm-2013/
==================================================================
Theme of the Conference:
The NASA Formal Methods Symposium is a forum for theoreticians and
practitioners from academia, industry, and government, with the goals
of identifying challenges and providing solutions to achieving
assurance in mission- and safety-critical systems. Within NASA, for
example, such systems include autonomous robots, separation assurance
algorithms for aircraft, Next Generation Air Transportation (NextGen),
and autonomous rendezvous and docking for spacecraft. Moreover,
emerging paradigms such as code generation and safety cases are
bringing with them new challenges and opportunities. The focus of the
symposium will be on formal techniques, their theory, current
capabilities, and limitations, as well as their application to
aerospace, robotics, and other safety-critical systems.
We encourage submissions on cross-cutting approaches that bring
together formal methods and techniques from other domains such as
probabilistic reasoning, machine learning, control theory, robotics,
and quantum computing among others. Topics of Interest
Topics of Interest:
* Formal verification, including theorem proving, model checking,
and static analysis
* Techniques and algorithms for scaling formal methods, including
but not restricted to abstraction and symbolic methods,
compositional techniques, as well as parallel and distributed
techniques
* Use of formal methods in automated software engineering and
testing Model-based development
* Formal program synthesis
* Runtime monitoring and verification
* Formal approaches to fault tolerance
* Formal analysis of cyber-physical systems, including hybrid and
embedded systems
* Formal methods in systems engineering, modeling, requirements
and specifications
* Applications of formal methods to aerospace systems
* Use of formal methods in safety cases
* Use of formal methods in human-machine interaction analysis
* Formal methods for multi-core, GPU-based implementations
* Application of formal methods to emerging technologies, e.g.,
mobile applications, autonomous systems, web-based application
Important Dates
Dec 7, 2012 Paper Submission Deadline
Jan 28 - Feb 1, 2013 Rebuttal phase
Feb 15, 2013 Acceptance Notification
March 15, 2013 Camera-Ready Version Submission
May 13 - 16, 2013 NFM Symposium
Submission
There are two categories of submissions:
* Regular papers describing fully developed work and complete
results (15 pages).
* Short papers describing tools, experience reports, or
descriptions of work in progress with preliminary results (6
pages)
All papers should be in English and describe original work that has
not been published or submitted elsewhere. All submissions will be
fully reviewed by members of the program committee. Papers must use
Springer's Lecture Notes in Computer Science (LNCS) style and be put
in PDF format, as the papers will appear as a volume in Lecture Notes
of Computer Science. Submissions are now open through easychair.
easychair.org/conferences/?conf=nfm2013
Registration:
NFM 2013 will be held at NASA Ames Research Center, Moffett Field, CA
on May 14 to 16, 2013. There will not be a registration fee charged to
participants. All interested individuals, including non-US citizens,
are welcome to attend, to listen to the talks, and to participate in
discussions; however, all attendees must register. Details coming soon
on Registration. Program Chairs
Chairs:
Guillaume Brat, CMU/NASA Ames Research Center, USA
Neha Rungta, SGT Inc/NASA Ames Research Center, USA
Arnaud Venet, CMU/NASA Ames Research Center, USA
Program Committee:
Julia Badger, NASA, USA
Thomas Ball, Microsoft Research, USA
Ricky Butler, NASA Langley Research Center, USA
Patrice Chalin, Kansas State University, USA
Darren Cofer, Rockwell Collins, USA
Radhia Cousot, CNRS/École Normale Supérieure, France
Leonardo De Moura, Microsoft Research, USA
Ewen Denney, SGT Inc./NASA Ames, USA
Ben Di Vito, NASA Langley Research Center, USA
Jim Disbrow, NASA, USA
Gilles Dowek, INRIA, France
Matt Dwyer, University of Nebraska, USA
Eric Feron, Georgia Institute of Technology, USA
Jean-Christophe Filliatre, CNRS, France
Kathleen Fisher, Tufts University, USA
Pierre-Loic Garoche, ONERA, France
Eric Goubault, CEA/Saclay, France
Orna Grumberg, Technion, Israel
Klaus Havelund, JPL, USA
Gerard Holzmann, JPL, USA
JoeHurd, Galois, Inc., USA
Ranjit Jhala, University of California, San Diego, USA
Hadas Kress-Gazit, Cornell University, USA
Daniel Kroening, Oxford University, UK
Tiziana Margaria, Univ. Potsdam, Germany
Célia Martinie, University Paul Sabatier, France
Eric Mercer, Brigham Young University, USA
Paul Miner, NASA Langley Research Center, USA
Cesar Munoz, NASA Langley Research Center, USA
Natasha Neogi, National Institute of Aerospace, USA
Ganesh Pai, SGT/NASA Ames Research Center, USA
Corina Pasareanu CMU/NASA Ames Research Center, USA
Charles Pecheur, UC Louvain, Belgium
Suzette Person, NASA Langley Research Center, USA
Franco Raimondi, Middlesex University, UK
John Regehr, University of Utah, USA
Kristin Yvonne Rozier, NASA Ames, USA
Sriram Sankaranarayanan, University of Colorado, USA
Stephen F. Siegel, University of Delaware, USA
Radu Siminiceanu, National Institute of Aerospace, USA
Henny Sipma, Kestrel Technology, France
Sarah Thompson, SGT Inc./NASA Ames Research Center, USA
Cesare Tinelli, University of Iowa, USA
Oksana Tkachuk, SGT Inc./NASA Ames Research Center, USA
Helmut Veith, Vienna University of Technology, Austria
Willem Visser, Stellenbosch University, South Africa
Michael Whalen, University of Minnesota, USA
Virginie Wiels, ONERA/DTIM, France
Reinhard Wilhelm Saarland University, Germany
[DMANET] SAT 2013 Call for Workshops, Competitions, and Tutorials
[ We apologize if you receive multiple copies of this call. ]
-------------------------------------------------------------------------
1ST CALL FOR WORKSHOPS, COMPETITIONS, AND TUTORIALS
Sixteenth International Conference on
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING
--- SAT 2013 ---
Helsinki, Finland, July 8-12, 2013
http://sat2013.cs.helsinki.fi/
-------------------------------------------------------------------------
PROPOSAL SUBMISSION DEADLINE: November 2, 2012
Proposals should be submitted by email to sat2013@easychair.org, either
in
ASCII text or as an attachment in PDF form, and should include
in sufficient detail the information outlined below.
Proposals with incomplete information may be submitted, in case the
deadline
is a bit early. Please indicate in your proposal a plan and/or
schedule
for getting the remaining information.
-------------------------------------------------------------------------
CALL FOR WORKSHOPS
Workshop proposals for SAT 2013 are solicited. Both well-established
workshops, possible previously affiliated with other venues, and newer
ones are encouraged. Similarly, proposals for workshops with a tight
focus on a core area within SAT, ranging from theory to applications,
as well as those with a broader focus on SAT and related formalisms
and
paradigms, are very welcome.
Please provide the following information in your proposal:
+ Workshop title.
+ Names and affiliations of organizers.
+ Proposed workshop duration (from half a day to full day).
+ Brief description of the goals and the scope of the workshop.
Why is the workshop relevant for SAT?
+ Preliminary call-for-papers and program committee composition.
+ Is the workshop new or has it met previously? In the latter case
provide information on previous meetings (success, number of
submissions,
number of participants, etc).
+ What are the plans for publication?
The main workshop day is July 8. Two-day workshops for July 8-9,
overlapping
with the main conference for July 9, may also be considered.
The main organizers of accepted workshops are expected to be present
at SAT 2013. Should multiple proposals be submitted for similar
workshops,
possibilities of combining the workshops into one may be considered.
----------------------------------------------------------------------------
CALL FOR SOLVER COMPETITIONS
Solver competitions for SAT solvers and their extensions
are a traditional part of the SAT conferences.
For SAT 2013, proposals for solver competitions are solicited openly.
The goal is to foster the development of both core SAT solvers as well
as
their extensions (including, but not restricted to structural SAT
solving,
MaxSAT, MUS computation, QBF, SMT, etc) and SAT-based systems for
important
application domains.
Organization of the accepted solver competitions is expected to be
separate from the SAT 2013 conference organization.
The organizers of the accepted competitions are expected to be present
at SAT 2013. Results of the accepted competitions are expected to
be presented during the main conference, and time for these reports
will
allocated within the main conference schedule.
Please provide the following information in your proposal:
+ Competition title.
+ Names and affiliations of organizers.
+ Duration and schedule of the competition.
+ Description of the competition task and the evaluation procedure.
+ Is the competition new or has it been organized before?
In the latter case information on previous competitions should be
given.
+ What computing resources are required and how will they be provided?
Should multiple proposals be submitted for similar competitions,
possibilities
of combining the competition organizations into one may be considered.
------------------------------------------------------------------------------
CALL FOR TUTORIALS
As a new development for 2013, tutorial proposals for SAT 2013 are
solicited.
Tutorials are expected to be 1-2 hours long, although other durations
will
be considered. The tutorial may have a theoretical or applied focus,
on a topic of interest for SAT 2013, broadly construed.
Please provide the following information in your proposal:
+ Tutorial title.
+ Names and affiliations of organizer(s).
+ Brief description of the tutorial's goals and topics to be covered.
+ Planned duration (1.5 hours being the default).
+ Whether or not a version of the tutorial has been given previously.
If so, a pointer to those presentation materials will be helpful.
All accepted tutorials will be scheduled to take place during the main
conference.
-----------------------------------------------------------------------------
Should you have any questions regarding these calls, please contact us
via email using sat2013@easychair.org .
SAT 2013 Program Committee Chairs
Matti Jarvisalo University of Helsinki
Allen Van Gelder University of California at Santa Cruz
**********************************************************
*
* 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/
*
**********************************************************
-------------------------------------------------------------------------
1ST CALL FOR WORKSHOPS, COMPETITIONS, AND TUTORIALS
Sixteenth International Conference on
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING
--- SAT 2013 ---
Helsinki, Finland, July 8-12, 2013
http://sat2013.cs.helsinki.fi/
-------------------------------------------------------------------------
PROPOSAL SUBMISSION DEADLINE: November 2, 2012
Proposals should be submitted by email to sat2013@easychair.org, either
in
ASCII text or as an attachment in PDF form, and should include
in sufficient detail the information outlined below.
Proposals with incomplete information may be submitted, in case the
deadline
is a bit early. Please indicate in your proposal a plan and/or
schedule
for getting the remaining information.
-------------------------------------------------------------------------
CALL FOR WORKSHOPS
Workshop proposals for SAT 2013 are solicited. Both well-established
workshops, possible previously affiliated with other venues, and newer
ones are encouraged. Similarly, proposals for workshops with a tight
focus on a core area within SAT, ranging from theory to applications,
as well as those with a broader focus on SAT and related formalisms
and
paradigms, are very welcome.
Please provide the following information in your proposal:
+ Workshop title.
+ Names and affiliations of organizers.
+ Proposed workshop duration (from half a day to full day).
+ Brief description of the goals and the scope of the workshop.
Why is the workshop relevant for SAT?
+ Preliminary call-for-papers and program committee composition.
+ Is the workshop new or has it met previously? In the latter case
provide information on previous meetings (success, number of
submissions,
number of participants, etc).
+ What are the plans for publication?
The main workshop day is July 8. Two-day workshops for July 8-9,
overlapping
with the main conference for July 9, may also be considered.
The main organizers of accepted workshops are expected to be present
at SAT 2013. Should multiple proposals be submitted for similar
workshops,
possibilities of combining the workshops into one may be considered.
----------------------------------------------------------------------------
CALL FOR SOLVER COMPETITIONS
Solver competitions for SAT solvers and their extensions
are a traditional part of the SAT conferences.
For SAT 2013, proposals for solver competitions are solicited openly.
The goal is to foster the development of both core SAT solvers as well
as
their extensions (including, but not restricted to structural SAT
solving,
MaxSAT, MUS computation, QBF, SMT, etc) and SAT-based systems for
important
application domains.
Organization of the accepted solver competitions is expected to be
separate from the SAT 2013 conference organization.
The organizers of the accepted competitions are expected to be present
at SAT 2013. Results of the accepted competitions are expected to
be presented during the main conference, and time for these reports
will
allocated within the main conference schedule.
Please provide the following information in your proposal:
+ Competition title.
+ Names and affiliations of organizers.
+ Duration and schedule of the competition.
+ Description of the competition task and the evaluation procedure.
+ Is the competition new or has it been organized before?
In the latter case information on previous competitions should be
given.
+ What computing resources are required and how will they be provided?
Should multiple proposals be submitted for similar competitions,
possibilities
of combining the competition organizations into one may be considered.
------------------------------------------------------------------------------
CALL FOR TUTORIALS
As a new development for 2013, tutorial proposals for SAT 2013 are
solicited.
Tutorials are expected to be 1-2 hours long, although other durations
will
be considered. The tutorial may have a theoretical or applied focus,
on a topic of interest for SAT 2013, broadly construed.
Please provide the following information in your proposal:
+ Tutorial title.
+ Names and affiliations of organizer(s).
+ Brief description of the tutorial's goals and topics to be covered.
+ Planned duration (1.5 hours being the default).
+ Whether or not a version of the tutorial has been given previously.
If so, a pointer to those presentation materials will be helpful.
All accepted tutorials will be scheduled to take place during the main
conference.
-----------------------------------------------------------------------------
Should you have any questions regarding these calls, please contact us
via email using sat2013@easychair.org .
SAT 2013 Program Committee Chairs
Matti Jarvisalo University of Helsinki
Allen Van Gelder University of California at Santa Cruz
**********************************************************
*
* 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 and PhD positions in algorithms at IDSIA, University of Lugano
The Dalle Molle Institute, University of Lugano (Switzerland), opens
one PhD position and multiple PostDoc positions in the area of
algorithms. All the positions are supported by the ERC Starting Grant
"New Approaches to Network Design" (January 2012-December 2016). The
main topics of the project are approximation algorithms and
exact/parameterized algorithms. Positions will be filled as soon as
adequate candidates will apply, tentatively within the end of 2012.
Further details about the project, positions, and how to apply can be
found at:
www.idsia.ch/~grandoni/ERC2010.html
For any question, please contact:
Prof. Fabrizio Grandoni
fabrizio@idsia.ch
**********************************************************
*
* 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/
*
**********************************************************
one PhD position and multiple PostDoc positions in the area of
algorithms. All the positions are supported by the ERC Starting Grant
"New Approaches to Network Design" (January 2012-December 2016). The
main topics of the project are approximation algorithms and
exact/parameterized algorithms. Positions will be filled as soon as
adequate candidates will apply, tentatively within the end of 2012.
Further details about the project, positions, and how to apply can be
found at:
www.idsia.ch/~grandoni/ERC2010.html
For any question, please contact:
Prof. Fabrizio Grandoni
fabrizio@idsia.ch
**********************************************************
*
* 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 position at the Ecole des Mines de Saint-Etienne / Optimized robust integrated planning in railway transportation
A PhD position is available at the Ecole des Mines de Saint-Etienne
(Saint-Etienne and Gardanne, France) on "Optimized robust integrated
planning in railway transportation" within the French ANR research
project SCRIPT ("Decision Support System for Robust Design and Service
Quality Indicators of Railway Transport Plans").
In cooperation with the SNCF (French national railway company -
Innovation & Research), the SCRIPT project aims first at defining the
relevant indicators to model the robustness of a railway transport plan
from a passenger point of view, but also from the railway company
standpoint. Based on these indicators, novel methods will have to be
developed to build optimized robust integrated plans for specific random
events. The solution methods will be validated on a simulator
integrating the various uncertainties on real data.
The PhD student will be located in Saint-Etienne in the Institute Henri
Fayol (CNRS UMR 6158, LIMOS). The project will be conducted with the
support of the Manufacturing Sciences and Logistics Department (CMP,
Gardanne, between Aix-en-Provence and Marseille) and some short stays in
Gardanne will be scheduled during the thesis. Also, there will be
regular meetings with the SNCF, in Paris or Lille.
The position is for three years starting November 1st, 2012 or later
(exact date to be discussed).
Applicants must have a Master Degree (or equivalent) in Computer
Sciences, Applied Mathematics, Industrial Engineering or any related
discipline. Applicants should demonstrate good programming skills and
knowledge in combinatorial optimization. Experience on the development
of solution methods for robust planning problems would be appreciated.
Please send your application electronically (preferably as a single pdf
file) including a detailed curriculum vitae and examination results,
plus, if available, a list of reference letters and copies of diploma, to:
Associate Professor Xavier Delorme, delorme@emse.fr.
Professor Stéphane Dauzère-Pérès, dauzere-peres@emse.fr,
Professor Dominique Feillet, feillet@emse.fr,
For further questions regarding the position or details on the research
projects, please contact Xavier Delorme, Stéphane Dauzère-Pérès or
Dominique Feillet.
--
Stéphane Dauzère-Pérès
Professor
Ecole des Mines de Saint-Etienne
CMP - Site Georges Charpak
880 avenue de Mimet
F-13541 GARDANNE
FRANCE
Tel: +33 (0)4 42 61 66 60
Fax: +33 (0)4 42 61 65 91
E-mail: Dauzere-Peres@emse.fr
URL: http://www.emse.fr
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
(Saint-Etienne and Gardanne, France) on "Optimized robust integrated
planning in railway transportation" within the French ANR research
project SCRIPT ("Decision Support System for Robust Design and Service
Quality Indicators of Railway Transport Plans").
In cooperation with the SNCF (French national railway company -
Innovation & Research), the SCRIPT project aims first at defining the
relevant indicators to model the robustness of a railway transport plan
from a passenger point of view, but also from the railway company
standpoint. Based on these indicators, novel methods will have to be
developed to build optimized robust integrated plans for specific random
events. The solution methods will be validated on a simulator
integrating the various uncertainties on real data.
The PhD student will be located in Saint-Etienne in the Institute Henri
Fayol (CNRS UMR 6158, LIMOS). The project will be conducted with the
support of the Manufacturing Sciences and Logistics Department (CMP,
Gardanne, between Aix-en-Provence and Marseille) and some short stays in
Gardanne will be scheduled during the thesis. Also, there will be
regular meetings with the SNCF, in Paris or Lille.
The position is for three years starting November 1st, 2012 or later
(exact date to be discussed).
Applicants must have a Master Degree (or equivalent) in Computer
Sciences, Applied Mathematics, Industrial Engineering or any related
discipline. Applicants should demonstrate good programming skills and
knowledge in combinatorial optimization. Experience on the development
of solution methods for robust planning problems would be appreciated.
Please send your application electronically (preferably as a single pdf
file) including a detailed curriculum vitae and examination results,
plus, if available, a list of reference letters and copies of diploma, to:
Associate Professor Xavier Delorme, delorme@emse.fr.
Professor Stéphane Dauzère-Pérès, dauzere-peres@emse.fr,
Professor Dominique Feillet, feillet@emse.fr,
For further questions regarding the position or details on the research
projects, please contact Xavier Delorme, Stéphane Dauzère-Pérès or
Dominique Feillet.
--
Stéphane Dauzère-Pérès
Professor
Ecole des Mines de Saint-Etienne
CMP - Site Georges Charpak
880 avenue de Mimet
F-13541 GARDANNE
FRANCE
Tel: +33 (0)4 42 61 66 60
Fax: +33 (0)4 42 61 65 91
E-mail: Dauzere-Peres@emse.fr
URL: http://www.emse.fr
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Indo-Slovenia Conference on Graph Theory and Applications
Dear Colleagues,
It is our great pleasure to announce
the Indo-Slovenian Conference on Graph Theory and Applications (Indo-Slov-2013)
to be held in Thiruvananthapuram, India, February 22-24, 2013.
Further information can be obtained in the attached file
and at http://indoslov2013.wordpress.com/.
Please feel free to distribute this announcement to
anyone who might be interested.
A very cordial welcome to India for Indo-Slov-2013 and to Trivandrum.
Organizers:
Manoj Changat - India- Convener
Department of Futures Studies, University of Kerala
Trivandrum-695034, India.
mchangat at gmail dot com & indoslov2013 at gmail dot com
Boštjan Brešar, University of Maribor, Slovenia
Sandi Klavžar, University of Maribor & University of Ljubljana, Slovenia
Ambat Vijayakumar , University of Cochin, India
--
With best regards, sincerely yours,
Manoj Changat
Department of Futures Studies
University of Kerala
Trivandum- 695 034
Ph. 0471-2742309(R)
9446967394
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Tuesday, October 2, 2012
[DMANET] Postdoctoral Research Position: Optimizing Port Supply Chains
Postdoctoral Research Position: Optimizing Port Supply Chains
The University of Newcastle, Australia, invites expressions of
interest for Postdoctoral Research Fellowships in the area of theory
and algorithms for optimization of integrated supply chains,
starting early in 2013, or as soon as possible subject to applicant
availability.
Fellowships are available for 1 or 2 years, with possible 1-year extensions.
The salary will be in the range of AU$63,572-$79,915 per annum,
depending on the skills and experience of the applicant. There is also
provision for a relocation allowance, and for additional funds to
support travel to conferences both overseas and within Australia during
the period of the fellowship.
The successful applicant will hold a PhD in operations research,
engineering, mathematics, computer science, or related discipline.
Strong optimization and computer programming skills are essential. A
knowledge of constraint programming and/or artificial intelligence
techniques would be an asset.
Expressions of interest are preferred before December 1, 2012, however
later interest will be considered until the position is filled. To
express your interest in a fellowship please send your CV, together
with an academic transcript showing details of all courses you have
taken, the grades you were awarded, an interpretation of those grades,
and the names and contact details of at least two people who can
provide confidential references, to Daniel Urquhart at the address
shown below. If your transcript is not in English, please provide an
English translation. Please feel free to include a link to your PhD
thesis, and/or include other publications in your email. Include
details of your computer programming skills and experience, your
optimization training and background, and any experience you have with
modelling and solving industrial problems. Please also indicate your
possible start dates.
The project will be funded under an Australia Research Council (ARC)
Linkage Grant with industry support from the Hunter Valley Coal
Chain Coordinator (HVCCC - www.hvccc.com.au) and Triple Point
Technologies (TPT - www.tpt.com).
The export of coal is a critical economic activity in Australia.
However the logistics of getting the coal from mine to port is
highly complex, involving solution of numerous interrelated planning
and scheduling problems. For example, trains must be scheduled on
tightly capacitated rail lines, equipment for stacking and
reclaiming coal from stockpiles must be scheduled, and the layout of
the stockpiles themselves must be planned. This project will
investigate the optimization of key planning activities in the
export coal supply chain, and seek to develop effective algorithms
for their solution.
The postdoctoral fellows will join a research team of several
faculty, research fellows and PhD students working on this project,
under the supervision of Professors Natashia Boland and Martin
Savelsbergh.
The University of Newcastle is a major research university in
Australia, increasingly recognised internationally as a rapidly
emerging educational institution. The main campus is located in the
city of Newcastle: on the coast about two hours drive north from
Sydney. The School of Mathematical and Physical Sciences provides a
stimulating and supportive environment for research and teaching,
with ample opportunities for collaborative research partnerships
both within the university and with industry. Although well known
for its beautiful beaches and pleasant climate, Newcastle is home to
Australia's (and the world's) largest coal exporting port. Newcastle
is also at the gateway of one of Australia's largest wine-growing
regions, the Hunter valley. Thus opportunities for research in
shipping, transportation, and mineral resources abound.
The School includes a strong group in Operations Research, with a
number of faculty, research fellows, and current PhD students
working in areas such as mixed integer programming, mixed integer
nonlinear programming, supply chain logistics, transportation
optimization, and health systems optimization. The group has strong
collaborations with colleagues in computer science working with
evolutionary algorithms. It also has close research links with
first-class international institutions and excellent support from
industry and government research funding.
For further information on the School and the University, go to
http://www.newcastle.edu.au/school/mathematical-physical-sciences/
or http://www.newcastle.edu.au/. For further information about
Newcastle, Australia, refer to sections below, or visit
http://www.visitnewcastle.com.au/visitnewcastle.asp. Further
information can be obtained by contacting Daniel Urquhart below.
Main contact:
Daniel Urquhart
School of Mathematical and Physical Sciences
The University of Newcastle
T: +61 2 4921 5440
E: Daniel.A.Urquhart@newcastle.edu.au
**********************************************************
*
* 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 University of Newcastle, Australia, invites expressions of
interest for Postdoctoral Research Fellowships in the area of theory
and algorithms for optimization of integrated supply chains,
starting early in 2013, or as soon as possible subject to applicant
availability.
Fellowships are available for 1 or 2 years, with possible 1-year extensions.
The salary will be in the range of AU$63,572-$79,915 per annum,
depending on the skills and experience of the applicant. There is also
provision for a relocation allowance, and for additional funds to
support travel to conferences both overseas and within Australia during
the period of the fellowship.
The successful applicant will hold a PhD in operations research,
engineering, mathematics, computer science, or related discipline.
Strong optimization and computer programming skills are essential. A
knowledge of constraint programming and/or artificial intelligence
techniques would be an asset.
Expressions of interest are preferred before December 1, 2012, however
later interest will be considered until the position is filled. To
express your interest in a fellowship please send your CV, together
with an academic transcript showing details of all courses you have
taken, the grades you were awarded, an interpretation of those grades,
and the names and contact details of at least two people who can
provide confidential references, to Daniel Urquhart at the address
shown below. If your transcript is not in English, please provide an
English translation. Please feel free to include a link to your PhD
thesis, and/or include other publications in your email. Include
details of your computer programming skills and experience, your
optimization training and background, and any experience you have with
modelling and solving industrial problems. Please also indicate your
possible start dates.
The project will be funded under an Australia Research Council (ARC)
Linkage Grant with industry support from the Hunter Valley Coal
Chain Coordinator (HVCCC - www.hvccc.com.au) and Triple Point
Technologies (TPT - www.tpt.com).
The export of coal is a critical economic activity in Australia.
However the logistics of getting the coal from mine to port is
highly complex, involving solution of numerous interrelated planning
and scheduling problems. For example, trains must be scheduled on
tightly capacitated rail lines, equipment for stacking and
reclaiming coal from stockpiles must be scheduled, and the layout of
the stockpiles themselves must be planned. This project will
investigate the optimization of key planning activities in the
export coal supply chain, and seek to develop effective algorithms
for their solution.
The postdoctoral fellows will join a research team of several
faculty, research fellows and PhD students working on this project,
under the supervision of Professors Natashia Boland and Martin
Savelsbergh.
The University of Newcastle is a major research university in
Australia, increasingly recognised internationally as a rapidly
emerging educational institution. The main campus is located in the
city of Newcastle: on the coast about two hours drive north from
Sydney. The School of Mathematical and Physical Sciences provides a
stimulating and supportive environment for research and teaching,
with ample opportunities for collaborative research partnerships
both within the university and with industry. Although well known
for its beautiful beaches and pleasant climate, Newcastle is home to
Australia's (and the world's) largest coal exporting port. Newcastle
is also at the gateway of one of Australia's largest wine-growing
regions, the Hunter valley. Thus opportunities for research in
shipping, transportation, and mineral resources abound.
The School includes a strong group in Operations Research, with a
number of faculty, research fellows, and current PhD students
working in areas such as mixed integer programming, mixed integer
nonlinear programming, supply chain logistics, transportation
optimization, and health systems optimization. The group has strong
collaborations with colleagues in computer science working with
evolutionary algorithms. It also has close research links with
first-class international institutions and excellent support from
industry and government research funding.
For further information on the School and the University, go to
http://www.newcastle.edu.au/school/mathematical-physical-sciences/
or http://www.newcastle.edu.au/. For further information about
Newcastle, Australia, refer to sections below, or visit
http://www.visitnewcastle.com.au/visitnewcastle.asp. Further
information can be obtained by contacting Daniel Urquhart below.
Main contact:
Daniel Urquhart
School of Mathematical and Physical Sciences
The University of Newcastle
T: +61 2 4921 5440
E: Daniel.A.Urquhart@newcastle.edu.au
**********************************************************
*
* 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] Tenure-track position at The University of Newcastle, Australia
Faculty Position in Operations Research
School of Mathematical and Physical Sciences
The University of Newcastle
School of Mathematical and Physical Sciences
The University of Newcastle
The School of Mathematical and Physical Sciences at the University of
Newcastle, Australia, invites applications for a tenure-track faculty
position commencing in 2013. We seek candidates with a strong
methodological foundation in Operations Research, e.g. integer
programming, stochastic programming, and nonlinear programming, as well
as a demonstrated interest in applications, e.g. transportation and
logistics, energy and the environment, and healthcare. Applicants
should also have a strong commitment to teaching, to mentoring graduate
students, and to developing and maintaining an active program of
sponsored research. Applicants must hold a Ph.D., or expect to complete
their degree by Fall 2013, in Operations Research, Industrial
Engineering, Mathematics, Computer Science, or a closely related
discipline.
The successful applicant will be part of a vigorous Operations Research
group that conducts methodological as well as applied research and that
has many national and international collaborations.
Newcastle is located less than 100 miles north of Sydney on
Australia's beautiful east coast. Additional information about the
school can be found at www.newcastle.edu.au.
Applications are accepted online at
www.newcastle.edu.au//job-vacancies, Reference ID #2044.
Applicants should submit a cover letter, a curriculum vitae, a statement
of research interests, a statement of teaching interests, and three
references.
For more information contact Professor Martin Savelsbergh at
martin.savelsbergh@newcastle.edu.au.
**********************************************************
*
* 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] OPODIS 2012 - Call for Participation and Preliminary Program
[Apologies if you receive multiple copies of this e-mail. ]
----------------------------------------------------------------------------------------
CALL FOR PARTICIPATION
16th International Conference On Principles Of DIstributed Systems (OPODIS 2012)
December 17-20, 2012, Rome, Italy
http://www.opodis.net
----------------------------------------------------------------------------------------
Save on your registration fee by registering by October 10th, 2012
----------------------------------------------------------------------------------------
******* AIMS OF THE CONFERENCE
OPODIS is an open forum for the exchange of state-of-the-art knowledge on distributed computing and systems among researchers from around the world. This conference is the 16th in a series of annual conferences. Following the tradition of the previous events, its program will be composed of high-quality contributed papers and invited presentations.
******* REGISTRATION
Detailed registration information can be found at
http://opodis2012.dis.uniroma1.it/registration_opodis_2012.php?lang=eng
******* PRELIMINARY PROGRAM
---------------------------------------------------------------------------
DECEMBER 17th
18:30 Welcome Reception
DECEMBER 18
8:00 Registration
8:45-9:00 Welcome Addresses
9:00-10:00 Invited Talk - Pierre Fraigniaud
"Distributed Local Decision and Verification"
10:00-10:30 Coffee Break
10:30-11:45 Session I
---Amos Korman, Pierre Fraigniaud and Magnus M. Halldorsson.
On the Impact of Identifiers on Local Decision
---Armando Castaneda, Julien Stainer and Michel Raynal.
When and How Process Groups can be Used to Reduce the Renaming Space
---Vijay Garg.
Lattice Completion Algorithms for Distributed Computations
11:45-12:00 --- small break---
12:00 -12:50 Session II
--- Andres Sevilla, Alberto Mozo and Antonio Fernandez Anta.
Node Sampling using Centrifugal Random Walks
---- Devan Sohier, Georgios Georgiadis, Marina Papatriantafilou, Simon Claviere and Alain Bui.
Physarum-inspired self-biased walkers for distributed clustering
LUNCH BREAK
14:30 -15:45 Session III
--- Mohsen Ghaffari, Seth Gilbert, Calvin Newport and Henry Tan.
Optimal Broadcast in Shared Spectrum Radio Networks
--- Bogdan Chlebus, Dariusz Kowalski and Andrzej Pelc.
Electing a Leader in Multi-Hop Radio Networks
--- Tomasz Jurdzinski and Dariusz Kowalski.
On the Complexity of Distributed Broadcasting and MDS Construction in Radio Networks
15:45 - 16:20 Coffee Break
16:20 - 18:00 Session IV
--- Jurek Czyzowicz, Andrzej Pelc and Melanie Roy.
Tree exploration by a swarm of mobile agents
---Shibata Masahiro, Ooshita Fukuhito, Kakugawa Hirotsugu, Masuzawa Toshimistu and Kawai Shinji.
Algorithms for partial gathering of mobile agents in asynchronous rings
---Michel Paquette and Euripides Markou.
Black Hole Search and Exploration in Unoriented Tori with Synchronous Scattered Finite Automata
-- Klaus-Tycho Förster and Roger Wattenhofer.
Directed Graph Exploration
DECEMBER 19
9:00-10:15 Session V
---Sascha Grau.
Attack-Resilient Multitree Data Distribution Topologies
--- Robbert Van Renesse, Chi Ho and Nicolas Schiper
Byzantine Chain Replication
--- Hoang Bao Thien and Abdessamad Imine.
On the Polling Problem for Social Networks
10:15-10:45 Coffee Break
10:45-11:15 Invited Talk - Giuseppe Ateniese
"The Cloud was Tipsy and Ate my Files!"
11:45-12:00 --- small break---
12:00 -12:50 Session VI
-- Hillel Avni and Trevor Brown.
Range Queries in Non-blocking k-ary Search Trees
--- Shahar Timnat, Anastasia Braginsky, Alex Kogan and Erez Petrank.
Wait-Free Linked-Lists
LUNCH BREAK
14:30-15:45 Session VII
--- Othon Michail, Ioannis Chatzigiannakis and Paul Spirakis.
Causality, Influence, and Computation in Possibly Disconnected Synchronous Dynamic Networks
-- Joffroy Beauquier, Janna Burman, Laurent Rosaz and Brigitte Rozoy.
Non-deterministic Population Protocols
--- Emmanuelle Anceaume, Erwan Le Merrer, Romaric Ludinard, Bruno Sericola and Gilles Straub.
FixMe: A Self-organizing Isolated Anomaly Detection Architecture for Large Scale Distributed Systems
15:45-16:15 Coffee Break
Excursion & Banquet
DECEMBER 20
9:30-10:30 Invited Talk - Antony Rowstron
10:30-11:00 Coffee Break
11:00-12:40 Session VIII
--- Srikanth Sastry, Jennifer Welch and Josef Widder.
Wait-Free Stabilizing Dining Using Regular Registers
-- Shlomi Dolev, Swan Dubois, Maria Gradinariu Potop-Butucaru and Sebastien Tixeuil.
Fail-stop Resilient and Pseudo-Stabilizing Atomic Registers
-- Silvia Bonomi, Andreas Klappenecker, Hyunyoung Lee and Jennifer Welch.
Stochastic Modeling of Dynamic Distributed Systems with Crash Recovery and its Application to Atomic Registers
--- Bjorn Andersson and Dionisio Deniz.
Analyzing Global-EDF for Multiprocessor Scheduling of Parallel Tasks
12:40-13:00 concluding remarks
LUNCH BREAK
******* SPONSORED BY
- Sapienza University of Rome
- Sapienza Cyber Intelligence and Information Security Research Center
- Over Technologies
******* CONTACT INFORMATION
For any further information please visit the Contacts web page:
http://opodis2012.dis.uniroma1.it/contacts.php?lang=eng
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
----------------------------------------------------------------------------------------
CALL FOR PARTICIPATION
16th International Conference On Principles Of DIstributed Systems (OPODIS 2012)
December 17-20, 2012, Rome, Italy
http://www.opodis.net
----------------------------------------------------------------------------------------
Save on your registration fee by registering by October 10th, 2012
----------------------------------------------------------------------------------------
******* AIMS OF THE CONFERENCE
OPODIS is an open forum for the exchange of state-of-the-art knowledge on distributed computing and systems among researchers from around the world. This conference is the 16th in a series of annual conferences. Following the tradition of the previous events, its program will be composed of high-quality contributed papers and invited presentations.
******* REGISTRATION
Detailed registration information can be found at
http://opodis2012.dis.uniroma1.it/registration_opodis_2012.php?lang=eng
******* PRELIMINARY PROGRAM
---------------------------------------------------------------------------
DECEMBER 17th
18:30 Welcome Reception
DECEMBER 18
8:00 Registration
8:45-9:00 Welcome Addresses
9:00-10:00 Invited Talk - Pierre Fraigniaud
"Distributed Local Decision and Verification"
10:00-10:30 Coffee Break
10:30-11:45 Session I
---Amos Korman, Pierre Fraigniaud and Magnus M. Halldorsson.
On the Impact of Identifiers on Local Decision
---Armando Castaneda, Julien Stainer and Michel Raynal.
When and How Process Groups can be Used to Reduce the Renaming Space
---Vijay Garg.
Lattice Completion Algorithms for Distributed Computations
11:45-12:00 --- small break---
12:00 -12:50 Session II
--- Andres Sevilla, Alberto Mozo and Antonio Fernandez Anta.
Node Sampling using Centrifugal Random Walks
---- Devan Sohier, Georgios Georgiadis, Marina Papatriantafilou, Simon Claviere and Alain Bui.
Physarum-inspired self-biased walkers for distributed clustering
LUNCH BREAK
14:30 -15:45 Session III
--- Mohsen Ghaffari, Seth Gilbert, Calvin Newport and Henry Tan.
Optimal Broadcast in Shared Spectrum Radio Networks
--- Bogdan Chlebus, Dariusz Kowalski and Andrzej Pelc.
Electing a Leader in Multi-Hop Radio Networks
--- Tomasz Jurdzinski and Dariusz Kowalski.
On the Complexity of Distributed Broadcasting and MDS Construction in Radio Networks
15:45 - 16:20 Coffee Break
16:20 - 18:00 Session IV
--- Jurek Czyzowicz, Andrzej Pelc and Melanie Roy.
Tree exploration by a swarm of mobile agents
---Shibata Masahiro, Ooshita Fukuhito, Kakugawa Hirotsugu, Masuzawa Toshimistu and Kawai Shinji.
Algorithms for partial gathering of mobile agents in asynchronous rings
---Michel Paquette and Euripides Markou.
Black Hole Search and Exploration in Unoriented Tori with Synchronous Scattered Finite Automata
-- Klaus-Tycho Förster and Roger Wattenhofer.
Directed Graph Exploration
DECEMBER 19
9:00-10:15 Session V
---Sascha Grau.
Attack-Resilient Multitree Data Distribution Topologies
--- Robbert Van Renesse, Chi Ho and Nicolas Schiper
Byzantine Chain Replication
--- Hoang Bao Thien and Abdessamad Imine.
On the Polling Problem for Social Networks
10:15-10:45 Coffee Break
10:45-11:15 Invited Talk - Giuseppe Ateniese
"The Cloud was Tipsy and Ate my Files!"
11:45-12:00 --- small break---
12:00 -12:50 Session VI
-- Hillel Avni and Trevor Brown.
Range Queries in Non-blocking k-ary Search Trees
--- Shahar Timnat, Anastasia Braginsky, Alex Kogan and Erez Petrank.
Wait-Free Linked-Lists
LUNCH BREAK
14:30-15:45 Session VII
--- Othon Michail, Ioannis Chatzigiannakis and Paul Spirakis.
Causality, Influence, and Computation in Possibly Disconnected Synchronous Dynamic Networks
-- Joffroy Beauquier, Janna Burman, Laurent Rosaz and Brigitte Rozoy.
Non-deterministic Population Protocols
--- Emmanuelle Anceaume, Erwan Le Merrer, Romaric Ludinard, Bruno Sericola and Gilles Straub.
FixMe: A Self-organizing Isolated Anomaly Detection Architecture for Large Scale Distributed Systems
15:45-16:15 Coffee Break
Excursion & Banquet
DECEMBER 20
9:30-10:30 Invited Talk - Antony Rowstron
10:30-11:00 Coffee Break
11:00-12:40 Session VIII
--- Srikanth Sastry, Jennifer Welch and Josef Widder.
Wait-Free Stabilizing Dining Using Regular Registers
-- Shlomi Dolev, Swan Dubois, Maria Gradinariu Potop-Butucaru and Sebastien Tixeuil.
Fail-stop Resilient and Pseudo-Stabilizing Atomic Registers
-- Silvia Bonomi, Andreas Klappenecker, Hyunyoung Lee and Jennifer Welch.
Stochastic Modeling of Dynamic Distributed Systems with Crash Recovery and its Application to Atomic Registers
--- Bjorn Andersson and Dionisio Deniz.
Analyzing Global-EDF for Multiprocessor Scheduling of Parallel Tasks
12:40-13:00 concluding remarks
LUNCH BREAK
******* SPONSORED BY
- Sapienza University of Rome
- Sapienza Cyber Intelligence and Information Security Research Center
- Over Technologies
******* CONTACT INFORMATION
For any further information please visit the Contacts web page:
http://opodis2012.dis.uniroma1.it/contacts.php?lang=eng
**********************************************************
*
* 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] KU Leuven PhD position: optimisation of public transportation
The Centre of Industrial Management, Traffic and Infrastructure of KU Leuven
(Department of Mechanical Engineering) has a vacancy for a doctoral student.
-----
If you are interested in a PhD in operations research (logistics,
metaheuristics, linear/integer programming, simulation, etc.), but not in
one of the presented topics, do not hesitate to contact Pieter Vansteenwegen
at pieter.vansteenwegen@cib.kuleuven.be and discuss other possible topics.
-----
Possible topics:
. Design of efficient bus networks
. Optimization of bus schedules
. Design of an efficient ride-sharing system
. Design of robust railway timetables
. Real time railway scheduling
. City Logistics
. Applying metaheuristics to manage fleets of vehicles
. ...
-----
Position:
. a four year doctoral research position at KU Leuven;
. (80%) scientific research in the field of operations research;
. (20%) educational tasks: seminars, workshops, thesis coaching, etc.;
. attending conferences, visiting international partners, etc.
-----
Practical:
The starting date of this research position is preferably January, 1, 2013.
The candidate should be able to write and teach in English (speaking Dutch
is an advantage). He/She should have a master degree in engineering,
business engineering, computer science, informatics or applied mathematics
and have an interest in quantitative techniques and operations research.
For any questions about this vacancy, contact Pieter Vansteenwegen.
If you are interested, you should apply as soon as possible and before
November, 15, 2012, using this link:
http://phd.kuleuven.be/set/voorstellen_departement?departement=50000509#deta
il
**********************************************************
*
* 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/
*
**********************************************************
(Department of Mechanical Engineering) has a vacancy for a doctoral student.
-----
If you are interested in a PhD in operations research (logistics,
metaheuristics, linear/integer programming, simulation, etc.), but not in
one of the presented topics, do not hesitate to contact Pieter Vansteenwegen
at pieter.vansteenwegen@cib.kuleuven.be and discuss other possible topics.
-----
Possible topics:
. Design of efficient bus networks
. Optimization of bus schedules
. Design of an efficient ride-sharing system
. Design of robust railway timetables
. Real time railway scheduling
. City Logistics
. Applying metaheuristics to manage fleets of vehicles
. ...
-----
Position:
. a four year doctoral research position at KU Leuven;
. (80%) scientific research in the field of operations research;
. (20%) educational tasks: seminars, workshops, thesis coaching, etc.;
. attending conferences, visiting international partners, etc.
-----
Practical:
The starting date of this research position is preferably January, 1, 2013.
The candidate should be able to write and teach in English (speaking Dutch
is an advantage). He/She should have a master degree in engineering,
business engineering, computer science, informatics or applied mathematics
and have an interest in quantitative techniques and operations research.
For any questions about this vacancy, contact Pieter Vansteenwegen.
If you are interested, you should apply as soon as possible and before
November, 15, 2012, using this link:
http://phd.kuleuven.be/set/voorstellen_departement?departement=50000509#deta
il
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Monday, October 1, 2012
[DMANET] (Deadline extention) CFP, Special Issue MPB (ISCO 2012)
DEADLINE EXTENDED TO OCTOBER 21, 2012
(Apologies in advance for multiple postings)
CALL FOR PAPERS
MATHEMATICAL PROGRAMMING B
Special Issue on Combinatorial Optimization
We invite submissions of novel research articles for a forthcoming issue
of Mathematical Programming B on Combinatorial Optimization.
This special issue is associated with the International Symposium on
Combinatorial Optimization (ISCO 2012) that was held in Athens, Greece,
April 19-21, 2012.
However it is also open to papers which have not been presented at the
conference.
High quality research papers are solicited to address theoretical as
well as practical issues of Combinatorial Optimization.
Topics of interest include, but are notlimited to:
Approximation algorithms
Cutting planes algorithms
Polyhedral combinatorics
Branch-and-cut-and-price algorithms
Graph and network algorithms
Linear and nonlinear (mixed-) integer programming
Randomized algorithms
Scheduling algorithms
The deadline for submission of full papers is extended to October 21, 2012.
We aim at completing a first review of all papers by January 31, 2012.
For their submissions, the authors should follow the following steps
in the Editorial Manager at http://mapr.edmgr.com/.
Register in Editorial Manager
Click on 'Submit A Manuscript' button at the top of the site
Click on 'Submit New Manuscript' in Author Main Menu
Select Full Length Paper Series B as article type and follow the next steps
Type in the name of the special issue at the Additional Information step
and follow the next steps.
The name of the special issue is Combinatorial Optimization.
Approve your manuscript.
Papers will be refereed to the standard of Mathematical Programming,
Series A. Due to limits in page volume, we are requesting that all papers
be submitted using MP style files, and conform to the 25 page maximum.
The necessary LaTeX files can be downloaded at
www.eng.cam.ac.uk/~dr241/MPB/MPB-Springer-latex-style-files.zip."
The special issue will be limited to around 9 papers. We therefore may
be obliged to either return some papers to authors without review or,
later, with authors' consent, transfer some papers to MPA.
Additional information about the special issue can be obtained from the
guest editors.
Guest Editors:
A. Ridha Mahjoub, mahjoub@lamsade.dauphine.fr
Giovanni Rinaldi rinaldi@iasi.cnr.it
Gerhard J. Woeginger gwoegi@win.tue.nl
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
(Apologies in advance for multiple postings)
CALL FOR PAPERS
MATHEMATICAL PROGRAMMING B
Special Issue on Combinatorial Optimization
We invite submissions of novel research articles for a forthcoming issue
of Mathematical Programming B on Combinatorial Optimization.
This special issue is associated with the International Symposium on
Combinatorial Optimization (ISCO 2012) that was held in Athens, Greece,
April 19-21, 2012.
However it is also open to papers which have not been presented at the
conference.
High quality research papers are solicited to address theoretical as
well as practical issues of Combinatorial Optimization.
Topics of interest include, but are notlimited to:
Approximation algorithms
Cutting planes algorithms
Polyhedral combinatorics
Branch-and-cut-and-price algorithms
Graph and network algorithms
Linear and nonlinear (mixed-) integer programming
Randomized algorithms
Scheduling algorithms
The deadline for submission of full papers is extended to October 21, 2012.
We aim at completing a first review of all papers by January 31, 2012.
For their submissions, the authors should follow the following steps
in the Editorial Manager at http://mapr.edmgr.com/.
Register in Editorial Manager
Click on 'Submit A Manuscript' button at the top of the site
Click on 'Submit New Manuscript' in Author Main Menu
Select Full Length Paper Series B as article type and follow the next steps
Type in the name of the special issue at the Additional Information step
and follow the next steps.
The name of the special issue is Combinatorial Optimization.
Approve your manuscript.
Papers will be refereed to the standard of Mathematical Programming,
Series A. Due to limits in page volume, we are requesting that all papers
be submitted using MP style files, and conform to the 25 page maximum.
The necessary LaTeX files can be downloaded at
www.eng.cam.ac.uk/~dr241/MPB/MPB-Springer-latex-style-files.zip."
The special issue will be limited to around 9 papers. We therefore may
be obliged to either return some papers to authors without review or,
later, with authors' consent, transfer some papers to MPA.
Additional information about the special issue can be obtained from the
guest editors.
Guest Editors:
A. Ridha Mahjoub, mahjoub@lamsade.dauphine.fr
Giovanni Rinaldi rinaldi@iasi.cnr.it
Gerhard J. Woeginger gwoegi@win.tue.nl
**********************************************************
*
* 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
