**********************************************************************
INTERNATIONAL SUMMER SCHOOL ON INFORMATION SECURITY
InfoSec 2015
Tarragona, Spain
July 6-10, 2015
Organized by
Rovira i Virgili University
http://grammars.grlmc.com/InfoSec2015/
**********************************************************************
--- Early registration deadline: January 3, 2015 ---
**********************************************************************
AIM:
InfoSec 2015 will be a major research training event addressed to graduates
and postgraduates in the first steps of their academic career. With a global
scope, it aims at updating them about the most recent advances in the
critical and fast developing area of information security, which covers a
large spectrum of current exciting academic research and industrial
innovation. It refers to procedures to defend information from unauthorized
access, use, modification, recording or destruction, with a critical role to
play in order to avoid or minimize risks in the digital world. Renowned
academics and industry pioneers will lecture and share their views with the
audience.
Most information security subareas will be displayed, namely: computer
security, cryptography, privacy, cyber security, mobile security, network
security, world wide web security, fraud prevention, data protection, etc.
Main challenges of information security will be identified through 4 keynote
lectures, 33 six-hour courses, and 1 round table, which will tackle the most
active and promising topics. The organizers believe outstanding speakers
will attract the brightest and most motivated students. Interaction will be
a main component of the event.
ADDRESSED TO:
Graduates and postgraduates from around the world. There are no formal
pre-requisites in terms of academic degrees. However, since there will be
differences in the course levels, specific background knowledge may be
required for some of them.
InfoSec 2015 is also appropriate for more senior people who want to keep
themselves updated on recent developments and future trends. They will
surely find it fruitful to listen and discuss with major researchers,
industry leaders and innovators.
REGIME:
In addition to keynotes, 4 courses will run in parallel during the whole
event. Participants will be able to freely choose the courses they will be
willing to attend as well as to move from one to another.
VENUE:
InfoSec 2015 will take place in Tarragona, located 90 kms. to the south of
Barcelona. The venue will be:
Campus Catalunya
Universitat Rovira i Virgili
Av. Catalunya, 35
43002 Tarragona
KEYNOTE SPEAKERS:
Jan Camenisch (IBM Research, Zurich), Privacy in a Digital World: a Lost
Cause?
Hao Chen (University of California, Davis), (In)security of Mobile Apps in
Untrusted Networks
Jennifer Seberry (University of Wollongong), The Global Village: the
Beginning of the Need for Computer Security [via videoconference]
Gene Tsudik (University of California, Irvine), Off-line Proximity-based
Social Networking
PROFESSORS AND COURSES:
N. Asokan (Aalto University), [intermediate] Mobile Security: Overview of
Hardware Platform Security and Considerations of Usability
Jan Camenisch (IBM Research, Zurich), [introductory/intermediate]
Technologies to Protect Online Privacy
Hao Chen (University of California, Davis), [intermediate/advanced] Security
of the Mobile App Ecosystem
Nicolas T. Courtois (University College London), [introductory/intermediate]
Security of ECDSA in Bitcoin and Crypto Currency
Claude Crépeau (McGill University, Montréal), [introductory/intermediate]
Quantum Computation, Cryptography and Cryptanalysis
Joan Daemen (ST Microelectronics Belgium, Diegem),
[introductory/intermediate] Sponge Functions, Keccak and SHA-3
Sajal K. Das (Missouri University of Science and Technology, Rolla),
[intermediate/advanced] Securing Cyber-Physical Systems: Challenges and
Opportunities
Hervé Debar (Télécom SudParis), [introductory/intermediate] Detection and
Reaction to Attacks: from Intrusion Detection to Cyber-Defense
Yevgeniy Dodis (New York University), [intermediate/advanced] Randomness in
Cryptography
David Evans (University of Virginia, Charlottesville),
[introductory/intermediate] Secure Multiparty Computation: Techniques,
Theory, and Tools for Building Privacy-Preserving Applications
Rosario Gennaro (City University of New York), [intermediate/advanced] A
Survey of Verifiable Delegation of Computation
Trent Jaeger (Pennsylvania State University, University Park),
[intermediate/advanced] How to Add Security Enforcement to Legacy Programs
Markus Jakobsson (Qualcomm, Santa Clara), [introductory/intermediate]
Frontiers in Fraud Prevention
Antoine Joux (Pierre et Marie Curie University, Paris),
[introductory/intermediate] Discrete Logarithms in Finite Fields
Marc Joye (Technicolor R&I, Los Altos), [introductory/intermediate] Secure
Public-Key Cryptosystems
Somesh Jha (University of Wisconsin, Madison), [intermediate/advanced]
Analysis Techniques in Information Security
Lars R. Knudsen (Technical University of Denmark, Lyngby),
[introductory/intermediate] Block Ciphers: the Workhorses in Cryptography
Songwu Lu (University of California, Los Angeles),
[introductory/intermediate] Cellular Network Security: Issues and Defenses
Catherine Meadows (Naval Research Laboratory, Washington DC),
[introductory/intermediate] Formal Analysis of Cryptographic Protocols
Nasir Memon (New York University), [introductory/intermediate] User
Authentication
Ethan L. Miller (University of California, Santa Cruz),
[intermediate/advanced] Securing Stored Data in a Connected World
Stefano Paraboschi (University of Bergamo), [introductory/intermediate] Data
Protection in Network-enabled Systems
Bart Preneel (KU Leuven), [introductory/intermediate] Cryptology: State of
the Art and Research Challenges
Jean-Jacques Quisquater (Catholic University of Louvain),
[introductory/intermediate] The History of RSA: from Babylon to Smart Cards
Shantanu Rane (Palo Alto Research Center), [introductory/intermediate]
Privacy-preserving Data Analytics: Problems, Solutions and Challenges
Mark Ryan (University of Birmingham), [introductory/intermediate] Designing
Security Protocols: Electronic Voting, and Electronic Mail
Rei Safavi-Naini (University of Calgary), [introductory]
Information-theoretic Security
Stefan Saroiu (Microsoft Research, Redmond), [advanced] Dealing with Loss:
Protecting Data on a Lost Mobile Device
Milind Tambe (University of Southern California, Los Angeles),
[introductory/intermediate] Introduction to the Emerging Science of Security
Games
Gene Tsudik (University of California, Irvine), [intermediate/advanced]
Security and Privacy in Candidate Future Internet Architectures
Yang Xiao (University of Alabama, Tuscaloosa), [introductory/advanced]
Security in Smart Grids
Wenyuan Xu (University of South Carolina, Columbia), [intermediate] Security
and Privacy Analysis of Embedded Systems
Yuliang Zheng (University of North Carolina, Charlotte), [introductory]
Cryptography and the Future of Money
ORGANIZING COMMITTEE:
Adrian Horia Dediu (Tarragona)
Carlos Martín-Vide (Tarragona, chair)
Florentina Lilica Voicu (Tarragona)
REGISTRATION:
The registration form can be found at:
http://grammars.grlmc.com/InfoSec2015/registration.php
The selection of up to 8 courses requested in the registration template is
only tentative and non-binding. For the sake of organization, it will be
helpful to have an approximation of the respective demand for each course.
Since the capacity of the venue is limited, registration requests will be
processed on a first come first served basis. The registration period will
be closed and the on-line registration facility disabled when the capacity
of the venue will be complete. It is much recommended to register prior to
the event.
FEES:
Fees are a flat rate covering the attendance to all courses during the week.
There are several early registration deadlines. Fees depend on the
registration deadline.
ACCOMMODATION:
Suggestions of accommodation will be provided in due time.
CERTIFICATE:
Participants will be delivered a certificate of attendance.
QUESTIONS AND FURTHER INFORMATION:
florentinalilica.voicu@urv.cat
POSTAL ADDRESS:
InfoSec 2015
Lilica Voicu
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain
Phone: +34 977 559 543
Fax: +34 977 558 386
ACKNOWLEDGEMENTS:
Universitat Rovira i Virgili
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Wednesday, December 31, 2014
Tuesday, December 30, 2014
[DMANET] PODC 2015 Final Call for Workshop Proposals
-----------------------------------------------------------------------
PODC 2015 Final Call for Workshop Proposals
-----------------------------------------------------------------------
34th Annual ACM Symposium on Principles of Distributed Computing
July 21-23, 2015
Donostia-San Sebastian, Spain
http://www.podc.org/
-----------------------------------------------------------------------
The 34th Annual ACM SIGACT-SIGOPS Symposium on Principles of
Distributed Computing (PODC 2015) invites proposals for up to 1.5 day
workshops that are closely related to the current scope of the
conference or are new emerging research fields complementing or
extending it, including but not restricted to:
- algorithms for distributed systems and their complexity
- cluster, cloud, grid and high-performance computing
- communication networks: protocols, architectures, services,
applications
- sensor, mobile, ad-hoc, robot and peer-to-peer networks
- concurrent programming, synchronization, shared and transactional
memory
- cryptographic protocols and system security
- distributed operating systems, databases and programming languages
- dynamic, adaptive and machine learning based distributed algorithms
- self-stabilizing, self-organizing and autonomic systems
- formal methods, semantics and verification of concurrent systems
- fault tolerance, reliability, availability of distributed systems
- game-theoretic approaches to distributed computing
- information theory, codes and reliable communication
- Internet applications, social networks and complex networks
- multiprocessor and multi-core architectures and algorithms
- nanonetworks and biological distributed algorithms
- quantum and optics based distributed algorithms
- energy issues of parallel and distributed algorithms
Workshops will be held in conjunction with PODC on Monday 20 July 2015,
or, in exceptional cases, after the main PODC conference program.
Interested members of the community are invited to send proposals for
workshops by email to the workshop chair:
Elad Michael Schiller <elad@chalmers.se>
The following are required in a workshop proposal:
- Title of the workshop;
- An abstract describing the main focus of the workshop and why it
would be of interest to the PODC community;
- Names and contact information of the organizers;
- Estimated number of submitted and accepted papers, duration of the
workshop, and a brief description of the review process.
Although PODC will provide organizational and administrative support
for the co-located workshops, they must be prepared to bear their own
expenses (e.g., those associated with the meeting rooms and catering).
The budget of PODC and the workshops could be integrated in case of
ACM-based workshops, but the details will need to be worked out.
The proposals should be submitted to the workshop chair as soon as
possible, but no later than
January 6, 2015.
Notification of acceptance will be sent shortly after the deadline.
-----------------------------------------------------------------------
**********************************************************
*
* 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/
*
**********************************************************
PODC 2015 Final Call for Workshop Proposals
-----------------------------------------------------------------------
34th Annual ACM Symposium on Principles of Distributed Computing
July 21-23, 2015
Donostia-San Sebastian, Spain
http://www.podc.org/
-----------------------------------------------------------------------
The 34th Annual ACM SIGACT-SIGOPS Symposium on Principles of
Distributed Computing (PODC 2015) invites proposals for up to 1.5 day
workshops that are closely related to the current scope of the
conference or are new emerging research fields complementing or
extending it, including but not restricted to:
- algorithms for distributed systems and their complexity
- cluster, cloud, grid and high-performance computing
- communication networks: protocols, architectures, services,
applications
- sensor, mobile, ad-hoc, robot and peer-to-peer networks
- concurrent programming, synchronization, shared and transactional
memory
- cryptographic protocols and system security
- distributed operating systems, databases and programming languages
- dynamic, adaptive and machine learning based distributed algorithms
- self-stabilizing, self-organizing and autonomic systems
- formal methods, semantics and verification of concurrent systems
- fault tolerance, reliability, availability of distributed systems
- game-theoretic approaches to distributed computing
- information theory, codes and reliable communication
- Internet applications, social networks and complex networks
- multiprocessor and multi-core architectures and algorithms
- nanonetworks and biological distributed algorithms
- quantum and optics based distributed algorithms
- energy issues of parallel and distributed algorithms
Workshops will be held in conjunction with PODC on Monday 20 July 2015,
or, in exceptional cases, after the main PODC conference program.
Interested members of the community are invited to send proposals for
workshops by email to the workshop chair:
Elad Michael Schiller <elad@chalmers.se>
The following are required in a workshop proposal:
- Title of the workshop;
- An abstract describing the main focus of the workshop and why it
would be of interest to the PODC community;
- Names and contact information of the organizers;
- Estimated number of submitted and accepted papers, duration of the
workshop, and a brief description of the review process.
Although PODC will provide organizational and administrative support
for the co-located workshops, they must be prepared to bear their own
expenses (e.g., those associated with the meeting rooms and catering).
The budget of PODC and the workshops could be integrated in case of
ACM-based workshops, but the details will need to be worked out.
The proposals should be submitted to the workshop chair as soon as
possible, but no later than
January 6, 2015.
Notification of acceptance will be sent shortly after the deadline.
-----------------------------------------------------------------------
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Post-Doctoral Position "Algorithmic and Enumerative Combinatorics"
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% POST-DOCTORAL POSITION in %
% ALGORITHMIC AND ENUMERATIVE COMBINATORICS %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
The Special Research Program (SFB) "ALGORITHMIC AND ENUMERATIVE
COMBINATORICS," a four-year programme (March 1, 2013 - Feb. 28, 2017)
funded by the Austrian Science Foundation FWF, is offering a post-
doctoral position at the University of Vienna, to be filled latest
in autumn 2015.
For more specific information on the program see the SFB WWW Site
https://www.sfb050.risc.jku.at/
The open position is within the Project Part
"Determinantal and Recursive Methods in Enumeration"
(Principal investigator: Christian Krattenthaler).
The position will run at least until the end of the first
funding period of the SFB (Feb. 28, 2017), and will be up
to 3 years provided a second funding period is granted.
We explicitly encourage female researchers to apply for the offered
positions. We guarantee that the selection process, based solely on
the research records, will give equal opportunities to female and
male researchers.
Interested applicants should submit an application with
CV, list of publications, and in addition ask 2 people
to send letters of evaluation, no later than
JANUARY 10, 2015
to <Christian.Krattenthaler@univie.ac.at>.
**********************************************************
*
* 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/
*
**********************************************************
% POST-DOCTORAL POSITION in %
% ALGORITHMIC AND ENUMERATIVE COMBINATORICS %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
The Special Research Program (SFB) "ALGORITHMIC AND ENUMERATIVE
COMBINATORICS," a four-year programme (March 1, 2013 - Feb. 28, 2017)
funded by the Austrian Science Foundation FWF, is offering a post-
doctoral position at the University of Vienna, to be filled latest
in autumn 2015.
For more specific information on the program see the SFB WWW Site
https://www.sfb050.risc.jku.at/
The open position is within the Project Part
"Determinantal and Recursive Methods in Enumeration"
(Principal investigator: Christian Krattenthaler).
The position will run at least until the end of the first
funding period of the SFB (Feb. 28, 2017), and will be up
to 3 years provided a second funding period is granted.
We explicitly encourage female researchers to apply for the offered
positions. We guarantee that the selection process, based solely on
the research records, will give equal opportunities to female and
male researchers.
Interested applicants should submit an application with
CV, list of publications, and in addition ask 2 people
to send letters of evaluation, no later than
JANUARY 10, 2015
to <Christian.Krattenthaler@univie.ac.at>.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] PhD Studentship in Algorithms and Complexity - Royal Holloway, University of London
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/
*
**********************************************************
(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] CFP Request - The International Conference on Electrical and Bio-medical Engineering, Clean Energy and Green Computing (EBECEGC2015)
Dear Sir/Madam:
Could you please kindly forward the following CFP to your colleagues and
friends. We hope to see some papers from your country by your efforts.
THANK YOU.
Sincerely yours
Hazel Ann
www.sdiwc.net
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
The International Conference on Electrical and Bio-medical Engineering,
Clean Energy
and Green Computing (EBECEGC2015)
Dubai, UAE, on January 28-30, 2015
http://goo.gl/zcvutp
ebecegc15@sdiwc.net
All registered papers will be included in SDIWC Digital Library
==============================================================
The submission is open from now until Jan. 08, 2015.
Paper submission link: http://goo.gl/lhRxTv
Researchers are encouraged to submit their work electronically. Full paper
must be submitted (Abstracts are not acceptable).
==============================================================
Looking forward to receive your papers related to Electrical/ Bio-medical
Engineering and Clean Energy/Green Computing.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Could you please kindly forward the following CFP to your colleagues and
friends. We hope to see some papers from your country by your efforts.
THANK YOU.
Sincerely yours
Hazel Ann
www.sdiwc.net
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
The International Conference on Electrical and Bio-medical Engineering,
Clean Energy
and Green Computing (EBECEGC2015)
Dubai, UAE, on January 28-30, 2015
http://goo.gl/zcvutp
ebecegc15@sdiwc.net
All registered papers will be included in SDIWC Digital Library
==============================================================
The submission is open from now until Jan. 08, 2015.
Paper submission link: http://goo.gl/lhRxTv
Researchers are encouraged to submit their work electronically. Full paper
must be submitted (Abstracts are not acceptable).
==============================================================
Looking forward to receive your papers related to Electrical/ Bio-medical
Engineering and Clean Energy/Green Computing.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Monday, December 29, 2014
[DMANET] Call for Workshops - CP-AI-OR 2015
****************************************
Call for Workshop Proposals for CP-AI-OR 2015 - One-page Proposals Due Friday, January 16, 2015.
The Twelfth International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) techniques in Constraint Programming (CPAIOR 2015)
http://cpaior2015.uconn.edu/
May 18 - May 22, 2015
Barcelona, Spain
The CP-AI-OR 2015 Program Chair invites proposals for workshops which will take place on May 18, 2015.
The aim of the conference is to bring together interested researchers from Constraint Programming (CP), Artificial Intelligence (AI), and Operations Research (OR) to present new techniques or applications in combinatorial optimization and to provide an opportunity for researchers in one area to learn about techniques in the others. A main objective of this conference series is also to give these researchers the opportunity to show how the integration of techniques from different fields can lead to interesting results on large and complex problems. Workshops on topics dedicated to combining and integrating approaches from more than one of the areas are especially solicited.
All workshops will take place on May 18, 2015 at the site of the main conference. Workshops can follow a half-day or a full-day format. The details of the organization of each workshop are left to its organizers.
Workshop proposals are due Friday, January 16, 2015 and should be submitted via email to cpaior2015@gmail.com.
****************************************
Proposals Details
Each workshop proposal should be one-page in length and include the following information:
- Title and abstract giving the goals and scope of the workshop
- Description of the target audience
- List of tentative speakers and / or attendees (if available)
- History of the workshop if this is not the first instance
- Relevant experience of the organizing committee
- Tentative organizing committee members (at least 2 to 3 members)
- Contact information for the organizer.
****************************************
Responsibilities of the workshop organizers
The workshop organizers are responsible for:
- Creating and distributing a call-for-participation and any other relevant advertising. The calls should make it clear that participants will have to present the topics and must attend the Workshop. The call should clearly describe the review and selection process. Finally, the calls must be framed to encourage as broad a participation as possible.
- Creating and publishing (in a timely manner) a website with all the relevant information pertaining to the workshop which will be linked to from the main conference website.
- Providing an extended abstract for the conference program.
- Reviewing and selecting presentation submissions.
- Scheduling the presentations within the workshop
It should be noted that the conference organization does not budget for free registration, accommodation or travel expenses for the workshop organizers or their invited speakers. The workshop organizers should therefore secure any source of funding / sponsorship deemed necessary for their invited speakers.
****************************************
Responsibilities of the CP-AI-OR 2015 Organizing Committee
The conference organization is responsible for:
- Providing publicity for the workshop program as a whole
- Providing logistics at the conference venue (meeting room, coffee breaks, etc.)
- Coordinating the allocation of time blocks for each workshop
- Coordinating the distribution of the workshop proceedings (i.e., online via links from the main conference website).
- Collect the workshop dues covering the costs of space, breaks and distributed documents.
- The CP-AI-OR 2015 Publicity Chair will take care of CFP distributions and publicity of the conference.
****************************************
Workshop Attendance Cost
The cost of attending the workshops will be included in the cost of the conference. A separate (lower) cost will be charged should an individual choose to attend only the workshop and the masters class which is associated with the conference.
****************************************
Submission process
All proposals should be sent electronically to the Program Chair (Laurent D. Michel).
CP-AI-OR 2015 Program Chair
Laurent D. Michel
ldm@engr.uconn.edu
****************************************
**********************************************************
*
* 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 Workshop Proposals for CP-AI-OR 2015 - One-page Proposals Due Friday, January 16, 2015.
The Twelfth International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) techniques in Constraint Programming (CPAIOR 2015)
http://cpaior2015.uconn.edu/
May 18 - May 22, 2015
Barcelona, Spain
The CP-AI-OR 2015 Program Chair invites proposals for workshops which will take place on May 18, 2015.
The aim of the conference is to bring together interested researchers from Constraint Programming (CP), Artificial Intelligence (AI), and Operations Research (OR) to present new techniques or applications in combinatorial optimization and to provide an opportunity for researchers in one area to learn about techniques in the others. A main objective of this conference series is also to give these researchers the opportunity to show how the integration of techniques from different fields can lead to interesting results on large and complex problems. Workshops on topics dedicated to combining and integrating approaches from more than one of the areas are especially solicited.
All workshops will take place on May 18, 2015 at the site of the main conference. Workshops can follow a half-day or a full-day format. The details of the organization of each workshop are left to its organizers.
Workshop proposals are due Friday, January 16, 2015 and should be submitted via email to cpaior2015@gmail.com.
****************************************
Proposals Details
Each workshop proposal should be one-page in length and include the following information:
- Title and abstract giving the goals and scope of the workshop
- Description of the target audience
- List of tentative speakers and / or attendees (if available)
- History of the workshop if this is not the first instance
- Relevant experience of the organizing committee
- Tentative organizing committee members (at least 2 to 3 members)
- Contact information for the organizer.
****************************************
Responsibilities of the workshop organizers
The workshop organizers are responsible for:
- Creating and distributing a call-for-participation and any other relevant advertising. The calls should make it clear that participants will have to present the topics and must attend the Workshop. The call should clearly describe the review and selection process. Finally, the calls must be framed to encourage as broad a participation as possible.
- Creating and publishing (in a timely manner) a website with all the relevant information pertaining to the workshop which will be linked to from the main conference website.
- Providing an extended abstract for the conference program.
- Reviewing and selecting presentation submissions.
- Scheduling the presentations within the workshop
It should be noted that the conference organization does not budget for free registration, accommodation or travel expenses for the workshop organizers or their invited speakers. The workshop organizers should therefore secure any source of funding / sponsorship deemed necessary for their invited speakers.
****************************************
Responsibilities of the CP-AI-OR 2015 Organizing Committee
The conference organization is responsible for:
- Providing publicity for the workshop program as a whole
- Providing logistics at the conference venue (meeting room, coffee breaks, etc.)
- Coordinating the allocation of time blocks for each workshop
- Coordinating the distribution of the workshop proceedings (i.e., online via links from the main conference website).
- Collect the workshop dues covering the costs of space, breaks and distributed documents.
- The CP-AI-OR 2015 Publicity Chair will take care of CFP distributions and publicity of the conference.
****************************************
Workshop Attendance Cost
The cost of attending the workshops will be included in the cost of the conference. A separate (lower) cost will be charged should an individual choose to attend only the workshop and the masters class which is associated with the conference.
****************************************
Submission process
All proposals should be sent electronically to the Program Chair (Laurent D. Michel).
CP-AI-OR 2015 Program Chair
Laurent D. Michel
ldm@engr.uconn.edu
****************************************
**********************************************************
*
* 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] Special issue of ITOR dedicated to Variable Neighborhood Search Variants - Recent Applications
Call for Papers: special issue of ITOR on Variable Neighborhood Search
Variants - Recent Applications
(URL: http://dx.doi.org/10.1111/itor.12141)
Variants - Recent Applications
(URL: http://dx.doi.org/10.1111/itor.12141)
Guest Editors:
Angelo Sifaleras, University of Macedonia, Greece
Abraham Duarte, Universidad Rey Juan Carlos, Spain
Nenad Mladenovic, University of Valenciennes, France
Kenneth Sorensen, University of Antwerp, Belgium
The Variable Neighborhood Search (VNS) metaheuristic is based on
systematic changes in the neighborhood structure within a search, and has
been successfully applied for solving various combinatorial, global
optimization problems, and related tasks. This Call for Papers addresses
the recently growing interest of the research community working on the VNS
methodology.
The aim of this special issue of the International Transactions in
Operational Research (ITOR) is to gather not only recent algorithmic,
theoretical, and methodological developments in the field of Variable
Neighborhood Search, but also to publish surveys and recent applications
in this area. This special issue is also linked to the 3rd International
Conference dedicated to Variable Neighborhood Search (VNS'14), which was
held in Djerba, Tunisia, October 8-11, 2014.
The deadline for submission is February 28, 2015. Although we strongly
encourage authors who attended VNS'14 conference to submit their
manuscripts, this Call for Papers is also open to the entire community of
academics and practitioners. Contributions solicited cover a variety of
topics, including but not limited to:
- Supply chain optimization;
- Job shop scheduling problems;
- Multiobjective VNS;
- VNS hybrids; and
- Real world problems and innovative applications of VNS.
Each paper will be peer-reviewed according to the editorial policy of ITOR
(http://www3.interscience.wiley.com/journal/118505725/home), published by
the International Federation of Operational Research Societies - IFORS.
Papers should be original, unpublished, and not currently under
consideration for publication elsewhere. They should be prepared according
to the instructions to authors that can be found in the journal homepage.
Authors should upload their contributions using the submission site
http://mc.manuscriptcentral.com/itor, indicating in their cover letter
that the paper is intended for this special issue. Other inquiries should
be sent directly to any of the Guest Editors in charge of this issue:
Angelo Sifaleras (sifalera@uom.gr), Abraham Duarte
(abraham.duarte@urjc.es), Nenad Mladenovic
(nenad.mladenovic@univ-valenciennes.fr), and Kenneth Sorensen
(kenneth.sorensen@uantwerpen.be).
**********************************************************
*
* 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, December 28, 2014
[DMANET] CALL FOR PARTICIPATION: 2nd German Day on Computational Game
==============================================
CALL FOR PARTICIPATION
2nd German Day on Computational Game Theory
February 11th, 2015, Department of Mathematics, TU Berlin
URL: www.tu-berlin.de/?155119
==============================================
The 2nd German Day on Computational Game Theory will take place on
Wednesday, February 11th, 2015, at the Department of Mathematics, TU
Berlin. The event will be preceded by a reception and an open problems
session in the afternoon of Tuesday 10th.
We want to bring together researchers who are interested in algorithmic or
computational aspects of game theory, social choice, and related areas.
The aim of this one-and-half-day-event is to provide an opportunity to
foster collaboration, present research and exchange ideas at an informal
and relaxed level.
The program will start about 10am, consist of two invited talks and about
10 contributed presentations of 15-20min. If you want to give a talk,
please send an email with title and abstract to klimm@math.tu-berlin.de no
later than January 28th, 2015.
We will be organizing a dinner for all participants after the end of the
workshop.
Participation in the workshop is free of charge and lunch and coffee will
be provided. For organizational purposes, please send an email to
klimm@math.tu-berlin.de by January 28th, 2015 if you plan to attend.
Please indicate in your registration email if you are interested in
joining the dinner.
Best regards,
Max Klimm
--
Max Klimm
Junior Research Group Leader
TU Berlin
Department of Mathematics
Office MA-502
Strasse des 17. Juni 136
10623 Berlin, Germany
phone: +49 (0)30 314-28043
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
CALL FOR PARTICIPATION
2nd German Day on Computational Game Theory
February 11th, 2015, Department of Mathematics, TU Berlin
URL: www.tu-berlin.de/?155119
==============================================
The 2nd German Day on Computational Game Theory will take place on
Wednesday, February 11th, 2015, at the Department of Mathematics, TU
Berlin. The event will be preceded by a reception and an open problems
session in the afternoon of Tuesday 10th.
We want to bring together researchers who are interested in algorithmic or
computational aspects of game theory, social choice, and related areas.
The aim of this one-and-half-day-event is to provide an opportunity to
foster collaboration, present research and exchange ideas at an informal
and relaxed level.
The program will start about 10am, consist of two invited talks and about
10 contributed presentations of 15-20min. If you want to give a talk,
please send an email with title and abstract to klimm@math.tu-berlin.de no
later than January 28th, 2015.
We will be organizing a dinner for all participants after the end of the
workshop.
Participation in the workshop is free of charge and lunch and coffee will
be provided. For organizational purposes, please send an email to
klimm@math.tu-berlin.de by January 28th, 2015 if you plan to attend.
Please indicate in your registration email if you are interested in
joining the dinner.
Best regards,
Max Klimm
--
Max Klimm
Junior Research Group Leader
TU Berlin
Department of Mathematics
Office MA-502
Strasse des 17. Juni 136
10623 Berlin, Germany
phone: +49 (0)30 314-28043
**********************************************************
*
* 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, December 26, 2014
[DMANET] second CFP for ESI 2015
Dear colleagues,
The OR Society of Hungary is pleased to announce a EURO Summer Institute
(ESI) on Online Optimization. The ESI will take place at University of
Szeged, from 15th to 27th June in 2015, the homepage of
the event can be found at http://www.eswi.u-szeged.hu
EURO Summer and Winter Institutes (ESWI) provide an excellent forum for
PhD students and early career researchers to discuss their research at
length with experts in the field, as well as forming links with other
early stage researchers. For further details, see
http://www.euro-online.org/web/pages/458/summerwinter-institutes.
Around twenty early stage researchers from the EURO member societies will
be invited to participate at the ESWI. They must be very early career
academics (PhD students and/or those who have less than two years
research experience post PhD). They have to present the material of an
unpublished piece of work, discussing it with others and with the invited
senior experts in the field. The ESI will also present a series of
lectures
by the invited senior experts. After the ESI, the papers can be submitted
to a special issue of an OR publication (TBA).
Apart from the senior experts, no one can participate in an ESWI more than
once in their lifetime. EURO provides a substantial contribution towards
all the ESWI expenses 'on location' (room and board, social programs,
etc.) and sponsorship is being sought to meet the remaining part of these
expenses. The travel costs, however, must be borne by the participants
themselves, eventually with the support of their national OR societies.
Applicants have to submit an unpublished paper (or a 3-5 pages long report
on ongoing research work) to the Scientific Committee, along with a
curriculum vitae. The Committee will select and rank the candidates on the
basis of submitted papers, and afterwards channel this information to the
national OR societies for funding decisions.
Candidates who fulfill the eligibility rules but exceed the quota of 20
participants or coming from non EURO member society might be accepted, in
a limited number. These candidates should cover their own expenses. Fees
will be also required, but their amount will be specified later.
Interested candidates are asked to notify us in advance in order to help
us assess the likely number of participants. Please send an email to
esi15@inf.u-szeged.hu if you are planning to submit a paper.
Important dates:
31st January 2015 deadline for submission of applications
15th March 2015 selection of Candidates by the Scientific Committee and
communication to the National OR Societies
15th June- 27th June 2015 ESWI at the University of Szeged
30th September 2015 submission of final versions of papers for publication
in the special issue
Scientific Committee which is the same as the list of the planned senior
speakers
• Joan Boyar (University of Southern Denmark)
• Leah Epstein (University of Haifa, Israel)
• Sándor Fekete (TU Braunschweig, Germany)
• Gábor Galambos (University of Szeged, Hungary)
• Csanád Imreh (University of Szeged, Hungary)
• Piotr Krysta (University of Liverpool, United Kingdom)
• Jiri Sgall (Charles University Prague, Czech Republic)
• Gerhard Woeginger (TU Eindhoven, The Netherlands)
best regards
Csanád Imreh
chair of the ESI 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/
*
**********************************************************
Wednesday, December 24, 2014
[DMANET] AlCoB 2015: 2nd call for papers
****************************************************************************
******
2nd INTERNATIONAL CONFERENCE ON ALGORITHMS FOR COMPUTATIONAL BIOLOGY
AlCoB 2015
Mexico City, Mexico
August 4-6, 2015
Organized by:
Centre for Complexity Sciences (C3)
School of Sciences
Institute for Research in Applied Mathematics and Systems (IIMAS)
Graduate Program in Computing Science and Engineering
National Autonomous University of Mexico
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
http://grammars.grlmc.com/alcob2015/
****************************************************************************
******
AIMS:
AlCoB aims at promoting and displaying excellent research using string and
graph algorithms and combinatorial optimization to deal with problems in
biological sequence analysis, genome rearrangement, evolutionary trees, and
structure prediction.
The conference will address several of the current challenges in
computational biology by investigating algorithms aimed at: 1) assembling
sequence reads into a complete genome, 2) identifying gene structures in the
genome, 3) recognizing regulatory motifs, 4) aligning nucleotides and
comparing genomes, 5) reconstructing regulatory networks of genes, and 6)
inferring the evolutionary phylogeny of species.
Particular focus will be put on methodology and significant room will be
reserved to young scholars at the beginning of their career.
VENUE:
AlCoB 2015 will take place in Mexico City, the oldest capital city in the
Americas and the largest Spanish-speaking city in the world. The venue will
be the main campus of the National Autonomous University of Mexico.
SCOPE:
Topics of either theoretical or applied interest include, but are not
limited to:
Exact sequence analysis
Approximate sequence analysis
Pairwise sequence alignment
Multiple sequence alignment
Sequence assembly
Genome rearrangement
Regulatory motif finding
Phylogeny reconstruction
Phylogeny comparison
Structure prediction
Compressive genomics
Proteomics: molecular pathways, interaction networks ...
Transcriptomics: splicing variants, isoform inference and quantification,
differential analysis …
Next-generation sequencing: population genomics, metagenomics,
metatranscriptomics ...
Microbiome analysis
Systems biology
STRUCTURE:
AlCoB 2015 will consist of:
invited lectures
peer-reviewed contributions
INVITED SPEAKERS:
Julio Collado-Vides (National Autonomous University of Mexico, Cuernavaca),
>From Curation of Information to Knowledge Encoding
Gaston Gonnet (Swiss Federal Institute of Technology, Zurich),
Human-Dog-Mouse, Probably and Provable Non-trivial Evolution Close to the
Root of the Mammalian Clade
Peter D. Karp (SRI International, Menlo Park), Algorithms for Metabolic
Route Search and Determination of Reaction Atom Mappings
PROGRAMME COMMITTEE:
Stephen Altschul (National Center for Biotechnology Information, Bethesda,
USA)
Yurii Aulchenko (Russian Academy of Sciences, Novosibirsk, Russia)
Pierre Baldi (University of California, Irvine, USA)
Daniel G. Brown (University of Waterloo, Canada)
Yuehui Chen (University of Jinan, China)
Keith A. Crandall (George Washington University, Washington, USA)
Joseph Felsenstein (University of Washington, Seattle, USA)
Michael Galperin (National Center for Biotechnology Information, Bethesda,
USA)
Susumu Goto (Kyoto University, Japan)
Igor Grigoriev (DOE Joint Genome Institute, Walnut Creek, USA)
Martien Groenen (Wageningen University, The Netherlands)
Yike Guo (Imperial College, London, UK)
Javier Herrero (University College London, UK)
Karsten Hokamp (Trinity College Dublin, Ireland)
Hsuan-Cheng Huang (National Yang-Ming University, Taipei, Taiwan)
Ian Korf (University of California, Davis, USA)
Nikos Kyrpides (DOE Joint Genome Institute, Walnut Creek, USA)
Mingyao Li (University of Pennsylvania, Philadelphia, USA)
Yun Li (University of North Carolina, Chapel Hill, USA)
Jun Liu (Harvard University, Cambridge, USA)
Rodrigo López (European Bioinformatics Institute, Hinxton, UK)
Andrei N. Lupas (Max Planck Institute for Developmental Biology, Tübingen,
Germany)
B.S. Manjunath (University of California, Santa Barbara, USA)
Carlos Martín-Vide (chair, Rovira i Virgili University, Tarragona, Spain)
Tarjei Mikkelsen (Broad Institute, Cambridge, USA)
Henrik Nielsen (Technical University of Denmark, Lyngby, Denmark)
Zemin Ning (Wellcome Trust Sanger Institute, Hinxton, UK)
Christine Orengo (University College London, UK)
Modesto Orozco (Institute for Research in Biomedicine, Barcelona, Spain)
Christos A. Ouzounis (Centre for Research & Technology Hellas, Thessaloniki,
Greece)
Manuel Peitsch (Philip Morris International R&D, Neuchâtel, Switzerland)
David A. Rosenblueth (National Autonomous University of Mexico, Mexico City,
Mexico)
Julio Rozas (University of Barcelona, Spain)
Alessandro Sette (La Jolla Institute for Allergy and Immunology, USA)
Peter F. Stadler (University of Leipzig, Germany)
Guy Theraulaz (Paul Sabatier University, Toulouse, France)
Alfonso Valencia (Spanish National Cancer Research Centre, Madrid, Spain)
Kai Wang (University of Southern California, Los Angeles, USA)
Lusheng Wang (City University of Hong Kong, Hong Kong)
Zidong Wang (Brunel University, Uxbridge, UK)
Harel Weinstein (Cornell University, New York, USA)
Jennifer Wortman (Broad Institute, Cambridge, USA)
Jun Yu (Chinese Academy of Sciences, Beijing, China)
Mohammed J. Zaki (Rensselaer Polytechnic Institute, Troy, USA)
Louxin Zhang (National University of Singapore, Singapore)
Hongyu Zhao (Yale University, New Haven, USA)
ORGANIZING COMMITTEE:
Adrian Horia Dediu (Tarragona)
Francisco Hernández-Quiroz (Mexico City)
Carlos Martín-Vide (Tarragona, co-chair)
David A. Rosenblueth (Mexico City, co-chair)
Florentina Lilica Voicu (Tarragona)
SUBMISSIONS:
Authors are invited to submit non-anonymized papers in English presenting
original and unpublished research. Papers should not exceed 12 single-spaced
pages (including eventual appendices, references, proofs, etc.) and should
be prepared according to the standard format for Springer Verlag's LNCS
series (see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0).
Submissions have to be uploaded to:
https://www.easychair.org/conferences/?conf=alcob2015
PUBLICATIONS:
A volume of proceedings published by Springer in the LNCS/LNBI series will
be available by the time of the conference.
A special issue of a major journal will be later published containing
peer-reviewed substantially extended versions of some of the papers
contributed to the conference. Submissions to it will be by invitation.
REGISTRATION:
The registration form can be found at:
http://grammars.grlmc.com/alcob2015/Registration.php
DEADLINES:
Paper submission: March 2, 2015 (23:59 CET)
Notification of paper acceptance or rejection: April 10, 2015
Final version of the paper for the LNCS/LNBI proceedings: April 19, 2015
Early registration: April 19, 2015
Late registration: July 21, 2015
Submission to the journal special issue: November 6, 2015
QUESTIONS AND FURTHER INFORMATION:
florentinalilica.voicu@urv.cat
POSTAL ADDRESS:
AlCoB 2015
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain
Phone: +34 977 559 543
Fax: +34 977 558 386
ACKNOWLEDGEMENTS:
National Autonomous University of Mexico
Rovira i Virgili University
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
******
2nd INTERNATIONAL CONFERENCE ON ALGORITHMS FOR COMPUTATIONAL BIOLOGY
AlCoB 2015
Mexico City, Mexico
August 4-6, 2015
Organized by:
Centre for Complexity Sciences (C3)
School of Sciences
Institute for Research in Applied Mathematics and Systems (IIMAS)
Graduate Program in Computing Science and Engineering
National Autonomous University of Mexico
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
http://grammars.grlmc.com/alcob2015/
****************************************************************************
******
AIMS:
AlCoB aims at promoting and displaying excellent research using string and
graph algorithms and combinatorial optimization to deal with problems in
biological sequence analysis, genome rearrangement, evolutionary trees, and
structure prediction.
The conference will address several of the current challenges in
computational biology by investigating algorithms aimed at: 1) assembling
sequence reads into a complete genome, 2) identifying gene structures in the
genome, 3) recognizing regulatory motifs, 4) aligning nucleotides and
comparing genomes, 5) reconstructing regulatory networks of genes, and 6)
inferring the evolutionary phylogeny of species.
Particular focus will be put on methodology and significant room will be
reserved to young scholars at the beginning of their career.
VENUE:
AlCoB 2015 will take place in Mexico City, the oldest capital city in the
Americas and the largest Spanish-speaking city in the world. The venue will
be the main campus of the National Autonomous University of Mexico.
SCOPE:
Topics of either theoretical or applied interest include, but are not
limited to:
Exact sequence analysis
Approximate sequence analysis
Pairwise sequence alignment
Multiple sequence alignment
Sequence assembly
Genome rearrangement
Regulatory motif finding
Phylogeny reconstruction
Phylogeny comparison
Structure prediction
Compressive genomics
Proteomics: molecular pathways, interaction networks ...
Transcriptomics: splicing variants, isoform inference and quantification,
differential analysis …
Next-generation sequencing: population genomics, metagenomics,
metatranscriptomics ...
Microbiome analysis
Systems biology
STRUCTURE:
AlCoB 2015 will consist of:
invited lectures
peer-reviewed contributions
INVITED SPEAKERS:
Julio Collado-Vides (National Autonomous University of Mexico, Cuernavaca),
>From Curation of Information to Knowledge Encoding
Gaston Gonnet (Swiss Federal Institute of Technology, Zurich),
Human-Dog-Mouse, Probably and Provable Non-trivial Evolution Close to the
Root of the Mammalian Clade
Peter D. Karp (SRI International, Menlo Park), Algorithms for Metabolic
Route Search and Determination of Reaction Atom Mappings
PROGRAMME COMMITTEE:
Stephen Altschul (National Center for Biotechnology Information, Bethesda,
USA)
Yurii Aulchenko (Russian Academy of Sciences, Novosibirsk, Russia)
Pierre Baldi (University of California, Irvine, USA)
Daniel G. Brown (University of Waterloo, Canada)
Yuehui Chen (University of Jinan, China)
Keith A. Crandall (George Washington University, Washington, USA)
Joseph Felsenstein (University of Washington, Seattle, USA)
Michael Galperin (National Center for Biotechnology Information, Bethesda,
USA)
Susumu Goto (Kyoto University, Japan)
Igor Grigoriev (DOE Joint Genome Institute, Walnut Creek, USA)
Martien Groenen (Wageningen University, The Netherlands)
Yike Guo (Imperial College, London, UK)
Javier Herrero (University College London, UK)
Karsten Hokamp (Trinity College Dublin, Ireland)
Hsuan-Cheng Huang (National Yang-Ming University, Taipei, Taiwan)
Ian Korf (University of California, Davis, USA)
Nikos Kyrpides (DOE Joint Genome Institute, Walnut Creek, USA)
Mingyao Li (University of Pennsylvania, Philadelphia, USA)
Yun Li (University of North Carolina, Chapel Hill, USA)
Jun Liu (Harvard University, Cambridge, USA)
Rodrigo López (European Bioinformatics Institute, Hinxton, UK)
Andrei N. Lupas (Max Planck Institute for Developmental Biology, Tübingen,
Germany)
B.S. Manjunath (University of California, Santa Barbara, USA)
Carlos Martín-Vide (chair, Rovira i Virgili University, Tarragona, Spain)
Tarjei Mikkelsen (Broad Institute, Cambridge, USA)
Henrik Nielsen (Technical University of Denmark, Lyngby, Denmark)
Zemin Ning (Wellcome Trust Sanger Institute, Hinxton, UK)
Christine Orengo (University College London, UK)
Modesto Orozco (Institute for Research in Biomedicine, Barcelona, Spain)
Christos A. Ouzounis (Centre for Research & Technology Hellas, Thessaloniki,
Greece)
Manuel Peitsch (Philip Morris International R&D, Neuchâtel, Switzerland)
David A. Rosenblueth (National Autonomous University of Mexico, Mexico City,
Mexico)
Julio Rozas (University of Barcelona, Spain)
Alessandro Sette (La Jolla Institute for Allergy and Immunology, USA)
Peter F. Stadler (University of Leipzig, Germany)
Guy Theraulaz (Paul Sabatier University, Toulouse, France)
Alfonso Valencia (Spanish National Cancer Research Centre, Madrid, Spain)
Kai Wang (University of Southern California, Los Angeles, USA)
Lusheng Wang (City University of Hong Kong, Hong Kong)
Zidong Wang (Brunel University, Uxbridge, UK)
Harel Weinstein (Cornell University, New York, USA)
Jennifer Wortman (Broad Institute, Cambridge, USA)
Jun Yu (Chinese Academy of Sciences, Beijing, China)
Mohammed J. Zaki (Rensselaer Polytechnic Institute, Troy, USA)
Louxin Zhang (National University of Singapore, Singapore)
Hongyu Zhao (Yale University, New Haven, USA)
ORGANIZING COMMITTEE:
Adrian Horia Dediu (Tarragona)
Francisco Hernández-Quiroz (Mexico City)
Carlos Martín-Vide (Tarragona, co-chair)
David A. Rosenblueth (Mexico City, co-chair)
Florentina Lilica Voicu (Tarragona)
SUBMISSIONS:
Authors are invited to submit non-anonymized papers in English presenting
original and unpublished research. Papers should not exceed 12 single-spaced
pages (including eventual appendices, references, proofs, etc.) and should
be prepared according to the standard format for Springer Verlag's LNCS
series (see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0).
Submissions have to be uploaded to:
https://www.easychair.org/conferences/?conf=alcob2015
PUBLICATIONS:
A volume of proceedings published by Springer in the LNCS/LNBI series will
be available by the time of the conference.
A special issue of a major journal will be later published containing
peer-reviewed substantially extended versions of some of the papers
contributed to the conference. Submissions to it will be by invitation.
REGISTRATION:
The registration form can be found at:
http://grammars.grlmc.com/alcob2015/Registration.php
DEADLINES:
Paper submission: March 2, 2015 (23:59 CET)
Notification of paper acceptance or rejection: April 10, 2015
Final version of the paper for the LNCS/LNBI proceedings: April 19, 2015
Early registration: April 19, 2015
Late registration: July 21, 2015
Submission to the journal special issue: November 6, 2015
QUESTIONS AND FURTHER INFORMATION:
florentinalilica.voicu@urv.cat
POSTAL ADDRESS:
AlCoB 2015
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain
Phone: +34 977 559 543
Fax: +34 977 558 386
ACKNOWLEDGEMENTS:
National Autonomous University of Mexico
Rovira i Virgili University
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Tuesday, December 23, 2014
[DMANET] Tenure-track junior professorship (W1) for Mathematical Optimization at TU Darmstadt
We are seeking candidates for a tenure-track junior professorship (W1)
for Mathematical Optimization. Please see below for an English version.
for Mathematical Optimization. Please see below for an English version.
----------------------------------------------------------------------
An der Graduiertenschule Computational Engineering (CE) und dem
Fachbereich Mathematik der Technischen Universität Darmstadt
ist zum frühestmöglichen Zeitpunkt folgende Professur zu besetzen:
Junior-Professur (W1) für Optimierung mit Tenure-Track
Bewerberinnen/Bewerber sollen sich durch Forschungsarbeiten im Bereich
Mathematische Optimierung ausgewiesen haben. Die Besetzung soll das
fachliche Spektrum der Arbeitsgruppe Optimierung gut ergänzen. Bewerber
sollten in mindestens einem der Gebiete
- Optimierung mit partiellen Differentialgleichungen
- Diskret-kontinuierliche optimale Steuerung
- Diskrete und kombinatorische Optimierung
ausgewiesen sein. Die Bereitschaft zur Zusammenarbeit innerhalb der
Arbeitsgruppe Optimierung, mit anderen Fachgebieten des Fachbereichs und
innerhalb der Graduiertenschule wird vorausgesetzt.
Die Graduiertenschule CE wird in der zweiten Förderperiode im Rahmen der
Exzellenzinitiative des Bundes gefördert. Im Rahmen der
Graduiertenschule verfolgt die TU Darmstadt das Ziel, die Expertise im
Bereich Computational Engineering weiter zu stärken und fördert die
interdisziplinäre Zusammenarbeit in diesem Gebiet durch
Promotionsstipendien und Juniorprofessuren. Die Graduiertenschule ist in
eine exzellente Forschungsumgebung an der TU Darmstadt eingebettet,
unter anderem das Forschungszentrum Computational Engineering, mehrere
Sonderforschungsbereiche und Graduiertenkollegs, sowie den konsekutiven
Bachelor- und Masterstudiengang Computational Engineering.
Neben eixner hervorragenden wissenschaftlichen Qualifikation werden auch
besondere didaktische Fähigkeiten erwartet. Die Lehrverpflichtungen
umfassen Vorlesungen im Fachgebiet Optimierung sowie der
Graduiertenschule CE und, zu einem späteren Zeitpunkt,
Lehrveranstaltungen für Studierende anderer Fachbereiche.
Die Stelle ist mit einer Tenure-Track Option ausgestattet. Bewerberinnen
und Bewerber müssen ein Hochschulstudium erfolgreich absolviert haben
und promoviert sein. Es gelten ferner die Einstellungsvoraussetzungen
des § 64 HHG. Die Promotions- und Beschäftigungsphase vor Beginn der
Juniorprofessur soll grundsätzlich sechs Jahre nicht überschreiten. Die
Einstellung erfolgt zunächst in einem Beamten- oder
Angestelltenverhältnis auf Zeit nach BesGr. W1 HBesG. Das
Beschäftigungsverhältnis ist zunächst auf drei Jahre befristet. Nach
erfolgter Zwischenevaluation über die Bewährung als Hochschullehrer/in
kann es um weitere drei Jahre verlängert werden. Nach einer
abschließenden erfolgreichen Tenure-Evaluation ist die
Weiterbeschäftigung auf einer Dauerstelle nach BesGr. W2 HBesG vorgesehen.
Die Technische Universität Darmstadt strebt eine Erhöhung des Anteils
der Frauen am Personal an und fordert deshalb besonders Frauen auf, sich
zu bewerben. Bewerberinnen oder Bewerber mit einem Grad der Behinderung
von mindestens 50 oder diesen Gleichgestellte werden bei gleicher
Eignung bevorzugt. Bewerbungen sollten mit den üblichen Unterlagen
(Lebenslauf, Zeugnisse, Schriftenverzeichnis, Angaben über
wissenschaftliche Aktivitäten, bisherige Lehrtätigkeiten und ggf.
Lehrevaluierungen) elektronisch an bewerbung@mathematik.tu-darmstadt.de
mit Angabe der Kenn-Nummer im Betreff gesendet werden.
Kenn.-Nr. 481
Bewerbungsfrist: 31. Januar 2015
----------------------------------------------------------------------
The Graduate School of Computational Engineering (CE) and the Department
of Mathematics at the Technische Universität Darmstadt
are inviting applications for a
Junior Professorship (W1) for Optimization (Tenure-Track)
in the Department of Mathematics.
The research field of the candidates should complement the topics
represented in the research group optimization. Candidates should have
expertise in at least one of the following areas:
- Optimization with PDEs
- Discrete-continuous optimal control
- Discrete and combinatorial optimization
The ability for collaboration within the optimization group, to
contribute to interdisciplinary research projects and to cooperate with
other fields of science within the Graduate School of Computational
Engineering is required.
The Graduate School CE has been recognized as a center for top-level
research and scientific excellence by the highly competitive "Excellence
Initiative" of the German Federal and State Governments in 2007 and
2012. Within the framework of the Graduate School the TU Darmstadt
intends to further strengthen its expertise in the field of
Computational Engineering and in the area of optimization in particular.
The Graduate School is embedded into an excellent environment at TU
Darmstadt consisting of the Computational Engineering Research Center, a
variety of Research and Research Training Groups, Collaborative Research
Centers and existing BSc/MSc study programs in Computational Engineering.
The candidates will have excellent opportunities for interaction within
this stimulating, interdisciplinary environment and are expected to
develop a high quality research program. The Graduate School will
support the activities by PhD scholarships related to each position in
order to establish a Junior Research Group.
Applicants should hold an excellent PhD or equivalent qualifications in
the above or a related area. The prerequisites according to §64 HHG
(Hessisches Hochschulgesetz) apply. The doctorate and the experience as
post-doctoral researcher should not have exceeded a total of 6 years.
Besides scientific qualification, didactic skills are essential.
Successful candidates are expected to teach classes primarily in German
for all mathematical degrees and at a later stage also for engineering
and science students.
The position has a tenure-track option. It is initially assigned for
three years at W1-level. Given a positive evaluation at the end of the
initial period, the appointment can be extended by three more years.
After a successful tenure evaluation the position is converted to a
permanent W2-position.
The Technische Universität Darmstadt intends to increase the number of
female faculty members and encourages female candidates to apply. In
case of equal qualifications applicants with a degree of disability of
at least 50 or equal will be given preference.
Qualified applicants should submit a letter of application, a curriculum
vitae, research records and teaching records in electronic form to
bewerbung@mathematik.tu-darmstadt.de quoting the reference number in the
subject.
Code. No. 481
Application deadline: January 31, 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/
*
**********************************************************
Monday, December 22, 2014
[DMANET] 2 PhD positions in Linkoping
PhD students in Air Traffic and Logistics and in Traffic Systems are sought. The first position is about airspace optimization (involving computational geometry), the second is about traffic modeling (involving congestion pricing).; both positions have strong practical components.
More details and links for application may be found at
http://www.liu.se/jobba/lediga-jobb?l=en&&rmpage=job&rmjob=1146&rmlang=UK
http://www.liu.se/jobba/lediga-jobb?l=en&&rmpage=job&rmjob=1102&rmlang=UK
Please contact valentin.polishchuk@liu.se with questions.
Valentin Polishchuk
Associate professor
Senior lecturer in Air Transportation
Communications and Transport Systems
ITN, Linkoping University
Sweden
http://webstaff.itn.liu.se/~valpo40/
**********************************************************
*
* 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/
*
**********************************************************
More details and links for application may be found at
http://www.liu.se/jobba/lediga-jobb?l=en&&rmpage=job&rmjob=1146&rmlang=UK
http://www.liu.se/jobba/lediga-jobb?l=en&&rmpage=job&rmjob=1102&rmlang=UK
Please contact valentin.polishchuk@liu.se with questions.
Valentin Polishchuk
Associate professor
Senior lecturer in Air Transportation
Communications and Transport Systems
ITN, Linkoping University
Sweden
http://webstaff.itn.liu.se/~valpo40/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Postdoctoral scholar & PhD student position in Helsinki
-----------------------------------------------------------------------------------
Postdoctoral Researcher and Doctoral Candidate, Helsinki
-----------------------------------------------------------------------------------
The Department of Communications and Networking (Comnet) at the Aalto University School of Electrical Engineering is seeking to hire outstanding researchers for the User Interfaces group to two fully funded positions:
* Postdoctoral Researcher
* Doctoral Candidate
The positions will be placed in the ERC-funded project Computational User Interface Design [COMPUTED] (2015-2020). The project develops predictive models of human-computer interaction and uses them to computationally optimize user interfaces. The research topics include fundamental aspects of interface optimization - model acquisition, optimization methods, and interactive support for designers, as well as demonstrators for real design problems. More about the project:
* 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/
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. It works closely with groups in the Max Planck Institute for Informatics in Germany and HCI groups in the Helsinki metropolitan area.
REQUIREMENTS
We invite applications from outstanding individuals with a MSc (or equivalent) or Doctoral degree in Computer Science, Cognitive Science, or a field relevant to the project. An interdisciplinary perspective and experience is highly valued. The successful applicant has demonstrated excellence in one or more of the following topics:
* Optimization
* Modeling
* Interaction techniques
* Design tools
SALARY AND CONTRACT TERMS
For the Postdoctoral Researcher, the expected starting salary is around 3,400-3,800 €/month, depending on experience and qualifications, and it will increase with responsibilities and performance over time. For the Doctoral Candidate, the expected starting salary is 2,400 €/month, and it will increase with performance over time. The contract includes occupational health and social security benefits. The starting date is negotiable. The positions will be initially filled for 1 year, with a possible extension of up to 4 years.
APPLICATIONS
Apply by submitting (a) full CV, (b) cover letter describing research interests, (c) degree information, (d) course transcripts with grades and (e) names and contact information for two references. Candidates for the Postdoctoral Researcher position are expected to add also (f) three representative papers in PDF format. Send applications via email to antti.oulasvirta@aalto.fi. We start reviewing candidates on January 7, 2015, but applications will be considered until the positions are filled.
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 is consistently ranked highly 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/
MORE INFORMATION
For additional information of the positions, please contact Professor Antti Oulasvirta: antti.oulasvirta@aalto.fi
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Postdoctoral Researcher and Doctoral Candidate, Helsinki
-----------------------------------------------------------------------------------
The Department of Communications and Networking (Comnet) at the Aalto University School of Electrical Engineering is seeking to hire outstanding researchers for the User Interfaces group to two fully funded positions:
* Postdoctoral Researcher
* Doctoral Candidate
The positions will be placed in the ERC-funded project Computational User Interface Design [COMPUTED] (2015-2020). The project develops predictive models of human-computer interaction and uses them to computationally optimize user interfaces. The research topics include fundamental aspects of interface optimization - model acquisition, optimization methods, and interactive support for designers, as well as demonstrators for real design problems. More about the project:
* 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/
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. It works closely with groups in the Max Planck Institute for Informatics in Germany and HCI groups in the Helsinki metropolitan area.
REQUIREMENTS
We invite applications from outstanding individuals with a MSc (or equivalent) or Doctoral degree in Computer Science, Cognitive Science, or a field relevant to the project. An interdisciplinary perspective and experience is highly valued. The successful applicant has demonstrated excellence in one or more of the following topics:
* Optimization
* Modeling
* Interaction techniques
* Design tools
SALARY AND CONTRACT TERMS
For the Postdoctoral Researcher, the expected starting salary is around 3,400-3,800 €/month, depending on experience and qualifications, and it will increase with responsibilities and performance over time. For the Doctoral Candidate, the expected starting salary is 2,400 €/month, and it will increase with performance over time. The contract includes occupational health and social security benefits. The starting date is negotiable. The positions will be initially filled for 1 year, with a possible extension of up to 4 years.
APPLICATIONS
Apply by submitting (a) full CV, (b) cover letter describing research interests, (c) degree information, (d) course transcripts with grades and (e) names and contact information for two references. Candidates for the Postdoctoral Researcher position are expected to add also (f) three representative papers in PDF format. Send applications via email to antti.oulasvirta@aalto.fi. We start reviewing candidates on January 7, 2015, but applications will be considered until the positions are filled.
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 is consistently ranked highly 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/
MORE INFORMATION
For additional information of the positions, please contact Professor Antti Oulasvirta: antti.oulasvirta@aalto.fi
**********************************************************
*
* 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: Central European Conference on Cryptology CECC 2015
The 15th Central European Conference on Cryptology will be held in Klagenfurt,
Austria, from July 8th to July 10th, 2015.
Austria, from July 8th to July 10th, 2015.
This is the 15th edition of the Central European Conference on Cryptology and it
is organized by the Department of Mathematics and the System Security Group
(syssec) of the Department of Applied Informatics of Alpen-Adria-Universität
Klagenfurt.
The conference will feature invited lectures by
* Andrey Bogdanov - Technical University of Denmark
* Keith Martin - Royal Holloway, University of London
* Vincent Rijmen (unconfirmed) - Katholieke Universiteit Leuven, Belgium
* Eran Tromer - Tel Aviv University, Israel
Registration and abstract submission are now open:
http://conference.aau.at/event/cecc2015
**********************************************************
*
* 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, December 21, 2014
[DMANET] CFP: DIPDMWC * Jan. 28-30, 2015 * Dubai, UAE
[Apologies for cross-posting. Please forward to anybody who might be
interested]
=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*
CALL FOR PAPERS:
[DIPDMWC2015] The International Conference on Digital Information
Processing, Data Mining, and Wireless Communications
http://sdiwc.net/conferences/dipdmwc2015/
dipdmwc15@sdiwc.net
January 28-30, 2015 - Dubai, UAE
=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*
DIPDMWC2015 will be held over three days, with presentations delivered
by researchers from the international community, including presentations
from keynote speakers and state-of-the-art lectures.
TOPICS:
=*Digital Information Processing
- Adaptive Signal Processing
- Parallel Programming & Processing
- Artificial Intelligence
- Expert Systems
- Image Processing
- Information Security and Cryptography
- Modulation, Coding, and Channel Analysis
- Multimedia Signal Processing
- Bioinformatics & Biomedical Imaging
- Biomedical Signal Processing
- Natural Language Processing
- Neural Networks and Genetic Algorithms
- Computer-Aided Surgery
- Data Compression and Watermarking
- Speech Recognition, Analysis and Synthesis
- Energy Minimization in Cluster-Based Wireless Sensor Networks
- Biometric and Pattern Recognition
- Video Compression and Streaming
- Face Recognition and High-Resolution Imaging
- Object Detection, Recognition and Categorization
- Network and Cyber Security
- Data Modeling for Cloud-Based Networks
- E-Learning, E-Commerce, E-Marketing, E-Banking
=*Data Mining
- Data Mining Techniques
- Ethics of Data Mining
- Risk Management and Analysis
- Data Classification and Clustering
- Abnormally and Outlier Detection
- Feature Extraction and Data Reduction
- Multi-Task Learning
- Optimization Techniques
- Data Cleaning and Processing
- Text and Web Mining
- Data Mining for Complex Dataset
- Data Mining for Network/Cyber Security
- Data Mining for Customer Retention
- Data Mining for Climate Change and Impacts
- Data Mining for Business Intelligent
- Data Mining for Social Network Analysis
- Data Mining for Network Intrusion Detection
- Data Mining for Traffic Control
- Online Algorithms for Data Mining
- Data Mining and Cloud Computing
=*Wireless Communications
- Energy Minimization in Cluster-Based Wireless Sensor Networks
- Bioinformatics and Scientific Computing
- Coding and Modulation
- Mobile IP Networks/ Ad-hoc Networks
- Vehicular Wireless Networks
- Security and Robustness in Wireless Networks
- Wireless Sensor Networks
- Network Management
- Wi-Fi and Wi-MAX B3G/ 4G Wireless Networks
- Wireless Local Area Networks
- Bluetooth and Personal Area Networks
- Wireless System Architecture
- Mobile Management in Wireless Networks
- Mobile Database Access and Design
- IP Multimedia Sub-Systems
- Key Management Protocols
- Mobile/ Wireless Network Modeling and Simulation
- Mobile / Wireless Network Planning
- Wireless Network Standard and Protocols
- Digital Right Management and Multimedia Protection
=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*
=*IMPORTANT DATES*=
- Submission Date: The submission is open from now until Jan. 08, 2015
- Notification of Acceptance: 2-3 weeks from the submission date
- Camera Ready Submission: Open from now until Jan. 18, 2015
- Last Day for Registration: Open from now until Jan. 18, 2015
=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*
=*Invited Keynote Speaker*=
Prof. Keith A. Teague, Oklahoma State University, United State
=*Program Committees*=
* General Chair
Dr. Mohammad V. Malakooti, Islamic Azad University (IAU), Dubai
* Program Chair
Dr. Jacek Stando, Lodz University of Technology, Poland
* Program Co-Chairs
Dr. Yoshiro Imai, Kagawa University, Japan
Dr. Mohammad Salman, Mevlana University, Turkey
* Proceedings Chair
Dr. Jan Platos, VSB-Technical University of Ostrava, Czech Republic
* Publicity Chairs
Dr. Mazdak Zamani, Universiti Teknologi Malaysia, Malaysia
Dr. Faraja Igira, The Institute of Finance Management, Tanzania
* Deputy Chair and Head of Organizing Committee
Dr. Muhammad Ehsan Rana, The Asia Pacific University of Technology and
Innovation (APU), Malaysia
=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*
WE ARE SINCERELY LOOKING FORWARD TO SEE YOU IN DUBAI IN JAN. 2015
Aya Akiyama
www.sdiwc.net
=*=*=*=*=*=*=*=
**********************************************************
*
* 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/
*
**********************************************************
interested]
=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*
CALL FOR PAPERS:
[DIPDMWC2015] The International Conference on Digital Information
Processing, Data Mining, and Wireless Communications
http://sdiwc.net/conferences/dipdmwc2015/
dipdmwc15@sdiwc.net
January 28-30, 2015 - Dubai, UAE
=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*
DIPDMWC2015 will be held over three days, with presentations delivered
by researchers from the international community, including presentations
from keynote speakers and state-of-the-art lectures.
TOPICS:
=*Digital Information Processing
- Adaptive Signal Processing
- Parallel Programming & Processing
- Artificial Intelligence
- Expert Systems
- Image Processing
- Information Security and Cryptography
- Modulation, Coding, and Channel Analysis
- Multimedia Signal Processing
- Bioinformatics & Biomedical Imaging
- Biomedical Signal Processing
- Natural Language Processing
- Neural Networks and Genetic Algorithms
- Computer-Aided Surgery
- Data Compression and Watermarking
- Speech Recognition, Analysis and Synthesis
- Energy Minimization in Cluster-Based Wireless Sensor Networks
- Biometric and Pattern Recognition
- Video Compression and Streaming
- Face Recognition and High-Resolution Imaging
- Object Detection, Recognition and Categorization
- Network and Cyber Security
- Data Modeling for Cloud-Based Networks
- E-Learning, E-Commerce, E-Marketing, E-Banking
=*Data Mining
- Data Mining Techniques
- Ethics of Data Mining
- Risk Management and Analysis
- Data Classification and Clustering
- Abnormally and Outlier Detection
- Feature Extraction and Data Reduction
- Multi-Task Learning
- Optimization Techniques
- Data Cleaning and Processing
- Text and Web Mining
- Data Mining for Complex Dataset
- Data Mining for Network/Cyber Security
- Data Mining for Customer Retention
- Data Mining for Climate Change and Impacts
- Data Mining for Business Intelligent
- Data Mining for Social Network Analysis
- Data Mining for Network Intrusion Detection
- Data Mining for Traffic Control
- Online Algorithms for Data Mining
- Data Mining and Cloud Computing
=*Wireless Communications
- Energy Minimization in Cluster-Based Wireless Sensor Networks
- Bioinformatics and Scientific Computing
- Coding and Modulation
- Mobile IP Networks/ Ad-hoc Networks
- Vehicular Wireless Networks
- Security and Robustness in Wireless Networks
- Wireless Sensor Networks
- Network Management
- Wi-Fi and Wi-MAX B3G/ 4G Wireless Networks
- Wireless Local Area Networks
- Bluetooth and Personal Area Networks
- Wireless System Architecture
- Mobile Management in Wireless Networks
- Mobile Database Access and Design
- IP Multimedia Sub-Systems
- Key Management Protocols
- Mobile/ Wireless Network Modeling and Simulation
- Mobile / Wireless Network Planning
- Wireless Network Standard and Protocols
- Digital Right Management and Multimedia Protection
=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*
=*IMPORTANT DATES*=
- Submission Date: The submission is open from now until Jan. 08, 2015
- Notification of Acceptance: 2-3 weeks from the submission date
- Camera Ready Submission: Open from now until Jan. 18, 2015
- Last Day for Registration: Open from now until Jan. 18, 2015
=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*
=*Invited Keynote Speaker*=
Prof. Keith A. Teague, Oklahoma State University, United State
=*Program Committees*=
* General Chair
Dr. Mohammad V. Malakooti, Islamic Azad University (IAU), Dubai
* Program Chair
Dr. Jacek Stando, Lodz University of Technology, Poland
* Program Co-Chairs
Dr. Yoshiro Imai, Kagawa University, Japan
Dr. Mohammad Salman, Mevlana University, Turkey
* Proceedings Chair
Dr. Jan Platos, VSB-Technical University of Ostrava, Czech Republic
* Publicity Chairs
Dr. Mazdak Zamani, Universiti Teknologi Malaysia, Malaysia
Dr. Faraja Igira, The Institute of Finance Management, Tanzania
* Deputy Chair and Head of Organizing Committee
Dr. Muhammad Ehsan Rana, The Asia Pacific University of Technology and
Innovation (APU), Malaysia
=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*
WE ARE SINCERELY LOOKING FORWARD TO SEE YOU IN DUBAI IN JAN. 2015
Aya Akiyama
www.sdiwc.net
=*=*=*=*=*=*=*=
**********************************************************
*
* 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] EURO 2015 in Glasgow --- 2nd Call for Papers
EURO 2015
27th European Conference on Operational Research,
July 12-15, 2015, University of Strathclyde, Glasgow, UK
http://www.euro2015.org/
Second CALL FOR PAPERS
The next European Conference on Operational Research, EURO 2015:
Operational Research In Practice, will take place at the University of
Strathclyde's new Technology and Innovation Centre in Glasgow. It is
the place to present your work and find out about other cutting edge
ideas emerging from the Operational Research community. Glasgow is
very lively city, and we have a great social programme to look forward
to.
Researchers, academics, practitioners, and students interested in any
branch of Operational Research, mathematical modelling or economic
analysis are invited to submit abstracts or organise sessions.
The deadline for abstract submissions is March 16, 2015, but if you
are interested in organising a session then you should contact the
Programme Committee. More information is on the website, including
details of the main topical areas, the Programme and Organising
Committee members, and details of how to submit your abstract.
Submit your Abstract now: http://www.euro-online.org/conf/euro27/.
Event Deadlines
Abstracts:
Abstract Submission: OPEN
Abstract Submission Deadline: Monday, March 16, 2015
Registration:
Registration and Accommodation Booking: OPEN
Early Bird Deadline: Monday, April 20, 2015
Registration Deadline: Friday, May 8, 2015
Plenary Speakers Announced:
R. Tyrrell Rockafellar (University of Washington):
"Convex analysis, stochastic programming, and finance"
Sir Alan Wilson (University College London):
"Public policy & governance, sustainable cities"
M. Grazia Speranza (University of Brescia):
"Trends in transportation and logistics"
Further news about the programme and key speakers will be announced soon.
We look forward to welcoming you to our very exciting conference in Glasgow.
David Pisinger, Technical University of Denmark
PC chair of EURO-2015
----
Conference Secretariat
c/o MCI UK Ltd
Suite 4.1, Turnberry House
175 West George Street
Glasgow
G2 2LB
Tel: +44 (0) 141 202 2888
Twitter: @EUROonline_News
Email: euro2015@mci-group.com
Web: www.euro2015.org
**********************************************************
*
* 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/
*
**********************************************************
27th European Conference on Operational Research,
July 12-15, 2015, University of Strathclyde, Glasgow, UK
http://www.euro2015.org/
Second CALL FOR PAPERS
The next European Conference on Operational Research, EURO 2015:
Operational Research In Practice, will take place at the University of
Strathclyde's new Technology and Innovation Centre in Glasgow. It is
the place to present your work and find out about other cutting edge
ideas emerging from the Operational Research community. Glasgow is
very lively city, and we have a great social programme to look forward
to.
Researchers, academics, practitioners, and students interested in any
branch of Operational Research, mathematical modelling or economic
analysis are invited to submit abstracts or organise sessions.
The deadline for abstract submissions is March 16, 2015, but if you
are interested in organising a session then you should contact the
Programme Committee. More information is on the website, including
details of the main topical areas, the Programme and Organising
Committee members, and details of how to submit your abstract.
Submit your Abstract now: http://www.euro-online.org/conf/euro27/.
Event Deadlines
Abstracts:
Abstract Submission: OPEN
Abstract Submission Deadline: Monday, March 16, 2015
Registration:
Registration and Accommodation Booking: OPEN
Early Bird Deadline: Monday, April 20, 2015
Registration Deadline: Friday, May 8, 2015
Plenary Speakers Announced:
R. Tyrrell Rockafellar (University of Washington):
"Convex analysis, stochastic programming, and finance"
Sir Alan Wilson (University College London):
"Public policy & governance, sustainable cities"
M. Grazia Speranza (University of Brescia):
"Trends in transportation and logistics"
Further news about the programme and key speakers will be announced soon.
We look forward to welcoming you to our very exciting conference in Glasgow.
David Pisinger, Technical University of Denmark
PC chair of EURO-2015
----
Conference Secretariat
c/o MCI UK Ltd
Suite 4.1, Turnberry House
175 West George Street
Glasgow
G2 2LB
Tel: +44 (0) 141 202 2888
Twitter: @EUROonline_News
Email: euro2015@mci-group.com
Web: www.euro2015.org
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Saturday, December 20, 2014
[DMANET] CFP: FCT 2015, 20th International Symposium on Fundamentals of Computation Theory
*** Call for Papers ***
20th International Symposium on Fundamentals of Computation Theory (FCT 2015)
August 17-19, 2015, Gdansk, Poland
http://sites.google.com/site/fct2015gdansk/
Authors are invited to submit original research papers in all areas
related to the Foundations of Computer Science (algorithms, formal
methods, emerging fields of study).
Submissions should be made via the conference website, no later
than April 25, 2015 (anytime in the world). No simultaneous submission to
other conferences with published proceedings is allowed.
* About FCT *
FCT is a biennial series of conferences in the field of theoretical
computer science. It was established in 1977 for researchers interested in
all aspects of theoretical computer science, and in particular
algorithms, complexity, formal and logical methods.
The 20th edition of FCT will be held in Gdansk, a 1000-year old city on
the Baltic coast in northern Poland, with a medieval Old Town
picturesquely set on the banks of the Motlawa River.
The invited speakers will be: Marek Karpinski, Peter Widmayer, and Antonin
Kucera.
* Important dates *
Submission deadline: April 25, 2015
Notification to authors: June 4, 2015
Symposium: August 17-19, 2015
* Scope *
The program committee is soliciting original and significant research
contributions to the Fundamentals of Computation Theory, including (but
not limited to):
Algorithms:
- algorithm design and optimization
- approximation, randomized, and heuristic methods
- circuits and boolean functions
- combinatorics and analysis of algorithms
- computational algebra
- computational complexity
- computational geometry
- online algorithms
- streaming algorithms
- distributed and parallel computing
Formal methods:
- algebraic and categorical methods
- automata and formal languages
- computability and nonstandard computing models
- database theory
- foundations of concurrency and distributed systems
- logics and model checking
- models of reactive, hybrid and stochastic systems
- principles of programming languages
- program analysis and transformation
- specification, refinement and verification
- security
- type systems
Emerging fields:
- ad hoc, dynamic and evolving systems
- algorithmic game theory
- computational biology
- foundations of cloud computing and ubiquitous systems
- quantum information and quantum computing
* Submission *
Papers must be submitted electronically in PDF format via EasyChair, using
the link provided on the conference website. Submissions should consist of
the following elements:
- a cover page containing: the title of the paper, the names and
affiliations of all the authors and an abstract of at least one paragraph
detailing the main contributions of the paper,
- a self-contained exposition of the contribution of the paper of at most
11 pages length (excluding the cover page and references) in A4 format,
typeset in at least 11pt font, with standard line spacing and reasonable
page margins.
* Publication *
Conference proceedeings will be published in the Springer "Lecture Notes
in Computer Science" series. Selected papers will be invited to a special
issue of the journal "Discrete Mathematics & Theoretical
Computer Science", devoted to FCT'15. It is required that each accepted
paper be presented at the conference by one of its authors.
* Program Committee *
Per Austrin, KTH Royal Institute of Technology, Stockholm
Christel Baier, Technische Universitat Dresden
Marcin Bienkowski, University of Wroclaw
Tomas Brazdil, Masaryk University, Brno
Luis Caires, Universidade Nova de Lisboa
Thomas Colcombet, CNRS and Universite Paris Diderot
Marek Cygan, University of Warsaw
Stephane Demri, CNRS and ENS Cachan
Dariusz Dereniowski, Gdansk University of Technology
Konstantinos Georgiou, University of Waterloo
Radu Grosu, Vienna University of Technology
Rolf Klein, University of Bonn
Barbara Konig, University of Duisburg-Essen
Adrian Kosowski, Inria and Universite Paris Diderot (co-chair)
Dan Kral, University of Warwick
Leonid Libkin, University of Edinburgh
Andrzej Murawski, University of Warwick
Jelani Nelson, Harvard University
Gennaro Parlato, University of Southampton
Andrzej Pelc, Universite du Quebec en Outaouais
Guido Proietti, University of L'Aquila
Andrzej Proskurowski, University of Oregon
Stanislaw Radziszowski, Rochester Institute of Technology
Davide Sangiorgi, Inria and University of Bologna
Thomas Sauerwald, University of Cambridge
Pawel Sobocinski, University of Southampton
Andrzej Szepietowski, University of Gdansk
Wojciech Szpankowski, Purdue University
Igor Walukiewicz, CNRS and Universite de Bordeaux (co-chair)
Pawel Zylinski, University of Gdansk
*************************
**********************************************************
*
* 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/
*
**********************************************************
20th International Symposium on Fundamentals of Computation Theory (FCT 2015)
August 17-19, 2015, Gdansk, Poland
http://sites.google.com/site/fct2015gdansk/
Authors are invited to submit original research papers in all areas
related to the Foundations of Computer Science (algorithms, formal
methods, emerging fields of study).
Submissions should be made via the conference website, no later
than April 25, 2015 (anytime in the world). No simultaneous submission to
other conferences with published proceedings is allowed.
* About FCT *
FCT is a biennial series of conferences in the field of theoretical
computer science. It was established in 1977 for researchers interested in
all aspects of theoretical computer science, and in particular
algorithms, complexity, formal and logical methods.
The 20th edition of FCT will be held in Gdansk, a 1000-year old city on
the Baltic coast in northern Poland, with a medieval Old Town
picturesquely set on the banks of the Motlawa River.
The invited speakers will be: Marek Karpinski, Peter Widmayer, and Antonin
Kucera.
* Important dates *
Submission deadline: April 25, 2015
Notification to authors: June 4, 2015
Symposium: August 17-19, 2015
* Scope *
The program committee is soliciting original and significant research
contributions to the Fundamentals of Computation Theory, including (but
not limited to):
Algorithms:
- algorithm design and optimization
- approximation, randomized, and heuristic methods
- circuits and boolean functions
- combinatorics and analysis of algorithms
- computational algebra
- computational complexity
- computational geometry
- online algorithms
- streaming algorithms
- distributed and parallel computing
Formal methods:
- algebraic and categorical methods
- automata and formal languages
- computability and nonstandard computing models
- database theory
- foundations of concurrency and distributed systems
- logics and model checking
- models of reactive, hybrid and stochastic systems
- principles of programming languages
- program analysis and transformation
- specification, refinement and verification
- security
- type systems
Emerging fields:
- ad hoc, dynamic and evolving systems
- algorithmic game theory
- computational biology
- foundations of cloud computing and ubiquitous systems
- quantum information and quantum computing
* Submission *
Papers must be submitted electronically in PDF format via EasyChair, using
the link provided on the conference website. Submissions should consist of
the following elements:
- a cover page containing: the title of the paper, the names and
affiliations of all the authors and an abstract of at least one paragraph
detailing the main contributions of the paper,
- a self-contained exposition of the contribution of the paper of at most
11 pages length (excluding the cover page and references) in A4 format,
typeset in at least 11pt font, with standard line spacing and reasonable
page margins.
* Publication *
Conference proceedeings will be published in the Springer "Lecture Notes
in Computer Science" series. Selected papers will be invited to a special
issue of the journal "Discrete Mathematics & Theoretical
Computer Science", devoted to FCT'15. It is required that each accepted
paper be presented at the conference by one of its authors.
* Program Committee *
Per Austrin, KTH Royal Institute of Technology, Stockholm
Christel Baier, Technische Universitat Dresden
Marcin Bienkowski, University of Wroclaw
Tomas Brazdil, Masaryk University, Brno
Luis Caires, Universidade Nova de Lisboa
Thomas Colcombet, CNRS and Universite Paris Diderot
Marek Cygan, University of Warsaw
Stephane Demri, CNRS and ENS Cachan
Dariusz Dereniowski, Gdansk University of Technology
Konstantinos Georgiou, University of Waterloo
Radu Grosu, Vienna University of Technology
Rolf Klein, University of Bonn
Barbara Konig, University of Duisburg-Essen
Adrian Kosowski, Inria and Universite Paris Diderot (co-chair)
Dan Kral, University of Warwick
Leonid Libkin, University of Edinburgh
Andrzej Murawski, University of Warwick
Jelani Nelson, Harvard University
Gennaro Parlato, University of Southampton
Andrzej Pelc, Universite du Quebec en Outaouais
Guido Proietti, University of L'Aquila
Andrzej Proskurowski, University of Oregon
Stanislaw Radziszowski, Rochester Institute of Technology
Davide Sangiorgi, Inria and University of Bologna
Thomas Sauerwald, University of Cambridge
Pawel Sobocinski, University of Southampton
Andrzej Szepietowski, University of Gdansk
Wojciech Szpankowski, Purdue University
Igor Walukiewicz, CNRS and Universite de Bordeaux (co-chair)
Pawel Zylinski, University of Gdansk
*************************
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] PhD Studentships - Theoretical Analysis of Evolutionary Processes
PhD Studentships - Theoretical Analysis of Evolutionary Processes
Applications are invited for PhD studentships funded by the School of Computer Science, University of Nottingham. Studentships are available from October 2015 for a period of three years and include a stipend of £13,863 per year and tuition fees, and are available to students of any nationality. Applicants are expected to have a first-class Masters or Bachelors degree in Computer Science or related discipline, and must obtain support from a potential supervisor. I am happy support strong applicants interested in the following topic.
Evolutionary algorithms and other randomised search heuristics have been successfully applied to various industrial optimisation domains. However, the theoretical understanding of these methods has been limited. Recently, there has been significant progress in analysing the runtime (also called optimisation time) of randomised search heuristics using rigorous techniques from probability theory, randomised algorithms, and computational complexity. Results about the runtime give insights into how the behaviour of a randomised search heuristic depends on its parameter-settings and on the characteristics of the underlying optimisation problem.
The successful candidate(s) will contribute to this exciting research area, which lies at the interface between probability theory and theoretical computer science. The aim is to develop theory that aids in predicting and controlling the behaviour of evolutionary processes, both natural processes as well as in evolutionary algorithms.
The topic is mathematically challenging and requires an excellent degree in mathematics or computer science. In particular, the candidate should have a strong background in probability theory, discrete mathematics, and/or theoretical computer science.
The research will be carried out in the context of the EU-funded project Speed of Adaptation in Population Genetics and Evolutionary Computation (SAGE) which brings together researchers from population genetics and evolutionary computation. The studentship is locally associated with the Automated Scheduling, OptimisAtion and Planning (ASAP) research group, one of the five main Research Groups within the School of Computer Science at Nottingham.
For further information, please contact,
- Per Kristian Lehre <PerKristian.Lehre@nottingham.ac.uk>
- http://www.cs.nott.ac.uk/~pkl
and see
- http://www.jobs.ac.uk/job/AJW968/10-fully-funded-phd-studentships-in-the-school-of-computer-science/
- http://www.project-sage.eu
This message and any attachment are intended solely for the addressee
and may contain confidential information. If you have received this
message in error, please send it back to me, and immediately delete it.
Please do not use, copy or disclose the information contained in this
message or in any attachment. Any views or opinions expressed by the
author of this email do not necessarily reflect the views of the
University of Nottingham.
This message has been checked for viruses but the contents of an
attachment may still contain software viruses which could damage your
computer system, you are advised to perform your own checks. Email
communications with the University of Nottingham may be monitored as
permitted by UK legislation.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Applications are invited for PhD studentships funded by the School of Computer Science, University of Nottingham. Studentships are available from October 2015 for a period of three years and include a stipend of £13,863 per year and tuition fees, and are available to students of any nationality. Applicants are expected to have a first-class Masters or Bachelors degree in Computer Science or related discipline, and must obtain support from a potential supervisor. I am happy support strong applicants interested in the following topic.
Evolutionary algorithms and other randomised search heuristics have been successfully applied to various industrial optimisation domains. However, the theoretical understanding of these methods has been limited. Recently, there has been significant progress in analysing the runtime (also called optimisation time) of randomised search heuristics using rigorous techniques from probability theory, randomised algorithms, and computational complexity. Results about the runtime give insights into how the behaviour of a randomised search heuristic depends on its parameter-settings and on the characteristics of the underlying optimisation problem.
The successful candidate(s) will contribute to this exciting research area, which lies at the interface between probability theory and theoretical computer science. The aim is to develop theory that aids in predicting and controlling the behaviour of evolutionary processes, both natural processes as well as in evolutionary algorithms.
The topic is mathematically challenging and requires an excellent degree in mathematics or computer science. In particular, the candidate should have a strong background in probability theory, discrete mathematics, and/or theoretical computer science.
The research will be carried out in the context of the EU-funded project Speed of Adaptation in Population Genetics and Evolutionary Computation (SAGE) which brings together researchers from population genetics and evolutionary computation. The studentship is locally associated with the Automated Scheduling, OptimisAtion and Planning (ASAP) research group, one of the five main Research Groups within the School of Computer Science at Nottingham.
For further information, please contact,
- Per Kristian Lehre <PerKristian.Lehre@nottingham.ac.uk>
- http://www.cs.nott.ac.uk/~pkl
and see
- http://www.jobs.ac.uk/job/AJW968/10-fully-funded-phd-studentships-in-the-school-of-computer-science/
- http://www.project-sage.eu
This message and any attachment are intended solely for the addressee
and may contain confidential information. If you have received this
message in error, please send it back to me, and immediately delete it.
Please do not use, copy or disclose the information contained in this
message or in any attachment. Any views or opinions expressed by the
author of this email do not necessarily reflect the views of the
University of Nottingham.
This message has been checked for viruses but the contents of an
attachment may still contain software viruses which could damage your
computer system, you are advised to perform your own checks. Email
communications with the University of Nottingham may be monitored as
permitted by UK legislation.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] PhD in Search Based Optimisation of Software Testing
Visa Europe and UCL are offering a PhD in Search Based Optimisation of Software Testing
University College London is offering a fully funded student bursary in Search Based Optimisation of Software Testing to start as soon as possible. The student will undertake a UCL PhD, the focus of which will be having a direct impact on improving Visa software systems. It will be a chance for the student to work collaboratively in both academic and industrial sites, developing innovative techniques and evaluating them on real-world systems at Visa.
This impact studentship will recruit a talented and dedicated PhD student to work closely with Visa (at their Paddington site) under the supervision of Mark Harman and Earl Barr (at UCL), on the development and evaluation of advanced test optimisation techniques. Dr. Federica Sarro will also join the supervisor team, providing expertise on full prediction and predictive modelling. You will also have an industrial supervisor, Paul Baker, of Visa Europe.
The primary research question is:
"how can we best develop optimisation processes and techniques to develop effective and efficient testing of web-based systems?"
The studentship is funded 50% by UCL and 50% by Visa, demonstrating the commitment of each partner to this project. The student will also be part of the large program grant dynamic adaptive automated software engineering (DAASE), A significant investment by the engineering and physical sciences research Council of the United Kingdom in the area of search based software engineering. More details on the project are available at http://daase.cs.ucl.ac.uk/. The student to whom this studentship bursary is awarded will be situated in the CREST centre, which is part of the Software Systems, Engineering group (SSE) within the Department of Computer Science at UCL. http://crest.cs.ucl.ac.uk/about/
Applications close 5th January 2015
Interviews will take place in the week of the 2nd – 5th of February 2015
For more information and to apply: http://crest.cs.ucl.ac.uk/phd_opportunities/phdpositions/
---
Dr. Federica Sarro
Research Associate, CREST centre
Department of Computer Science
University College London
Malet Place, London, WC1E 6BT, UK
Tel: +44 (0) 2076737289
Office: 4.17 (249)
E-mail: f.sarro@ucl.ac.uk<mailto:f.sarro@ucl.ac.uk>
Web: http://www0.cs.ucl.ac.uk/staff/F.Sarro/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
University College London is offering a fully funded student bursary in Search Based Optimisation of Software Testing to start as soon as possible. The student will undertake a UCL PhD, the focus of which will be having a direct impact on improving Visa software systems. It will be a chance for the student to work collaboratively in both academic and industrial sites, developing innovative techniques and evaluating them on real-world systems at Visa.
This impact studentship will recruit a talented and dedicated PhD student to work closely with Visa (at their Paddington site) under the supervision of Mark Harman and Earl Barr (at UCL), on the development and evaluation of advanced test optimisation techniques. Dr. Federica Sarro will also join the supervisor team, providing expertise on full prediction and predictive modelling. You will also have an industrial supervisor, Paul Baker, of Visa Europe.
The primary research question is:
"how can we best develop optimisation processes and techniques to develop effective and efficient testing of web-based systems?"
The studentship is funded 50% by UCL and 50% by Visa, demonstrating the commitment of each partner to this project. The student will also be part of the large program grant dynamic adaptive automated software engineering (DAASE), A significant investment by the engineering and physical sciences research Council of the United Kingdom in the area of search based software engineering. More details on the project are available at http://daase.cs.ucl.ac.uk/. The student to whom this studentship bursary is awarded will be situated in the CREST centre, which is part of the Software Systems, Engineering group (SSE) within the Department of Computer Science at UCL. http://crest.cs.ucl.ac.uk/about/
Applications close 5th January 2015
Interviews will take place in the week of the 2nd – 5th of February 2015
For more information and to apply: http://crest.cs.ucl.ac.uk/phd_opportunities/phdpositions/
---
Dr. Federica Sarro
Research Associate, CREST centre
Department of Computer Science
University College London
Malet Place, London, WC1E 6BT, UK
Tel: +44 (0) 2076737289
Office: 4.17 (249)
E-mail: f.sarro@ucl.ac.uk<mailto:f.sarro@ucl.ac.uk>
Web: http://www0.cs.ucl.ac.uk/staff/F.Sarro/
**********************************************************
*
* 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, December 19, 2014
[DMANET] PhD position in QBF solving at Vienna University of Technology, Austria
There is an opening for a funded PhD position in Quantified Boolean Formula (QBF) solving at the Vienna University of Technology, Vienna, Austria.
The PhD student will join Stefan Szeider's research group to develop and implement new methods for leveraging variable independence in QBF solvers, as part of a new research project funded by the Austrian Science Fund (FWF). Applicants are expected to have solid programming skills and a strong interest in theory. A background in QBF or SAT solving is of advantage.
The position is for a duration of three years (the expected duration for completing the PhD). The successful applicant is expected to start in 2015. The salary is according to standard FWF contracts for PhD candidates (approx. EUR 27,500 gross, p.a.), which allows for a convenient living in Vienna close to the city center.
The application should include the candidate's CV, an abstract of their diploma/masters thesis, a short motivation letter, and two letters of recommendation (all five items in a single pdf file). The application should also mention possible starting dates and should be sent to qbf@kr.tuwien.ac.at by February 15, 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 PhD student will join Stefan Szeider's research group to develop and implement new methods for leveraging variable independence in QBF solvers, as part of a new research project funded by the Austrian Science Fund (FWF). Applicants are expected to have solid programming skills and a strong interest in theory. A background in QBF or SAT solving is of advantage.
The position is for a duration of three years (the expected duration for completing the PhD). The successful applicant is expected to start in 2015. The salary is according to standard FWF contracts for PhD candidates (approx. EUR 27,500 gross, p.a.), which allows for a convenient living in Vienna close to the city center.
The application should include the candidate's CV, an abstract of their diploma/masters thesis, a short motivation letter, and two letters of recommendation (all five items in a single pdf file). The application should also mention possible starting dates and should be sent to qbf@kr.tuwien.ac.at by February 15, 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/
*
**********************************************************
Thursday, December 18, 2014
[DMANET] Call for Papers WG'2015
** (apologies for duplicates) **
************************************************************************
WG 2015 CALL FOR PAPERS
41st International Workshop on Graph-Theoretic Concepts in Computer Science
June 17 - 19, 2015, Garching near Munich, Germany
Submission Deadline: Feb 28, 2015 (23:59:59 GMT/UTC)
http://www14.in.tum.de/WG2015
************************************************************************
The WG 2015 conference is the 41st edition of the WG series. It will take
place on the Garching campus of Technische Universität München (about
15km north of the city of Munich). The
conference will be from Wednesday, the 17th, to Friday, the 19th of June
2015,
with participants expected to arrive in Garching/Munich on the 16th of June.
AIMS AND SCOPE
***************
WG conferences aim to connect theory and applications by demonstrating how
graph-theoretic concepts can be applied in various areas of computer
science.
The goal is to present recent results and to identify and explore directions
for future research. Submitted papers should describe original results in
any
aspects of graph theory related to computer science, including but not
restricted to:
- design and analysis of sequential, parallel, randomized, parameterized and
distributed graph and network algorithms,
- structural graph theory with algorithmic or complexity applications,
- computational complexity of graph and network problems,
- graph grammars, graph rewriting systems and graph modeling,
- graph drawing and layouts,
- computational geometry,
- random graphs and models of the web and scale-free networks, and
- support of these concepts by suitable implementations and applications.
SUBMISSIONS AND PROCEEDINGS
***************
Contributors are invited to submit an extended abstract of at most 12 pages
Springer LNCS format including title, abstract and references. Proofs
omitted
due to space restrictions must be placed in an appendix, to be read by
program
committee members at their discretion. Simultaneous submission of papers to
any other conference with proceedings published or made publicly available,
or
submitting papers previously accepted for journal publication is not
allowed.
Authors are encouraged to post full versions of their submissions in a
freely
accessible repository such as the arXiv or ECCC.
Invited papers and accepted contributions will be published in the
conference
proceedings in the Lecture Notes in Computer Science (LNCS) series of
Springer-Verlag.
WG 2015 offers an award for the best paper written by students only. Three
papers selected by the PC will be invited to contribute to a special section
in Algorithmica.
IMPORTANT DATES
***************
Submission of papers: February 28, 2015 via EasyChair:
https://www.easychair.org/conferences/?conf=wg2015
Acceptance notification: April 28, 2015
Conference: June 17-19, 2015
INVITED SPEAKERS
***************
- Rolf Niedermeier (TU Berlin)
- Daniel Paulusma (U Durham)
- Shmuel Zaks (Technion, Haifa)
PROGRAM COMMITTEE
*****************
Hajo Broersma (University of Twente, The Netherlands)
L. Sunil Chandran (IIS, Bangalore, India)
Jianer Chen (Texas A\&M University, College Station, USA)
Victor Chepoi (Université de la Mediterranée, Marseille, France)
Pinar Heggerness (University of Bergen, Bergen, Norway)
Juraj Hromkovic (ETH, Zurich, Switzerland)
Klaus Jansen (Universität zu Kiel, Kiel, Germany)
Michael Kaufmann (Universität Tübingen, Tübingen, Germany)
Jan Kratochvil (Charles University, Prague, Czech Republic)
Dieter Kratsch (Université de Metz, Metz, France)
Van Bang Le (Universität Rostock, Rostock, Germanu)
Ernst W. Mayr (TU München, München, Germany)
Ross McConnell (Colorado State University, Fort Collins, USA)
Bojan Mohar (Simon Fraser University, Burnay, Canada)
Haiko Müller (University of Leeds, Leeds, UK)
Christophe Paul (LIRMM, Montpellier, France)
Dieter Rautenbach (Universität Ulm, Ulm, Germany)
Dimitrios Thilikos (LIRMM, Montpellier, France)
Oren Weimann (University of Haifa, Haifa, Israel)
ORGANIZING COMMITTEE
*******************
Ernst W. Mayr (chair)
Christine Lissner
Ernst Bayer
CONTACT INFORMATION
*******************
http://www14.in.tum.de/WG2015 (for general information)
wg2015@easychair.org (for information regarding paper submission)
_______________________________________________________________________
Prof. Ernst W. Mayr Tel.: +49-89-289-17704
Lehrstuhl für Effiziente Algorithmen Sekr.: +49-89-289-17706
Fakultät für Informatik, I14 Fax: +49-89-289-17707
TU München E-Mail: mayr@in.tum.de
Boltzmannstraße 3
85748 Garching Raum: MI 03.09.052
Germany URL: http://www.in.tum.de/~mayr/
_______________________________________________________________________
**********************************************************
*
* 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/
*
**********************************************************
************************************************************************
WG 2015 CALL FOR PAPERS
41st International Workshop on Graph-Theoretic Concepts in Computer Science
June 17 - 19, 2015, Garching near Munich, Germany
Submission Deadline: Feb 28, 2015 (23:59:59 GMT/UTC)
http://www14.in.tum.de/WG2015
************************************************************************
The WG 2015 conference is the 41st edition of the WG series. It will take
place on the Garching campus of Technische Universität München (about
15km north of the city of Munich). The
conference will be from Wednesday, the 17th, to Friday, the 19th of June
2015,
with participants expected to arrive in Garching/Munich on the 16th of June.
AIMS AND SCOPE
***************
WG conferences aim to connect theory and applications by demonstrating how
graph-theoretic concepts can be applied in various areas of computer
science.
The goal is to present recent results and to identify and explore directions
for future research. Submitted papers should describe original results in
any
aspects of graph theory related to computer science, including but not
restricted to:
- design and analysis of sequential, parallel, randomized, parameterized and
distributed graph and network algorithms,
- structural graph theory with algorithmic or complexity applications,
- computational complexity of graph and network problems,
- graph grammars, graph rewriting systems and graph modeling,
- graph drawing and layouts,
- computational geometry,
- random graphs and models of the web and scale-free networks, and
- support of these concepts by suitable implementations and applications.
SUBMISSIONS AND PROCEEDINGS
***************
Contributors are invited to submit an extended abstract of at most 12 pages
Springer LNCS format including title, abstract and references. Proofs
omitted
due to space restrictions must be placed in an appendix, to be read by
program
committee members at their discretion. Simultaneous submission of papers to
any other conference with proceedings published or made publicly available,
or
submitting papers previously accepted for journal publication is not
allowed.
Authors are encouraged to post full versions of their submissions in a
freely
accessible repository such as the arXiv or ECCC.
Invited papers and accepted contributions will be published in the
conference
proceedings in the Lecture Notes in Computer Science (LNCS) series of
Springer-Verlag.
WG 2015 offers an award for the best paper written by students only. Three
papers selected by the PC will be invited to contribute to a special section
in Algorithmica.
IMPORTANT DATES
***************
Submission of papers: February 28, 2015 via EasyChair:
https://www.easychair.org/conferences/?conf=wg2015
Acceptance notification: April 28, 2015
Conference: June 17-19, 2015
INVITED SPEAKERS
***************
- Rolf Niedermeier (TU Berlin)
- Daniel Paulusma (U Durham)
- Shmuel Zaks (Technion, Haifa)
PROGRAM COMMITTEE
*****************
Hajo Broersma (University of Twente, The Netherlands)
L. Sunil Chandran (IIS, Bangalore, India)
Jianer Chen (Texas A\&M University, College Station, USA)
Victor Chepoi (Université de la Mediterranée, Marseille, France)
Pinar Heggerness (University of Bergen, Bergen, Norway)
Juraj Hromkovic (ETH, Zurich, Switzerland)
Klaus Jansen (Universität zu Kiel, Kiel, Germany)
Michael Kaufmann (Universität Tübingen, Tübingen, Germany)
Jan Kratochvil (Charles University, Prague, Czech Republic)
Dieter Kratsch (Université de Metz, Metz, France)
Van Bang Le (Universität Rostock, Rostock, Germanu)
Ernst W. Mayr (TU München, München, Germany)
Ross McConnell (Colorado State University, Fort Collins, USA)
Bojan Mohar (Simon Fraser University, Burnay, Canada)
Haiko Müller (University of Leeds, Leeds, UK)
Christophe Paul (LIRMM, Montpellier, France)
Dieter Rautenbach (Universität Ulm, Ulm, Germany)
Dimitrios Thilikos (LIRMM, Montpellier, France)
Oren Weimann (University of Haifa, Haifa, Israel)
ORGANIZING COMMITTEE
*******************
Ernst W. Mayr (chair)
Christine Lissner
Ernst Bayer
CONTACT INFORMATION
*******************
http://www14.in.tum.de/WG2015 (for general information)
wg2015@easychair.org (for information regarding paper submission)
_______________________________________________________________________
Prof. Ernst W. Mayr Tel.: +49-89-289-17704
Lehrstuhl für Effiziente Algorithmen Sekr.: +49-89-289-17706
Fakultät für Informatik, I14 Fax: +49-89-289-17707
TU München E-Mail: mayr@in.tum.de
Boltzmannstraße 3
85748 Garching Raum: MI 03.09.052
Germany URL: http://www.in.tum.de/~mayr/
_______________________________________________________________________
**********************************************************
*
* 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] 2nd CFP Multi/Many-core computing for parallel Metaheuristics
Please accept our apologies if you receive multiple copies of this CFP.
*************************************************************************************
*Multi/Many-core computing for parallel Metaheuristics(McM'2015)
*http://www.umons.ac.be/mcm2015
*In conjunction with
*The 11th Metaheuristics International Conference (MIC'2015)
*http://www.lifl.fr/MIC2015
*7-10 June, 2015
*Agadir, Morocco
*************************************************************************************
Submission Deadline: Feb 6, 2015
Selected best papers of McM'2015 will be considered for publication in
a special issue of the Wiley's journal of Concurrency and Computation:
Practice and Experience (CC-PE).
-----------------------------------------
PURPOSE AND SCOPE
-----------------------------------------
Plenty of hard problems in a wide range of application areas,
including engineering design, telecommunications, logistics, etc. have
been modelled and tackled successfully with metaheuristics
(evolutionary algorithms, scatter or swarm search, simulated
annealing, Tabu search, etc.).
Nowadays, optimization problems become increasingly large and complex,
forcing the use of parallel computing for their efficient and
effective resolution. On the other hand, parallel computing has
recently undergone a significant evolution in terms of performance and
energy consumption with the emergence of multi-core and many-core
computing technologies (GPU, MIC, etc.). Indeed, accelerators and
coprocessors have powered many parallel and/or distributed
environements including high-performance workstations, hybrid clusters
among them the top ranked Top500 and Green500 ones, and computational
grids and clouds.
The design and implementation of parallel metaheuristics for the above
environments raise several issues related in the same time to the
characteristics of these hardware execution machines and those of the
parallel models of metaheuristics. This workshop seeks to provide an
opportunity for the researchers to present their original
contributions on the joint use of advanced (discrete or continuous,
single or multi-objective, static or dynamic, deterministic or
stochastic, hybrid) optimization methods and distributed and/or
parallel multi/many-core computing, and any related issues.
-----------------------------------------
TOPICS INCLUDE (BUT NOT LIMITED TO):
-----------------------------------------
Parallel models (island, master-worker, multi-start, etc.) for
metaheuristics revisited for multi-core and/or many-core (MMC)
environments.
Parallel mechanisms for hybridization of metaheuristics on MMC environments.
Implementation of parallel metaheuristics on MMC workstations, MMC
clusters, MMC grids/clouds, etc.
Software frameworks for the design and implementation of parallel
and/or distributed MMC metaheuristics.
Computational/theoretical studies reporting results on solving
challenging problems using MMC computing.
Performance metrics for MMC parallel and/or distributed metaheuristics.
Energy-aware optimization for/with MMC parallel and/or distributed
metaheuristics.
INSTRUCTIONS FOR PAPER SUBMISSION
Authors are invited to submit papers to the McM'2015 workshop. During
submission authors will be required to specify which track they are
submitting their paper to. Submitted papers to McM'2015 must be
formatted according to MIC 2015 guidelines and submitted
electronically through the MIC 2015 paper submission site. Full
instructions including formatting guidelines and electronic templates
(both LaTeX and Microsoft Word) are available on the MIC 2015 website.
Submission is only electronic, in PDF format, using the easychair
system.
At least one author of each accepted paper is required to attend the
workshop to present the work. Authors will be required to agree to
this requirement at the time of submission.
All papers are due electronically by the deadline reported above.
Submissions that do not meet the length or formatting requirements
will not be accepted for review. No email or fax submissions will be
accepted. Notification of receipt of an electronically submitted paper
will be emailed to the designated contact author soon after receipt.
If there are problems with the electronic submission, the program
chairs will contact the designated author by email.
If you have any questions about paper submission or the workshop,
please feel free to contact the workshop organizers.
-----------------------------------------
SPECIAL ISSUE
-----------------------------------------
In addition, a special issue of an appropriate journal (to be
announced later) is planned to be published. Participants will be
invited to submit extended versions of their work for consideration.
-----------------------------------------
IMPORTANT DATES
-----------------------------------------
Submission deadline: Feb 6, 2015
Notification of acceptance: March 20, 2015
Camera ready copy: April 10, 2015
Early registration: April 10, 2015
Conference: June 7-10, 2015
-----------------------------------------
WORKSHOP ORGANIZERS
-----------------------------------------
Nouredine Melab
Université Lille 1 / INRIA Lille - Nord Europe / CNRS LIFL
Phone: +33 3 59 57 78 86
Fax: +33 3 28 77 85 37
Email: nouredine.melab@lifl.fr
Mohand Mezmaz
University of Mons
Phone: +32 65 37 46 91
Fax: +32 65 37 46 45
Email: mohand.mezmaz@umons.ac.be
-----------------------------------------
International Program Committee (To be extended)
-----------------------------------------
Ahcène Bendjoudi, CERIST, Algeria
Didier El Baz, LAAS-CNRS, France
Bertrand Le Cun, Université de Paris-Ouest-Nanterre-La Défense, France
Andrew Lewis, Griffith University, Australia
Pierre Manneback, University of Mons, Belgium
Malika Mehdi, University of Sciences and Technology Houari Boumediene, Algeria
Nouredine Melab, Université Lille 1, France
Mohand Mezmaz, University of Mons, Belgium
Sanaz Mostagim, Universität Karlsruhe, Germany
Celso C. Ribeiro, Universidade Federal Fluminense, Brasil
Catherine Roucairol, Université de Versailles Saint-Quentin-en-Yvelines, France
Franciszek Seredynski, Polish Academy of Sciences, Poland
El-Ghazali Talbi, Université Lille 1, France
Daniel Tuyttens, University of Mons, Belgium
**********************************************************
*
* 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/
*
**********************************************************
*************************************************************************************
*Multi/Many-core computing for parallel Metaheuristics(McM'2015)
*http://www.umons.ac.be/mcm2015
*In conjunction with
*The 11th Metaheuristics International Conference (MIC'2015)
*http://www.lifl.fr/MIC2015
*7-10 June, 2015
*Agadir, Morocco
*************************************************************************************
Submission Deadline: Feb 6, 2015
Selected best papers of McM'2015 will be considered for publication in
a special issue of the Wiley's journal of Concurrency and Computation:
Practice and Experience (CC-PE).
-----------------------------------------
PURPOSE AND SCOPE
-----------------------------------------
Plenty of hard problems in a wide range of application areas,
including engineering design, telecommunications, logistics, etc. have
been modelled and tackled successfully with metaheuristics
(evolutionary algorithms, scatter or swarm search, simulated
annealing, Tabu search, etc.).
Nowadays, optimization problems become increasingly large and complex,
forcing the use of parallel computing for their efficient and
effective resolution. On the other hand, parallel computing has
recently undergone a significant evolution in terms of performance and
energy consumption with the emergence of multi-core and many-core
computing technologies (GPU, MIC, etc.). Indeed, accelerators and
coprocessors have powered many parallel and/or distributed
environements including high-performance workstations, hybrid clusters
among them the top ranked Top500 and Green500 ones, and computational
grids and clouds.
The design and implementation of parallel metaheuristics for the above
environments raise several issues related in the same time to the
characteristics of these hardware execution machines and those of the
parallel models of metaheuristics. This workshop seeks to provide an
opportunity for the researchers to present their original
contributions on the joint use of advanced (discrete or continuous,
single or multi-objective, static or dynamic, deterministic or
stochastic, hybrid) optimization methods and distributed and/or
parallel multi/many-core computing, and any related issues.
-----------------------------------------
TOPICS INCLUDE (BUT NOT LIMITED TO):
-----------------------------------------
Parallel models (island, master-worker, multi-start, etc.) for
metaheuristics revisited for multi-core and/or many-core (MMC)
environments.
Parallel mechanisms for hybridization of metaheuristics on MMC environments.
Implementation of parallel metaheuristics on MMC workstations, MMC
clusters, MMC grids/clouds, etc.
Software frameworks for the design and implementation of parallel
and/or distributed MMC metaheuristics.
Computational/theoretical studies reporting results on solving
challenging problems using MMC computing.
Performance metrics for MMC parallel and/or distributed metaheuristics.
Energy-aware optimization for/with MMC parallel and/or distributed
metaheuristics.
INSTRUCTIONS FOR PAPER SUBMISSION
Authors are invited to submit papers to the McM'2015 workshop. During
submission authors will be required to specify which track they are
submitting their paper to. Submitted papers to McM'2015 must be
formatted according to MIC 2015 guidelines and submitted
electronically through the MIC 2015 paper submission site. Full
instructions including formatting guidelines and electronic templates
(both LaTeX and Microsoft Word) are available on the MIC 2015 website.
Submission is only electronic, in PDF format, using the easychair
system.
At least one author of each accepted paper is required to attend the
workshop to present the work. Authors will be required to agree to
this requirement at the time of submission.
All papers are due electronically by the deadline reported above.
Submissions that do not meet the length or formatting requirements
will not be accepted for review. No email or fax submissions will be
accepted. Notification of receipt of an electronically submitted paper
will be emailed to the designated contact author soon after receipt.
If there are problems with the electronic submission, the program
chairs will contact the designated author by email.
If you have any questions about paper submission or the workshop,
please feel free to contact the workshop organizers.
-----------------------------------------
SPECIAL ISSUE
-----------------------------------------
In addition, a special issue of an appropriate journal (to be
announced later) is planned to be published. Participants will be
invited to submit extended versions of their work for consideration.
-----------------------------------------
IMPORTANT DATES
-----------------------------------------
Submission deadline: Feb 6, 2015
Notification of acceptance: March 20, 2015
Camera ready copy: April 10, 2015
Early registration: April 10, 2015
Conference: June 7-10, 2015
-----------------------------------------
WORKSHOP ORGANIZERS
-----------------------------------------
Nouredine Melab
Université Lille 1 / INRIA Lille - Nord Europe / CNRS LIFL
Phone: +33 3 59 57 78 86
Fax: +33 3 28 77 85 37
Email: nouredine.melab@lifl.fr
Mohand Mezmaz
University of Mons
Phone: +32 65 37 46 91
Fax: +32 65 37 46 45
Email: mohand.mezmaz@umons.ac.be
-----------------------------------------
International Program Committee (To be extended)
-----------------------------------------
Ahcène Bendjoudi, CERIST, Algeria
Didier El Baz, LAAS-CNRS, France
Bertrand Le Cun, Université de Paris-Ouest-Nanterre-La Défense, France
Andrew Lewis, Griffith University, Australia
Pierre Manneback, University of Mons, Belgium
Malika Mehdi, University of Sciences and Technology Houari Boumediene, Algeria
Nouredine Melab, Université Lille 1, France
Mohand Mezmaz, University of Mons, Belgium
Sanaz Mostagim, Universität Karlsruhe, Germany
Celso C. Ribeiro, Universidade Federal Fluminense, Brasil
Catherine Roucairol, Université de Versailles Saint-Quentin-en-Yvelines, France
Franciszek Seredynski, Polish Academy of Sciences, Poland
El-Ghazali Talbi, Université Lille 1, France
Daniel Tuyttens, University of Mons, Belgium
**********************************************************
*
* 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
