We are pleased to announce the opening of two PhD positions at Lancaster University, with the School of Computing and Communications. Lancaster University is ranked within the top 10 UK University and is with a vibrant and friendly environment.
Position 1
---------------
PhD Studentship – Dynamic Heterogeneous Information Fusion, Patterns Extraction and Classification. From Data to Knowledge
Lancaster University, School of Computing and Communications,
Stipend: Minimum of £13590/year
The studentship offers a fully funded PhD studentship, including a stipend and university fees. Additional finance is available to provide equipment, consumables and project travel costs.
The problem of interest
Applications are invited for a 3.5-year PhD studentship in the area of sensor data fusion.
The research is funded by SELEX Gallileo, UK (www.selexgalileo.com) and will be conducted in joint collaboration with the industrial sponsor. The project is part of a Centre of Excellence comprising SELEX Galileo and 5 UK universities. The aim is of this studentship is to address both theoretical and application in extracting knowledge from a large amount of heterogeneous data, e.g. optical, infrared, Synthetic Aperture Radar (SAR) images and burst illumination laser. The main focus will be based on combinatorial pattern matching, statistical data mining methods for various purposes including tracking and decision making.
Methodology
Bayesian distributed data fusion methods and probabilistic graphical models (such as Bayesian networks, tree types of models), nonparametric inference methods will be studied. One approach that will be investigated is based on hierarchical Dirichlet models, and the impact of the prior on the decision making process, nonparametric models for inference and fusion. Nonparametric methods are a class of methods that allow the data to determine the complexity of the model. This prior knowledge will afford to account for prior information in an efficient way. Data of various types will be considered, such as from the airborne sensors, and ground sensors. The reliability metrics will include (but are not limited to) accuracy, computational time and minimum communications. Performance studies will be conducted between centralised, distributed and hybrid architectures. Some of the challenges that will be considered are: aggregation (fusion) of high dimensional data, both on-line and off-line, asynchronous arrival of the data, detection of faults and abilities to cope with missing or rare data, followed by an inference. In case of faults the sensor network should be reconfigured in a way to cope with the missing data and faults. Then the information extracted from the data is meant to be provided to the Unmanned Aerial Vehicles (UAVs) or operators for achieving better situation awareness. The results from the fusion algorithms will be used for recognition and classification of stealthy objects.
Areas of expertise/ qualifications: statistical and probabilistic methods, numerical methods, digital signal processing, optimisation. Candidates with solid mathematical background are invited to apply for this position. Applicants should hold (or expect to obtain) a minimum upper-second class honours degree or equivalent in a discipline related with electrical engineering, aerospace engineering, statistical science or computer science. Willingness to study across scientific disciplines and a willingness to learn fast new areas of research will also be essential. Because this studentship is a part of a project and includes communication with partners of a large consortium, excellent communications skills are required.
How to apply: To apply please complete a PhD application form available at
(http://www.lancs.ac.uk/study/postgraduate/ ) and indicate on the form that you wish to be considered for the PhD studentship sponsored by Selex Gallileo, UK. The following documents are needed: a CV, a cover letter (including a motivation statement), a research proposal, and the contact details of two referees. Further information can be obtained from Dr Mila Mihaylova (mila.mihaylova@lancaster.ac.uk) and on Tel: 01524 510388. The PhD student will be based in Lancaster University, Infolab21 – a Centre of Excellence in ICT at the School of Computing and Communication Systems (http://www.scc.lancs.ac.uk/). This provides great opportunities for professional and personal development.
Position 2
----------------------------
PhD studentship - Analysis and Classification of Objects in Complex Environmental Systems (141)
Stipend: Minimum of £13590/year
The studentship offers a fully funded PhD studentship, including a stipend and university fees, as part of the Doctoral Training Centre Lancaster-Liverpool. Additional finance is available to provide equipment, consumables and project travel costs.
Applications are invited for a 3-year PhD studentship at Lancaster University.
This project aims to address some of the most challenging remote sensing problems of detection and analysis of environmental changes and events based on multiple sensor data. Far infrared and Synthetic Aperture Radar (SAR) imagery data will be integrated within a novel fusion framework. Different applications are envisaged to be considered, including for ground ecological systems, and interesting events detection and monitoring. The uniqueness of the project stems from the synergy of C++ software engineering, advanced image and signal processing techniques with decision making and real time systems aimed to cope with different noises and obscuration.
The project is of particular interest to the Company and will generate significant revenues as a number of existing customers already expressed their interest in the outcome of this project
Funding Notes:
Project supervision:
* Rinicom Ltd
* Lancaster University, UK
Application details
To apply for this opportunity please email graduate-applications@cgeinnovation.org with:
A completed Application Criteria document (.doc file)
2 page CV
2 page expression of interest
Reference number: 141
Informal inquiries can be sent to Dr Lyudmila Mihaylova (email: mila.mihaylova@lancaster.ac.uk).
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Saturday, June 30, 2012
[DMANET] postdoc algorithms bergen
One year research position, with a possibility of extension,
postdoctoral level, at the University of Bergen, Norway.
The successful candidate will work on "Rigorous Theory of
Preprocessing" project funded by the European Research Council (ERC)
via the Advanced Investigator Grant scheme. The research areas are
Algorithms and
Complexity, in particular, fixed parameter tractability, parameterized
complexity, kernelization.
The position is within Algorithm group
http://www.uib.no/rg/algo/
The group is rapidly growing and two new faculty (Daniel Lokshtanov
and Saket Saurabh) with a number of new PhDs and postdocs are
anticipated to join the group this fall.
Starting salary is on grade 57 (code 1109/pay framework 24.1) in the
Civil Service pay grade table which currently means NOK 448,400 gross
p.a., taxes should be at most 40%.
Preferred starting date: October-November 2011. The deadline is
August 10, 2012.
If you are interested to apply, please contact me (Fedor Fomin)
fomin@ii.uib.no for more information and instructions how to apply.
**********************************************************
*
* 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 level, at the University of Bergen, Norway.
The successful candidate will work on "Rigorous Theory of
Preprocessing" project funded by the European Research Council (ERC)
via the Advanced Investigator Grant scheme. The research areas are
Algorithms and
Complexity, in particular, fixed parameter tractability, parameterized
complexity, kernelization.
The position is within Algorithm group
http://www.uib.no/rg/algo/
The group is rapidly growing and two new faculty (Daniel Lokshtanov
and Saket Saurabh) with a number of new PhDs and postdocs are
anticipated to join the group this fall.
Starting salary is on grade 57 (code 1109/pay framework 24.1) in the
Civil Service pay grade table which currently means NOK 448,400 gross
p.a., taxes should be at most 40%.
Preferred starting date: October-November 2011. The deadline is
August 10, 2012.
If you are interested to apply, please contact me (Fedor Fomin)
fomin@ii.uib.no for more information and instructions how to apply.
**********************************************************
*
* 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 Springer CASM on Complex Networks Modeling, Simulation, Visualization & Analysis
CFP
<Apologies if you receive multiple posts>
Special Issue of Springer Complex Adaptive Systems Modeling on
"Multidisciplinary applications of Complex Networks Modeling, Simulation,
Visualization & Analysis"
<http://preview.casmodeling.com/sites/10349/pdf/H9012_DF_CASM_CFP_Global_A4.
pdf>
http://preview.casmodeling.com/sites/10349/pdf/H9012_DF_CASM_CFP_Global_A4.p
df
Kind regards,
Muaz
-
Muaz A. Niazi, PhD SMIEEE
Professor of Computer & Software Engineering,
Bahria University, Pakistan
Editor-in-Chief Springer Complex Adaptive Systems Modeling
Editor-in-Chief IGI Global IJPHIM
Email: muaz.niazi@gmail.com, niazi@alum.bu.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/
*
**********************************************************
<Apologies if you receive multiple posts>
Special Issue of Springer Complex Adaptive Systems Modeling on
"Multidisciplinary applications of Complex Networks Modeling, Simulation,
Visualization & Analysis"
<http://preview.casmodeling.com/sites/10349/pdf/H9012_DF_CASM_CFP_Global_A4.
pdf>
http://preview.casmodeling.com/sites/10349/pdf/H9012_DF_CASM_CFP_Global_A4.p
df
Kind regards,
Muaz
-
Muaz A. Niazi, PhD SMIEEE
Professor of Computer & Software Engineering,
Bahria University, Pakistan
Editor-in-Chief Springer Complex Adaptive Systems Modeling
Editor-in-Chief IGI Global IJPHIM
Email: muaz.niazi@gmail.com, niazi@alum.bu.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/
*
**********************************************************
Friday, June 29, 2012
[DMANET] 2 WEEKS LEFT - 5th Nokia Ubimedia MindTrek Award Competition - 6.000 Euros Award Sum
---------------------------------------------------------------------------------
The 6th Nokia Ubimedia MindTrek Awards Competition - NUMA2012
Submission DEADLINE 15th July on: http://www.numa.fi
Call for the best UBIMEDIA, PERVASIVE, AMBIENT MEDIA
... products, services, applications, concepts...
Check out previous years' entries on: http://www.ambientmediaassociation.org
The total AWARD SUM: 6.000?
---------------------------------------------------------------------------------
NUMA2012 seeks for novel ways to combine ubiquitous computing to media. We are
looking for disruptive artistic visions as well as clever near-to-market
solutions off the beaten tracks! This includes any range of innovative ubimedia,
pervasive, or ambient products and services. The Nokia Ubimedia MindTrek Awards
is a highly interdisciplinary competition and we invite Designers, Computer
Scientists, Artists, Economists and Engineers to take a stand on one of the
following questions with their entries:
// What is the aesthetic experience opened up by the rise of ubiquitous and ambient media?
// What constitutes the specific intelligence that drives future media environments?
// How will location- and context-aware media services change our social life?
// How will our future lives look like in the era of ubiquitous computation?
// How can society as a whole benefit from these advanced technologies?
Valid competition entries include:
// Pervasive and ubiquitous games
// Ambient installations
// Artistic works related to ubiquitous media and computation
// Business models and management strategies
// Ambient and ubiquitous media technology
// Ubiquitous and ambient media services, devices, and environments
// Context aware, sensing, and interfaces for ubiquitous computation
// Ergonomics, human-computer interaction designs, and product prototypes
// Software, hardware and middleware framework demonstrations
// Ambient television
// Any other inspiring work in the broad context of ubiquitous media
All ubiquitous, pervasive, or ambient media products, services or prototypes which have
been finalized during the previous year after 1st January 2011 are eligible to take part.
More information on: www.numa.fi
Competition Chairs
- Artur LUGMAYR, EMMi Lab, Tampere Univ. of Technology, FINLAND
- Cai MELAKOSKI, Degree Programme in Media, Tampere Univ. of Applied Sciences, FINLAND
- Ville LUOTONEN, Ubiquitous Computing Tampere Center of Expertise, Hermia Ltd., FINLAND
Honorary Chair
- Timothy MERRITT, Aarhus School of Architecture, DENMARK
Head of Jury
- Bj?rn STOCKLEBEN, Project "Cross Media", University of Applied Sciences Magdeburg-Stendal, GERMANY
---
The Nokia Ubimedia MindTrek Awards 2012 (NUMA2012) is a competition category of the MindTrek
Conference 2012. The category is organized collaboratively by MindTrek, Tampere Region Centre
of Expertise in Ubiquitous Computing, Entertainment & Media Management Lab. (EMMi Lab.)/Tampere
University of Technology, the Tampere University of Applied Sciences, Nokia Oyj and the Ambient
Media Association (AMEA). NUMA2012 is funded by Nokia Oyj and the Tampere Region Centre of
Expertise in Ubiquitous Computing.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
The 6th Nokia Ubimedia MindTrek Awards Competition - NUMA2012
Submission DEADLINE 15th July on: http://www.numa.fi
Call for the best UBIMEDIA, PERVASIVE, AMBIENT MEDIA
... products, services, applications, concepts...
Check out previous years' entries on: http://www.ambientmediaassociation.org
The total AWARD SUM: 6.000?
---------------------------------------------------------------------------------
NUMA2012 seeks for novel ways to combine ubiquitous computing to media. We are
looking for disruptive artistic visions as well as clever near-to-market
solutions off the beaten tracks! This includes any range of innovative ubimedia,
pervasive, or ambient products and services. The Nokia Ubimedia MindTrek Awards
is a highly interdisciplinary competition and we invite Designers, Computer
Scientists, Artists, Economists and Engineers to take a stand on one of the
following questions with their entries:
// What is the aesthetic experience opened up by the rise of ubiquitous and ambient media?
// What constitutes the specific intelligence that drives future media environments?
// How will location- and context-aware media services change our social life?
// How will our future lives look like in the era of ubiquitous computation?
// How can society as a whole benefit from these advanced technologies?
Valid competition entries include:
// Pervasive and ubiquitous games
// Ambient installations
// Artistic works related to ubiquitous media and computation
// Business models and management strategies
// Ambient and ubiquitous media technology
// Ubiquitous and ambient media services, devices, and environments
// Context aware, sensing, and interfaces for ubiquitous computation
// Ergonomics, human-computer interaction designs, and product prototypes
// Software, hardware and middleware framework demonstrations
// Ambient television
// Any other inspiring work in the broad context of ubiquitous media
All ubiquitous, pervasive, or ambient media products, services or prototypes which have
been finalized during the previous year after 1st January 2011 are eligible to take part.
More information on: www.numa.fi
Competition Chairs
- Artur LUGMAYR, EMMi Lab, Tampere Univ. of Technology, FINLAND
- Cai MELAKOSKI, Degree Programme in Media, Tampere Univ. of Applied Sciences, FINLAND
- Ville LUOTONEN, Ubiquitous Computing Tampere Center of Expertise, Hermia Ltd., FINLAND
Honorary Chair
- Timothy MERRITT, Aarhus School of Architecture, DENMARK
Head of Jury
- Bj?rn STOCKLEBEN, Project "Cross Media", University of Applied Sciences Magdeburg-Stendal, GERMANY
---
The Nokia Ubimedia MindTrek Awards 2012 (NUMA2012) is a competition category of the MindTrek
Conference 2012. The category is organized collaboratively by MindTrek, Tampere Region Centre
of Expertise in Ubiquitous Computing, Entertainment & Media Management Lab. (EMMi Lab.)/Tampere
University of Technology, the Tampere University of Applied Sciences, Nokia Oyj and the Ambient
Media Association (AMEA). NUMA2012 is funded by Nokia Oyj and the Tampere Region Centre of
Expertise in Ubiquitous Computing.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] 2 PhD positions in Operations Research at KULeuven, Belgium
The operations research group within the Faculty of Business and Economics of KU Leuven, Belgium
http://www.econ.kuleuven.be/research/ORSTAT/display.aspx?URL=main
has two openings for PhD students starting from September 2012.
One of the projects is in the area of combinatorial auctions, for more information see http://www.econ.kuleuven.ac.be/public/NDBAE03/vacancyauctions.htm;
A second project is in the area of sustainable transportation networks, for more information see http://www.econ.kuleuven.ac.be/public/NDBAE03/vacancylogistics.htm.
Sofie Coene
Katholieke Universiteit Leuven
Research Center ORSTAT (Operations Research and Business Statistics)
Naamsestraat 69
B-3000 Leuven
E-mail: sofie.coene@kuleuven.be
tel: +32 (0)16 326926
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
http://www.econ.kuleuven.be/research/ORSTAT/display.aspx?URL=main
has two openings for PhD students starting from September 2012.
One of the projects is in the area of combinatorial auctions, for more information see http://www.econ.kuleuven.ac.be/public/NDBAE03/vacancyauctions.htm;
A second project is in the area of sustainable transportation networks, for more information see http://www.econ.kuleuven.ac.be/public/NDBAE03/vacancylogistics.htm.
Sofie Coene
Katholieke Universiteit Leuven
Research Center ORSTAT (Operations Research and Business Statistics)
Naamsestraat 69
B-3000 Leuven
E-mail: sofie.coene@kuleuven.be
tel: +32 (0)16 326926
**********************************************************
*
* 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/
*
**********************************************************
Computing with lambda-terms: a Festschrift dedicated to Corrado Bohm
======================================================================
Computing with lambda-terms
A special issue dedicated to Corrado Bohm for his 90th birthdays
http://www.lipn.univ-paris13.fr/~guerrini/bohm90/
======================================================================
In honor of Corrado Bohm at the occasion of his 90th birthday, a
Festschrift will be published as a special issue of Mathematical
Structures in Computer Science.
The Festschrift will be presented during a special event in honor
of Corrado Bohm at ETAPS 2013, 16-24 March 2013, Rome, Italy.
SCOPE
=====
We invite submissions on all the topics covered by Corrado Bohm's
research and in particular new contributions on syntax and semantics
of lambda-calculus, logic and type systems, functional programming.
We also welcome surveys or position papers on current and future
directions of research on the above topics.
A more detailed, but not exclusive, list of topics of interest for
submissions include:
Lambda-calculus and higher-order rewriting systems: properties of
reductions, reduction strategies, combinatory logic, Bohm-out
and Bohm-trees, variants and extensions of lambda-calculus,
term and graph rewriting systems, higher-order reduction.
Semantics of lambda-calculus: Bohm-trees, models and theories of
lambda-calculus, realizability.
Logic and types: type systems, linear logic, types and logics for
resources, implicit computational complexity.
Functional programming: foundational aspects of functional
programming, Curry-Howard isomorphism, applications and
implementations of functional programming.
New and alternative approaches to computing: quantum calculi,
biologically inspired models and calculi.
Submitted papers should stay within the scope of MSCS.
SUBMISSION
==========
The results must be unpublished and not submitted for publication
elsewhere. Submissions will be refereed according to the usual high
standards of MSCS.
Submissions should not exceed 20 pages of content (excluding references
and appendices). Submissions exceeding 25 pages (including references
and appendices) will require a specific justification and the agreement
of the editors.
Further information and instructions about submission will be
available at http://www.lipn.univ-paris13.fr/~guerrini/bohm90/
PLANNED SCHEDULE
================
Title and short abstract submission: 1 september 2012
Deadline for submission: 15 september 2012 (STRICT!)
First referee report: 15 december 2012
Revised version: 15 january 2013
Notification: 1 march 2013
Final version: 1 june 2013
GUEST EDITORS
=============
Henk Barendregt (henk at cs.ru.nl)
Stefano Guerrini (guerrini at univ-paris13.fr)
Adolfo Piperno (piperno at di.uniroma1.it)
Computing with lambda-terms
A special issue dedicated to Corrado Bohm for his 90th birthdays
http://www.lipn.univ-paris13.fr/~guerrini/bohm90/
======================================================================
In honor of Corrado Bohm at the occasion of his 90th birthday, a
Festschrift will be published as a special issue of Mathematical
Structures in Computer Science.
The Festschrift will be presented during a special event in honor
of Corrado Bohm at ETAPS 2013, 16-24 March 2013, Rome, Italy.
SCOPE
=====
We invite submissions on all the topics covered by Corrado Bohm's
research and in particular new contributions on syntax and semantics
of lambda-calculus, logic and type systems, functional programming.
We also welcome surveys or position papers on current and future
directions of research on the above topics.
A more detailed, but not exclusive, list of topics of interest for
submissions include:
Lambda-calculus and higher-order rewriting systems: properties of
reductions, reduction strategies, combinatory logic, Bohm-out
and Bohm-trees, variants and extensions of lambda-calculus,
term and graph rewriting systems, higher-order reduction.
Semantics of lambda-calculus: Bohm-trees, models and theories of
lambda-calculus, realizability.
Logic and types: type systems, linear logic, types and logics for
resources, implicit computational complexity.
Functional programming: foundational aspects of functional
programming, Curry-Howard isomorphism, applications and
implementations of functional programming.
New and alternative approaches to computing: quantum calculi,
biologically inspired models and calculi.
Submitted papers should stay within the scope of MSCS.
SUBMISSION
==========
The results must be unpublished and not submitted for publication
elsewhere. Submissions will be refereed according to the usual high
standards of MSCS.
Submissions should not exceed 20 pages of content (excluding references
and appendices). Submissions exceeding 25 pages (including references
and appendices) will require a specific justification and the agreement
of the editors.
Further information and instructions about submission will be
available at http://www.lipn.univ-paris13.fr/~guerrini/bohm90/
PLANNED SCHEDULE
================
Title and short abstract submission: 1 september 2012
Deadline for submission: 15 september 2012 (STRICT!)
First referee report: 15 december 2012
Revised version: 15 january 2013
Notification: 1 march 2013
Final version: 1 june 2013
GUEST EDITORS
=============
Henk Barendregt (henk at cs.ru.nl)
Stefano Guerrini (guerrini at univ-paris13.fr)
Adolfo Piperno (piperno at di.uniroma1.it)
[DMANET] PhD-Student in Bioinformatik (PhD-Student in Bioinformatics)
An der UMIT (The Health and Life Sciences University) ist am Institut für
Bioinformatik und Translationale Forschung im Rahmen eines
ONCOTYROL-Projekts (Center for Personalized Cancer Medicine) die folgende
Stelle zu besetzen:
Bioinformatik und Translationale Forschung im Rahmen eines
ONCOTYROL-Projekts (Center for Personalized Cancer Medicine) die folgende
Stelle zu besetzen:
Doktorand/in
Die Stelle ist ab Herbst für 3 Jahre zu besetzen. Der Stelleninhaber/in
sollte folgende Voraussetzungen erfüllen:
- Master oder Diplomabschluss in Informatik, Bioinformatik, Biostatistik
oder Physik
- Ausgeprägte Kenntnisse in Datenbanken und sehr gute
Programmierkenntnisse in R/python/Java/C
Die Arbeitsgruppe forscht an Themen der Netzwerkbiologie, Biostatistik und
Biomarkeranalyse. Das Institut ist international vernetzt und hat viele
erfolgreiche
Forschungsprojekte in der Bioinformatik, Systembiologie und
Netzwerkanalyse initiiert. Für weitere Informationen siehe
http://bioinf.umit.at/
Interesse an mathematischen Modellen, Datenanalyse und Kenntnisse in der
medizinischen Dokumentation, Strahlentherapie, und Tumorbiologie sind
erwünscht.
Bewerbungen mit Anschreiben, Lebenslauf, Zeugnissen und
Forschungsinteressen (als PDF per E-Mail) bitte an:
Univ. Prof. Dr. habil. Matthias Dehmer
UMIT - The Health and Life Sciences University
Eduard Wallnoefer Zentrum 1
A-6060 Hall in Tyrol, Austria
E-Mail: matthias.dehmer@umit.at
http://www.dehmer.org
For a project funded by ONCOTYROL Center for Personalized Cancer Medicine,
we are seeking for a highly motivated PhD student. This position is
available for the duration of 3 years.
The applicant must have the following essential skills:
• Master degree in computer science, bioinformatics, biostatistics or physics
• Strong database knowledge and programming skills in R/python/Java/C
preferably in
a Linux environment.
Knowledge in medical documentation, radiotheorapy and tumor biology is
desired but not
absolutely required.
Moreover, good communication- and English skills are also necessary.
Fluency in German is
also desirable. The ideal candidate would enjoy working in a
multidisciplinary environment.
Interested applicants should e-mail a full curriculum vitae, a cover
letter expressing research
interests, and the contact information of two references to Matthias Dehmer
(matthias.dehmer@umit.at).
Contact:
Univ.-Prof. Dr. habil. Matthias Dehmer
UMIT
Institute for Bioinformatics and Translational Research
Hall in Tyrol, Austria
Tel.: 0043/(0)50/8648-3851
Fax: 0043/(0)50/8648-673851
**********************************************************
*
* 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] Conference announcment: Colloquium on Combinatorics (KolKom)
CONFERENCE ANNOUNCMENT
******************************************
* *
* Colloquium on Combinatorics *
* BERLIN *
* 16th and 17th of November 2012 *
* *
******************************************
The 31st Colloquium on Combinatorics will take place at the
Technical University of Berlin (Germany), November 16 and 17.
It is a forum that brings together young researchers and well
established scientists. The colloquium will cover all parts from
Combinatorics and Discrete Mathematics in a broad sense,
including combinatorial aspects in Algebra, Geometry and Computer Science.
There will be invited talks and parallel sessions with short
contributions of 20 minutes.
Deadline for registration: October 14, 2012.
More information is available on the webpage
http://page.math.tu-berlin.de/~felsner/KolKom12
***********************************************************************
Organizers: Prof. Dr. Stefan Felsner
Institut fuer Mathematik
Technische Universitaet Berlin
10623 Berlin
phone: +49-30-31429297
fax: +49-30-31425191
felsner@math.tu-berlin.de
Prof. Dr. Alexander Pott
Fakultaet fuer Mathematik
Otto-von-Guericke-Universitaet Magdeburg
Postfach 4120
39016 Magdeburg
phone: +49-391-6718322
fax: +49-391-6711213
alexander.pott@ovgu.de
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
******************************************
* *
* Colloquium on Combinatorics *
* BERLIN *
* 16th and 17th of November 2012 *
* *
******************************************
The 31st Colloquium on Combinatorics will take place at the
Technical University of Berlin (Germany), November 16 and 17.
It is a forum that brings together young researchers and well
established scientists. The colloquium will cover all parts from
Combinatorics and Discrete Mathematics in a broad sense,
including combinatorial aspects in Algebra, Geometry and Computer Science.
There will be invited talks and parallel sessions with short
contributions of 20 minutes.
Deadline for registration: October 14, 2012.
More information is available on the webpage
http://page.math.tu-berlin.de/~felsner/KolKom12
***********************************************************************
Organizers: Prof. Dr. Stefan Felsner
Institut fuer Mathematik
Technische Universitaet Berlin
10623 Berlin
phone: +49-30-31429297
fax: +49-30-31425191
felsner@math.tu-berlin.de
Prof. Dr. Alexander Pott
Fakultaet fuer Mathematik
Otto-von-Guericke-Universitaet Magdeburg
Postfach 4120
39016 Magdeburg
phone: +49-391-6718322
fax: +49-391-6711213
alexander.pott@ovgu.de
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Post-doc / Engineering position in algorithmic optimization
When determining the structure of a macromolecular complex, data from
different sources can be used to aid reconstruction [1] . Continuous
data, such as those collected in small-angle X-ray scattering or
electron microscopy experiments, is a challenge to treat rigorously
because of the correlations in the observed values. Recent work has
shown that these data can be treated in a statistically rigorous way
using gaussian process interpolation [2].
We have implemented such an interpolation procedure in the open-source
Integrative Modelling Platform. It is written in C++, uses the
high-level algebra library Eigen, and interfaces with python. Benchmarks
have shown that the current implementation suffers from multiple
algorithmic limitations that translate into a big computational burden
for datasets larger than a thousand points.
The applicant must have excellent skills in object-based C++ programming
and design patterns. He or she must be aware of the general caveats of
matrix computations on floating-point units and their numeric stability.
Basic linear algebra knowledge is also recommended, with a bonus for
linear and nonlinear regression. Possible modifications of the code include
•Templating of all classes to avoid numerous virtual function calls
•Efficient use of sparse matrices
•Implementing various approximation algorithms for large datasets, such
as Subset of Regressors, Subset of Datapoints or Projected Process [3]
•Parallelization of the code to multiple CPUs or GPUs
•Refactoring to make the code reusable for mathematically similar
projects of the lab, such as the Self-Organizing Map, or its bayesian
counterpart, Gaussian Process Latent Variable Model
Requests for information and applications should be addressed to Yannick
Spill (yannick@pasteur.fr) and Michael Nilges (nilges@pasteur.fr). The
project duration is at least one year, and will be funded by an ERC grant.
[1] Wolfgang Rieping, Michael Habeck, and Michael Nilges. Inferential
structure determination. /Science/, 8:303–306, 2005.
[2] Yannick Spill, Seung Joong Kim, Dina Schneidman-Duhovny, Andrej
Sali, and Michael Nilges. Bayesian treatment of continuous data for
structure determination. In preparation, 2012.
[3] Carl Edward Rasmussen and Christopher K. I. Williams. /Gaussian
Processes for Machine Learning/. The MIT Press, 2006.
**********************************************************
*
* 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/
*
**********************************************************
different sources can be used to aid reconstruction [1] . Continuous
data, such as those collected in small-angle X-ray scattering or
electron microscopy experiments, is a challenge to treat rigorously
because of the correlations in the observed values. Recent work has
shown that these data can be treated in a statistically rigorous way
using gaussian process interpolation [2].
We have implemented such an interpolation procedure in the open-source
Integrative Modelling Platform. It is written in C++, uses the
high-level algebra library Eigen, and interfaces with python. Benchmarks
have shown that the current implementation suffers from multiple
algorithmic limitations that translate into a big computational burden
for datasets larger than a thousand points.
The applicant must have excellent skills in object-based C++ programming
and design patterns. He or she must be aware of the general caveats of
matrix computations on floating-point units and their numeric stability.
Basic linear algebra knowledge is also recommended, with a bonus for
linear and nonlinear regression. Possible modifications of the code include
•Templating of all classes to avoid numerous virtual function calls
•Efficient use of sparse matrices
•Implementing various approximation algorithms for large datasets, such
as Subset of Regressors, Subset of Datapoints or Projected Process [3]
•Parallelization of the code to multiple CPUs or GPUs
•Refactoring to make the code reusable for mathematically similar
projects of the lab, such as the Self-Organizing Map, or its bayesian
counterpart, Gaussian Process Latent Variable Model
Requests for information and applications should be addressed to Yannick
Spill (yannick@pasteur.fr) and Michael Nilges (nilges@pasteur.fr). The
project duration is at least one year, and will be funded by an ERC grant.
[1] Wolfgang Rieping, Michael Habeck, and Michael Nilges. Inferential
structure determination. /Science/, 8:303–306, 2005.
[2] Yannick Spill, Seung Joong Kim, Dina Schneidman-Duhovny, Andrej
Sali, and Michael Nilges. Bayesian treatment of continuous data for
structure determination. In preparation, 2012.
[3] Carl Edward Rasmussen and Christopher K. I. Williams. /Gaussian
Processes for Machine Learning/. The MIT Press, 2006.
**********************************************************
*
* 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] Aarhus Workshop on Satisfiability Augest 20-22
The Aarhus Workshop on Satisfiability wants to bring together
researchers who are interested in different aspects of Boolean
Satisfiability. The workshop consists of two parts. In Part 1, leading
experts in the field will give a minicourse on selected topics. In Part
2, we will work in small groups on open problems. All participants are
invited to contribute one or two open problems related to
satisfiability. The goal of the workshop is to learn from each other,
start fruitful collaborations on the open problems, and enjoy the
beautiful town of Aarhus in summer.
Confirmed speakers:
Ramamohan Paturi, University of California at San Diego
Rahul Santhanam, University of Edinburgh
Important Dates:
Wednesday, August 1: Registration deadline
Friday, August 17: Deadline for submitting open problems
Monday, August 20 to Wednesday, August 22: Workshop
Please find more information on our webpage:
http://ctic.au.dk/workshops-conferences/wsat2012/
**********************************************************
*
* 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/
*
**********************************************************
researchers who are interested in different aspects of Boolean
Satisfiability. The workshop consists of two parts. In Part 1, leading
experts in the field will give a minicourse on selected topics. In Part
2, we will work in small groups on open problems. All participants are
invited to contribute one or two open problems related to
satisfiability. The goal of the workshop is to learn from each other,
start fruitful collaborations on the open problems, and enjoy the
beautiful town of Aarhus in summer.
Confirmed speakers:
Ramamohan Paturi, University of California at San Diego
Rahul Santhanam, University of Edinburgh
Important Dates:
Wednesday, August 1: Registration deadline
Friday, August 17: Deadline for submitting open problems
Monday, August 20 to Wednesday, August 22: Workshop
Please find more information on our webpage:
http://ctic.au.dk/workshops-conferences/wsat2012/
**********************************************************
*
* 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/
*
**********************************************************
ICDT 2013 CFP
--------------------------------------------------
16th International Conference on Database Theory (ICDT 2013)
Genoa, Italy, March 18-22, 2013
http://edbticdt2013.disi.unige.it
--------------------------------------------------
The series of ICDT conferences provides an international forum for the
communication of research advances on the principles of database
systems. Originally biennial, the ICDT conference has been held
annually and jointly with EDBT ("Extending Database Technology") since
2009.
--------------------------------------------------
Important Dates
--------------------------------------------------
Abstract submission deadline: August 17, 2012, 11:59pm PDT
Paper submission deadline: August 24, 2012, 11:59pm PDT
Notification deadline: November 2, 2012
Conference: March 18-22, 2013
--------------------------------------------------
Topics of Interest
--------------------------------------------------
Topics of interest for submissions include but are not limited to:
Business processes and workflows; Concurrency and recovery; Constraint
databases; Data exchange and data integration; Data mining; Data
models, semantics, and query languages; Data privacy and security;
Data provenance; Data streams; Inconsistency and uncertainty in
databases; Information extraction; Deductive databases; Distributed
and parallel databases; Logic and databases; Query processing and
optimization; Semi-structured and Web data; Spatial and temporal
databases; Transaction management; Views and data warehousing.
--------------------------------------------------
Paper Submission
--------------------------------------------------
Papers must be submitted electronically to:
https://www.easychair.org/conferences/?conf=icdt2013. Papers must be
submitted as PDF documents within 12 pages according to the ACM
guidelines, which can be found at
http://www.acm.org/sigs/publications/proceedings-templates. Templates
are available in Word, WordPerfect, and LaTeX (versions 2.09 and
2e). For the LaTeX formats, you may use either the standard style or
the SIG-alternate style. It is not permissible to change the
template's font size, margins, inter-column spacing, or line spacing,
etc. If the authors believe more details are necessary to substantiate
the main claims of the paper, they may also include a clearly marked
appendix to be read at the discretion of the committee. Papers not
conforming to these requirements may be rejected without further
consideration. The deadline for abstract submission is August 17,
2012 and the deadline for paper submission is August 24, 2012.
Submission deadlines firm; late submissions will not be considered.
Authors will be notified of acceptance or rejection by November 2,
2012. The results must be unpublished and not submitted for
publication elsewhere, including the formal proceedings of other
symposia or workshops. All authors of accepted papers will be
expected to sign copyright release forms. One author of each accepted
paper will be expected to present it at the conference. The
proceedings will appear in the ACM International Conference
Proceedings Series (pending approval).
--------------------------------------------------
Awards
--------------------------------------------------
An award will be given to the best paper. Also, an award will be given
to the best paper written by newcomers to the field of database
theory. The latter award will preferentially be given to a paper
written only by students; in that case the award will be called "Best
Student Paper Award." The program committee reserves the following
rights: not to give an award; to split an award among several papers;
and to define the notion of a newcomer. Papers authored or co-authored
by Program Committee members are not eligible for any award.
--------------------------------------------------
Invited Speakers
--------------------------------------------------
- Jan van den Bussche (Hasselt Univ.)
- Yehoshua Sagiv (Hebrew Univ. of Jerusalem)
- Luc Segoufin (Inria & ENS-Cachan)
--------------------------------------------------
Conference Officers
--------------------------------------------------
- Program Chair:
Wang-Chiew Tan (IBM Almaden and UC Santa Cruz)
- Publicity Chair:
Benny Kimelfeld (IBM Almaden)
- Program Committee:
Balder ten Cate (UC Santa Cruz)
James Cheney (University of Edinburgh)
Jan Chomicki (University at Buffalo)
Sara Cohen (The Hebrew University of Jerusalem)
Todd J. Green (UC Davis & LogicBlox)
Sudipto Guha (University of Pennsylvania)
Benny Kimelfeld (IBM Almaden)
Solmaz Kolahi (Oracle)
Kobbi Nissim (Ben-Gurion University)
Antonella Poggi (Sapienza University of Rome)
Riccardo Rosati (Sapienza University of Rome)
Cristina Sirangelo (ENS Cachan)
Nicole Schweikardt (Goethe-University Frankfurt)
Kyusheok Shim (Seoul National University)
Slawek Staworko (University of Lille)
Jianwen Su (UC Santa Barbara)
Wang-Chiew Tan (IBM Almaden & UC Santa Cruz)
Stijn Vansummeren (University Libre de Bruxelles)
Victor Vianu (UC San Diego)
Jef Wijsen (University of Mons)
16th International Conference on Database Theory (ICDT 2013)
Genoa, Italy, March 18-22, 2013
http://edbticdt2013.disi.unige.it
--------------------------------------------------
The series of ICDT conferences provides an international forum for the
communication of research advances on the principles of database
systems. Originally biennial, the ICDT conference has been held
annually and jointly with EDBT ("Extending Database Technology") since
2009.
--------------------------------------------------
Important Dates
--------------------------------------------------
Abstract submission deadline: August 17, 2012, 11:59pm PDT
Paper submission deadline: August 24, 2012, 11:59pm PDT
Notification deadline: November 2, 2012
Conference: March 18-22, 2013
--------------------------------------------------
Topics of Interest
--------------------------------------------------
Topics of interest for submissions include but are not limited to:
Business processes and workflows; Concurrency and recovery; Constraint
databases; Data exchange and data integration; Data mining; Data
models, semantics, and query languages; Data privacy and security;
Data provenance; Data streams; Inconsistency and uncertainty in
databases; Information extraction; Deductive databases; Distributed
and parallel databases; Logic and databases; Query processing and
optimization; Semi-structured and Web data; Spatial and temporal
databases; Transaction management; Views and data warehousing.
--------------------------------------------------
Paper Submission
--------------------------------------------------
Papers must be submitted electronically to:
https://www.easychair.org/conferences/?conf=icdt2013. Papers must be
submitted as PDF documents within 12 pages according to the ACM
guidelines, which can be found at
http://www.acm.org/sigs/publications/proceedings-templates. Templates
are available in Word, WordPerfect, and LaTeX (versions 2.09 and
2e). For the LaTeX formats, you may use either the standard style or
the SIG-alternate style. It is not permissible to change the
template's font size, margins, inter-column spacing, or line spacing,
etc. If the authors believe more details are necessary to substantiate
the main claims of the paper, they may also include a clearly marked
appendix to be read at the discretion of the committee. Papers not
conforming to these requirements may be rejected without further
consideration. The deadline for abstract submission is August 17,
2012 and the deadline for paper submission is August 24, 2012.
Submission deadlines firm; late submissions will not be considered.
Authors will be notified of acceptance or rejection by November 2,
2012. The results must be unpublished and not submitted for
publication elsewhere, including the formal proceedings of other
symposia or workshops. All authors of accepted papers will be
expected to sign copyright release forms. One author of each accepted
paper will be expected to present it at the conference. The
proceedings will appear in the ACM International Conference
Proceedings Series (pending approval).
--------------------------------------------------
Awards
--------------------------------------------------
An award will be given to the best paper. Also, an award will be given
to the best paper written by newcomers to the field of database
theory. The latter award will preferentially be given to a paper
written only by students; in that case the award will be called "Best
Student Paper Award." The program committee reserves the following
rights: not to give an award; to split an award among several papers;
and to define the notion of a newcomer. Papers authored or co-authored
by Program Committee members are not eligible for any award.
--------------------------------------------------
Invited Speakers
--------------------------------------------------
- Jan van den Bussche (Hasselt Univ.)
- Yehoshua Sagiv (Hebrew Univ. of Jerusalem)
- Luc Segoufin (Inria & ENS-Cachan)
--------------------------------------------------
Conference Officers
--------------------------------------------------
- Program Chair:
Wang-Chiew Tan (IBM Almaden and UC Santa Cruz)
- Publicity Chair:
Benny Kimelfeld (IBM Almaden)
- Program Committee:
Balder ten Cate (UC Santa Cruz)
James Cheney (University of Edinburgh)
Jan Chomicki (University at Buffalo)
Sara Cohen (The Hebrew University of Jerusalem)
Todd J. Green (UC Davis & LogicBlox)
Sudipto Guha (University of Pennsylvania)
Benny Kimelfeld (IBM Almaden)
Solmaz Kolahi (Oracle)
Kobbi Nissim (Ben-Gurion University)
Antonella Poggi (Sapienza University of Rome)
Riccardo Rosati (Sapienza University of Rome)
Cristina Sirangelo (ENS Cachan)
Nicole Schweikardt (Goethe-University Frankfurt)
Kyusheok Shim (Seoul National University)
Slawek Staworko (University of Lille)
Jianwen Su (UC Santa Barbara)
Wang-Chiew Tan (IBM Almaden & UC Santa Cruz)
Stijn Vansummeren (University Libre de Bruxelles)
Victor Vianu (UC San Diego)
Jef Wijsen (University of Mons)
Thursday, June 28, 2012
[DMANET] RECOMB-AB/BE - Early Registration ends July 2 - Open Problems in Algorithmic Biology / Bioinformatics Education
EARLY REGISTRATION ENDS SOON: JULY 2, 2012
RECOMB Satellite Conference on Open Problems in Algorithmic Biology
(RECOMB-AB)
August 27-29, 2012
St. Petersburg, Russia
http://bioinf.spbau.ru/ab2012
recombab2012 at gmail dot com
RECOMB Satellite Conference on Bioinformatics Education
(RECOMB-BE)
August 26, 2012
St. Petersburg, Russia
http://bioinf.spbau.ru/be2012
recombbe2012 at gmail dot com
KEY DATES:
Abstract submission deadline Expired
Request for visa voucher Monday July 2, 2012
Early registration deadline (discount rate) Monday July 2, 2012
Online registration deadline (full rate) Friday August 17, 2012
On-site registration (full rate) Available at conferences
RECOMB-BE conference August 26, 2012
RECOMB-AB conference August 27-29, 2012
OVERVIEW:
The First RECOMB Satellite Conference on Open Problems in Algorithmic
Biology (RECOMB-AB) will be held August 27-29, 2012 in St. Petersburg,
Russia. This workshop brings together leading researchers in the
mathematical, computational, and life sciences to discuss current
challenges in computational biology, with an emphasis on open
algorithmic problems. The program will consist of invited speakers,
contributed speakers, posters, and discussion panels.
The Fourth Annual RECOMB Conference on Bioinformatics Education
(RECOMB-BE) will be held in St. Petersburg, Russia, August 26, 2012.
RECOMB-BE 2012 will consist of invited presentations, oral
presentations selected from submitted educational problems, and
discussion panels, all of which focus on improving bioinformatics
education.
Saint Petersburg (formerly known as Leningrad) is Russia's second
largest city. The large historic center of Saint Petersburg, threaded
with canals dotted with baroque bridges, is a UNESCO World Heritage
site. Its Hermitage Museum, housed in the Winter Palace (formerly
called the Palace of the Russian Tsars), is one of the world's
greatest collections of art.
REGISTRATION:
Registration is now open through either conference website:
http://bioinf.spbau.ru/ab2012
http://bioinf.spbau.ru/be2012
We offer discounts for early registration through July 2;
discounts for jointly registering for both conferences;
and discounts for students. See the website for full pricing
information. If you have any questions about or difficulties
with the registration process, please contact us at
recombab2012 at gmail dot com.
The conference website also provides information about visas.
We recommend starting the visa process as soon as possible.
THEME AND SCOPE (RECOMB-AB: Open Problems in Algorithmic Biology):
RECOMB-AB aims to discuss recent advances and present open algorithmic
problems in different areas of life sciences. Today, life sciences are
in the midst of a major paradigm shift driven by computational
sciences. RECOMB-AB emphasizes that this is a two-way street: while
life sciences have greatly benefited from new computational ideas,
they also are a major source of new open problems and inspiration for
computational sciences. RECOMB-AB brings together leading researchers
in the mathematical, computational, and life sciences to discuss
interesting, challenging, and well-formulated open problems in
algorithmic biology.
Many areas of computational sciences started as an attempt to solve
applied problems and later became more theoretically-oriented. These
theoretical aspects may be very valuable even if they stray away from
the applied problems that originally motivated them. Thus, RECOMB-AB
is interested in a wide range of well-formulated open problems. Some
of them may be rather theoretical and have limited biological
application. The solutions of others might provide valuable tools for
biologists or might lead to new biological discoveries. This blend of
theoretical and applied problems is a fascinating feature of
algorithmic biology.
The discussion panels at RECOMB-AB will also address the worrisome
proliferation of ill-formulated computational problems in
bioinformatics. While some biological problems can be translated into
well-formulated computational problems, others defy all attempts to
bridge biology and computing. This may result in computational biology
papers that lack a formulation of a computational problem they are
trying to solve. While some such papers may represent valuable
biological contributions (despite lacking a well-defined computational
problem), others may represent computational "pseudoscience."
RECOMB-AB will address the difficult question of how to evaluate
computational papers that lack a computational problem formulation.
RECOMB-AB KEYNOTE SPEAKERS:
Max Alekseyev (University of South Carolina)
Vineet Bafna (University of California, San Diego)
Mikhail Gelfand (Russian Academy of Sciences and Moscow State University)
Sorin Istrail (Brown University)
Richard Karp (University of California, Berkeley)
Bernard Moret (École Polytechnique Fédérale de Lausanne)
Stephen O'Brien (Saint Petersburg University)
Pavel Pevzner (University of California, San Diego)
Marie-France Sagot (INRIA, Université Lyon 1)
Cenk Sahinalp (Simon Fraser University)
Ron Shamir (Tel Aviv University)
Glenn Tesler (University of California, San Diego)
Tandy Warnow (The University of Texas at Austin)
Michael S. Waterman (University of Southern California)
THEME AND SCOPE (RECOMB-BE: Bioinformatics Education):
The goals of RECOMB-BE 2012 are twofold: to showcase best practices of
teaching algorithmic bioinformatics and to demonstrate and discuss a
novel learning framework (ROSALIND) for students to understand
bioinformatics problems through programming within a guided feedback
environment.
While biology has been transformed into a computational science in the
last decade, the biological curriculum remains largely unchanged with
respect to computational issues. The question: "How should we teach
bioinformatics to biology students?" has become of the utmost
importance, as many universities have not only founded undergraduate
bioinformatics programs but are considering the addition of new
computational courses to the standard biology curriculum - a change
that would represent a dramatic paradigm shift in biology education.
RECOMB-BE KEYNOTE SPEAKERS:
Michael Brudno (University of Toronto)
Uri Keich (University of Sydney)
Chris Lee (University of California, Los Angeles)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] DEADLINE FOR EARLY REGISTRATION APPROACHING
===========================================
International Symposium on Combinatorial Optimization (CO 2012)
17-19 September 2012, University of Oxford, UK
http://www.sbs.oxford.edu/co2012
===========================================
DEADLINE FOR EARLY REGISTRATION APPROACHING
31 July 2012 Early registration deadline
CO 2012 is an International Symposium on Combinatorial Optimization. It is the next in a series of biennial conferences. The last few conferences were held in Malaga (2010), Warwick (2008), Porto (2006), Lancaster (2004), Paris (2002), Greenwich (2000), Brussels (1998), and London (1996). CO 2012 is hosted by the University of Oxford.
PLENARY SPEAKERS
Monique Guignard-Spielberg, University of Pennsylvania
Quadratic combinatorial optimization models: why they are needed, and a few approaches to solve them
Andrea Lodi, University of Bologna
On bilevel knapsack problems
Franz Rendl, Alpen-Adria University Klagenfurt
Matrix relaxations for partitioning and clustering problems in graphs
CONFERENCE WEBSITE
Further information can be found on the conference website:
http://www.sbs.oxford.edu/co2012
IMPORTANT DATES
31 July 2012 Early registration deadline
17 September 2012 Start of Conference
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
International Symposium on Combinatorial Optimization (CO 2012)
17-19 September 2012, University of Oxford, UK
http://www.sbs.oxford.edu/co2012
===========================================
DEADLINE FOR EARLY REGISTRATION APPROACHING
31 July 2012 Early registration deadline
CO 2012 is an International Symposium on Combinatorial Optimization. It is the next in a series of biennial conferences. The last few conferences were held in Malaga (2010), Warwick (2008), Porto (2006), Lancaster (2004), Paris (2002), Greenwich (2000), Brussels (1998), and London (1996). CO 2012 is hosted by the University of Oxford.
PLENARY SPEAKERS
Monique Guignard-Spielberg, University of Pennsylvania
Quadratic combinatorial optimization models: why they are needed, and a few approaches to solve them
Andrea Lodi, University of Bologna
On bilevel knapsack problems
Franz Rendl, Alpen-Adria University Klagenfurt
Matrix relaxations for partitioning and clustering problems in graphs
CONFERENCE WEBSITE
Further information can be found on the conference website:
http://www.sbs.oxford.edu/co2012
IMPORTANT DATES
31 July 2012 Early registration deadline
17 September 2012 Start of Conference
**********************************************************
*
* 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/
*
**********************************************************
POSTDOC position in Verification at Aix-Marseille University
Please distribute (apologies for multiple postings):
A postdoc position is available in the Modelling and Verification team
of LIF (Laboratoire d'Informatique Fondamentale de Marseille),
Aix-Marseille University (Marseille, France).
*** POSTDOC POSITION ***
A postdoc position is available in the Modelling and Verification team
of LIF (Laboratoire d'Informatique Fondamentale de Marseille),
Aix-Marseille University (Marseille, France).
The position is funded by the ANR project ECSPER.
A short description of the ANR project ECSPER can be found at:
http://www.lif.univ-mrs.fr/~preynier/ECSPER/
Candidates should hold (or be close to) a PhD in Computer Science.
A short description of the ANR project ECSPER can be found at:
http://www.lif.univ-mrs.fr/~preynier/ECSPER/
Candidates should hold (or be close to) a PhD in Computer Science.
The ideal candidate has a strong background in
algorithmic for verification and/or controller synthesis.
The candidate is expected to work in one of the following research
topics, which are actually investigated within the ECSPER project:
- robustness and implementability of distributed and/or timed systems
- robust controller synthesis for non-linear hybrid systems
- faults and perturbations in distributed computing
algorithmic for verification and/or controller synthesis.
The candidate is expected to work in one of the following research
topics, which are actually investigated within the ECSPER project:
- robustness and implementability of distributed and/or timed systems
- robust controller synthesis for non-linear hybrid systems
- faults and perturbations in distributed computing
EMPLOYMENT
The duration of the contract is one year.
The position is available immediately, or anytime before October 2012.
Applications should be sent before July 8th, 2012.
Applications should be sent to Pierre-Alain Reynier
(pierre-alain.reynier@lif.univ-mrs.fr)
Required documents are:
- a detailled curriculum vitae, including a list of publications
- recommendation letters or references
(pierre-alain.reynier@lif.univ-mrs.fr)
Required documents are:
- a detailled curriculum vitae, including a list of publications
- recommendation letters or references
The announcement for this position can be found there:
--
Pierre-Alain Reynier
Laboratoire d'Informatique Fondamentale de Marseille
Université d'Aix-Marseille & CNRS
http://www.lif.univ-mrs.fr/~preynier/
Phone : (+33/0) 4 13 55 13 07
Pierre-Alain Reynier
Laboratoire d'Informatique Fondamentale de Marseille
Université d'Aix-Marseille & CNRS
http://www.lif.univ-mrs.fr/~preynier/
Phone : (+33/0) 4 13 55 13 07
Call for participation - 28th International Conference on Logic Programming (ICLP 2012)
Apologies for cross posting.
Gergely
=========================================================================
CALL FOR PARTICIPATION
28th International Conference on Logic Programming (ICLP 2012)
Theory and Practice of Logic Programming
Budapest, Hungary, September 4-8, 2012
http://www.cs.bme.hu/iclp2012/
=========================================================================
REGISTRATION
Registration Site is now open at:
http://www.cs.bme.hu/iclp2012/Registration.html
Early registration is until July 13, 2012.
ACCOMMODATION
Information on hotels is available on the homepage:
http://www.cs.bme.hu/iclp2012/HotelInfo.html
CONFERENCE SCOPE
Since the first conference held in Marseille in 1982, ICLP has been
the premier international conference for presenting research in logic
programming. This year conference will offer invited talks and
tutorials, as well as technical presentations on the broad spectrum of
most recent research topics in the field. The conference will also
host Doctoral Consortium, several workshops, and a Prolog programming
contest.
WORKSHOPS
* Answer Set Programming and Other Computing Paradigms (ASPOCP 2012),
September 4
* 9th International Workshop on Constraint Handling Rules (CHR 2012),
September 4
* 12th International Colloquium on Implementation of Constraint and
LOgic Programming Systems (CICLOPS 2012), September 4
* WG17, September 4-5
* 22nd Workshop on Logic-based methods in Programming Environments
(WLPE 2012), September 8
* Constraint Based Methods for Bioinformatics (WCB'12), September 8
* Coinductive Logic Programming (Co-LP), September 8
Workshops are perhaps the best places for the presentation of
preliminary work, undeveloped novel ideas, and new open problems to a
wide and interested audience with opportunities for intensive
discussions and project collaboration.
DOCTORAL CONSORTIUM
The 8th Doctoral Consortium (DC) on Logic Programming provides
research students with the opportunity to present and discuss their
research directions, and to obtain feedback from both peers and
world-renown experts in the field. Accepted participants receives
partial financial support to attend the event and the main
conference. The best paper and presentation from the DC is given
the opportunity to present in a special session of the main ICLP
conference.
INVITED TALKS
* Ferenc Darvas (http://www.thalesnano.com/board_of_directors)
"Several Applications of Logic Programming in Hungary"
* Jan Wielemaker (http://www.cs.vu.nl/~janw/)
"25 years of SWI Prolog"
* Mike Elston (http://www.securitease.com/) on
"Applications of Prolog and CHR to stock brokering tools"
* Invited author(s) of the most influencial paper of ICLP/ILPS 1992
* Invited author(s) of the most influencial paper of ICLP 2002
TUTORIAL
* Viviana Mascardi (http://www.disi.unige.it/person/MascardiV/)
"Logic-based Agents and the Semantic Web"
FINANCIAL ASSISTANCE
The Association for Logic Programming has funds to assist financially
disadvantaged participants and, specially, students in order to be
able to attend the conference. For information, please contact the
organizers of the Doctoral Consortium and the General Chair.
HOTELS
See http://www.cs.bme.hu/iclp2012/HotelInfo.html.
CONFERENCE VENUE
The Conference will be located in Tulip Inn Budapest Millennium. Budapest
is in the center of Hungary, in the heart of Central Europe. Hungary is
member of the European Union and belongs to the Schengen area.
Hungary is well-served by transport links from abroad. The main
international airport is Budapest Ferihegy. Budapest is linked to 15
European capitals by train, directly or indirectly; e.g. a
Wien-Budapest trip is less than 3 hours.
SPONSORS
The conference is sponsored by the Association for Logic Programming (ALP),
the Artificial Intelligence Section of the John von Neumann Computer
Society and by AIT-Budapest (Aquincum Institute of Technology).
ICLP 2012 ORGANIZATION
General Chair: Péter Szeredi (Budapest Univ. of Technology and Economics)
Program Comittee Chairs:
Agostino Dovier (Univ. of Udine),
Vítor Santos Costa (Univ. of Porto)
Workshop Chair: Mats Carlsson (SICS, Sweden)
Doctoral Consortium Chairs:
Marco Gavanelli (Univ. of Ferrara),
Stefan Woltran (Vienna University of Technology)
Prolog Programming Contest Chair: Tom Schrijvers (Universiteit Gent)
Publicity Chair: Gergely Lukácsy (Cisco Systems Inc.)
Web Manager: János Csorba (Budapest Univ. of Technology and Economics)
Wednesday, June 27, 2012
ITCS 2013 call for papers
CALL FOR PAPERS
The 4th Innovations in Theoretical Computer Science (ITCS) conference, sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT), will be held in Berkeley, California, January 10-12, 2013.
The 4th Innovations in Theoretical Computer Science (ITCS) conference, sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT), will be held in Berkeley, California, January 10-12, 2013.
ITCS (previously known as ICS) seeks to promote research that carries a strong conceptual message (e.g., introducing a new concept or model, opening a new line of inquiry within traditional or cross-interdisciplinary areas, or introducing new techniques or new applications of known techniques). ITCS welcomes all submissions, whether aligned with current theory of computation research directions or deviating from them.
Submission Format
Submissions should start with a title page consisting of the title of the paper; each author's name, affiliation, and email address; and an abstract of 1-2 paragraphs summarizing the paper's contributions. A submission must contain within its first ten pages a clear presentation of the merits of the paper, including discussion of its importance, prior work, and an outline (similar to a brief oral presentation) of key technical ideas and methods used to achieve the main claims. There is no bound on the length of a submission, but material other than the abstract, references, and the first ten pages may be considered as supplementary and will be read at the committee's discretion. Authors are encouraged to put the references at the very end of the submission. The submission should include all of the ideas necessary for an expert to verify fully the central claims in the paper. Finally, the submission should be addressed to a broad spectrum of theoretical computer scientists, not solely to experts in the subarea.The extended abstract should be typeset using 11-point or larger fonts, in a single-column, single-space (between lines) format with ample spacing throughout and 1-inch margins all around. Submissions deviating significantly from these guidelines risk rejection without consideration of their merits.
All submissions will be treated as confidential, and will only be disclosed to the committee and their chosen sub-referees.
Submission Instructions
Authors are required to submit their papers electronically, in PDF (without security restrictions on copying or printing). The submission server is accessible through the following link: https://www.easychair.org/conferences/?conf=itcs2013.
Simultaneous Submissions and Prior Publications
Papers which have been previously presented at a CS conference with published proceedings, or are currently under submission to another such conference, will not be considered for acceptance in ITCS 2013. On the other hand, authors are welcome to submit a paper even if the same paper (or a paper with substantial overlap) has previously appeared in a form other than a CS conference with published proceedings, e.g. a journal, or has already been accepted to any such venue. In such cases the prior publication category must be selected when submitting the paper, and the title page must clearly indicate where the paper (or substantially overlapping paper) has previously appeared or been accepted. In accordance with SIGACT's policy on prior publications, such papers will not be published in the proceedings but will instead be summarized by a one-page abstract accompanied by a bibliographic citation to the published or accepted version of the paper. The program committee reserves the right to apply a higher standard when evaluating such papers.Questions about this policy should be directed to itcs13chair@gmail.com.
Working Papers
To accommodate the publishing traditions of different fields, authors submitting work that is under review or nearly ready for journal review may choose to designate their submission as a working paper, meaning that only a one page abstract will appear in the proceedings, along with a URL pointing to the full paper and guaranteed to be reliable for at least two years. We prefer open access; however, the link can reference a publisher who takes copyright and limits access. Working papers and regular papers are treated equivalently from the standpoint of the conference review process, and they are subject to the same rules regarding formatting, prior publication, and simultaneous submission. The title page should state clearly that the submission is a working paper.
Important Dates
| Extended Abstract Submission: | Monday August 13, 2012 at 23:59pm US PDT. | |
| Notification to authors: | Monday October 22, 2012 at 23:59pm US PDT. | |
| Camera ready papers due: | Thursday, November 29, 2012, at 23:59pm US PDT. | |
| Conference dates: | January 10 - 12, 2013. |
Best Student Paper Award
We are happy to announce a best paper award for papers all of whose authors are full-time students at the time of submission. Student authors who are interested in being considered for this award should notify the chair of their student status and eligibility for the award.
Steering Committee
Sanjeev Arora, Manuel Blum, Bernard Chazelle, Oded Goldreich, Shafi Goldwasser, Richard Karp, Ueli Maurer, Silvio Micali, Peter Bro Miltersen, Christos Papadimitriou, Michael Rabin, Madhu Sudan, Leslie Valiant, Umesh Vazirani, Avi Wigderson, and Andy Yao.
Program Committee
| Mark Braverman | Princeton | |
| Shuchi Chawla | University of Wisconsin | |
| Julia Chuzhoy | TTI-Chicago | |
| Yevgeniy Dodis | New York University | |
| Andrew Drucker | MIT and IAS | |
| Uriel Feige | Weizmann Institute | |
| Ravi Kannan | Microsoft Research India | |
| Robert Kleinberg (Chair) | Cornell | |
| Eyal Kushilevitz | Technion | |
| S. Muthukrishnan | Rutgers | |
| Ronitt Rubinfeld | MIT and Tel Aviv University | |
| Atri Rudra | University at Buffalo | |
| Adam Smith | Pennsylvania State University | |
| Santosh Vempala | Georgia Tech | |
| Andrew Yao | Tsinghua |
Organizing Committee
| Satish Rao | U.C. Berkeley | |
| Christos Papadimitriou | U.C. Berkeley | |
| Umesh Vazirani | U.C. Berkeley |
Website
The conference website is at http://itcs2013.cs.berkeley.edu.
Contact Information
Inquiries should be addressed to itcs13chair@gmail.com.
PhD and Postdoc Positions in Athens (in Theoretical Computer Science)
We are pleased to announce the opening of up to 3 PhD and 1 or 2 postdoc
positions in theoretical computer science. The positions fall within the new
joint project, ALGONOW, among 3 collaborating research groups in the
following institutions in Athens, Greece:
- National Technical University of Athens (NTUA), School of Electrical and
Computer Engineering,
Faculty members: Efstathios Zachos, Dimitris Fotakis, Aris Pagourtzis,
Antonis Symvonis. The group includes also Euripides Markou, collaborating
faculty member from University of Central Greece.
- National Kapodistrian University of Athens (NKUA), Department of
Informatics and Telecommunications,
Faculty members: Elias Koutsoupias, Vassilis Zissimopoulos.
- Athens University of Economics and Business (AUEB), Department of
Informatics,
Faculty members: Vangelis Markakis, Ioannis Milis, Martha Sideri
The project also involves collaboration with our external partners, which
include:
- Evripidis Bampis, LIP6, Universite Pierre et Marie Curie
- Costis Daskalakis, MIT
- Christos Papadimitriou, University of California - Berkeley
- Vangelis Paschos, LAMSADE, Universite Paris-Dauphine
- George Rouskas, North Carolina State University
The aim of the project ALGONOW is to address current algorithmic challenges
and to investigate fundamental problems that arise from the increasing needs
of computation and communication. In particular, the research topics that
the project involves include, but are not limited to:
1. Resource management in multi-fiber optical networks: routing and
wavelength assignment, wavelength conversion and traffic grooming,
noncooperative game theoretic models.
2. Models and diffusion methods for social networks: mathematical models for
the evolution of networks, diffusion of information in
networks, game theoretic aspects of diffusion models.
3. Location, availability, and processing of massive data sets:
approximation and online algorithms for infrastructure leasing and
content distribution problems, competitive analysis of streaming algorithms.
4. Energy management in computing environments: models for capturing energy
minimization problems, algorithms for the corresponding scheduling problems
under energy/temperature constraints.
These are full-time positions and funding is guaranteed initially for two
years. The funding is extendable for at least 1 more year based
upon satisfactory academic progress. The preferred starting date is October
1, 2012, however it is negotiable with each institute.
Desirable background of applicants:
The applicants should have (or be bound to have by the starting date) a
Masters degree in computer science, mathematics, operations research or a
related discipline. Applicants with a strong background in algorithms and
discrete mathematics will be preferred. Candidates must be comfortable with
writing and speaking in English.
HOW TO APPLY:
Applicants should send an email to Vangelis Markakis (markakis@gmail.com)
including the following:
- Their CV
- Contact details of at least 2 references
- For phd candidates: A cover letter, where they will specify their
preferred area(s) on which they would like to do their phd thesis.
There is possibility that a phd student is coadvised by 2 faculty members
from different institutes.
- For postdoc candidates: A research statement explaining their research
interests (1-2 pages).
There is no deadline for applying, but the applications will be processed as
they come.
For any further inquiries the applicants are encouraged to send an email to
markakis@gmail.com.
positions in theoretical computer science. The positions fall within the new
joint project, ALGONOW, among 3 collaborating research groups in the
following institutions in Athens, Greece:
- National Technical University of Athens (NTUA), School of Electrical and
Computer Engineering,
Faculty members: Efstathios Zachos, Dimitris Fotakis, Aris Pagourtzis,
Antonis Symvonis. The group includes also Euripides Markou, collaborating
faculty member from University of Central Greece.
- National Kapodistrian University of Athens (NKUA), Department of
Informatics and Telecommunications,
Faculty members: Elias Koutsoupias, Vassilis Zissimopoulos.
- Athens University of Economics and Business (AUEB), Department of
Informatics,
Faculty members: Vangelis Markakis, Ioannis Milis, Martha Sideri
The project also involves collaboration with our external partners, which
include:
- Evripidis Bampis, LIP6, Universite Pierre et Marie Curie
- Costis Daskalakis, MIT
- Christos Papadimitriou, University of California - Berkeley
- Vangelis Paschos, LAMSADE, Universite Paris-Dauphine
- George Rouskas, North Carolina State University
The aim of the project ALGONOW is to address current algorithmic challenges
and to investigate fundamental problems that arise from the increasing needs
of computation and communication. In particular, the research topics that
the project involves include, but are not limited to:
1. Resource management in multi-fiber optical networks: routing and
wavelength assignment, wavelength conversion and traffic grooming,
noncooperative game theoretic models.
2. Models and diffusion methods for social networks: mathematical models for
the evolution of networks, diffusion of information in
networks, game theoretic aspects of diffusion models.
3. Location, availability, and processing of massive data sets:
approximation and online algorithms for infrastructure leasing and
content distribution problems, competitive analysis of streaming algorithms.
4. Energy management in computing environments: models for capturing energy
minimization problems, algorithms for the corresponding scheduling problems
under energy/temperature constraints.
These are full-time positions and funding is guaranteed initially for two
years. The funding is extendable for at least 1 more year based
upon satisfactory academic progress. The preferred starting date is October
1, 2012, however it is negotiable with each institute.
Desirable background of applicants:
The applicants should have (or be bound to have by the starting date) a
Masters degree in computer science, mathematics, operations research or a
related discipline. Applicants with a strong background in algorithms and
discrete mathematics will be preferred. Candidates must be comfortable with
writing and speaking in English.
HOW TO APPLY:
Applicants should send an email to Vangelis Markakis (markakis@gmail.com)
including the following:
- Their CV
- Contact details of at least 2 references
- For phd candidates: A cover letter, where they will specify their
preferred area(s) on which they would like to do their phd thesis.
There is possibility that a phd student is coadvised by 2 faculty members
from different institutes.
- For postdoc candidates: A research statement explaining their research
interests (1-2 pages).
There is no deadline for applying, but the applications will be processed as
they come.
For any further inquiries the applicants are encouraged to send an email to
markakis@gmail.com.
[DMANET] Deadline Extension: ICSNC 2012 || November 18-23, 2012 - Lisbon, Portugal
INVITATION:
=================
The submission deadline has been extended to July 18, 2012.
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results to ICSNC 2012.
In addition, authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org
=================
============== ICSNC 2012 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
ICSNC 2012, The Seventh International Conference on Systems and Networks Communications
November 18-23, 2012 - Lisbon, Portugal
General page: http://www.iaria.org/conferences2012/ICSNC12.html
Call for Papers: http://www.iaria.org/conferences2012/CfPICSNC12.html
- regular papers
- short papers (work in progress)
- posters
Submission page: http://www.iaria.org/conferences2012/SubmitICSNC12.html
Submission deadline: July 18, 2012
Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org
Please note the Poster and Work in Progress options.
The topics suggested by the conference can be discussed in term of concepts, state of the art, research, standards, implementations, running experiments, applications, and industrial case studies.
Authors are invited to submit complete unpublished papers, which are not under review in any other conference or journal in the following, but not limited to, topic areas.
All tracks are open to both research and industry contributions, in terms of Regular papers, Posters, Work in progress, Technical/marketing/business presentations, Demos, Tutorials, and Panels.
Before submission, please check and comply with the Editorial rules: http://www.iaria.org/editorialrules.html
ICSNC 2012 Topics (topics and submission details: see CfP on the site)
WINET: Wireless networks
3G/4G integration; Wireless protocols, architectural and design concepts; Design and implementation of mobile information systems; Wireless communications and mechanisms; Antenna and RF subsystems; Coding & modulation & equalization; Channel modeling and characterization; Equalization/Synchronization; Wireless technologies; Wireless applications & services; IP Multimedia subsystems (IMS); Wireless and mobility; Wireless-wireline convergence; Radio communications systems; Specialized wireless networks; Management of wireless networks; Position on standards & fora on wireless networks; Business models on wireless networks; Communications regulations, Spectrum management; Software-Defined Radio (SDR) [ architectures, hardware, software, signal processing and smart antennas, etc.]
HSNET: High speed networks
Technologies, protocols, and applications for high speed networks; Voice over high speed networks; Services and interconnections of high speed networks; Technologies for High speed optical networks; Optical burst switching; End-to-end applications; Optical control plan; Advanced optical technology architectures; Design of high speed systems and networks; Methodologies and development tools for high speed networks; Management and control of high speed networks; Performance in high speed networks; Security aspects in high speed networks; QoS/SLA in high speed networks; Diagnosing high speed networks; High speed networks and NGN
SENET: Sensor networks
Architectures and protocols for wired and wireless sensor networks; Design of sensor networks; Instrumentation and models for deployment of sensors networks; Power in sensor networks; Ad hoc and wireless sensor networks; Management and control of sensor networks; Performance in sensor networks; Security and reliability aspects in sensor networks; Information assurance in sensor networks; QoS/SLA in sensor networks; Applications, case studies and prototypes with sensor networks
MHNET: Mobile and Ad hoc networks
Mobile technology and fundamentals; Analytical and validation models for mobility; Architecture and routing protocols for mobile networks; Architectures, frameworks, fundamentals on ad hoc networks; Energy efficient design, cross-layer design, scalability; MAC protocols for ad-hoc and sensor networks (801.11, Bluetooth, etc.); Data, information, and signal processing in mobile networks; Complexity analysis of mobile algorithms and protocols; Software platforms and development tools supporting mobility; QoS/SLA, access control and security in mobile and ad hoc networks; Location and mobility management; Location and service discovery in ad hoc networks; Planning, provisioning, and deployment mobility features; Directional and smart antennas for mobile and ad-hoc networks; Performance and security in ad hoc and mobile networks; Self-organization, synchronization and stability in ad hoc networks; Self-management in ad hoc and mobile networks; Ad hoc and mobile networks and auto!
nomic co
mputing; Mobile ad hoc platforms, systems and tools; Applications over ad hoc networks; Standards evolution on mobility and ad hoc networks
VENET: Vehicular networks
Communication technologies in vehicular networks; Frameworks and architectures for vehicular networks; Interoperability with Internet and other networks; Vehicle-infrastructure communications; Vehicle-to-vehicle communications; Emerging inter/intra-vehicle and infrastructure-to-vehicle wireless technologies; Cross-layer design and optimization for vehicular networks; Middleware and service architectures for vehicular networks; Propagation issues Vehicular sensors and data collection and process; On-drive diagnostics and repair technologies and systems; Protocol features /MAC, QoS, routing, multicast, addressing, identity/; Mobility and hand-off ; Properties /security, privacy, performance, robustness, real-time, etc./; Control and management in vehicular networks; Driver-oriented support systems /assistance, active&passive safety, etc./; Case studies and fields trials on vehicular networks; Applications across vehicular networks /content distribution, alerting, etc./; Standa!
rdizatio
n /802.11p, DSRC, etc./ and standard platforms /JasPar, AUTOSTAR, etc./
RFID: Radio-frequency identification systems
Fundamentals for RFID systems; Communications in RFID systems; Next generation RFID Technologies; RFID middleware design and architecture; Antenna design for RFID; System design and deployment; Circuits and architecture; RFID ans sensor networks; Bridging RFID networks in heterogeneous networks; Collision, proximity, speed; Security, privacy, trust; Monitoring and control of RFID systems; Localization and tracking; Inventory tracking; Testing and verification; Planing and executing RFID systems; RFID pilot projects; Use cases in deploying and operating /finance, manufacture, agriculture, transportation, etc./; Tools for supporting the design and deployment of RFID systems
SESYS: Security systems
Security analysis methodologies; Middleware and distributed systems security; Cryptography, certificates, information hiding, access control; Protection, risk, vulnerabilities, attacks, authorization/authentication; Access control, wireless access control, broadband access control; Biometrics, smart cards, identification and trust methodologies; Certification, accreditation anonymity, and audit; Security management, emergency contingency planning, identify theft, life safety; Wireless and mobile security; Fast security associations; Electronic surveillance and e-commerce protocols; Security and trust in web-services-based applications; Peer-to-peer security, denial of services; Information survivability, insider threat protection, integrity; Intellectual property rights, privacy, legal and regulatory issues; Criminal exploitation of technology; Commercial and industrial security; Viruses, hackers, worms, spam, and other malicious code
MCSYS: Multimedia communications systems
Technologies, protocols, and mechanisms for multimedia communications; Multimedia compression mechanisms and information representation; Multimedia encoding and compression, MPEG-1 to MPEG-4, Wavelet and fractal; Multimedia frameworks, communications, and middleware; Next generation multimedia communications; Mobile multimedia communications; Methodologies and development tools for multimedia communications systems; Wireless mobile multimedia communications; Ad hoc multimedia networks; IP-based Multimedia Subsystems (IMS); QoS/SLA in mobile multimedia services and applications; Mechanisms for interactive multimedia applications; Designing and implementing interactive applications; Multimedia authoring, publishing, and right securing; Security and performance for multimedia communications; Management, QoS, and security aspects in streaming over wireless ad hoc networks; Management and control of multimedia systems; Standards protocols for multimedia communications
POSYS: Policy-based systems
Policy for automation control; Trusting policy control commands; Policy-driven autonomic organizations; Policy-based control scalability; Policy sensors for feedback control; Policy conflict detection and conflict resolution; Context-aware policy-driven adaptive frameworks; Policy integrity, trust and negotiations; Policy-based software applications; Policing pervasive computing environments; Policing on-demand systems and services
PESYS: Pervasive education system
Learning and teaching systems; E-learning methods and e-learning scenarios; Tools and architectures for mobile/ubiquitous e-learning; Cooperative learning and working; Mobile technology and education; Distance learning and education; Computers and arts; Education in developing regions; Reflection in learning software and hardware; Social impact metrics on distance learning; Methodologies and processes for education; Curriculum projects and experiences; Intelligent support; Multimedia environment for teaching; E-market place for higher education; Embedded systems education; Wearable computers and education
================================================
IARIA Publicity Board
------------------------------
**********************************************************
*
* 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 submission deadline has been extended to July 18, 2012.
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results to ICSNC 2012.
In addition, authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org
=================
============== ICSNC 2012 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
ICSNC 2012, The Seventh International Conference on Systems and Networks Communications
November 18-23, 2012 - Lisbon, Portugal
General page: http://www.iaria.org/conferences2012/ICSNC12.html
Call for Papers: http://www.iaria.org/conferences2012/CfPICSNC12.html
- regular papers
- short papers (work in progress)
- posters
Submission page: http://www.iaria.org/conferences2012/SubmitICSNC12.html
Submission deadline: July 18, 2012
Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org
Please note the Poster and Work in Progress options.
The topics suggested by the conference can be discussed in term of concepts, state of the art, research, standards, implementations, running experiments, applications, and industrial case studies.
Authors are invited to submit complete unpublished papers, which are not under review in any other conference or journal in the following, but not limited to, topic areas.
All tracks are open to both research and industry contributions, in terms of Regular papers, Posters, Work in progress, Technical/marketing/business presentations, Demos, Tutorials, and Panels.
Before submission, please check and comply with the Editorial rules: http://www.iaria.org/editorialrules.html
ICSNC 2012 Topics (topics and submission details: see CfP on the site)
WINET: Wireless networks
3G/4G integration; Wireless protocols, architectural and design concepts; Design and implementation of mobile information systems; Wireless communications and mechanisms; Antenna and RF subsystems; Coding & modulation & equalization; Channel modeling and characterization; Equalization/Synchronization; Wireless technologies; Wireless applications & services; IP Multimedia subsystems (IMS); Wireless and mobility; Wireless-wireline convergence; Radio communications systems; Specialized wireless networks; Management of wireless networks; Position on standards & fora on wireless networks; Business models on wireless networks; Communications regulations, Spectrum management; Software-Defined Radio (SDR) [ architectures, hardware, software, signal processing and smart antennas, etc.]
HSNET: High speed networks
Technologies, protocols, and applications for high speed networks; Voice over high speed networks; Services and interconnections of high speed networks; Technologies for High speed optical networks; Optical burst switching; End-to-end applications; Optical control plan; Advanced optical technology architectures; Design of high speed systems and networks; Methodologies and development tools for high speed networks; Management and control of high speed networks; Performance in high speed networks; Security aspects in high speed networks; QoS/SLA in high speed networks; Diagnosing high speed networks; High speed networks and NGN
SENET: Sensor networks
Architectures and protocols for wired and wireless sensor networks; Design of sensor networks; Instrumentation and models for deployment of sensors networks; Power in sensor networks; Ad hoc and wireless sensor networks; Management and control of sensor networks; Performance in sensor networks; Security and reliability aspects in sensor networks; Information assurance in sensor networks; QoS/SLA in sensor networks; Applications, case studies and prototypes with sensor networks
MHNET: Mobile and Ad hoc networks
Mobile technology and fundamentals; Analytical and validation models for mobility; Architecture and routing protocols for mobile networks; Architectures, frameworks, fundamentals on ad hoc networks; Energy efficient design, cross-layer design, scalability; MAC protocols for ad-hoc and sensor networks (801.11, Bluetooth, etc.); Data, information, and signal processing in mobile networks; Complexity analysis of mobile algorithms and protocols; Software platforms and development tools supporting mobility; QoS/SLA, access control and security in mobile and ad hoc networks; Location and mobility management; Location and service discovery in ad hoc networks; Planning, provisioning, and deployment mobility features; Directional and smart antennas for mobile and ad-hoc networks; Performance and security in ad hoc and mobile networks; Self-organization, synchronization and stability in ad hoc networks; Self-management in ad hoc and mobile networks; Ad hoc and mobile networks and auto!
nomic co
mputing; Mobile ad hoc platforms, systems and tools; Applications over ad hoc networks; Standards evolution on mobility and ad hoc networks
VENET: Vehicular networks
Communication technologies in vehicular networks; Frameworks and architectures for vehicular networks; Interoperability with Internet and other networks; Vehicle-infrastructure communications; Vehicle-to-vehicle communications; Emerging inter/intra-vehicle and infrastructure-to-vehicle wireless technologies; Cross-layer design and optimization for vehicular networks; Middleware and service architectures for vehicular networks; Propagation issues Vehicular sensors and data collection and process; On-drive diagnostics and repair technologies and systems; Protocol features /MAC, QoS, routing, multicast, addressing, identity/; Mobility and hand-off ; Properties /security, privacy, performance, robustness, real-time, etc./; Control and management in vehicular networks; Driver-oriented support systems /assistance, active&passive safety, etc./; Case studies and fields trials on vehicular networks; Applications across vehicular networks /content distribution, alerting, etc./; Standa!
rdizatio
n /802.11p, DSRC, etc./ and standard platforms /JasPar, AUTOSTAR, etc./
RFID: Radio-frequency identification systems
Fundamentals for RFID systems; Communications in RFID systems; Next generation RFID Technologies; RFID middleware design and architecture; Antenna design for RFID; System design and deployment; Circuits and architecture; RFID ans sensor networks; Bridging RFID networks in heterogeneous networks; Collision, proximity, speed; Security, privacy, trust; Monitoring and control of RFID systems; Localization and tracking; Inventory tracking; Testing and verification; Planing and executing RFID systems; RFID pilot projects; Use cases in deploying and operating /finance, manufacture, agriculture, transportation, etc./; Tools for supporting the design and deployment of RFID systems
SESYS: Security systems
Security analysis methodologies; Middleware and distributed systems security; Cryptography, certificates, information hiding, access control; Protection, risk, vulnerabilities, attacks, authorization/authentication; Access control, wireless access control, broadband access control; Biometrics, smart cards, identification and trust methodologies; Certification, accreditation anonymity, and audit; Security management, emergency contingency planning, identify theft, life safety; Wireless and mobile security; Fast security associations; Electronic surveillance and e-commerce protocols; Security and trust in web-services-based applications; Peer-to-peer security, denial of services; Information survivability, insider threat protection, integrity; Intellectual property rights, privacy, legal and regulatory issues; Criminal exploitation of technology; Commercial and industrial security; Viruses, hackers, worms, spam, and other malicious code
MCSYS: Multimedia communications systems
Technologies, protocols, and mechanisms for multimedia communications; Multimedia compression mechanisms and information representation; Multimedia encoding and compression, MPEG-1 to MPEG-4, Wavelet and fractal; Multimedia frameworks, communications, and middleware; Next generation multimedia communications; Mobile multimedia communications; Methodologies and development tools for multimedia communications systems; Wireless mobile multimedia communications; Ad hoc multimedia networks; IP-based Multimedia Subsystems (IMS); QoS/SLA in mobile multimedia services and applications; Mechanisms for interactive multimedia applications; Designing and implementing interactive applications; Multimedia authoring, publishing, and right securing; Security and performance for multimedia communications; Management, QoS, and security aspects in streaming over wireless ad hoc networks; Management and control of multimedia systems; Standards protocols for multimedia communications
POSYS: Policy-based systems
Policy for automation control; Trusting policy control commands; Policy-driven autonomic organizations; Policy-based control scalability; Policy sensors for feedback control; Policy conflict detection and conflict resolution; Context-aware policy-driven adaptive frameworks; Policy integrity, trust and negotiations; Policy-based software applications; Policing pervasive computing environments; Policing on-demand systems and services
PESYS: Pervasive education system
Learning and teaching systems; E-learning methods and e-learning scenarios; Tools and architectures for mobile/ubiquitous e-learning; Cooperative learning and working; Mobile technology and education; Distance learning and education; Computers and arts; Education in developing regions; Reflection in learning software and hardware; Social impact metrics on distance learning; Methodologies and processes for education; Curriculum projects and experiences; Intelligent support; Multimedia environment for teaching; E-market place for higher education; Embedded systems education; Wearable computers and education
================================================
IARIA Publicity Board
------------------------------
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Call for participation UNCONVENTIONAL COMPUTATION and NATURAL COMPUTATION, UCNC 2012
Call for participation
11th International Conference on
UNCONVENTIONAL COMPUTATION and NATURAL COMPUTATION, UCNC 2012
(previously UNCONVENTIONAL COMPUTATION - UC)
University of Orleans, France, September 3-7, 2012
http://www.univ-orleans.fr/lifo/events/UCNC2012/
Deadline EARLY REGISTRATION JULY 15th
++++++++++++++++++++++++++++++++++++++++++++++++
UCNC 2012 is organized by the LIFO, the Computer Science Research
Laboratory of the University of Orleans.
This series of international conferences is devoted to all aspects of
unconventional computation and natural computation, theory as well as
experiments and applications. These conferences were previously named
Unconventional Models of Computation (UMC) from 1998 to 2002 and then
Unconventional Computation (UC). For the 11th edition, the conference
becomes Unconventional Computation and Natural Computation
(UCNC).
Typical, but not exclusive, topics are: natural computing
including quantum, cellular, molecular, neural, DNA and membrane
computing, as well as evolutionary paradigms; chaos and dynamical
systems based computing; massive parallel computation, collective
intelligence, relativistic, optical, spatial computing, amorphous
computing, physarum computing, collision-based computing, proposals
for computations going beyond the Turing model...
++++++++++++++++++++++++++++++++++++++++++++++++
Program Committee:
- Andrew ADAMATSKY (University of Bristol, UK)
- Cristian S. CALUDE (University of Auckland, New Zealand)
- Jose Felix COSTA (Technical University of Lisbon, Portugal)
- David DOTY (Caltech, California, USA)
- Jerome DURAND-LOSE (University of Orleans, France) - co-chair
- Christine EISENBEIS (INRIA Saclay-Ile de France & Universite
Paris-Sud 11, France)
- Rudolf FREUND (University of Vienna, Austria)
- Pierre GUILLON (CNRS & Universite de Aix-Marseille, France)
- Masami HAGIYA (University of Tokyo, Japan)
- Tero HARJU (University of Turku, Finland)
- Mika HIRVENSALO (University of Turku, Finland)
- Oscar H. IBARRA (University of California - Santa Barbara, USA)
- Natasha JONOSKA (University of South Florida, USA) - co-chair
- Jarkko KARI (University of Turku, Finland)
- Satoshi KOBAYASHI (University of Electro-Communications, Japan)
- Giancarlo MAURI (University of Milano-Bicocca, Italy)
- Jacques MAZOYER (LIP-ENS Lyon, France)
- Kenichi MORITA (University of Hiroshima, Japan)
- Kae NEMOTO (National Institute of Informatics, Japan)
- Gheorghe PAUN (Institute of Mathematics of the Romanian Academy,
Romania)
- Igor POTAPOV (University of Liverpool, UK)
- Susan STEPNEY (University of York, UK)
++++++++++++++++++++++++++++++++++++++++++++++++
Invited Speakers:
- Paola BONIZZONI (University of Milano-Bicocca, Italy)
- Cristian CALUDE (University of Auckland, New Zealand)
- Marco DORIGO (IRIDIA, Université Libre de Bruxelles, Belgium)
- Rene DOURSAT (Complex Systems Institute Paris Ile-de-France, France)
- Jack LUTZ (Iowa State University, USA)
- Maurice MARGENSTERN (Universite de Metz, France)
Alan M. Turing centenary talk
- Gilles DOWEK (INRIA, France)
Tutorials:
- Spatial Computing & MGS
Jean-Louis GIAVITTO (IRCAM, Paris, France)
Antoine SPICHER (Universite de Paris Est - Creteil)
Olivier MICHEL (Universite de Paris Est - Creteil)
- Self-Assembling Systems
Matthew PATITZ (University of Texas-Pan American, USA)
++++++++++++++++++++++++++++++++++++++++++++++++
Registration
http://www.univ-orleans.fr/lifo/events/UCNC2012/registration.php
Deadline early registration July 15th
Reduced Normal
210 € 250 € Early registration
260 € 300 € Late registration
360 € 400 € On site registration
Includes: access to all workshops, proceedings (LNCS and workshops),
coffee breaks, lunches, social event, banquet...
++++++++++++++++++++++++++++++++++++++++++++++++
Satellite Workshops:
http://www.univ-orleans.fr/lifo/events/UCNC2012/workshops.php
CoSMoS 2012 ― 5th International Workshop on Complex Systems Modelling
and Simulation (Monday, 3rd September)
BioChemIT 2012 ― 2nd COBRA Workshop on Biological and Chemical
Information Technologies (Thursday, September 6th)
IPCN 2012 ― The First International Workshop on Information Physics
and Computing in Nano-scale Photonics and Materials (Friday, 7th
September)
FounQI 2 ― 2nd Workshop on Foundations of Quantum Information (funky
too) (Friday, 7th and Saturday, 8th September)
++++++++++++++++++++++++++++++++++++++++++++++++
Conference location:
The conference and the satellite workshops will take place in the
computer science building of the Universite d'Orleans.
++++++++++++++++++++++++++++++++++++++++++++++++
ACCEPTED PAPERS
REGULAR PAPERS
General Topologies and P Systems.
Erzsébet Csuhaj-Varjú, Marian Gheorghe and Mike Stannett
**********************************************************
*
* 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/
*
**********************************************************
ITCS 2013 call for papers
CALL FOR PAPERS
The 4th Innovations in Theoretical Computer Science (ITCS) conference, sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT), will be held in Berkeley, California, January 10-12, 2013.
The 4th Innovations in Theoretical Computer Science (ITCS) conference, sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT), will be held in Berkeley, California, January 10-12, 2013.
ITCS (previously known as ICS) seeks to promote research that carries a strong conceptual message (e.g., introducing a new concept or model, opening a new line of inquiry within traditional or cross-interdisciplinary areas, or introducing new techniques or new applications of known techniques). ITCS welcomes all submissions, whether aligned with current theory of computation research directions or deviating from them.
Submission Format
Submissions should start with a title page consisting of the title of the paper; each author's name, affiliation, and email address; and an abstract of 1-2 paragraphs summarizing the paper's contributions. A submission must contain within its first ten pages a clear presentation of the merits of the paper, including discussion of its importance, prior work, and an outline (similar to a brief oral presentation) of key technical ideas and methods used to achieve the main claims. There is no bound on the length of a submission, but material other than the abstract, references, and the first ten pages may be considered as supplementary and will be read at the committee's discretion. Authors are encouraged to put the references at the very end of the submission. The submission should include all of the ideas necessary for an expert to verify fully the central claims in the paper. Finally, the submission should be addressed to a broad spectrum of theoretical computer scientists, not solely to experts in the subarea.The extended abstract should be typeset using 11-point or larger fonts, in a single-column, single-space (between lines) format with ample spacing throughout and 1-inch margins all around. Submissions deviating significantly from these guidelines risk rejection without consideration of their merits.
All submissions will be treated as confidential, and will only be disclosed to the committee and their chosen sub-referees.
Submission Instructions
Authors are required to submit their papers electronically, in PDF (without security restrictions on copying or printing). The submission server is accessible through the following link: https://www.easychair.org/conferences/?conf=itcs2013.
Simultaneous Submissions and Prior Publications
Papers which have been previously presented at a CS conference with published proceedings, or are currently under submission to another such conference, will not be considered for acceptance in ITCS 2013. On the other hand, authors are welcome to submit a paper even if the same paper (or a paper with substantial overlap) has previously appeared in a form other than a CS conference with published proceedings, e.g. a journal, or has already been accepted to any such venue. In such cases the prior publication category must be selected when submitting the paper, and the title page must clearly indicate where the paper (or substantially overlapping paper) has previously appeared or been accepted. In accordance with SIGACT's policy on prior publications, such papers will not be published in the proceedings but will instead be summarized by a one-page abstract accompanied by a bibliographic citation to the published or accepted version of the paper. The program committee reserves the right to apply a higher standard when evaluating such papers.Questions about this policy should be directed to itcs13chair@gmail.com.
Working Papers
To accommodate the publishing traditions of different fields, authors submitting work that is under review or nearly ready for journal review may choose to designate their submission as a working paper, meaning that only a one page abstract will appear in the proceedings, along with a URL pointing to the full paper and guaranteed to be reliable for at least two years. We prefer open access; however, the link can reference a publisher who takes copyright and limits access. Working papers and regular papers are treated equivalently from the standpoint of the conference review process, and they are subject to the same rules regarding formatting, prior publication, and simultaneous submission. The title page should state clearly that the submission is a working paper.
Important Dates
| Extended Abstract Submission: | Monday August 13, 2012 at 23:59pm US PDT. | |
| Notification to authors: | Monday October 22, 2012 at 23:59pm US PDT. | |
| Camera ready papers due: | Thursday, November 29, 2012, at 23:59pm US PDT. | |
| Conference dates: | January 10 - 12, 2013. |
Best Student Paper Award
We are happy to announce a best paper award for papers all of whose authors are full-time students at the time of submission. Student authors who are interested in being considered for this award should notify the chair of their student status and eligibility for the award.
Steering Committee
Sanjeev Arora, Manuel Blum, Bernard Chazelle, Oded Goldreich, Shafi Goldwasser, Richard Karp, Ueli Maurer, Silvio Micali, Peter Bro Miltersen, Christos Papadimitriou, Michael Rabin, Madhu Sudan, Leslie Valiant, Umesh Vazirani, Avi Wigderson, and Andy Yao.
Program Committee
| Mark Braverman | Princeton | |
| Shuchi Chawla | University of Wisconsin | |
| Julia Chuzhoy | TTI-Chicago | |
| Yevgeniy Dodis | New York University | |
| Andrew Drucker | MIT and IAS | |
| Uriel Feige | Weizmann Institute | |
| Ravi Kannan | Microsoft Research India | |
| Robert Kleinberg (Chair) | Cornell | |
| Eyal Kushilevitz | Technion | |
| S. Muthukrishnan | Rutgers | |
| Ronitt Rubinfeld | MIT and Tel Aviv University | |
| Atri Rudra | University at Buffalo | |
| Adam Smith | Pennsylvania State University | |
| Santosh Vempala | Georgia Tech | |
| Andrew Yao | Tsinghua |
Organizing Committee
| Satish Rao | U.C. Berkeley | |
| Christos Papadimitriou | U.C. Berkeley | |
| Umesh Vazirani | U.C. Berkeley |
Website
The conference website is at http://itcs2013.cs.berkeley.edu.
Contact Information
Inquiries should be addressed to itcs13chair@gmail.com.
Subscribe to:
Posts (Atom)
Posts
