---------------------------------------------------------------------------------------
Postdoctoral Researcher in Applications of Optimization in Human-Computer Interaction, Helsinki
---------------------------------------------------------------------------------------
Aalto University is seeking to hire an outstanding researcher for the User Interfaces group to fully funded position.
The position will be placed in the ERC-funded project Computational User Interface Design [COMPUTED] (2015-2020). The project develops predictive models of HCI and uses them to optimize user interfaces. The research topics include fundamental aspects of interface optimization - model acquisition, optimization methods, interactive support for designers, as well as applications. The successful candidate will join an ambitious research group that is at the forefront of this exciting research area. The group offers a collegiate and stimulating environment as well as access to state-of-the-art equipment.
REQUIREMENTS
We invite applications from outstanding individuals with a Doctoral degree in any field relevant to the project, including Computer Science, Optimization, Human-Computer Interaction, Interaction Design, Operations Research, and Cognitive Science. An interdisciplinary perspective and experience is highly valued. The successful applicant has demonstrated excellence in one or more of the following topics:
* Optimization
* Modeling
* HCI, especially interaction techniques, input devices, design tools, or modeling
SALARY AND CONTRACT TERMS
The expected starting salary is around 3,500-3,800 €/month, depending on experience and qualifications, and it will increase with responsibilities and performance over time. The contract includes occupational health and social security benefits. The starting date is negotiable. The position will be initially filled for 1 year, with possible extensions max to 4 years altogether.
APPLICATIONS
Apply by submitting (a) CV, (b) cover letter describing research interests and preferred starting date, (c) two representative publications as PDFs, (d) course transcripts from MSc and Doctoral degrees with grades and (e) names and contact information for two references. Incomplete applications cannot be considered. Submit your application via email to antti.oulasvirta@aalto.fi. We start reviewing candidates on April 17, 2015, but applications will be considered until the position is filled.
MORE INFORMATION
* Press release of ERC: http://erc.europa.eu/sites/default/files/press_release/files/Examples_ERC_stg_projects_2014.pdf
* Homepage of the PI with example papers: http://users.comnet.aalto.fi/oulasvir/
* For additional information, please contact Professor Antti Oulasvirta: antti.oulasvirta@aalto.fi
ABOUT AALTO UNIVERSITY CAMPUS AND HELSINKI
Aalto University is a new university with over a century of experience. Created from a high-profile merger between three leading universities in Finland – the Helsinki School of Economics, Helsinki University of Technology and the University of Art and Design Helsinki – Aalto University opens up new possibilities for strong multidisciplinary education and research. The university has 20 000 students and a staff of 5 000 including 350 professors. In a recent MIT study of the world's leading 200 universities, Aalto University was grouped among the five rising stars. The department is located at Otaniemi campus in the Helsinki metropolitan area, Finland. As a living and work environment, Finland consistent ranks high in quality-of-life. Finland has been selected as the world's best country to live in (Newsweek, 2010), and it is in the top 10 of the most highly educated nations in the world (OECD, 2013). The capital city Helsinki has been ranked as the World's Most Livable City (Monocle, 2011). It is the 2nd happiest place in the world according to a 2007 OECD study. For more information about living in Finland: http://www.aalto.fi/en/about/careers/international_staff/
**********************************************************
*
* 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, April 7, 2015
[DMANET] AIRO 2015: Abstract submission is open
The 45th Annual Conference of the Italian Operations Research
Society, AIRO 2015, will be hosted at the Department of Computer
Science of the University of Pisa on September 7-10, 2015. The theme
of AIRO 2015 is "Optimization for Energy, Environment and
Sustainability", but contributions are encouraged for all areas of
optimization. The conference is organized into plenary and parallel
sessions, with Italian and English as the official languages. Each
speaker can give only one talk.
Conference fees (early registration, in Euro):
Honorary AIRO member: 100
Junior AIRO member (under 30 years): 125
Regular AIRO member: 250
Junior: 135
Regular: 280
Accompanying person: 50
Abstract submissions are open. In order to submit you have first to
register at the site:
http://www.airo.org/conferences/airo2015/index.php/component/users/?view=registration
After you login, you will be able to access the "Abstract
Submissions" section. Submissions close on April 30, 2015.
We encourage perspective session chairs to submit to:
submissions2015@airo.org
proposals for sessions they could be willing to organize.
More information can be found on the web site of the conference:
http://www.airo.org/conferences/airo2015/
Maria Grazia
Scutella' (Conference chair)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Society, AIRO 2015, will be hosted at the Department of Computer
Science of the University of Pisa on September 7-10, 2015. The theme
of AIRO 2015 is "Optimization for Energy, Environment and
Sustainability", but contributions are encouraged for all areas of
optimization. The conference is organized into plenary and parallel
sessions, with Italian and English as the official languages. Each
speaker can give only one talk.
Conference fees (early registration, in Euro):
Honorary AIRO member: 100
Junior AIRO member (under 30 years): 125
Regular AIRO member: 250
Junior: 135
Regular: 280
Accompanying person: 50
Abstract submissions are open. In order to submit you have first to
register at the site:
http://www.airo.org/conferences/airo2015/index.php/component/users/?view=registration
After you login, you will be able to access the "Abstract
Submissions" section. Submissions close on April 30, 2015.
We encourage perspective session chairs to submit to:
submissions2015@airo.org
proposals for sessions they could be willing to organize.
More information can be found on the web site of the conference:
http://www.airo.org/conferences/airo2015/
Maria Grazia
Scutella' (Conference chair)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Discrete Math Days and Ontario Combinatorics Workshop, Ottawa, Canada, 21-24 May 2015
=================================================
Discrete Mathematics Days
and
Ontario Combinatorics Workshop
21-24 May 2015
http://web5.uottawa.ca/www5/mnewman/dmdocw15/
University of Ottawa and Carleton University
Ottawa, Canada
Sponsored by The Fields Institute
=================================================
The Ottawa-Carleton Discrete Mathematics Days and the Ontario
Combinatorics Workshop will be held May 21-24, 2015, at the University
of Ottawa. The two meetings are being held consecutively this year.
We cover all areas of discrete mathematics.
The invited speakers are:
Sebastian Cioaba, University of Delaware
Matt DeVos, Simon Fraser University
Angèle Hamel, Wilfred Laurier University
Jessica McDonald, Auburn University
David Pike, Memorial University Newfoundland
Éric Sopena, Bordeaux University of Technology
Qing Xiang, National Science Foundation and University of
Delaware
We will be accepting 25-minute contributed talks in any area of
discrete mathematics. Topics include (but are not limited to) graphs,
designs, enumeration, combinatorial optimization, finite fields,
algorithms. Titles and abstracts (text or LaTex only please) should
be sent to Mike Newman (mnewman at uottawa dot ca) and Brett Stevens
(brett at carleton dot ca). Please include "DMD/OCW" in the subject
line of your email.
We will be able to offer partial travel support to graduate students
and postdocs. Applications should be sent to Mike Newman (mnewman at
uottawa dot ca) and Brett Stevens (brett at carleton dot ca).
For more details visit http://web5.uottawa.ca/www5/mnewman/dmdocw15/
We look forward to seeing you in Ottawa!
Mike Newman
Brett Stevens
(organizers)
**********************************************************
*
* 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/
*
**********************************************************
Discrete Mathematics Days
and
Ontario Combinatorics Workshop
21-24 May 2015
http://web5.uottawa.ca/www5/mnewman/dmdocw15/
University of Ottawa and Carleton University
Ottawa, Canada
Sponsored by The Fields Institute
=================================================
The Ottawa-Carleton Discrete Mathematics Days and the Ontario
Combinatorics Workshop will be held May 21-24, 2015, at the University
of Ottawa. The two meetings are being held consecutively this year.
We cover all areas of discrete mathematics.
The invited speakers are:
Sebastian Cioaba, University of Delaware
Matt DeVos, Simon Fraser University
Angèle Hamel, Wilfred Laurier University
Jessica McDonald, Auburn University
David Pike, Memorial University Newfoundland
Éric Sopena, Bordeaux University of Technology
Qing Xiang, National Science Foundation and University of
Delaware
We will be accepting 25-minute contributed talks in any area of
discrete mathematics. Topics include (but are not limited to) graphs,
designs, enumeration, combinatorial optimization, finite fields,
algorithms. Titles and abstracts (text or LaTex only please) should
be sent to Mike Newman (mnewman at uottawa dot ca) and Brett Stevens
(brett at carleton dot ca). Please include "DMD/OCW" in the subject
line of your email.
We will be able to offer partial travel support to graduate students
and postdocs. Applications should be sent to Mike Newman (mnewman at
uottawa dot ca) and Brett Stevens (brett at carleton dot ca).
For more details visit http://web5.uottawa.ca/www5/mnewman/dmdocw15/
We look forward to seeing you in Ottawa!
Mike Newman
Brett Stevens
(organizers)
**********************************************************
*
* 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, April 6, 2015
[DMANET] IEEE Cluster 2015 - Call for Poster
April 6, 2015 Release
IEEE International Conference on Cluster Computing
September 8-11, 2015
Chicago, IL, USA
http://www.mcs.anl.gov/ieeecluster2015/
*** CALL FOR POSTER ***
The IEEE Cluster 2015 provides a forum for both academia and industry
professionals to present their latest research findings in all aspects
of cluster, cloud, and grid technologies in the form of a posters,
which will be included in the conference proceedings. Posters will be
presented during the same session, during the conference.
Additionally, authors may submit posters for publication on the web.
*** TOPICS OF INTEREST ***
The topics of interest are the same as in the Call for Papers.
Area 1: Application, Algorithms, and Libraries
* HPC Applications on Clusters
* Performance Modeling and Measurement
* Novel Algorithms on Clusters
* Hybrid programming techniques (MPI+OpenMP, MPI+OpenCL, etc.)
* Cluster Benchmarks
* Application-level libraries on clusters
* Effective use of clusters in novel applications
* Performance evaluation tools
Area 2: Architecture, Network/Communications, and Management
* Energy-efficient cluster architectures
* Node and system architecture
* Packaging, power and cooling
* GPU/ManyCore and heterogeneous clusters
* Interconnect/memory architectures
* Single system image clusters
* Administration and maintenance tools
Area 3: Programming and System Software
* Cluster System Software/Operating Systems
* Cloud-enabling cluster technologies and virtualization
* Energy-efficient middleware
* Cluster system-level Protocols and APIs
* Cluster Security
* Resource and job management
* Programming and Software Development Environment on Clusters
* Fault tolerance and high-availability
Area 4: Data, Storage, and Visualization
* Cluster Architecture for Big Data storage and processing
* Middleware for Big Data management
* Cluster-based Cloud Architecture for Big Data
* File systems and I/O libraries
* Support and Integration of Non-Volatile Memory
* Visualization clusters and tiled displays
* Big Data visualization tools
* Programming models for Big Data processing
* Big Data Application studies on cluster architectures
*** TYPES OF POSTERS ***
Participants submitting proceedings-published posters are required to
submit a short paper (2 pages) describing the poster content, the
research supporting it, and the relevance and importance to the
cluster, cloud, and grid computing community. If accepted, this short
paper will be published in the proceedings of the conference.
Participants submitting web-published posters are required to submit a
short 1-page extended abstract. These abstracts will not be included
in the conference proceedings.
Both proceedings-published and web-published posters will be displayed
during the conference. We encourage accepted authors of demos to
prepare a poster to accompany their demo. All accepted posters
(including posters prepared for demos) will be posted on the
conference website.
*** DISPLAY POSTER SIZE ***
The recommended poster size is A1 (594mm by 841mm, portrait).
*** SUBMISSION GUIDELINES ***
Submitted manuscripts should be structured as technical papers and may
not exceed 1 (web published) or 2 (proceedings published) letter size
(8.5 x 11) pages including figures, tables and references using the
IEEE format for conference proceedings.
See formatting templates for details:
* LaTex Package ZIP
ftp://pubftp.computer.org/Press/Outgoing/proceedings/IEEE_CS_Latex8.5x11x2.zip
* Word Template DOC and PDF
ftp://pubftp.computer.org/Press/Outgoing/proceedings/instruct8.5x11x2.doc
ftp://pubftp.computer.org/Press/Outgoing/proceedings/instruct8.5x11x2.pdf
Please submit your posters via the EasyChair submission system:
https://easychair.org/conferences/?conf=ieeecluster2015
*** IMPORTANT DATES ***
May 15, 2015 (extended) Posters Submission Deadline
May 9, 2015 Papers Acceptance Notification
*** STUDENT TRAVEL AWARDS ***
Several travel awards are sponsored by the National Science Foundation
for students enrolled in American institutions who participates in the
Student Mentoring Program
(http://www.mcs.anl.gov/ieeecluster2015/student-program/). Students
with accepted posters or papers must also apply to and participate in
the Student Mentoring Program to be eligible for the travel award. The
deadlines for the Student Mentoring Program application are at
http://www.mcs.anl.gov/ieeecluster2015/author-information/important-dates/.
Notice of travel awards will be made prior to the conference. The
travel awards will be distributed post-conference in the form of
reimbursements against actual travel, registration, and accommodation
expenses submitted by the student. The travel award will be contingent
on the participating of the awarded student in the Student Mentoring
Program at Cluster 2015.
*** CLUSTER 2015 POSTER CHAIR ***
Seetharami Seelam, IBM T. J. Watson Research Center (sseelam AT us.ibm.com).
----------------------------------------------
...Follow us on Facebook at https://www.facebook.com/ieee.cluster
...Follow us on Twitter at https://twitter.com/IEEECluster
...Follow us on Linkedin at
https://www.linkedin.com/groups/IEEE-International-Conference-on-Cluster-7428925
...Follow us on RenRen at http://page.renren.com/601871401
----------------------------------------------
**********************************************************
*
* 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/
*
**********************************************************
IEEE International Conference on Cluster Computing
September 8-11, 2015
Chicago, IL, USA
http://www.mcs.anl.gov/ieeecluster2015/
*** CALL FOR POSTER ***
The IEEE Cluster 2015 provides a forum for both academia and industry
professionals to present their latest research findings in all aspects
of cluster, cloud, and grid technologies in the form of a posters,
which will be included in the conference proceedings. Posters will be
presented during the same session, during the conference.
Additionally, authors may submit posters for publication on the web.
*** TOPICS OF INTEREST ***
The topics of interest are the same as in the Call for Papers.
Area 1: Application, Algorithms, and Libraries
* HPC Applications on Clusters
* Performance Modeling and Measurement
* Novel Algorithms on Clusters
* Hybrid programming techniques (MPI+OpenMP, MPI+OpenCL, etc.)
* Cluster Benchmarks
* Application-level libraries on clusters
* Effective use of clusters in novel applications
* Performance evaluation tools
Area 2: Architecture, Network/Communications, and Management
* Energy-efficient cluster architectures
* Node and system architecture
* Packaging, power and cooling
* GPU/ManyCore and heterogeneous clusters
* Interconnect/memory architectures
* Single system image clusters
* Administration and maintenance tools
Area 3: Programming and System Software
* Cluster System Software/Operating Systems
* Cloud-enabling cluster technologies and virtualization
* Energy-efficient middleware
* Cluster system-level Protocols and APIs
* Cluster Security
* Resource and job management
* Programming and Software Development Environment on Clusters
* Fault tolerance and high-availability
Area 4: Data, Storage, and Visualization
* Cluster Architecture for Big Data storage and processing
* Middleware for Big Data management
* Cluster-based Cloud Architecture for Big Data
* File systems and I/O libraries
* Support and Integration of Non-Volatile Memory
* Visualization clusters and tiled displays
* Big Data visualization tools
* Programming models for Big Data processing
* Big Data Application studies on cluster architectures
*** TYPES OF POSTERS ***
Participants submitting proceedings-published posters are required to
submit a short paper (2 pages) describing the poster content, the
research supporting it, and the relevance and importance to the
cluster, cloud, and grid computing community. If accepted, this short
paper will be published in the proceedings of the conference.
Participants submitting web-published posters are required to submit a
short 1-page extended abstract. These abstracts will not be included
in the conference proceedings.
Both proceedings-published and web-published posters will be displayed
during the conference. We encourage accepted authors of demos to
prepare a poster to accompany their demo. All accepted posters
(including posters prepared for demos) will be posted on the
conference website.
*** DISPLAY POSTER SIZE ***
The recommended poster size is A1 (594mm by 841mm, portrait).
*** SUBMISSION GUIDELINES ***
Submitted manuscripts should be structured as technical papers and may
not exceed 1 (web published) or 2 (proceedings published) letter size
(8.5 x 11) pages including figures, tables and references using the
IEEE format for conference proceedings.
See formatting templates for details:
* LaTex Package ZIP
ftp://pubftp.computer.org/Press/Outgoing/proceedings/IEEE_CS_Latex8.5x11x2.zip
* Word Template DOC and PDF
ftp://pubftp.computer.org/Press/Outgoing/proceedings/instruct8.5x11x2.doc
ftp://pubftp.computer.org/Press/Outgoing/proceedings/instruct8.5x11x2.pdf
Please submit your posters via the EasyChair submission system:
https://easychair.org/conferences/?conf=ieeecluster2015
*** IMPORTANT DATES ***
May 15, 2015 (extended) Posters Submission Deadline
May 9, 2015 Papers Acceptance Notification
*** STUDENT TRAVEL AWARDS ***
Several travel awards are sponsored by the National Science Foundation
for students enrolled in American institutions who participates in the
Student Mentoring Program
(http://www.mcs.anl.gov/ieeecluster2015/student-program/). Students
with accepted posters or papers must also apply to and participate in
the Student Mentoring Program to be eligible for the travel award. The
deadlines for the Student Mentoring Program application are at
http://www.mcs.anl.gov/ieeecluster2015/author-information/important-dates/.
Notice of travel awards will be made prior to the conference. The
travel awards will be distributed post-conference in the form of
reimbursements against actual travel, registration, and accommodation
expenses submitted by the student. The travel award will be contingent
on the participating of the awarded student in the Student Mentoring
Program at Cluster 2015.
*** CLUSTER 2015 POSTER CHAIR ***
Seetharami Seelam, IBM T. J. Watson Research Center (sseelam AT us.ibm.com).
----------------------------------------------
...Follow us on Facebook at https://www.facebook.com/ieee.cluster
...Follow us on Twitter at https://twitter.com/IEEECluster
...Follow us on Linkedin at
https://www.linkedin.com/groups/IEEE-International-Conference-on-Cluster-7428925
...Follow us on RenRen at http://page.renren.com/601871401
----------------------------------------------
**********************************************************
*
* 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] ISAAC 2015 - First Call for Papers
ISAAC 2015
The 26th International Symposium on Algorithms and Computation
December 9-11, 2015, Nagoya, Japan
FIRST CALL FOR PAPERS
-----------------------------
The 26th International Symposium on Algorithms and Computation (ISAAC 2015)
will be held in Nagoya, Japan during December 9-11, 2015. The symposium is
intended to provide a forum for researchers working in algorithms and theory
of computation. Papers presenting original research in the areas of algorithms
and theory of computation are sought. Papers in relevant applied areas are also
welcomed.
TOPICS OF INTEREST include (but are not limited to):
----------------------------------------------------------------
Algorithmic game theory
Algorithms and Data structures
Approximation algorithms
Combinatorial optimization
Computational biology
Computational complexity
Computational geometry
Cryptography
Experimental algorithms
Graph drawing and Graph algorithms
Internet algorithms
Online algorithms
Quantum computing
Randomized algorithms
Parallel and Distributed algorithms
COMMITTEES
-----------------
Conference Co-Chairs:
Tomio Hirata (Nagoya University, Japan)
Ken-ichi Kawarabayashi (NII, Japan)
Program Committee:
Sang Won Bae (Kyonggi U, Korea)
Mark de Berg (TU Eindhoven, the Netherlands)
Hubert Chan (HKU, Hong Kong)
Kai-Min Chung (Academia Sinica, Taiwan)
Adrian Dumitrescu (U Wisconsin-Milwaukee, USA)
Khaled Elbassioni (Masdar Institute, UAE, co-chair)
Amr Elmasry (Alexandria U, Egypt)
Xin Han (Dalian U Technology, China)
Seok-Hee Hong (U Sydney, Australia)
Tsan-Sheng Hsu (Academia Sinica, Taiwan)
Zhiyi Huang (HKU, Hong Kong)
Naonori Kakimura (U Tokyo, Japan)
Shuji Kijima (Kyushu U, Japan)
Tamas Kiraly (Eotvos U, Hungary)
Yusuke Kobayashi(U Tokyo, Japan)
Michal Koucky (Charles U, Czech Republic)
Michael Lampis (U Paris Dauphine, France)
Meena Mahajan (IMS, India)
Kazuhisa Makino (Kyoto U, Japan, co-chair)
Julian Mestre (U Sydney, Australia)
Danupon Nanongkai (KTH Royal Ins. Tech, Sweden)
Konstantinos Panagiotou (U. Munich, Germany)
Periklis Papakonstantinou (Tsinghua U, China)
Seth Pettie (U Michigan, USA)
Saurabh Ray (NYUAD, UAE)
Thomas Sauerwald (U Cambridge, UK)
Saket Saurabh (IMS, India)
Jeong Seop Sim (Inha U, Korea)
Rahul Shah (Louisiana State U, USA)
Rene Sitters (VU Amsterdam, the Netherlands)
Rob van Stee (U Leicester, UK)
Chaitanaya Swamy (U Waterloo, Canada)
Hing-Fung Ting (HKU, Hong Kong)
Yuichi Yoshida (NII, Japan)
Guochuan Zhang (Zhejiang U, China)
**************************************************************************
IMPORTANT DATES
------------------------
Submission due / June 19, 2015
Notification / August 31, 2015
Final version / September 21, 2015
**************************************************************************
SUBMISSION DETAILS
--------------------------
The submission should contain a scholarly exposition of ideas, techniques, and results,
including motivation and a comparison with related work. The main text, including title,
abstract, and references, should not exceed 11 pages in LNCS style. An optional appendix
should be used to provide proof details that do not fit in the main text. Submitted papers
must describe unpublished work. Authors should not submit papers with the same results or
essentially the same results that are accepted or published or under review by a conference
with refereed proceedings or a journal. Only electronic submission will be allowed and only
pdf files will be accepted. It will be done via Easychair:
https://www.easychair.org/conferences/?conf=isaac2015
At least one author of an accepted paper is expected to present the paper at the conference
as a registered participant.
PUBLICATION
-----------------
The proceedings will be published by Springer-Verlag in the LNCS series. Selected papers
will be invited to special issues of Algorithmica and International Journal of Computational
Geometry and Applications.
AWARDS
-----------
A Best Paper and a Best Student Paper may be awarded. A paper is eligible for the Best Student
Paper Award if all authors are full-time students at the time of submission. To indicate that
a submission is eligible, please add the phrase "Eligible for the Best Student Paper Award" in
the abstract.
ADDITIONAL DETAILS
--------------------------
This conference is sponsored by Kayamori Foundation of Information Science Advancement, Nagoya
University, Grant-in-Aid for Scientific Research on Innovative Areas "Exploring the limits of
computation (ELC)", "JST ERATO Kawarabayashi Large Graph Project and "JST CREST Foundations
of Innovative Algorithms for Big Data".
Additional details can be found in the conference web page:
http://www.al.cm.is.nagoya-u.ac.jp/isaac2015
------------------
Khaled Elbassioni,
Masdar Institute
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
The 26th International Symposium on Algorithms and Computation
December 9-11, 2015, Nagoya, Japan
FIRST CALL FOR PAPERS
-----------------------------
The 26th International Symposium on Algorithms and Computation (ISAAC 2015)
will be held in Nagoya, Japan during December 9-11, 2015. The symposium is
intended to provide a forum for researchers working in algorithms and theory
of computation. Papers presenting original research in the areas of algorithms
and theory of computation are sought. Papers in relevant applied areas are also
welcomed.
TOPICS OF INTEREST include (but are not limited to):
----------------------------------------------------------------
Algorithmic game theory
Algorithms and Data structures
Approximation algorithms
Combinatorial optimization
Computational biology
Computational complexity
Computational geometry
Cryptography
Experimental algorithms
Graph drawing and Graph algorithms
Internet algorithms
Online algorithms
Quantum computing
Randomized algorithms
Parallel and Distributed algorithms
COMMITTEES
-----------------
Conference Co-Chairs:
Tomio Hirata (Nagoya University, Japan)
Ken-ichi Kawarabayashi (NII, Japan)
Program Committee:
Sang Won Bae (Kyonggi U, Korea)
Mark de Berg (TU Eindhoven, the Netherlands)
Hubert Chan (HKU, Hong Kong)
Kai-Min Chung (Academia Sinica, Taiwan)
Adrian Dumitrescu (U Wisconsin-Milwaukee, USA)
Khaled Elbassioni (Masdar Institute, UAE, co-chair)
Amr Elmasry (Alexandria U, Egypt)
Xin Han (Dalian U Technology, China)
Seok-Hee Hong (U Sydney, Australia)
Tsan-Sheng Hsu (Academia Sinica, Taiwan)
Zhiyi Huang (HKU, Hong Kong)
Naonori Kakimura (U Tokyo, Japan)
Shuji Kijima (Kyushu U, Japan)
Tamas Kiraly (Eotvos U, Hungary)
Yusuke Kobayashi(U Tokyo, Japan)
Michal Koucky (Charles U, Czech Republic)
Michael Lampis (U Paris Dauphine, France)
Meena Mahajan (IMS, India)
Kazuhisa Makino (Kyoto U, Japan, co-chair)
Julian Mestre (U Sydney, Australia)
Danupon Nanongkai (KTH Royal Ins. Tech, Sweden)
Konstantinos Panagiotou (U. Munich, Germany)
Periklis Papakonstantinou (Tsinghua U, China)
Seth Pettie (U Michigan, USA)
Saurabh Ray (NYUAD, UAE)
Thomas Sauerwald (U Cambridge, UK)
Saket Saurabh (IMS, India)
Jeong Seop Sim (Inha U, Korea)
Rahul Shah (Louisiana State U, USA)
Rene Sitters (VU Amsterdam, the Netherlands)
Rob van Stee (U Leicester, UK)
Chaitanaya Swamy (U Waterloo, Canada)
Hing-Fung Ting (HKU, Hong Kong)
Yuichi Yoshida (NII, Japan)
Guochuan Zhang (Zhejiang U, China)
**************************************************************************
IMPORTANT DATES
------------------------
Submission due / June 19, 2015
Notification / August 31, 2015
Final version / September 21, 2015
**************************************************************************
SUBMISSION DETAILS
--------------------------
The submission should contain a scholarly exposition of ideas, techniques, and results,
including motivation and a comparison with related work. The main text, including title,
abstract, and references, should not exceed 11 pages in LNCS style. An optional appendix
should be used to provide proof details that do not fit in the main text. Submitted papers
must describe unpublished work. Authors should not submit papers with the same results or
essentially the same results that are accepted or published or under review by a conference
with refereed proceedings or a journal. Only electronic submission will be allowed and only
pdf files will be accepted. It will be done via Easychair:
https://www.easychair.org/conferences/?conf=isaac2015
At least one author of an accepted paper is expected to present the paper at the conference
as a registered participant.
PUBLICATION
-----------------
The proceedings will be published by Springer-Verlag in the LNCS series. Selected papers
will be invited to special issues of Algorithmica and International Journal of Computational
Geometry and Applications.
AWARDS
-----------
A Best Paper and a Best Student Paper may be awarded. A paper is eligible for the Best Student
Paper Award if all authors are full-time students at the time of submission. To indicate that
a submission is eligible, please add the phrase "Eligible for the Best Student Paper Award" in
the abstract.
ADDITIONAL DETAILS
--------------------------
This conference is sponsored by Kayamori Foundation of Information Science Advancement, Nagoya
University, Grant-in-Aid for Scientific Research on Innovative Areas "Exploring the limits of
computation (ELC)", "JST ERATO Kawarabayashi Large Graph Project and "JST CREST Foundations
of Innovative Algorithms for Big Data".
Additional details can be found in the conference web page:
http://www.al.cm.is.nagoya-u.ac.jp/isaac2015
------------------
Khaled Elbassioni,
Masdar Institute
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Sunday, April 5, 2015
[DMANET] IEEE BigDataSE2015 CFP – Deadline extended to April 20, 2015 (firm)
The 9th IEEE International Conference on Big Data Science and Engineering
(IEEE BigDataSE-15)
http://comnet.aalto.fi/BDSE2015/
(IEEE BigDataSE-15)
http://comnet.aalto.fi/BDSE2015/
20-22 August 2015, Helsinki, Finland
Latest news:
6 Keynotes and 4 workshops announced
Important Dates
Submission Deadline: March 31, 2015 -> extended to April 20, 2015 (firm)
Authors Notification: May 31, 2015
Final Manuscript Due: July 1, 2015
Big data is an emerging paradigm applied to datasets whose size is beyond
the ability of commonly used software tools to capture, manage, and process
the data within a tolerable elapsed time. Such datasets are often from
various sources (Variety) yet unstructured such as social media, sensors,
scientific applications, surveillance, video and image archives, Internet
texts and documents, Internet search indexing, medical records, business
transactions and web logs; and are of large size (Volume) with fast data
in/out (Velocity). More importantly, big data has to be of high value
(Value) and establish trust in it for business decision making (Veracity).
Various technologies are being discussed to support the handling of big
data such as massively parallel processing databases, scalable storage
systems, cloud computing platforms, and MapReduce.
Big data is more than simply a matter of size; it is an opportunity to find
insights in new and emerging types of data and content, to make business
more agile, and to answer questions that were previously considered beyond
our reach. Distributed systems is a classical research discipline
investigating various distributed computing technologies and applications
such as cloud computing and MapReduce. With new paradigms and technologies,
distributed systems research keeps going with new innovative outcomes from
both industry and academia. For example, wide deployment of MapReduce is a
distributed programming paradigm and an associated implementation to
support distributed computing over large datasets on cloud. BigDataSE is
created to provide a prime international forum for researchers, industry
practitioners and environment experts to exchange the latest fundamental
advances in the state of the art and practice of Big Data and broadly
related areas.
BigDataSE 2015 is the next event in a series of highly successful
International Conferences, previously held as BigDataSE2014 (Beijing,
China, September 2014), BigDataSE2013 (Sydney, Australia, December 2013),
BigDataMR-12 (Xiangtan, China, November 2012), AHPCN-12 (Bradford, UK, June
2012), AHPCN-11 (Banff, Canada, September 2011), AHPCN-10 (Melbourne,
Australia, September 2010), AHPCN-09 (Seoul, Korea, June 2009), AHPCN-08
(Dalian, China, September 2008).
Topics of interest include, but not limited to
- Big Data novel theory, algorithm and applications
- Big Data standards
- Big Data mining and analytics
- Big Data Infrastructure, MapReduce and Cloud Computing
- Big Data visualization
- Big Data curation and management
- Big Data semantics, scientific discovery and intelligence
- Big Data performance analysis and large-scale deployment
- Security, privacy, trust, and legal issues to big data
- Big Data vs Big Business and Big Industry
- Large data stream processing on cloud
- Large incremental datasets on cloud
- Distributed and federated datasets
- NoSQL data stores and DB scalability
- Big Data placement, scheduling, and optimization
- Distributed file systems for Big Data
- MapReduce for Big Data processing, resource scheduling and SLA
- Performance characterization, evaluation and optimization
- Simulation and debugging systems and tools for MapReduce and Big Data
- Volume, Velocity, Variety, Value and Veracity of Big Data
- Multiple source data processing and integration with MapReduce
- Storage and computation management of Big Data
- Large-scale big data workflow management
- Mobility and big data
- Sensor network, social network and big data
- Big data applications
Submission Guidelines
Submitted papers must not substantially overlap with papers that have been
published or that are simultaneously submitted to a journal or a conference
with proceedings. Papers must be clearly presented in English, must not
exceed 8 pages, including tables, figures, references and appendixes, in
IEEE Computer Society proceedings format with Portable Document Format
(.pdf). Please submit your paper
https://research.comnet.aalto.fi/BDSE2015/paper_submission.html
Papers will be selected based on their originality, timeliness,
significance, relevance, and clarity of presentation. Submission of a paper
should be regarded as a commitment that, should the paper be accepted, at
least one of the authors will register and attend the conference to present
the work. Accepted and presented papers will be included in the IEEE CPS
Proceedings. Distinguished papers presented at the conference, after
further revision, will be recommended to high quality international
journals.
Keynotes (in alphabetical order)
Prof. Robert H. Deng, Singapore Management University, Singapore
Mr. Mikko Hyppönen, Chief Research Officer, F-Secure, Finland
Mr. Lauri Oksanen, VP Research and Technology, Nokia Networks
Prof. Yi Pan, Georgia State University, USA
Prof. Witold Pedrycz, IEEE fellow, EiC of Information Sciences Canada
Research Chair
Prof. Vincenzo Piuri, IEEE fellow, IEEE Vice President on Technical
Activities, EiC of IEEE Systems Journal
Workshops and Symposia
- DTWSM 2015 (https://research.comnet.aalto.fi/BDSE2015/dtwsm2015/)
The 2nd IEEE International Workshop on Data, Text, Web, and Social
Network Mining
- RTStreams 2015 (https://research.comnet.aalto.fi/BDSE2015/rtstreams2015/)
The 1st IEEE International Workshop on Real Time Data Stream Analytics
- CPBD 2015 (https://research.comnet.aalto.fi/BDSE2015/cpbd2015/)
The 1st IEEE International Workshop on Classification Problems Embedded
in the Nature of Big Data
- PhoneCom 2015 (https://research.comnet.aalto.fi/BDSE2015/phonecom2015/)
The 4th IEEE International Workshop on Sensing, Networking, and Computing
with Smartphones
Organisation Committee
General Chairs:
Francisco Herrera, University of Granada, Spain
Zheng Yan, Xidian University, China
Moncef Gabbouj, Tampere University of Technology, Finland
Program Chair:
Nitesh Chawla, University of Notre Dame, USA
Barbara Hammer, Bielefeld University, Germany
Steering Co-Chairs:
Jinjun Chen, University of Technology Sydney, Australia (Chair)
Laurence T. Yang, St. Francis Xavier University, Canada (Chair)
Publicity Chairs:
Tianrui Li, Southwest Jiaotong University, China
Junze Wang, HUST, China
Workshop Chairs:
Alvin Chin, Microsoft, China
Maria José del Jesus, University of Jaén, Spain
Jun Liu, Xi'an Jiaotong University, China
Local Organizing and Finance Chair:
Raimo Kantola, Aalto University, Finland
Web Chair:
Jesús Llorente Santos, Aalto University, Finland
Steering Committee:
Please see http://comnet.aalto.fi/BDSE2015/
Technical Program Committee
https://research.comnet.aalto.fi/BDSE2015/program_committee.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] IEEE TrustCom2015 CFP – Deadline extended to April 20, 2015 (firm)
The 14th IEEE International Conference on Trust, Security and Privacy in
Computing and Communications (IEEE TrustCom-15)
http://comnet.aalto.fi/Trustcom2015/
Computing and Communications (IEEE TrustCom-15)
http://comnet.aalto.fi/Trustcom2015/
20-22 August 2015, Helsinki, Finland
Latest news:
6 Keynotes, 7 workshops and 1 tutorial announced
Important Dates
Submission Deadline: March 31, 2015 -> extended to April 20, 2015 (Firm)
Authors Notification: May 31, 2015
Final Manuscript Due: July 1, 2015
With the rapid development and increasing complexity of computer systems
and communication networks, user requirements for trust, security and
privacy are becoming more and more demanding. Therefore, there is a grand
challenge that traditional security technologies and measures may not meet
user requirements in open, dynamic, heterogeneous, mobile, wireless, and
distributed computing environments. As a result, we need to build systems
and networks in which various applications allow users to enjoy more
comprehensive services while preserving trust, security and privacy at the
same time. As useful and innovative technologies, trusted computing and
communications are attracting researchers with more and more attention.
The 14th IEEE International Conference on Trust, Security and Privacy in
Computing and Communications (IEEE TrustCom-15) will be held in Helsinki,
Finland on 20-22 August 2015. The conference aims at bringing together
researchers and practitioners in the world working on trusted computing and
communications, with regard to trust, security, privacy, reliability,
dependability, survivability, availability, and fault tolerance aspects of
computer systems and networks, and providing a forum to present and discuss
emerging ideas and trends in this highly challenging research field.
Topics of interest include, but not limited to
Trust Track
- Trust semantics, metrics and models
- Trusted computing platform
- Trusted network computing
- Trusted operating systems
- Trusted software and applications
- Trust in social networks
- Trust in e-commerce and e-government
- Trust in mobile and wireless communications
- Risk and reputation management
- Survivable computer systems/networks
- Trust of 5G
- Miscellaneous trust issues
Security Track
- Network security
- Computer security
- Database security
- Web applications security
- Security policy, model and architecture
- Security in social networks
- Security in parallel and distributed systems
- Security in mobile and wireless communications
- Security in grid/cloud/pervasive computing
- Authentication, authorization and accounting
- Security of 5G
- Miscellaneous security issues
Privacy Track
- Privacy in Web-based applications and services
- Privacy in database systems
- Privacy in parallel and distributed systems
- Privacy in grid/cloud/pervasive computing
- Privacy in mobile and wireless communications
- Privacy in e-commerce and e-government
- Privacy in network deployment and management
- Privacy and trust
- Privacy and security
- Privacy and anonymity
- Privacy preservation in 5G
- Miscellaneous privacy issues
Submission Guidelines
Submitted papers must not substantially overlap with papers that have been
published or that are simultaneously submitted to a journal or a conference
with proceedings. Papers must be clearly presented in English, must not
exceed 8 pages, including tables, figures, references and appendixes, in
IEEE Computer Society proceedings format with Portable Document Format
(.pdf). Please submit your paper at
https://research.comnet.aalto.fi/Trustcom2015/paper_submission.html
Papers will be selected based on their originality, timeliness,
significance, relevance, and clarity of presentation. Submission of a paper
should be regarded as a commitment that, should the paper be accepted, at
least one of the authors will register and attend the conference to present
the work. Accepted and presented papers will be included in the IEEE CPS
Proceedings. Distinguished papers presented at the conference, after
further revision, will be recommended to high quality international
journals.
Keynotes (in alphabetical order)
Prof. Robert H. Deng, Singapore Management University, Singapore
Mr. Mikko Hyppönen, Chief Research Officer, F-Secure, Finland
Mr. Lauri Oksanen, VP Research and Technology, Nokia Networks
Prof. Yi Pan, Georgia State University, USA
Prof. Witold Pedrycz, IEEE fellow, EiC of Information Sciences Canada
Research Chair
Prof. Vincenzo Piuri, IEEE fellow, IEEE Vice President on Technical
Activities, EiC of IEEE Systems Journal
Workshops and Symposia
- TrustSoft 2015 (
https://research.comnet.aalto.fi/Trustcom2015/trustsoft2015/)
The 1st IEEE International Workshop on Trustworthy Software Systems
- TSCloud 2015 (https://research.comnet.aalto.fi/Trustcom2015/tscloud2015/)
The 5th IEEE International Symposium on Trust and Security in Cloud
Computing
- SpaIoT 2015 (https://research.comnet.aalto.fi/Trustcom2015/spaiot2015/)
The 8th IEEE International Symposium on Security, Privacy and Anonymity
in Internet of Things
- UbiSafe 2015 (https://research.comnet.aalto.fi/Trustcom2015/ubisafe2015/)
The 7th IEEE International Symposium on UbiSafe Computing
- TrustWSN 2015 (https://research.comnet.aalto.fi/Trustcom2015/trustwsn2015/
)
The 1st IEEE International Workshop on Trust and Security in Wireless
Sensor Networks
- EFINS 2015 (https://research.comnet.aalto.fi/Trustcom2015/efins2015/)
The 2nd IEEE International Workshop on the Emerging Future Internet and
Network Security
- IW5GS 2015 (https://research.comnet.aalto.fi/Trustcom2015/iw5gs2015/)
The 1st IEEE International Workshop on 5G Security
Tutorial: Privacy Engineering Tutorial (
https://research.comnet.aalto.fi/Trustcom2015/tutorials/pets.html)
Organisation Committee
General Chairs
Valtteri Niemi, University of Turku, Finland
Raimo Kantola, Aalto University, Finland
Program Chair
Zheng Yan, Xidian University, China
Peter Mueller, IBM Zurich, Switzerland
Program Vice-Chairs
Trust Track Chair
Xinyi Huang, Fujian Normal University, China
Security Track Chair
Xiangjian (Sean) He, University of Technology, Sydney, Australia
Privacy Track Chair
Marinella Petrocchi, Istituto di Informatica e Telematica, CNR, Italy
Steering Committee
Steering Co-Chairs
Guojun Wang, Central South University, China (Chair)
Laurence T. Yang, St. Francis Xavier University, Canada (Chair)
Publicity Chairs
Ioanna Dionysiou, University of Nicosia, Cyprus
Jin Li, Guangzhou University, China
Marinella Petrocchi, Istituto di Informatica e Telematica, CNR, Italy
Tanveer A Zia, Charles Sturt University, Australia
Workshop Chairs
Matti Hämäläinen, Digile, Finland
Xinyi Huang, Fujian Normal University, China
Igor Kotenko, SPIIRAS, Russia
Finance Chair
Raimo Kantola, Aalto University, Finland
Web Chair
Jesús Llorente Santos, Aalto University, Finland
Steering Committee
Please see http://comnet.aalto.fi/Trustcom2015/
Technical Program Committee
https://research.comnet.aalto.fi/Trustcom2015/program_committee.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/
*
**********************************************************
Friday, April 3, 2015
[DMANET] Postdoctoral position in machine learning (Aalto University, Helsinki)
The Aalto University School of Science invites applications for:
SCIENCE FELLOW/ Machine learning strategies for materials optimization
The position is connected to the Aalto Science Institute, which is an
interdisciplinary research initiative hosted by the Aalto University
School of Science to advance and foster international collaboration and
research at the highest level across the fields of science.
The Science Fellow is a two-year postdoctoral position with freedom and
support to pursue independent and interdisciplinary research agenda.
Successful candidates shall have or are close to having a PhD in
Computer Science, Mathematics, Physics, or related disciplines. Strong
knowledge of machine-learning methodologies, and reasonable programming
skills are required. The candidate is expected to have the interest to
apply mathematics and statistics to physical problems. Specialist
knowledge of computational physics techniques is also welcomed.
Detailed information about the position, as well as the application
process, is provided at
http://asci.aalto.fi/en/science-fellows/call_for_applications/. Deadline
for applications is April 17, 2015 at 15:00 EEST.
**********************************************************
*
* 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/
*
**********************************************************
SCIENCE FELLOW/ Machine learning strategies for materials optimization
The position is connected to the Aalto Science Institute, which is an
interdisciplinary research initiative hosted by the Aalto University
School of Science to advance and foster international collaboration and
research at the highest level across the fields of science.
The Science Fellow is a two-year postdoctoral position with freedom and
support to pursue independent and interdisciplinary research agenda.
Successful candidates shall have or are close to having a PhD in
Computer Science, Mathematics, Physics, or related disciplines. Strong
knowledge of machine-learning methodologies, and reasonable programming
skills are required. The candidate is expected to have the interest to
apply mathematics and statistics to physical problems. Specialist
knowledge of computational physics techniques is also welcomed.
Detailed information about the position, as well as the application
process, is provided at
http://asci.aalto.fi/en/science-fellows/call_for_applications/. Deadline
for applications is April 17, 2015 at 15:00 EEST.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Postdoc Position: URGENT
Please contact Jean-Marc Steyaert <steyaert@lix.polytechnique.fr>
directly for any query.
directly for any query.
> LIX (Ecole Polytechnique, 91120 PALAISEAU) offers a Post-Doctoral position
> Period : 6 months + 6 months, starting NOW
>
> Contact : Prof. Jean-Marc Steyaert
> jean-marc.steyaert@polytechnique.edu
>
> Prerequisites :
> Theoretical Computer Science, Systems, Artificial Intelligence, Software
> development, Security, etc.
> Good experience in programming and system interfaces: UML modeling,
> sequence diagrams, Java, C++
>
> Objectives :
> Implementation and Validation of a prototype of Water Supply Network Control.
> The prototype is based on a preliminary study made under the lead of CALM
> Water and CEA.
> The platform C2SOS on which the project will be developed is proprietary.
> The final environment will be defined by the Utility.
>
> The candidate will apply and adapt existing algorithms to on-line
> utility's data using the algorithms identified for incorporation into
> C2SOS from the initial off-line demonstration. It will leverage the
> existing C2SOS algorithms and adapt them to enable software depiction and
> scenarios simulations of water system anomalies, including leaks and
> non-specific bio-contamination, capturing operators' experience and using
> data driven hydraulic modelling. Server software configurations at the
> Utility will be mimicked to prove out the developed software adapters and
> to enable initial testing for data integration.
>
> The software and system configurations will be developed, applied and
> tested with existing server software configuration specifications provided
> by the utility. System architecture, data management, and server software
> configuration specifications will be jointly developed with or provided by
> the Utility.
>
> Reports will be delivered every 3 months.
>
> During the first month, the LIX's Post Doc will be trained, at the expense
> of CALM Water and with the support of CEA-LIST experts, as needed, on the
> existing decision support system components to be leveraged for the
> purpose of this demonstration.
> Then the work will be done under the supervision of J-M Steyaert.
**********************************************************
*
* 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] CCA 2015: deadline extension
Due to several requests in view of the spring break/Easter Holiday,
the submission deadline to CCA 2015 has been extended to April 10.
the submission deadline to CCA 2015 has been extended to April 10.
Twelfth International Conference on
Computability and Complexity in Analysis (CCA 2015)
http://cca-net.de/cca2015/
July 12-15, 2015, Tokyo, JAPAN
The conference topic combines discrete and continuous
aspects of mathematics and computer science.
______________________________________________________________
Invited Speakers
* Sicun Gao (Boston, USA)
* Alexander Kreuzer (Singapore)
* Vikram Sharma (Chennai, India)
* Kohei Suenaga (Kyoto, Japan)
* Katrin Tent (Münster, Germany; tbc)
Scientific Program Committee
* Andrej Bauer (Ljubljana, Slovenia)
* Stephen A. Cook (Toronto, Canada)
* Guido Gherardi (Munich, Germany)
* Daniel Graça (Faro, Portugal)
* Hajime Ishihara (Ishikawa, Japan)
* Ker-I Ko (Hsinchu, Taiwan)
* Timothy McNicholl (Ames, USA)
* André Nies (Auckland, New Zealand)
* Mariko Yasugi (Kyoto, Japan)
* Martin Ziegler, chair (Darmstadt, Germany)
Organizing Committee
* Naohi Eguchi (Chiba University, Japan)
* Kojiro Higuchi (Chiba University, Japan)
* Akitoshi Kawamura, chair (University of Tokyo, Japan)
* Kenshi Miyabe (Meiji University, Japan)
* Ryuhei Mori (Tokyo Institute of Technology, Japan)
* Hideki Tsuiki (Kyoto University, Japan)
Submissions
CCA2015 invites the submission of two-page extended abstracts
collected for distribution at the conference. Not considered as
formally reviewed proceedings, full and extended versions of
these short submissions may, and are in fact encouraged to,
appear on other occasions such as fully refereed conferences
or in the later journal post-proceedings.
Please upload your contribution in PDF format by April 10
to https://easychair.org/conferences/?conf=cca2015
Conference Web Page
Co-located "Workshop on Theory and Practice of Real Computation"
on Sunday, July 12, jointly organized and with tutorials/talks by:
* Zin Arai
* Akitoshi Kawamura
* Shin'ichi Oishi
* Siegfried M. Rump
* Martin Ziegler
**********************************************************
*
* 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/
*
**********************************************************
PhD thesis in Parameterized Approximation at LAMSADE, University Paris-Dauphine
A funded PhD position is available in LAMSADE, Universite Paris
Dauphine under the topic "Parameterized Approximation".
The goal of the thesis will be to advance the state of the art in
parameterized approximation both by focusing on the parameterized
approximability of specific problems and by trying to build a general,
coherent theory of this emerging field. The approach proposed is
two-pronged: Working on algorithms that borrow and combine ideas from
both approximation and parameterized algorithmics; and building a
theory of parameterized inapproximability.
The successful candidate will work with Vangelis Paschos and Michael
Lampis, as a member of LAMSADE, Universite Paris Dauphine.
Prerequisites: The successful candidate will possess a Master's (or
equivalent) degree in Computer Science or a related field and a good
background in topics related to this thesis, such as discrete
algorithms, computational complexity, graph theory, etc. Good
abilities in spoken and written scientific English are expected. An
ability to speak French is a plus, but is NOT required.
Position: The successful candidate will be offered a competitive
3-year fellowship, through which she/he will be hired as a full-time
temporary employee of the university. This entitles her/him to all
basic benefits given to french public employees (such as health
insurance). Net salary is expected to be around 1600 Euros/month. A
light teaching load (such as, for example tutoring programming labs)
is expected, with a salary complement.
Environment: LAMSADE, a CNRS lab attached to Paris Dauphine, is a
research center with a vibrant and international research environment.
Universite Paris Dauphine is one of the leading universities in Paris,
located in the 16th district, a few minutes away from the Arc de
Triomphe. Paris, a beautiful metropolis, offers the interested student
countless opportunities for interactions with world-class researchers
in its many universities, as well as an excellent quality life-style.
To apply: Interested candidates should begin by sending informal
inquiries to Vangelis Paschos (paschos@lamsade.dauphine.fr) and
Michael Lampis (michail.lampis@dauphine.fr). More information about
this position can be found at:
http://www.lamsade.dauphine.fr/spip.php?article570
--
Vangelis Th. Paschos
LAMSADE, University Paris-Dauphine, CNRS and IUF
http://www.lamsade.dauphine.fr/~paschos/
Dauphine under the topic "Parameterized Approximation".
The goal of the thesis will be to advance the state of the art in
parameterized approximation both by focusing on the parameterized
approximability of specific problems and by trying to build a general,
coherent theory of this emerging field. The approach proposed is
two-pronged: Working on algorithms that borrow and combine ideas from
both approximation and parameterized algorithmics; and building a
theory of parameterized inapproximability.
The successful candidate will work with Vangelis Paschos and Michael
Lampis, as a member of LAMSADE, Universite Paris Dauphine.
Prerequisites: The successful candidate will possess a Master's (or
equivalent) degree in Computer Science or a related field and a good
background in topics related to this thesis, such as discrete
algorithms, computational complexity, graph theory, etc. Good
abilities in spoken and written scientific English are expected. An
ability to speak French is a plus, but is NOT required.
Position: The successful candidate will be offered a competitive
3-year fellowship, through which she/he will be hired as a full-time
temporary employee of the university. This entitles her/him to all
basic benefits given to french public employees (such as health
insurance). Net salary is expected to be around 1600 Euros/month. A
light teaching load (such as, for example tutoring programming labs)
is expected, with a salary complement.
Environment: LAMSADE, a CNRS lab attached to Paris Dauphine, is a
research center with a vibrant and international research environment.
Universite Paris Dauphine is one of the leading universities in Paris,
located in the 16th district, a few minutes away from the Arc de
Triomphe. Paris, a beautiful metropolis, offers the interested student
countless opportunities for interactions with world-class researchers
in its many universities, as well as an excellent quality life-style.
To apply: Interested candidates should begin by sending informal
inquiries to Vangelis Paschos (paschos@lamsade.dauphine.fr) and
Michael Lampis (michail.lampis@dauphine.fr). More information about
this position can be found at:
http://www.lamsade.dauphine.fr/spip.php?article570
--
Vangelis Th. Paschos
LAMSADE, University Paris-Dauphine, CNRS and IUF
http://www.lamsade.dauphine.fr/~paschos/
[DMANET] PhD position "Parameterized Approximation" at Universite Paris Dauphine
A funded PhD position is available in LAMSADE, Universite Paris
Dauphine under the topic "Parameterized Approximation".
The goal of the thesis will be to advance the state of the art in
parameterized approximation both by focusing on the parameterized
approximability of specific problems and by trying to build a general,
coherent theory of this emerging field. The approach proposed is
two-pronged: Working on algorithms that borrow and combine ideas from
both approximation and parameterized algorithmics; and building a
theory of parameterized inapproximability.
The successful candidate will work with Vangelis Paschos and Michael
Lampis, as a member of LAMSADE, Universite Paris Dauphine.
Prerequisites: The successful candidate will possess a Master's (or
equivalent) degree in Computer Science or a related field and a good
background in topics related to this thesis, such as discrete
algorithms, computational complexity, graph theory, etc. Good
abilities in spoken and written scientific English are expected. An
ability to speak French is a plus, but is NOT required.
Position: The successful candidate will be offered a competitive
3-year fellowship, through which she/he will be hired as a full-time
temporary employee of the university. This entitles her/him to all
basic benefits given to french public employees (such as health
insurance). Net salary is expected to be around 1600 Euros/month. A
light teaching load (such as, for example tutoring programming labs)
is expected, with a salary complement.
Environment: LAMSADE, a CNRS lab attached to Paris Dauphine, is a
research center with a vibrant and international research environment.
Universite Paris Dauphine is one of the leading universities in Paris,
located in the 16th district, a few minutes away from the Arc de
Triomphe. Paris, a beautiful metropolis, offers the interested student
countless opportunities for interactions with world-class researchers
in its many universities, as well as an excellent quality life-style.
To apply: Interested candidates should begin by sending informal
inquiries to Vangelis Paschos (paschos@lamsade.dauphine.fr) and
Michael Lampis (michail.lampis@dauphine.fr).
More information about this position can be found at:
http://www.lamsade.dauphine.fr/spip.php?article570
--
Vangelis Th. Paschos
LAMSADE, University Paris-Dauphine, CNRS and IUF
http://www.lamsade.dauphine.fr/~paschos/
**********************************************************
*
* 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/
*
**********************************************************
Dauphine under the topic "Parameterized Approximation".
The goal of the thesis will be to advance the state of the art in
parameterized approximation both by focusing on the parameterized
approximability of specific problems and by trying to build a general,
coherent theory of this emerging field. The approach proposed is
two-pronged: Working on algorithms that borrow and combine ideas from
both approximation and parameterized algorithmics; and building a
theory of parameterized inapproximability.
The successful candidate will work with Vangelis Paschos and Michael
Lampis, as a member of LAMSADE, Universite Paris Dauphine.
Prerequisites: The successful candidate will possess a Master's (or
equivalent) degree in Computer Science or a related field and a good
background in topics related to this thesis, such as discrete
algorithms, computational complexity, graph theory, etc. Good
abilities in spoken and written scientific English are expected. An
ability to speak French is a plus, but is NOT required.
Position: The successful candidate will be offered a competitive
3-year fellowship, through which she/he will be hired as a full-time
temporary employee of the university. This entitles her/him to all
basic benefits given to french public employees (such as health
insurance). Net salary is expected to be around 1600 Euros/month. A
light teaching load (such as, for example tutoring programming labs)
is expected, with a salary complement.
Environment: LAMSADE, a CNRS lab attached to Paris Dauphine, is a
research center with a vibrant and international research environment.
Universite Paris Dauphine is one of the leading universities in Paris,
located in the 16th district, a few minutes away from the Arc de
Triomphe. Paris, a beautiful metropolis, offers the interested student
countless opportunities for interactions with world-class researchers
in its many universities, as well as an excellent quality life-style.
To apply: Interested candidates should begin by sending informal
inquiries to Vangelis Paschos (paschos@lamsade.dauphine.fr) and
Michael Lampis (michail.lampis@dauphine.fr).
More information about this position can be found at:
http://www.lamsade.dauphine.fr/spip.php?article570
--
Vangelis Th. Paschos
LAMSADE, University Paris-Dauphine, CNRS and IUF
http://www.lamsade.dauphine.fr/~paschos/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Call for Prize Nominations: Prize for Innovation in Distributed Computing 2015-2016
Awarded by the Colloquium on Structural Information and Communication
Complexity (SIROCCO).
Complexity (SIROCCO).
Nominations are requested for the Prize for Innovation In Distributed Computing.
This prize was established to recognize individuals whose research contributions
expanded the collective investigative horizon in SIROCCO's area of interest.
That is, they formulated new problems, or identified new research areas, that
were at the time of their introduction, unorthodox and outside the mainstream,
but later attracted the interest of the SIROCCO community.
This community is interested in the relationships between information and
efficiency in decentralized computing. The prize recognizes originality,
innovation, and creativity -- the qualities that reflect the spirit of the
SIROCCO conference.
The winner is expected to give an invited talk at SIROCCO NEXT year (2016).
The winner chosen last year (Michel Raynal) will give a talk at sirocco in the
current year year: SIROCCO 2015 is going to be held on July 15-17,
Montserrat, Spain (a few days before PODC, also in Spain this year;
papers submission deadline is April 30th).
(Other invited speakers this current year are: Nati Linial (Keynote),
Amos Korman, Bernhard Haupler, and Sakat Navlakha).
The prize may not necessarily be awarded every year.
Past prize winners are Nicola Santoro, Jean-Claude Bermond, David Peleg,
Roger Wattenhofer, Andrzej Pelc, and Michel Raynal.
Eligibility
-----------
The following conditions must be met by the nominees to be eligible for the
prize. It is requested that a nomination letter explains and demonstrates how
the nominee matches these conditions.
(1) The original innovative contribution was introduced by the nominee(s) for
the first time in a publication at least five years before the
nomination deadline,
and the publication must have appeared in a conference proceedings or a
scientific journal.
(2) At least one paper (co)authored by the nominee(s), either the original
paper, or a paper very related to the innovative contribution, must have
appeared in a SIROCCO proceedings.
A nomination letter should identify the paper(s) that make(s) the nominee
eligible according to conditions (1) and (2) above, as well as explain the
contribution, its originality, and its significance.
Past SIROCCO papers and authors can be found at indexing sites, e.g. Google
Scholar or http://www.informatik.uni-trier.de/~ley/db/conf/sirocco/index.html.
Selection process
------------------
The prize winners are selected by the Award Committee composed of the current
Steering Committee (SC) Chair of the SIROCCO conference, the PC chairs,
including co-chairs, of the three SIROCCO conferences immediately preceding
the nominations deadline, plus one additional member of the Advisory Board, or
one past winner, selected by the Steering Committee for the current year.
In 2015, the Award Committee consists of: Guy Even (Tel Aviv University),
Magnús HalldórssonReykjavik University), Shay Kutten (Technion)- chair,
Thomas Moscibroda (Microsoft), and Andrzej Pelc (Universite du Quebec
en Outaouais).
Nominations can be made by any member of the scientific community.
DEADLINE :
Please send the nomination to the prize
committee chair, kutten@ie.technion.ac.il by MAY 15th, 2015.
PLEASE write SIROCCO Prize Nomination IN THE SUBJECT LINE.
Please help in recognizing the contributions of members of our community.
**********************************************************
*
* 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 Prize Nominations: Prize for Innovation in Distributed Computing 2015-2016
Awarded by the Colloquium on Structural Information and Communication
Complexity (SIROCCO).
Nominations are requested for the Prize for Innovation In Distributed Computing.
This prize was established to recognize individuals whose research contributions
expanded the collective investigative horizon in SIROCCO's area of interest.
That is, they formulated new problems, or identified new research areas, that
were at the time of their introduction, unorthodox and outside the mainstream,
but later attracted the interest of the SIROCCO community.
This community is interested in the relationships between information and
efficiency in decentralized computing. The prize recognizes originality,
innovation, and creativity -- the qualities that reflect the spirit of the
SIROCCO conference.
The winner is expected to give an invited talk at SIROCCO NEXT year (2016).
The winner chosen last year (Michel Raynal) will give a talk at sirocco in the
current year year: SIROCCO 2015 is going to be held on July 15-17,
Montserrat, Spain (a few days before PODC, also in Spain this year;
papers submission deadline is April 30th).
(Other invited speakers this current year are: Nati Linial (Keynote),
Amos Korman, Bernhard Haupler, and Sakat Navlakha).
The prize may not necessarily be awarded every year.
Past prize winners are Nicola Santoro, Jean-Claude Bermond, David Peleg,
Roger Wattenhofer, Andrzej Pelc, and Michel Raynal.
Eligibility
-----------
The following conditions must be met by the nominees to be eligible for the
prize. It is requested that a nomination letter explains and demonstrates how
the nominee matches these conditions.
(1) The original innovative contribution was introduced by the nominee(s) for
the first time in a publication at least five years before the
nomination deadline,
and the publication must have appeared in a conference proceedings or a
scientific journal.
(2) At least one paper (co)authored by the nominee(s), either the original
paper, or a paper very related to the innovative contribution, must have
appeared in a SIROCCO proceedings.
A nomination letter should identify the paper(s) that make(s) the nominee
eligible according to conditions (1) and (2) above, as well as explain the
contribution, its originality, and its significance.
Past SIROCCO papers and authors can be found at indexing sites, e.g. Google
Scholar or http://www.informatik.uni-trier.de/~ley/db/conf/sirocco/index.html.
Selection process
------------------
The prize winners are selected by the Award Committee composed of the current
Steering Committee (SC) Chair of the SIROCCO conference, the PC chairs,
including co-chairs, of the three SIROCCO conferences immediately preceding
the nominations deadline, plus one additional member of the Advisory Board, or
one past winner, selected by the Steering Committee for the current year.
In 2015, the Award Committee consists of: Guy Even (Tel Aviv University),
Magnús HalldórssonReykjavik University), Shay Kutten (Technion)- chair,
Thomas Moscibroda (Microsoft), and Andrzej Pelc (Universite du Quebec
en Outaouais).
Nominations can be made by any member of the scientific community.
DEADLINE :
Please send the nomination to the prize
committee chair, kutten@ie.technion.ac.il by MAY 15th, 2015.
PLEASE write SIROCCO Prize Nomination IN THE SUBJECT LINE.
Please help in recognizing the contributions of members of our community.
Complexity (SIROCCO).
Nominations are requested for the Prize for Innovation In Distributed Computing.
This prize was established to recognize individuals whose research contributions
expanded the collective investigative horizon in SIROCCO's area of interest.
That is, they formulated new problems, or identified new research areas, that
were at the time of their introduction, unorthodox and outside the mainstream,
but later attracted the interest of the SIROCCO community.
This community is interested in the relationships between information and
efficiency in decentralized computing. The prize recognizes originality,
innovation, and creativity -- the qualities that reflect the spirit of the
SIROCCO conference.
The winner is expected to give an invited talk at SIROCCO NEXT year (2016).
The winner chosen last year (Michel Raynal) will give a talk at sirocco in the
current year year: SIROCCO 2015 is going to be held on July 15-17,
Montserrat, Spain (a few days before PODC, also in Spain this year;
papers submission deadline is April 30th).
(Other invited speakers this current year are: Nati Linial (Keynote),
Amos Korman, Bernhard Haupler, and Sakat Navlakha).
The prize may not necessarily be awarded every year.
Past prize winners are Nicola Santoro, Jean-Claude Bermond, David Peleg,
Roger Wattenhofer, Andrzej Pelc, and Michel Raynal.
Eligibility
-----------
The following conditions must be met by the nominees to be eligible for the
prize. It is requested that a nomination letter explains and demonstrates how
the nominee matches these conditions.
(1) The original innovative contribution was introduced by the nominee(s) for
the first time in a publication at least five years before the
nomination deadline,
and the publication must have appeared in a conference proceedings or a
scientific journal.
(2) At least one paper (co)authored by the nominee(s), either the original
paper, or a paper very related to the innovative contribution, must have
appeared in a SIROCCO proceedings.
A nomination letter should identify the paper(s) that make(s) the nominee
eligible according to conditions (1) and (2) above, as well as explain the
contribution, its originality, and its significance.
Past SIROCCO papers and authors can be found at indexing sites, e.g. Google
Scholar or http://www.informatik.uni-trier.de/~ley/db/conf/sirocco/index.html.
Selection process
------------------
The prize winners are selected by the Award Committee composed of the current
Steering Committee (SC) Chair of the SIROCCO conference, the PC chairs,
including co-chairs, of the three SIROCCO conferences immediately preceding
the nominations deadline, plus one additional member of the Advisory Board, or
one past winner, selected by the Steering Committee for the current year.
In 2015, the Award Committee consists of: Guy Even (Tel Aviv University),
Magnús HalldórssonReykjavik University), Shay Kutten (Technion)- chair,
Thomas Moscibroda (Microsoft), and Andrzej Pelc (Universite du Quebec
en Outaouais).
Nominations can be made by any member of the scientific community.
DEADLINE :
Please send the nomination to the prize
committee chair, kutten@ie.technion.ac.il by MAY 15th, 2015.
PLEASE write SIROCCO Prize Nomination IN THE SUBJECT LINE.
Please help in recognizing the contributions of members of our community.
[DMANET] Fully-funded PhD studentship in Algorithms and Complexity at Lamsade, Paris
PhD Positions in Algorithmic Optimization Graph problems at Lamsade ( http://www.lamsade.dauphine.fr/ ), Paris , France
The research group Combinatorial Optimization, Algorithms, Data ( http://www.lamsade.dauphine.fr/spip.php?article258 ) at Lamsade, located at University Paris-Dauphine, France is offering
PhD positions in Algorithmic Optimization Graph problems . The PhD students will join the project "Algorithms with performance guarantees (AGaPe)" of Lamsade.
Each position has a start date in 2015, October.
The research focus will be on algorithms, Complexity Theory (Standard and parameterized), Approximation Algorithm and Structures for problems in graphs.
This will be at the intersection of theoretical computer science and discrete mathematics.
Funding
This PhD project is fully funded for three years with competitive salaries from a grant of the French Minister of Education. The grant
consists in a researcher contract (called contrat d'allocation de recherche) during a period of three years, with all the advantages of an employee
in France. In addition :
-- A full-time temporary appointment for a period of 3 years;
-- A salary (after social/health insurance deductions) of \euro 1635 per month for 3 years. The doctoral student will be employed as a researcher;
-- Support for your personal development and career planning including courses, summer schools, conference visits etc.;
-- A research position in an enthusiastic and internationally renowned research group;
Requirements:
The candidates shall satisfy the following requirements:
-- Master's degree in mathematics or computer science, ideally with specialization in algorithms, combinatorial optimization or another relevant area.
-- Excellent knowledge in Complexity Theory, Approximation Algorithms, Graph theory.
-- Good English skills (writing and speaking). Knowledge of French is welcome because the successful applicant should
ensure lectures in English or French.
Application:
Thesis subject is "Research on max-min or min-max solutions for algorithmic problems". Informal information about the topic can be asked
to j erome.monnot@dauphine.fr or eunjungkim78@gmail.com or florian.sikora@dauphine.fr
Dead-line for the applications, including any attachments, should be submitted by the 10 of May to the following emails: j erome.monnot@dauphine.fr
or eunjungkim78@gmail.com or florian.sikora@dauphine.fr
The following documents must be attached to the application:
-- A curriculum vitae;
-- Bachelor and Master grades (and the corresponding transcriptions if necessary) and certificates
-- Two reference letters
===================================================
Jérôme MONNOT
LAMSADE, Universite Paris-Dauphine
Place du Marechal de Lattre de Tassigny 75775 Paris Cedex 16 France
tel.: +33.1.44.05.41.62
fax: +33.1.44.05.40.91
e_mail: monnot@lamsade.dauphine.fr
web: http://l1.lamsade.dauphine.fr/~monnot/
===================================================
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Thursday, April 2, 2015
[DMANET] CFP DPM 2015 - Data Privacy Management
========================================================================
Call for Papers
DPM 2015, 10th International Workshop on
DATA PRIVACY MANAGEMENT,
http://deic.uab.cat/conferences/dpm/dpm2015/
Vienna, Austria, September 21-22, 2015
(co-located with ESORICS'2015)
Springer LNCS Proceedings
========================================================================
========================================================================
Important Dates
* Paper Submission Deadline: June 1, 2015
* Acceptance Notification: August 15, 2015
* Camera Ready Version: September 5, 2015
========================================================================
Scope: Organizations are increasingly concerned about the privacy of
information that they manage (several people have filed lawsuits
against organizations violating the privacy of customer's data). Thus,
the management of privacy-sensitive information is very critical and
important for every organization. This poses several challenging
problems, such as how to translate the high-level business goals into
system-level privacy policies, administration of privacy-sensitive
data, privacy data integration and engineering, privacy access control
mechanisms, information-oriented security, and query execution on
privacy-sensitive data for partial answers.
Topics: The aim of this workshop is to discuss and exchange the ideas
related to privacy data management. We invite papers from researchers
and practitioners working in privacy, security, trustworthy data
systems and related areas to submit their original papers in this
workshop. The main topics, but not limited to, include:
* Privacy Information Management
* Privacy Policy-based Infrastructures and Architectures
* Privacy-oriented Access Control Languages and Models
* Privacy in Trust Management
* Privacy in Digital Currencies
* Privacy Data Integration
* Privacy Risk Assessment and Assurance
* Privacy Services
* Cryptography and Cryptanalysis
* Privacy Policy Analysis
* Query Execution over Privacy Sensitive Data
* Privacy Preserving Data Mining
* Hippocratic and Water-marking Databases
* Privacy for Integrity-based Computing
* Privacy Monitoring and Auditing
* Privacy in Social Networks
* Privacy in Ambient Intelligence (AmI) Applications
* Individual Privacy vs. Corporate/National Security
* Privacy in computer networks
* Privacy and RFIDs
* Privacy and Big Data
* Privacy in sensor networks
========================================================================
Submission guidelines: Full papers should be at most 16
pages (using 11-point font), including the bibliography. Position
papers, as well as shoort papers, should be at most 8
pages (using 11-point font), including the bibliography. Authors
should indicate whether their paper is a position paper to
differentiate them from regular ones (just mention /position paper/
in the title). Program Committee members are not required to read
the appendices, so the paper should be intelligible without them.
All submissions must be written in English.
Authors must submit their papers by the deadline indicated below,
using the EasyChair web site (at easychair.org/conferences/?conf=dpm2015)
and following the requirements stated there.
The submitted paper (in PDF format) should follow the template
indicated by Springer (see http://springer.de/comp/lncs/authors.html).
It must start with a title, a short abstract, names and affiliations
of the authors, and a list of keywords.
All papers will be refereed. Accepted papers should be presented at
the Workshop. At least one author of each accepted paper must register
to the workshop, by the early date indicated by the organizers, and
present the paper.
As in previous editions, the proceedings are expected to be published
in a volume of the Lecture Notes in Computer Science series of Springer.
Submissions by PhD students as well as controversial ideas are
encouraged. Case studies (successful or not) are also encouraged.
========================================================================
General Chairs:
* Josep Domingo-Ferrer (Universitat Rovira i Virgili)
* Vicenc Torra (University of Skovde)
Program Committee Chairs:
* Joaquin Garcia-Alfaro (Telecom SudParis)
* Guillermo Navarro-Arribas (Autonomous University of Barcelona)
Program Committee:
* Rainer Bohme (University of Munster)
* Jordi Castella-Roca (Universitat Rovira i Virgili)
* Frederic Cuppens (Telecom Bretagne)
* Nora Cuppens (Telecom Bretagne)
* David Evans (University of Derby)
* Sara Foresti (University of Milan)
* Sebastien Gambs (University of Rennes)
* Paolo Gasti (New York Institute of Technology)
* Stefanos Gritzalis (University of the Aegean)
* Marit Hansen (Unabhangiges Landeszentrum fur Datenschutz)
* Jordi Herrera-Joancomarti (Universitat Autonoma de Barcelona)
* Sokratis Katsikas (University of Piraeus)
* Evangelos Kranakis (Carleton University)
* Fabio Martinelli (IIT-CNR)
* Chris Mitchell (Royal Holloway)
* Anna Monreale (University of Pisa)
* Maryline Laurent (Telecom SudParis)
* Georgios Lioudakis (National Technical University of Athens)
* Giovanni Livraga (University of Milan)
* Javier Lopez (University of Malaga)
* Sotirios Maniatis (Hellenic Authority for Communications Privacy)
* Melek Onen (EURECOM)
* Cristina Perez-Sola (Autonomous University of Barcelona)
* Silvio Ranise (FBK, Security and Trust Unit, Trento)
* Kai Rannenberg (Goethe University)
* Pierangela Samarati (University of Milan)
* David Sanchez (Universitat Rovira i Virgili)
* Claudio Soriente (ETH Zurich)
* Alessandro Sorniotti (IBM Research)
* Traian Marius-Truta (Northern Kentucky University)
* Yasuyuki Tsukada (NTT Communication Science Laboratories)
* Alexandre Viejo (Universitat Rovira i Virgili)
* Jens Weber (University of Victoria)
* Lena Wiese (University of Gottingen)
* Nicola Zannone (Eindhoven University of Technology)
=======================================
FURTHER INFORMATION
=======================================
Additional information about paper submission and conference topics and
events can be found at the DPM 2015 web site:
http://deic.uab.cat/conferences/dpm/dpm2015/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Call for Papers
DPM 2015, 10th International Workshop on
DATA PRIVACY MANAGEMENT,
http://deic.uab.cat/conferences/dpm/dpm2015/
Vienna, Austria, September 21-22, 2015
(co-located with ESORICS'2015)
Springer LNCS Proceedings
========================================================================
========================================================================
Important Dates
* Paper Submission Deadline: June 1, 2015
* Acceptance Notification: August 15, 2015
* Camera Ready Version: September 5, 2015
========================================================================
Scope: Organizations are increasingly concerned about the privacy of
information that they manage (several people have filed lawsuits
against organizations violating the privacy of customer's data). Thus,
the management of privacy-sensitive information is very critical and
important for every organization. This poses several challenging
problems, such as how to translate the high-level business goals into
system-level privacy policies, administration of privacy-sensitive
data, privacy data integration and engineering, privacy access control
mechanisms, information-oriented security, and query execution on
privacy-sensitive data for partial answers.
Topics: The aim of this workshop is to discuss and exchange the ideas
related to privacy data management. We invite papers from researchers
and practitioners working in privacy, security, trustworthy data
systems and related areas to submit their original papers in this
workshop. The main topics, but not limited to, include:
* Privacy Information Management
* Privacy Policy-based Infrastructures and Architectures
* Privacy-oriented Access Control Languages and Models
* Privacy in Trust Management
* Privacy in Digital Currencies
* Privacy Data Integration
* Privacy Risk Assessment and Assurance
* Privacy Services
* Cryptography and Cryptanalysis
* Privacy Policy Analysis
* Query Execution over Privacy Sensitive Data
* Privacy Preserving Data Mining
* Hippocratic and Water-marking Databases
* Privacy for Integrity-based Computing
* Privacy Monitoring and Auditing
* Privacy in Social Networks
* Privacy in Ambient Intelligence (AmI) Applications
* Individual Privacy vs. Corporate/National Security
* Privacy in computer networks
* Privacy and RFIDs
* Privacy and Big Data
* Privacy in sensor networks
========================================================================
Submission guidelines: Full papers should be at most 16
pages (using 11-point font), including the bibliography. Position
papers, as well as shoort papers, should be at most 8
pages (using 11-point font), including the bibliography. Authors
should indicate whether their paper is a position paper to
differentiate them from regular ones (just mention /position paper/
in the title). Program Committee members are not required to read
the appendices, so the paper should be intelligible without them.
All submissions must be written in English.
Authors must submit their papers by the deadline indicated below,
using the EasyChair web site (at easychair.org/conferences/?conf=dpm2015)
and following the requirements stated there.
The submitted paper (in PDF format) should follow the template
indicated by Springer (see http://springer.de/comp/lncs/authors.html).
It must start with a title, a short abstract, names and affiliations
of the authors, and a list of keywords.
All papers will be refereed. Accepted papers should be presented at
the Workshop. At least one author of each accepted paper must register
to the workshop, by the early date indicated by the organizers, and
present the paper.
As in previous editions, the proceedings are expected to be published
in a volume of the Lecture Notes in Computer Science series of Springer.
Submissions by PhD students as well as controversial ideas are
encouraged. Case studies (successful or not) are also encouraged.
========================================================================
General Chairs:
* Josep Domingo-Ferrer (Universitat Rovira i Virgili)
* Vicenc Torra (University of Skovde)
Program Committee Chairs:
* Joaquin Garcia-Alfaro (Telecom SudParis)
* Guillermo Navarro-Arribas (Autonomous University of Barcelona)
Program Committee:
* Rainer Bohme (University of Munster)
* Jordi Castella-Roca (Universitat Rovira i Virgili)
* Frederic Cuppens (Telecom Bretagne)
* Nora Cuppens (Telecom Bretagne)
* David Evans (University of Derby)
* Sara Foresti (University of Milan)
* Sebastien Gambs (University of Rennes)
* Paolo Gasti (New York Institute of Technology)
* Stefanos Gritzalis (University of the Aegean)
* Marit Hansen (Unabhangiges Landeszentrum fur Datenschutz)
* Jordi Herrera-Joancomarti (Universitat Autonoma de Barcelona)
* Sokratis Katsikas (University of Piraeus)
* Evangelos Kranakis (Carleton University)
* Fabio Martinelli (IIT-CNR)
* Chris Mitchell (Royal Holloway)
* Anna Monreale (University of Pisa)
* Maryline Laurent (Telecom SudParis)
* Georgios Lioudakis (National Technical University of Athens)
* Giovanni Livraga (University of Milan)
* Javier Lopez (University of Malaga)
* Sotirios Maniatis (Hellenic Authority for Communications Privacy)
* Melek Onen (EURECOM)
* Cristina Perez-Sola (Autonomous University of Barcelona)
* Silvio Ranise (FBK, Security and Trust Unit, Trento)
* Kai Rannenberg (Goethe University)
* Pierangela Samarati (University of Milan)
* David Sanchez (Universitat Rovira i Virgili)
* Claudio Soriente (ETH Zurich)
* Alessandro Sorniotti (IBM Research)
* Traian Marius-Truta (Northern Kentucky University)
* Yasuyuki Tsukada (NTT Communication Science Laboratories)
* Alexandre Viejo (Universitat Rovira i Virgili)
* Jens Weber (University of Victoria)
* Lena Wiese (University of Gottingen)
* Nicola Zannone (Eindhoven University of Technology)
=======================================
FURTHER INFORMATION
=======================================
Additional information about paper submission and conference topics and
events can be found at the DPM 2015 web site:
http://deic.uab.cat/conferences/dpm/dpm2015/
**********************************************************
*
* 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/
*
**********************************************************
[Eacsl-announce] Ackermann Award 2015
ACKERMANN AWARD 2015 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR
LOGIC IN COMPUTER SCIENCE
CALL FOR NOMINATIONS
LOGIC IN COMPUTER SCIENCE
CALL FOR NOMINATIONS
Nominations are now invited for the 2015 Ackermann Award.
PhD dissertations in topics specified by the EACSL and LICS
conferences, which were formally accepted as PhD theses at a
university or equivalent institution between 1.1.2013 and 31.12.2014
are eligible for nomination for the award. The deadline for submission
is 15 April 2015.
Submission details follow below.
Nominations can be submitted from 1 January 2015 and should be sent
to the chair of the Jury, Anuj Dawar, by e-mail:anuj.dawar@cl.cam.ac.uk
The Award
The 2015 Ackermann award will be presented to the recipient(s) at the
annual conference of the EACSL, 7-10 September 2015, in Berlin (Germany).
The award consists of
* a certificate,
* an invitation to present the thesis at the CSL/LICS conference,
* the publication of the laudatio in the CSL/LICS proceedings,
* travel support to attend the conference, and
* an invitation to present the work to the Kurt Gödel Society in
Vienna.
The jury is entitled to give the award to more (or less) than one
dissertation in a year.
Jury
The jury consists of:
* Thierry Coquand (Chalmers University of Gothenburg);
* Anuj Dawar (University of Cambridge), the president of EACSL;
* Dexter Kozen (Cornell University), ACM SigLog representative;
* Orna Kupferman (Hebrew University of Jerusalem);
* Daniel Leivant (Indiana University, Bloomington);
* Luke Ong (University of Oxford);
* Jean-Eric Pin (CNRS and University of Paris 7);
* Simona Ronchi Della Rocca (University of Torino), the
vice-president of EACSL;
How to submit
The candidate or his/her supervisor should submit
1. the thesis (ps or pdf file);
2. a detailed description (not longer than 20 pages) of the thesis
in ENGLISH (ps or pdf file);
3. a supporting letter by the PhD advisor and two supporting letters
by other senior researchers (in English);
supporting letters can also be sent directly to Anuj Dawar
(anuj.dawar@cl.cam.ac.uk);
4. a short CV of the candidate;
5. a copy of the document asserting that the thesis was accepted as
a PhD thesis at a recognized University (or equivalent institution) and
that the candidate has received his/her PhD within the specified period.
The submission should be sent by e-mail as attachments to the chairman
of the jury, Anuj Dawar:
anuj.dawar@cl.cam.ac.uk
With the following subject line and text:
* Subject: Ackermann Award Submission
* Text: Name of candidate, list of attachments
Submission can be sent via several e-mail messages. If this is the case,
please indicate it in the text. Letters of support and documents can
also be faxed to:
Anuj Dawar
Ackermann Award
+44 1223 334678
The Jury has the right to declare submissions to be out of scope or not
to meet the requirements.
The Award is sponsored by the Kurt Gödel Society.
_______________________________________________
Eacsl-announce mailing list
Eacsl-announce@kahle.ch
http://lists.kahle.ch/mailman/listinfo/eacsl-announce
Reminder: PhD Studentship in Algorithms and Complexity - Royal Holloway, University of London
This is a reminder that the application deadline is due soon.
> PHD STUDENTSHIP IN ALGORITHMS AND COMPLEXITY
>
> (full tuition-fee waiver, stipend of approximately USD 25,000
> per annum and support for conference travels)
>
> DEPARTMENT OF COMPUTER SCIENCE, ROYAL HOLLOWAY UNIVERSITY OF
> LONDON
>
> STARTING DATE: October 1, 2015
>
> The Department of Computer Science at Royal Holloway,
> University of London is offering a three-year full-time PhD
> studentship in algorithms and complexity starting in October
> 2015. The studentship includes a full tuition-fee waiver and a
> maintenance award in line with the level recommended by
> Research Councils UK (exact value to be confirmed, circa GBP
> 16,000 (USD 25,000 or EUR 20,000)). The student will be hosted
> in the Center for Algorithms and Applications and will work
> under the supervision of Dr Iddo Tzameret
> (http://www.cs.rhul.ac.uk/home/tzameret/).
>
> The project is broadly in the area of computational complexity
> with an emphasis on satisfiability and the complexity of
> proofs. The successful candidate will investigate fundamental
> aspects of the Boolean satisfiability problem SAT from possibly
> different aspects - combinatorial, algebraic and logical - with
> a possibility to engage as well in applied or empirical study
> of SAT-solving and other applications related to SAT, depending
> on the preferences and qualifications of the candidate.
>
> For more information see:
> http://www.cs.rhul.ac.uk/home/tzameret/PhD_Post.html
>
>
> HOW TO APPLY
>
> Applications should be made as soon as possible through the
> online application system at Royal Holloway, University of London:
> https://www.royalholloway.ac.uk/studyhere/researchdegrees/applying/home.aspx
>
> and will remain open until the position is filled.
>
> REQUIREMENTS
>
> The successful candidate will have obtained a first-class
> Bachelors or Masters degree in Computer Science, Mathematics or
> a cognate discipline, have a solid understanding of
> foundational aspects of computer science and, specifically,
> computational complexity (knowledge of logic will also be
> appreciated), meet the requirements for English language (IELTS
> or TOEFL), and be highly motivated. Every application will be
> analyzed individually.
>
> For any informal inquiries about the position, please contact
> Dr Iddo Tzameret at: Iddo.Tzameret@rhul.ac.uk.
>
> ABOUT THE DEPARTMENT
>
> The Computer Science Department at Royal Holloway, University
> of London, is one of the UK's leading centers for research into
> Computer Science. In the most recent Reference Excellent
> Framework (REF 2014), the department ranked 11th in the UK for
> the quality of research output, with over 32% of publications
> recognized as world leading, and 55% internationally excellent.
> The department consists of world-leading researchers in
> algorithms and complexity, bioinformatics, distributed and
> global computing, machine learning, software language
> engineering, and applications of logic in computer science.
> Research students enjoy a very lively research culture and are
> fully involved in the research activities of the Department
> (and share their successes). The Department also funds students
> to present their work at international conferences.
>
>
--
Iddo Tzameret
Computer Science Department
Royal Holloway, University of London
Iddo.Tzameret@rhul.ac.uk
http://www.cs.rhul.ac.uk/home/tzameret/
> PHD STUDENTSHIP IN ALGORITHMS AND COMPLEXITY
>
> (full tuition-fee waiver, stipend of approximately USD 25,000
> per annum and support for conference travels)
>
> DEPARTMENT OF COMPUTER SCIENCE, ROYAL HOLLOWAY UNIVERSITY OF
> LONDON
>
> STARTING DATE: October 1, 2015
>
> The Department of Computer Science at Royal Holloway,
> University of London is offering a three-year full-time PhD
> studentship in algorithms and complexity starting in October
> 2015. The studentship includes a full tuition-fee waiver and a
> maintenance award in line with the level recommended by
> Research Councils UK (exact value to be confirmed, circa GBP
> 16,000 (USD 25,000 or EUR 20,000)). The student will be hosted
> in the Center for Algorithms and Applications and will work
> under the supervision of Dr Iddo Tzameret
> (http://www.cs.rhul.ac.uk/home/tzameret/).
>
> The project is broadly in the area of computational complexity
> with an emphasis on satisfiability and the complexity of
> proofs. The successful candidate will investigate fundamental
> aspects of the Boolean satisfiability problem SAT from possibly
> different aspects - combinatorial, algebraic and logical - with
> a possibility to engage as well in applied or empirical study
> of SAT-solving and other applications related to SAT, depending
> on the preferences and qualifications of the candidate.
>
> For more information see:
> http://www.cs.rhul.ac.uk/home/tzameret/PhD_Post.html
>
>
> HOW TO APPLY
>
> Applications should be made as soon as possible through the
> online application system at Royal Holloway, University of London:
> https://www.royalholloway.ac.uk/studyhere/researchdegrees/applying/home.aspx
>
> and will remain open until the position is filled.
>
> REQUIREMENTS
>
> The successful candidate will have obtained a first-class
> Bachelors or Masters degree in Computer Science, Mathematics or
> a cognate discipline, have a solid understanding of
> foundational aspects of computer science and, specifically,
> computational complexity (knowledge of logic will also be
> appreciated), meet the requirements for English language (IELTS
> or TOEFL), and be highly motivated. Every application will be
> analyzed individually.
>
> For any informal inquiries about the position, please contact
> Dr Iddo Tzameret at: Iddo.Tzameret@rhul.ac.uk.
>
> ABOUT THE DEPARTMENT
>
> The Computer Science Department at Royal Holloway, University
> of London, is one of the UK's leading centers for research into
> Computer Science. In the most recent Reference Excellent
> Framework (REF 2014), the department ranked 11th in the UK for
> the quality of research output, with over 32% of publications
> recognized as world leading, and 55% internationally excellent.
> The department consists of world-leading researchers in
> algorithms and complexity, bioinformatics, distributed and
> global computing, machine learning, software language
> engineering, and applications of logic in computer science.
> Research students enjoy a very lively research culture and are
> fully involved in the research activities of the Department
> (and share their successes). The Department also funds students
> to present their work at international conferences.
>
>
--
Iddo Tzameret
Computer Science Department
Royal Holloway, University of London
Iddo.Tzameret@rhul.ac.uk
http://www.cs.rhul.ac.uk/home/tzameret/
[DMANET] Reminder: PhD Studentship in Algorithms and Complexity - Royal Holloway, University of London
This is a reminder that the deadline for applications is due soon.
--------------------------------------------
PHD STUDENTSHIP IN ALGORITHMS AND COMPLEXITY
--------------------------------------------
(full tuition-fee waiver, stipend of approximately USD 25,000
per annum and support for conference travels)
DEPARTMENT OF COMPUTER SCIENCE, ROYAL HOLLOWAY UNIVERSITY OF
LONDON
STARTING DATE: October 1, 2015
The Department of Computer Science at Royal Holloway,
University of London is offering a three-year full-time PhD
studentship in algorithms and complexity starting in October
2015. The studentship includes a full tuition-fee waiver and a
maintenance award in line with the level recommended by
Research Councils UK (exact value to be confirmed, circa GBP
16,000 (USD 25,000 or EUR 20,000)). The student will be hosted
in the Center for Algorithms and Applications and will work
under the supervision of Dr Iddo Tzameret
(http://www.cs.rhul.ac.uk/home/tzameret/).
The project is broadly in the area of computational complexity
with an emphasis on satisfiability and the complexity of
proofs. The successful candidate will investigate fundamental
aspects of the Boolean satisfiability problem SAT from possibly
different aspects - combinatorial, algebraic and logical - with
a possibility to engage as well in applied or empirical study
of SAT-solving and other applications related to SAT, depending
on the preferences and qualifications of the candidate.
For more information see:
http://www.cs.rhul.ac.uk/home/tzameret/PhD_Post.html
HOW TO APPLY
Applications should be made as soon as possible through the
online application system at Royal Holloway, University of London:
https://www.royalholloway.ac.uk/studyhere/researchdegrees/applying/home.aspx
and will remain open until the position is filled.
REQUIREMENTS
The successful candidate will have obtained a first-class
Bachelors or Masters degree in Computer Science, Mathematics or
a cognate discipline, have a solid understanding of
foundational aspects of computer science and, specifically,
computational complexity (knowledge of logic will also be
appreciated), meet the requirements for English language (IELTS
or TOEFL), and be highly motivated. Every application will be
analyzed individually.
For any informal inquiries about the position, please contact
Dr Iddo Tzameret at: Iddo.Tzameret@rhul.ac.uk.
ABOUT THE DEPARTMENT
The Computer Science Department at Royal Holloway, University
of London, is one of the UK's leading centers for research into
Computer Science. In the most recent Reference Excellent
Framework (REF 2014), the department ranked 11th in the UK for
the quality of research output, with over 32% of publications
recognized as world leading, and 55% internationally excellent.
The department consists of world-leading researchers in
algorithms and complexity, bioinformatics, distributed and
global computing, machine learning, software language
engineering, and applications of logic in computer science.
Research students enjoy a very lively research culture and are
fully involved in the research activities of the Department
(and share their successes). The Department also funds students
to present their work at international conferences.
--
Iddo Tzameret
Computer Science Department
Royal Holloway, University of London
Iddo.Tzameret@rhul.ac.uk
http://www.cs.rhul.ac.uk/home/tzameret/
**********************************************************
*
* 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/
*
**********************************************************
--------------------------------------------
PHD STUDENTSHIP IN ALGORITHMS AND COMPLEXITY
--------------------------------------------
(full tuition-fee waiver, stipend of approximately USD 25,000
per annum and support for conference travels)
DEPARTMENT OF COMPUTER SCIENCE, ROYAL HOLLOWAY UNIVERSITY OF
LONDON
STARTING DATE: October 1, 2015
The Department of Computer Science at Royal Holloway,
University of London is offering a three-year full-time PhD
studentship in algorithms and complexity starting in October
2015. The studentship includes a full tuition-fee waiver and a
maintenance award in line with the level recommended by
Research Councils UK (exact value to be confirmed, circa GBP
16,000 (USD 25,000 or EUR 20,000)). The student will be hosted
in the Center for Algorithms and Applications and will work
under the supervision of Dr Iddo Tzameret
(http://www.cs.rhul.ac.uk/home/tzameret/).
The project is broadly in the area of computational complexity
with an emphasis on satisfiability and the complexity of
proofs. The successful candidate will investigate fundamental
aspects of the Boolean satisfiability problem SAT from possibly
different aspects - combinatorial, algebraic and logical - with
a possibility to engage as well in applied or empirical study
of SAT-solving and other applications related to SAT, depending
on the preferences and qualifications of the candidate.
For more information see:
http://www.cs.rhul.ac.uk/home/tzameret/PhD_Post.html
HOW TO APPLY
Applications should be made as soon as possible through the
online application system at Royal Holloway, University of London:
https://www.royalholloway.ac.uk/studyhere/researchdegrees/applying/home.aspx
and will remain open until the position is filled.
REQUIREMENTS
The successful candidate will have obtained a first-class
Bachelors or Masters degree in Computer Science, Mathematics or
a cognate discipline, have a solid understanding of
foundational aspects of computer science and, specifically,
computational complexity (knowledge of logic will also be
appreciated), meet the requirements for English language (IELTS
or TOEFL), and be highly motivated. Every application will be
analyzed individually.
For any informal inquiries about the position, please contact
Dr Iddo Tzameret at: Iddo.Tzameret@rhul.ac.uk.
ABOUT THE DEPARTMENT
The Computer Science Department at Royal Holloway, University
of London, is one of the UK's leading centers for research into
Computer Science. In the most recent Reference Excellent
Framework (REF 2014), the department ranked 11th in the UK for
the quality of research output, with over 32% of publications
recognized as world leading, and 55% internationally excellent.
The department consists of world-leading researchers in
algorithms and complexity, bioinformatics, distributed and
global computing, machine learning, software language
engineering, and applications of logic in computer science.
Research students enjoy a very lively research culture and are
fully involved in the research activities of the Department
(and share their successes). The Department also funds students
to present their work at international conferences.
--
Iddo Tzameret
Computer Science Department
Royal Holloway, University of London
Iddo.Tzameret@rhul.ac.uk
http://www.cs.rhul.ac.uk/home/tzameret/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Call for Participation: ICITS 2015, Lugano
Hi
the 8th International Conference on Information-Theoretic Security (ICITS) will be held on May 2–5, 2015, in Lugano, Switzerland, right after EUROCRYPT 2015 (April 26–30, Sofia).
ICITS covers all aspects of information-theoretic security, from relevant mathematical tools to theoretical modeling to implementation.
The conference program includes 23 talks on areas including quantum information theory, leakage-resilient cryptography, code-based
schemes, foundations of information-theoretic security, and more.
Furthermore, the program features five invited talks of distinguished researches in those fields:
Adrian Kent, University of Cambridge, U.K.,
Jesper Buus Nielsen, Aarhus University, Denmark,
Joseph Renes, ETH Zurich, Switzerland,
Daniel Wichs, Northeastern University, USA,
Andreas Winter, Universitat Autonoma de Barcelona, Spain.
The program can be found at
http://icits2015.net/?page=program
Best,
Ämin
**********************************************************
*
* 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, April 1, 2015
[Mycolleagues] [CFP] - Special issue of PARCO: Theory and Practice of Irregular Applications (TaPIA) - Deadline EXTENDED
[Apologies if you got multiple copies of this email.]
NOTE: Due to numerous requests, we have extended the submission deadline for the special issue of the journal until April 20. The new deadline is FIRM and no more extensions will be possible.
CALL FOR PAPERS
A broad class of applications is irregular. Irregular applications present unpredictable memory access patterns, control structures, and/or network transfers. They typically use pointer or linked lists-based data structures such as graphs, unbalanced trees, and unstructured grids. They often present fine-grained synchronization and communication, and generally operate on very large data sets. They have a significant degree of latent parallelism, which is however difficult to fully exploit because of their complex behavior. Beside performance, another significant concern for emerging irregular applications is the size of the datasets. In fact, modern irregular applications operate on massive amounts of data, often unstructured, which are very difficult to partition and easily generate load imbalance.
Current high performance architectures rely on data locality, regular computations, structured data and easily partitionable datasets. They do not cope well with the requirements of these applications. Furthermore, irregular applications are difficult to scale on current supercomputing machines, because of their limits with fine-grained communication and synchronization. Irregular applications pertain both to well established and emerging fields, such as Computer Aided Design (CAD), bioinformatics, semantic graph databases, machine learning, analysis of social, transportation, communication and other types of networks, and computer security. Addressing the issues of these applications on current and future system architectures will become critical to solve the scientific challenges of the next few years.
This special issue seeks to explore solutions for supporting efficient design, development and execution of irregular applications in the form of new features at the level of the micro- and system-architecture, network, languages and libraries, runtimes, compilers, analysis, algorithms. Topics of interest, of both theoretical and practical significance, include but are not limited to:
* Micro- and System-architectures
* Network and memory architectures
* Manycore, hybrid, heterogeneous and custom architectures (Tilera, GPUs, FPGAs)
* Modeling, evaluation and characterization of architectures for memory intensive and irregular applications
* Innovative algorithmic techniques
* Combinatorial (graph) algorithms and their applications
* Parallelization techniques and data structures
* Languages and programming models
* Library and runtime support
* Compiler and analysis techniques
* Case studies of irregular applications (e.g. Semantic Graph Databases, Data Mining, Security, Bioinformatics)
This special issue solicits both novel, unpublished work, and previously published, but significantly extended, approaches.
Schedule
Submission deadline: April 20 - 2015 — EXTENDED!
First round of reviews and initial notification: June 2015
Revisions and final decisions: August 2015
Publication: November 2015
http://www.journals.elsevier.com/parallel-computing/call-for-papers/parallel-computing-on-theory-and-practice-of-irregular-appli/ <http://www.journals.elsevier.com/parallel-computing/call-for-papers/parallel-computing-on-theory-and-practice-of-irregular-appli/>
Guest Editors
Antonino Tumeo, Pacific Northwest National Laboratory
antonino.tumeo@pnnl.gov
John T. Feo, Context Relevant
jfeo@contextrelevant.com
Oreste Villa, NVIDIA Research
ovilla@nvidia.com
_______________________________________________
Mycolleagues mailing list
Mycolleagues@mailman.ufsc.br
http://mailman.ufsc.br/mailman/listinfo/mycolleagues
NOTE: Due to numerous requests, we have extended the submission deadline for the special issue of the journal until April 20. The new deadline is FIRM and no more extensions will be possible.
CALL FOR PAPERS
A broad class of applications is irregular. Irregular applications present unpredictable memory access patterns, control structures, and/or network transfers. They typically use pointer or linked lists-based data structures such as graphs, unbalanced trees, and unstructured grids. They often present fine-grained synchronization and communication, and generally operate on very large data sets. They have a significant degree of latent parallelism, which is however difficult to fully exploit because of their complex behavior. Beside performance, another significant concern for emerging irregular applications is the size of the datasets. In fact, modern irregular applications operate on massive amounts of data, often unstructured, which are very difficult to partition and easily generate load imbalance.
Current high performance architectures rely on data locality, regular computations, structured data and easily partitionable datasets. They do not cope well with the requirements of these applications. Furthermore, irregular applications are difficult to scale on current supercomputing machines, because of their limits with fine-grained communication and synchronization. Irregular applications pertain both to well established and emerging fields, such as Computer Aided Design (CAD), bioinformatics, semantic graph databases, machine learning, analysis of social, transportation, communication and other types of networks, and computer security. Addressing the issues of these applications on current and future system architectures will become critical to solve the scientific challenges of the next few years.
This special issue seeks to explore solutions for supporting efficient design, development and execution of irregular applications in the form of new features at the level of the micro- and system-architecture, network, languages and libraries, runtimes, compilers, analysis, algorithms. Topics of interest, of both theoretical and practical significance, include but are not limited to:
* Micro- and System-architectures
* Network and memory architectures
* Manycore, hybrid, heterogeneous and custom architectures (Tilera, GPUs, FPGAs)
* Modeling, evaluation and characterization of architectures for memory intensive and irregular applications
* Innovative algorithmic techniques
* Combinatorial (graph) algorithms and their applications
* Parallelization techniques and data structures
* Languages and programming models
* Library and runtime support
* Compiler and analysis techniques
* Case studies of irregular applications (e.g. Semantic Graph Databases, Data Mining, Security, Bioinformatics)
This special issue solicits both novel, unpublished work, and previously published, but significantly extended, approaches.
Schedule
Submission deadline: April 20 - 2015 — EXTENDED!
First round of reviews and initial notification: June 2015
Revisions and final decisions: August 2015
Publication: November 2015
http://www.journals.elsevier.com/parallel-computing/call-for-papers/parallel-computing-on-theory-and-practice-of-irregular-appli/ <http://www.journals.elsevier.com/parallel-computing/call-for-papers/parallel-computing-on-theory-and-practice-of-irregular-appli/>
Guest Editors
Antonino Tumeo, Pacific Northwest National Laboratory
antonino.tumeo@pnnl.gov
John T. Feo, Context Relevant
jfeo@contextrelevant.com
Oreste Villa, NVIDIA Research
ovilla@nvidia.com
_______________________________________________
Mycolleagues mailing list
Mycolleagues@mailman.ufsc.br
http://mailman.ufsc.br/mailman/listinfo/mycolleagues
- Through this link above you can "subscribe", "unsubscribe", or change your settings in the list, using "username=ufsc" and "password=ufsc".
- If you need any help, please send a message to mycolleagues-owner@mailman.ufsc.br.
- ENJOY this COURTESY offered by FEDERAL UNIVERSITY OF SANTA CATARINA.
[DMANET] CALL FOR PAPER WASA2015
WASA 2015
=============================================================
The 10th International Conference on Wireless Algorithms,
Systems, and Applications
August 10-12, 2015, Qufu, Shandong, China
(WASA 2015)
http://www.cs.gsu.edu/WASA/WASA2015//
=============================================================
Dear Colleagues,
Please accept our apologies if you receive multiple copies of this email.
WASA is an international conference on algorithms, systems, and applications of wireless networks. It is motivated by the recent advances in cutting-edge electronic and computer technologies that have paved the way for the proliferation of ubiquitous infrastructure and infrastructureless wireless networks.
WASA is designed to be a forum for theoreticians, system and application designers, protocol developers and practitioners to discuss and express their views on the current trends, challenges, and state-of-the-art solutions related to various issues in wireless networks. Topics of interests include, but not limited to, effective and efficient state-of-the-art algorithm design and analysis, reliable and secure system development and implementations, experimental study and testbed validation, and new application exploration in wireless networks.
All the papers will be published to the symposium in Springer-Verlag's Lecture Notes.
Extended versions of most papers from the conference will be published in the special issues of Peer-to-Peer Networking and Applications (SCI), EURASIP Journal on Wireless Communications and Networking (SCI), Journal of Medical Systems (SCI), and Security and Communication Networks Journal*(SCI).
Important Dates
Submission Deadline: April 1st, 2015
Notification of Acceptance: May, 1st, 2015
Camera-ready Submission: May 10th, 2015
Conference Date: August 10-12th, 2015
**********************************************************
*
* 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 10th International Conference on Wireless Algorithms,
Systems, and Applications
August 10-12, 2015, Qufu, Shandong, China
(WASA 2015)
http://www.cs.gsu.edu/WASA/WASA2015//
=============================================================
Dear Colleagues,
Please accept our apologies if you receive multiple copies of this email.
WASA is an international conference on algorithms, systems, and applications of wireless networks. It is motivated by the recent advances in cutting-edge electronic and computer technologies that have paved the way for the proliferation of ubiquitous infrastructure and infrastructureless wireless networks.
WASA is designed to be a forum for theoreticians, system and application designers, protocol developers and practitioners to discuss and express their views on the current trends, challenges, and state-of-the-art solutions related to various issues in wireless networks. Topics of interests include, but not limited to, effective and efficient state-of-the-art algorithm design and analysis, reliable and secure system development and implementations, experimental study and testbed validation, and new application exploration in wireless networks.
All the papers will be published to the symposium in Springer-Verlag's Lecture Notes.
Extended versions of most papers from the conference will be published in the special issues of Peer-to-Peer Networking and Applications (SCI), EURASIP Journal on Wireless Communications and Networking (SCI), Journal of Medical Systems (SCI), and Security and Communication Networks Journal*(SCI).
Important Dates
Submission Deadline: April 1st, 2015
Notification of Acceptance: May, 1st, 2015
Camera-ready Submission: May 10th, 2015
Conference Date: August 10-12th, 2015
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] CFP Computational optimization
------------
Call for Papers
8th Workshop on Computational Optimization (WCO 2015
Lodz, Poland, September 13 - 16, 2015
organized in the framework of FEDERATED CONFERENCE ON COMPUTER SCIENCE
AND INFORMATION SYSTEMS
FedCSIS - 2015
====================
We invite original contributions related with both theoretical and
practical aspects of optimization methods.
The list of topics includes, but is not limited to:
* unconstrained and constrained optimization
* combinatorial optimization
* continues optimization
* global optimization
* multiobjective optimization
* optimization in dynamic and/or noisy environments
* large scale optimization
* parallel and distributed approaches in optimization
* random search algorithms, simulated annealing, tabu search and other
derivative free optimization methods
* nature inspired optimization methods (evolutionary algorithms, ant
colony optimization, particle swarm optimization, immune artificial
systems etc)
* hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
*computational biology and optimization
* distance geometry and applications
* optimization methods for learning processes and data mining
* application of optimization methods on real life and industrial problems
* computational optimization methods in statistics, econometrics,
finance, physics, chemistry, biology, medicine, engineering etc.
====================
Important dates:
24.04.2015 (April 24, 2015) – Full paper submission
01.06.2015 (June 01, 2015) - Position paper submission
15.06.2015 (June 15, 2015) – Notification of acceptance
01.07.2015 (July 01, 2015) – Camera-ready version of the accepted
paper and registration
====================
Submission and Publication
* Authors should submit draft papers as PDF.
* The total length of a paper should not exceed 8 pages (IEEE style).
IEEE style templates are available at http://www.fedcsis.org/.
* Papers will be refereed and accepted on the basis of their
scientific merit and relevance to the workshop.
* Accepted and Presented paper will be published in the Conference
Proceedings and included in the IEEE Xplore database (pending) and
indexed in the DBLP.
* Extended versions of selected papers presented during the conference
will be published as Special Issue(s) of Springer Studies of
Computational Intelligence.
====================
If you have any question do not hesitate to send a mail to wco2015@fedcsis.org .
Organizing Committee
Stefka Fidanova, Bulgarian Academy of Science, Bulgaria
Daniela Zaharie, West University of Timisoara, Romania
Antonio Mucherino, IRISA, France
--
Assoc. Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Subscribe to:
Posts (Atom)
Posts
