APPROX 2013 and RANDOM 2013
16th Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems - APPROX 2013
17th Intl. Workshop on Randomization and Computation - RANDOM 2013
http://cui.unige.ch/tcs/random-approx/
Aug. 21-23, 2013
Berkeley
Call for papers
SCOPE
16th Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems - APPROX 2013
17th Intl. Workshop on Randomization and Computation - RANDOM 2013
The 16th. International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems (APPROX'2013), and the 17th.
International Workshop on Randomization and Computation (RANDOM'2013)
will be held in 21-23 August 2013 at Berkeley.
APPROX'2013 focuses on algorithmic and complexity theoretic issues
relevant to the development of efficient approximate solutions to
computationally difficult problems, while RANDOM'2013 focuses on
applications of randomness to computational and combinatorial problems.
RANDOM'2013 is the seventeenth workshop in the series; APPROX'2013 is
the sixteenth in the series.
TOPICS
Papers are solicited in all research areas related to randomization and
approximation, including, but not limited to:
APPROX
" design and analysis of approximation algorithms
" hardness of approximation
" small space, sub-linear time and streaming algorithms
" embeddings and metric space methods
" mathematical programming methods
" combinatorial problems in graphs and networks
" game theory, markets, and economic applications
" geometric problems
" packing, covering, and scheduling
" approximate learning
" other applications
RANDOM
" design and analysis of randomized algorithms
" randomized complexity theory
" pseudorandomness and derandomization
" random combinatorial structures
" random walks/Markov chains
" expander graphs and randomness extractors
" probabilistic proof systems
" random projections and embeddings
" error-correcting codes
" average-case analysis
" property testing
" computational learning theory
SUBMISSIONS
Abstract Format: Electronic submissions are solicited. Please consult
the following servers:
For submission of APPROX papers:
http://www.easychair.org/conferences/?conf=approx13
For submission of RANDOM papers:
http://www.easychair.org/conferences/?conf=random13
Note: You will be asked to login using an EasyChair account. Directions
on how to register for such an account are available at the submission
servers (you may also have an old account from a previous conference
submission).
The submission must be received by 17:00 (PDT) of April 17 for your
submission to be considered.
Abstract Format: Authors should submit an extended abstract (not a full
paper). An abstract should start with the title of the paper, each
author's name, affiliation, and e-mail address, followed by a
one-paragraph summary of the results to be presented. This should then
be followed by a technical exposition of the main ideas and techniques
used to achieve these results including motivation and a clear
comparison with related work.
The abstract should not exceed 10 single-spaced pages on letter-size
paper, using reasonable margins and at least 11-point font (not
including the references). If the authors believe that more details are
essential to substantiate the main claims of the paper, they may include
a clearly marked appendix that will be read at the discretion of the
program committee.
Simultaneous submission
Simultaneous submission to other conferences with published proceedings
is not allowed.
PROCEEDINGS
Proceedings will be published in the Springer-Verlag series Lecture
Notes in Computer Science.
Previous proceedings of APPROX appeared as LNCS 1444, 1671, 1913, 2129,
2462, 2764, 3122, 3624, 4110 and 4627 while previous proceedings of
RANDOM appeared as LNCS 1269, 1518, 1671, 2129, 2483, 2764, 3122, 3624,
4110, 4627 and as Proceedings in Informatics 8.
IMPORTANT DATES
Submission deadline: April 17, 17:00 PDT
Notifications: June 11
Camera ready: June 18
PROGRAM COMMITTEES
Approx
Nikhil Bansal - Eindhoven University
Chandra Chekuri - UIUC
Eden Chlamtac - Ben Gurion University
Nikhil Devanur - Microsoft Research
Uriel Feige - Weizmann Institute
Claire Mathieu - Brown University
Ankur Moitra - Institute of Advanced Study
Seffi Naor - Technion University
Yuval Rabani - Hebrew University
Prasad Raghavendra - University of California, Berkeley (Chair)
Roy Schwartz - Microsoft Research
Mohit Singh - Microsoft Research
Ola Svensson - EPFL
Mohammad Taghi Hajiaghayi - University of Maryland, College Park
Madhur Tulsiani - TTI Chicago
Rico Zenklusen - John Hopkins University
Random
Amit Chakrabarti - Dartmouth College
Nikolaos Fountoulakis - University of Birmingham
Ariel Gabizon - Technion
Parikshit Gopalan - Microsoft Research, Silicon Valley
Dan Gutfreund - IBM Research, Haifa
Prahladh Harsha - Tata Institute of Fundamental Research, India
Tomas Hayes - University of New Mexico
Michael Krivelevich - Tel Aviv University
Shachar Lovett - UCSD
Russell Martin - University of Liverpool
Dieter van Melkebeek - University of Wisconsin--Madison
Sofya Raskhodnikova - Pennsylvania State University (Chair)
Shubhangi Saraf - Rutgers University
Christian Sohler - TU Dortmund University
David P. Woodruff - IBM Research, Almaden
Amir Yehudayoff - Technion
Program Chairs
APPROX
Prasad Raghavendra - University of California, Berkeley
email: prasad@cs.berkeley.edu
RANDOM
Sofya Raskhodnikova - Pennsylvania State University
email:sofya@cse.psu.edu
Workshop Chairs
José Rolim, U. of Geneva
e-mail: jose.rolim@unige.ch
Klaus Jansen, U. of Kiel
e-mail: kj@informatik.uni-kiel.de
CONFERENCE WEB PAGE
http://cui.unige.ch/tcs/random-approx/
Monday, April 8, 2013
Sunday, April 7, 2013
[DMANET] Job Openings at Innovative Scheduling.
Dear DMANET Subscriber,
Innovative Scheduling (www.InnovativeScheduling.com) has several openings for Operations Researchers and Computer Scientists.
Job Requirements:
. M.S. or Ph.D. degree in Operations Research or Computer Science.
. Superb background in algorithm design and implementation and data structures.
. Excellent programming skills in object-oriented programming languages, such as C++, C#, or Java.
. Experience is working with databases.
. Strong multitasking, time management, team work, communication skills and analytical problem-solving skills.
About Innovative Scheduling:
. Developing data analytics, optimization, and simulation solutions in transportation and logistics.
. Turn-key solutions for complex decision problems that create significant value for clients.
. Use of cutting-edge operations research and computer science techniques.
. Clients include several Fortune 500 companies. Rapid growth expected in coming years.
. Highly educated, motivated, and talented team with 75+ professionals.
Why You Should Join Innovative Scheduling:
. Ability to work on interesting and challenging projects. Great learning opportunity.
. Very friendly and collegial atmosphere. Flat organization.
. Competitive salaries, profit sharing, and company equity. Excellent growth opportunities.
. Among the best places to live and raise a family. Wonderful weather. No state tax. Great schools.
How to Apply:
. Please send resume with cover letter to jobs@InnovativeScheduling.com.
*********************************************************************************************************************************
Ravindra K. Ahuja, Ph.D.
President & CEO, Innovative Scheduling
2153 SE Hawthorne Road, Gainesville, FL 32641, USA
ravi@InnovativeScheduling.com
**********************************************************
*
* 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/
*
**********************************************************
Innovative Scheduling (www.InnovativeScheduling.com) has several openings for Operations Researchers and Computer Scientists.
Job Requirements:
. M.S. or Ph.D. degree in Operations Research or Computer Science.
. Superb background in algorithm design and implementation and data structures.
. Excellent programming skills in object-oriented programming languages, such as C++, C#, or Java.
. Experience is working with databases.
. Strong multitasking, time management, team work, communication skills and analytical problem-solving skills.
About Innovative Scheduling:
. Developing data analytics, optimization, and simulation solutions in transportation and logistics.
. Turn-key solutions for complex decision problems that create significant value for clients.
. Use of cutting-edge operations research and computer science techniques.
. Clients include several Fortune 500 companies. Rapid growth expected in coming years.
. Highly educated, motivated, and talented team with 75+ professionals.
Why You Should Join Innovative Scheduling:
. Ability to work on interesting and challenging projects. Great learning opportunity.
. Very friendly and collegial atmosphere. Flat organization.
. Competitive salaries, profit sharing, and company equity. Excellent growth opportunities.
. Among the best places to live and raise a family. Wonderful weather. No state tax. Great schools.
How to Apply:
. Please send resume with cover letter to jobs@InnovativeScheduling.com.
*********************************************************************************************************************************
Ravindra K. Ahuja, Ph.D.
President & CEO, Innovative Scheduling
2153 SE Hawthorne Road, Gainesville, FL 32641, USA
ravi@InnovativeScheduling.com
**********************************************************
*
* 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, April 6, 2013
[DMANET] Last Mile: CENICS 2013 || August 25 - 31, 2013 - Barcelona, Spain
INVITATION:
=================
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results to CENICS 2013.
The submission deadline is April 19, 2013.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org
=================
============== CENICS 2013 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
CENICS 2013, The Sixth International Conference on Advances in Circuits, Electronics and Micro-electronics
August 25 - 31, 2013 - Barcelona, Spain
General page: http://www.iaria.org/conferences2013/CENICS13.html
Call for Papers: http://www.iaria.org/conferences2013/CfPCENICS13.html
- regular papers
- short papers (work in progress)
- posters
- idea
Submission page: http://www.iaria.org/conferences2013/SubmitCENICS13.html
Submission deadline: April 19, 2013
Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org
Print proceedings will be available via Curran Associates, Inc.: http://www.proceedings.com/9769.html
Articles will be archived in the free access ThinkMind Digital Library: http://www.thinkmind.org
Please note the Poster and Work in Progress options.
The topics suggested by the conference can be discussed in term of concepts, state of the art, research, standards, implementations, running experiments, applications, and industrial case studies. Authors are invited to submit complete unpublished papers, which are not under review in any other conference or journal in the following, but not limited to, topic areas.
All tracks are open to both research and industry contributions, in terms of Regular papers, Posters, Work in progress, Technical/marketing/business presentations, Demos, Tutorials, and Panels.
Before submission, please check and comply with the Editorial rules: http://www.iaria.org/editorialrules.html
CENICS 2013 Topics (topics and submission details: see CfP on the site)
Semiconductors and applications
Special semiconductors; Tunable bandgap semiconductors; Piezoelectricity; Polarization; Breakdown voltage; Superconductivity; Ferromagnetism; Biocompatibility; Chemical and thermal stability; Power amplification at very high frequencies; High temperature electronics; LEDs and lasers; Photodetectors; Transistors; Piezoelectric filters
Design, models and languages
Languages and models for specification and design of hardware; Robust, reliable and/or safe embedded electronics; Circuits/hardware description languages; Standards related to design languages; Processor and memory design; Embedded system design; VHDL-related standards; Electronic circuits modelling; Automatic generation of models; Quantitative analysis of models; Distributed CAD systems; Collaborative design based on Internet and WWW; Electronic systems design based on WWW; System- and high-level synthesis, HW/SW codesign
Signal processing circuits
Signal processing; High-speed signal processing; Multi-scale signal processing and imaging; Asynchronous circuits and systems; High frequency processing; Power and signal amplifiers; Parallel processing circuits; Equalization processing; Compression, transcoding, and applied signal processing
Arithmetic computational circuits
Operational arithmetic circuits; Basic arithmetic operations; Modular operations; Decimal-floating point operations; Multiple-precision operations; Squaring and exponentiation; Polynomial evaluations; Periodic functions; Operational approximations; Parallel decimal operations
Microelectronics
Components and circuits for communications; HMIC and MMIC design; Micro-electronics; Nano-electronics; Lasers and mini-lasers; Miniature devices; Low power electronics; Nano-scale electronics materials
Electronics technologies
Organic optoelectronic; Implantable electronics; Wearable electronics; Low power electronics; Electronic microarray technology and applications; RF and Microwave
Special circuits
Programmable circuits; Design of reconfigurable micro-chips; VLSI circuits design; Low-noise circuits; Digital modulators; Micro-sensors; Micro-antennas; Thermal circuits; Reconfigurable circuits; Dynamically reconfigurable processors; Oscillators; VCOs and phased-array transmitters
Consumer electronics
Home-oriented electronics; Biometric circuits; Home gateway; Home theater circuitry; Game systems; Interactive and directed programming electronics; Advanced DVD and CD; Interactive and directed programming electronics
Application-oriented electronics
Navigation electronics; Industrial electronics; Automotive electronics; Application-oriented electronics; Telemedicine and eHealth electronics; Biochip design for health science applications; Bio-systems and miniature instruments; Biosensors and biosensor networks; Industrial measurement electronics; Industrial control electronics; Energy distribution electronics; Energy saving and conversion circuits; Indoor and outdoor light control systems; Power electronics; Avionics electronics; Railways electronics; Vehicular electronics; Embedded electronics; Process industry electronics
--------------------------------
Committee: http://www.iaria.org/conferences2013/ComCENICS13.html
================================================
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
=================
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results to CENICS 2013.
The submission deadline is April 19, 2013.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org
=================
============== CENICS 2013 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
CENICS 2013, The Sixth International Conference on Advances in Circuits, Electronics and Micro-electronics
August 25 - 31, 2013 - Barcelona, Spain
General page: http://www.iaria.org/conferences2013/CENICS13.html
Call for Papers: http://www.iaria.org/conferences2013/CfPCENICS13.html
- regular papers
- short papers (work in progress)
- posters
- idea
Submission page: http://www.iaria.org/conferences2013/SubmitCENICS13.html
Submission deadline: April 19, 2013
Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org
Print proceedings will be available via Curran Associates, Inc.: http://www.proceedings.com/9769.html
Articles will be archived in the free access ThinkMind Digital Library: http://www.thinkmind.org
Please note the Poster and Work in Progress options.
The topics suggested by the conference can be discussed in term of concepts, state of the art, research, standards, implementations, running experiments, applications, and industrial case studies. Authors are invited to submit complete unpublished papers, which are not under review in any other conference or journal in the following, but not limited to, topic areas.
All tracks are open to both research and industry contributions, in terms of Regular papers, Posters, Work in progress, Technical/marketing/business presentations, Demos, Tutorials, and Panels.
Before submission, please check and comply with the Editorial rules: http://www.iaria.org/editorialrules.html
CENICS 2013 Topics (topics and submission details: see CfP on the site)
Semiconductors and applications
Special semiconductors; Tunable bandgap semiconductors; Piezoelectricity; Polarization; Breakdown voltage; Superconductivity; Ferromagnetism; Biocompatibility; Chemical and thermal stability; Power amplification at very high frequencies; High temperature electronics; LEDs and lasers; Photodetectors; Transistors; Piezoelectric filters
Design, models and languages
Languages and models for specification and design of hardware; Robust, reliable and/or safe embedded electronics; Circuits/hardware description languages; Standards related to design languages; Processor and memory design; Embedded system design; VHDL-related standards; Electronic circuits modelling; Automatic generation of models; Quantitative analysis of models; Distributed CAD systems; Collaborative design based on Internet and WWW; Electronic systems design based on WWW; System- and high-level synthesis, HW/SW codesign
Signal processing circuits
Signal processing; High-speed signal processing; Multi-scale signal processing and imaging; Asynchronous circuits and systems; High frequency processing; Power and signal amplifiers; Parallel processing circuits; Equalization processing; Compression, transcoding, and applied signal processing
Arithmetic computational circuits
Operational arithmetic circuits; Basic arithmetic operations; Modular operations; Decimal-floating point operations; Multiple-precision operations; Squaring and exponentiation; Polynomial evaluations; Periodic functions; Operational approximations; Parallel decimal operations
Microelectronics
Components and circuits for communications; HMIC and MMIC design; Micro-electronics; Nano-electronics; Lasers and mini-lasers; Miniature devices; Low power electronics; Nano-scale electronics materials
Electronics technologies
Organic optoelectronic; Implantable electronics; Wearable electronics; Low power electronics; Electronic microarray technology and applications; RF and Microwave
Special circuits
Programmable circuits; Design of reconfigurable micro-chips; VLSI circuits design; Low-noise circuits; Digital modulators; Micro-sensors; Micro-antennas; Thermal circuits; Reconfigurable circuits; Dynamically reconfigurable processors; Oscillators; VCOs and phased-array transmitters
Consumer electronics
Home-oriented electronics; Biometric circuits; Home gateway; Home theater circuitry; Game systems; Interactive and directed programming electronics; Advanced DVD and CD; Interactive and directed programming electronics
Application-oriented electronics
Navigation electronics; Industrial electronics; Automotive electronics; Application-oriented electronics; Telemedicine and eHealth electronics; Biochip design for health science applications; Bio-systems and miniature instruments; Biosensors and biosensor networks; Industrial measurement electronics; Industrial control electronics; Energy distribution electronics; Energy saving and conversion circuits; Indoor and outdoor light control systems; Power electronics; Avionics electronics; Railways electronics; Vehicular electronics; Embedded electronics; Process industry electronics
--------------------------------
Committee: http://www.iaria.org/conferences2013/ComCENICS13.html
================================================
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] SSTiC 2013: 3rd registration deadline 26 April
*********************************************************************
2013 INTERNATIONAL SUMMER SCHOOL ON TRENDS IN COMPUTING
SSTiC 2013
Tarragona, Spain
July 22-26, 2013
Organized by
Rovira i Virgili University
http://grammars.grlmc.com/SSTiC2013/
*********************************************************************
+++ 3rd registration deadline: April 26 +++
AIM:
SSTiC 2013 will be an open forum for the convergence of top class well
recognized computer scientists and people at the beginning of their research
career (typically PhD students) as well as consolidated researchers.
SSTiC 2013 will cover the whole spectrum of computer science by means of 74
six-hour courses dealing with hot topics at the frontiers of the field. By
actively participating, lecturers and attendees will share the idea of
scientific excellence as the main motto of their research work.
ADDRESSED TO:
Graduate students from around the world. There are no pre-requisites in
terms of the academic degree the attendee must hold. However, since there
will be several levels among the courses, in the description of some of them
reference may be made to specific knowledge background.
SSTiC 2013 is appropriate also for people more advanced in their career who
want to keep themselves updated on developments in the field.
Finally, senior researchers will find it fruitful to listen and discuss with
people who are main references of the diverse branches of computing
nowadays.
REGIME:
8 parallel sessions will be held during the whole event. Participants will
be able to freely choose the courses they will be willing to attend as well
as to move from one to another.
VENUE:
Palau Firal i de Congressos de Tarragona
Arquitecte Rovira, 2
43001 Tarragona
http://www.palaucongrestgna.com
COURSES AND PROFESSORS:
Divyakant Agrawal (Santa Barbara) [intermediate] Scalable Data Management in
Enterprise and Cloud Computing Infrastructures
Shun-ichi Amari (Riken) [introductory] Information Geometry and Its
Applications
James Anderson (Chapel Hill) [intermediate] Scheduling and Synchronization
in Real-Time Multicore Systems
Pierre Baldi (Irvine) [intermediate] Big Data Informatics Challenges and
Opportunities in the Life Sciences
Yoshua Bengio (Montréal) [introductory/intermediate] Deep Learning of
Representations
Stephen Brewster (Glasgow) [advanced] Multimodal Human-Computer Interaction
Bruno Buchberger (Linz) [introductory] Groebner Bases: An Algorithmic Method
for Multivariate Polynomial Systems. Foundations and Applications
Rajkumar Buyya (Melbourne) [intermediate] Cloud Computing
Jan Camenisch (IBM Zurich) [intermediate] Cryptography for Privacy
John M. Carroll (Penn State) [introductory] Usability Engineering and
Scenario-based Design
Jeffrey S. Chase (Duke) [intermediate] Trust Logic as an Enabler for Secure
Federated Systems
Larry S. Davis (College Park) [intermediate] Video Analysis of Human
Activities
Paul De Bra (Eindhoven) [intermediate] Adaptive Systems
Marco Dorigo (Brussels) [introductory] An Introduction to Swarm Intelligence
and Swarm Robotics
Paul Dourish (Irvine) [introductory] Ubiquitous Computing in a Social
Context
Max J. Egenhofer (Maine) [introductory/intermediate] Qualitative Spatial
Relations: Formalizations and Inferences
Richard M. Fujimoto (Georgia Tech) [introductory] Parallel and Distributed
Simulation
David Garlan (Carnegie Mellon) [advanced] Software Architecture: Past,
Present and Future
Mario Gerla (Los Angeles) [intermediate] Vehicle Cloud Computing
Georgios B. Giannakis (Minnesota) [advanced] Sparsity and Low Rank for
Robust Data Analytics and Networking
Ralph Grishman (New York) [intermediate] Information Extraction from Natural
Language
Mark Guzdial (Georgia Tech) [introductory] Computing Education Research:
What We Know about Learning and Teaching Computer Science
Francisco Herrera (Granada) [intermediate] Imbalanced Classification:
Current Approaches and Open Problems
Paul Hudak (Yale) [introductory] Euterpea: From Signals to Symphonies Using
Haskell
Syed Ali Jafar (Irvine) [intermediate] Interference Alignment
Niraj K. Jha (Princeton) [intermediate] FinFET Circuit Design
George Karypis (Minnesota) [introductory] Introduction to Parallel
Computing: Architectures, Algorithms, and Programming
Aggelos K. Katsaggelos (Northwestern) [intermediate/advanced] Sparsity-based
Advances in Image Processing
Arie E. Kaufman (Stony Brook) [advanced] Advances in Visualization
Carl Kesselman (Southern California) [intermediate] Biomedical Informatics
and Big Data
Hugo Krawczyk (IBM Research) [intermediate] An Introduction to the Design
and Analysis of Authenticated Key Exchange Protocols
Pierre L'Ecuyer (Montréal) [intermediate] Quasi-Monte Carlo Methods in
Simulation: Theory and Practice
Laks Lakshmanan (British Columbia) [intermediate/advanced] Information and
Influence Spread in Social Networks
Wenke Lee (Georgia Tech) [introductory] DNS-based Monitoring of Malware
Activities
Maurizio Lenzerini (Roma La Sapienza) [intermediate] Ontology-based Data
Integration
Ming C. Lin (Chapel Hill) [introductory/intermediate] Physically-based
Modeling and Simulation
Jane W.S. Liu (Academia Sinica) [intermediate] Critical Information and
Communication Technologies for Disaster Preparedness and Response
Nadia Magnenat-Thalmann (Nanyang Tech) [introductory] Modelling and
Animating Virtual Humans
Satoru Miyano (Tokyo) [intermediate] How to Hack Cancer Systems with
Computational Methods
Aloysius K. Mok (Austin) [intermediate] From Real-time Systems to
Cyber-physical Systems
Daniel Mossé (Pittsburgh) [intermediate] Asymmetric Multicore Management
Hermann Ney (Aachen) [intermediate/advanced] Probabilistic Modelling for
Natural Language Processing - with Applications to Speech Recognition,
Handwriting Recognition and Machine Translation
Cathleen A. Norris (North Texas) & Elliot Soloway (Ann Arbor) [introductory]
Primary & Secondary Educational Computing in the Age of Mobilism
Jeff Offutt (George Mason) [intermediate] Cutting Edge Research in
Engineering of Web Applications
David Padua (Urbana) [intermediate] Parallel Programming with Abstractions
Bijan Parsia (Manchester) [introductory] The Semantic Web: Conceptual and
Technical Foundations
Massoud Pedram (Southern California) [intermediate] Energy Efficient
Architectures and Information Processing Systems
Jian Pei (Simon Fraser) [intermediate/advanced] Mining Uncertain and
Probabilistic Data
Charles E. Perkins (FutureWei) [intermediate/advanced] Beyond 4G
Prabhakar Raghavan (Google) [introductory/intermediate] Web Search and
Advertising
Sudhakar M. Reddy (Iowa) [introductory] Design for Test and Test of Digital
VLSI Circuits
Phillip Rogaway (Davis) [introductory/intermediate] Provably Secure
Symmetric Encryption
Gustavo Rossi (La Plata) [intermediate] Topics in Model Driven Web
Engineering
Kaushik Roy (Purdue) [introductory/intermediate] Low-energy Computing
Robert Sargent (Syracuse) [introductory] Validating Models
Douglas C. Schmidt (Vanderbilt) [intermediate] Patterns and Frameworks for
Concurrent and Networked Software
Bart Selman (Cornell) [intermediate] Fast Large-scale Probabilistic and
Logical Inference Methods
Mubarak Shah (Central Florida) [intermediate/advanced] Visual Crowd
Surveillance
Ron Shamir (Tel Aviv) [introductory] Revealing Structure in Disease
Regulation and Networks
Micha Sharir (Tel Aviv) [introductory/intermediate] Geometric Arrangements
and Incidences: Algorithms, Combinatorics, and Algebra
Satinder Singh (Ann Arbor) [introductory/advanced] Reinforcement Learning:
On Machines Learning to Act from Experience
Dawn Xiaodong Song (Berkeley) [introductory] Selected Topics in Computer
Security
Daniel Thalmann (Nanyang Tech) [intermediate] Simulation of Individuals,
Groups and Crowds and Their Interaction with the User
Mike Thelwall (Wolverhampton) [introductory] Sentiment Strength Detection
for the Social Web
Julita Vassileva (Saskatchewan) [introductory/intermediate] Engaging Users
in Social Computing Systems
Philip Wadler (Edinburgh) [introductory] Topics in Lambda Calculus and Life
Yao Wang (Polytechnic New York) [introductory/advanced] Video Compression:
Fundamentals and Recent Development
Gio Wiederhold (Stanford) [introductory] Software Economics: How Do the
Results of the Intellectual Efforts Enter the Global Market Place
Ian H. Witten (Waikato) [introductory] Data Mining Using Weka
Limsoon Wong (National Singapore) [introductory/intermediate] The Use of
Context in Gene Expression and Proteomic Profile Analysis
Michael Wooldridge (Oxford) [introductory] Autonomous Agents and Multi-Agent
Systems
Ronald R. Yager (Iona) [introductory/intermediate] Fuzzy Sets and Soft
Computing
Philip S. Yu (Illinois Chicago) [advanced] Mining Big Data
Justin Zobel (Melbourne) [introductory/intermediate] Writing and Research
Skills for Computer Scientists
REGISTRATION:
It has to be done at
http://grammars.grlmc.com/SSTiC2013/Registration.php
Since a large number of attendees are expected and the capacity of the venue
is limited, registration requests will be processed on a first come first
served basis. The registration period will be closed when the capacity of
the venue will be complete.
FEES:
They are the same (a flat rate) for all people by the corresponding
deadline. They give the right to attend all courses.
ACCOMMODATION:
Information about accommodation is available on the website of the School.
CERTIFICATE:
Participants will be delivered a certificate of attendance.
IMPORTANT DATES:
Announcement of the programme: January 26, 2013
Six registration deadlines: February 26, March 26, April 26, May 26, June
26, July 26, 2013
QUESTIONS AND FURTHER INFORMATION:
Lilica Voicu:
florentinalilica.voicu@urv.cat
POSTAL ADDRESS:
SSTiC 2013
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain
Phone: +34-977-559543
Fax: +34-977-558386
ACKNOWLEDGEMENTS:
Ajuntament de Tarragona
Diputació de Tarragona
Universitat Rovira i Virgili
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
2013 INTERNATIONAL SUMMER SCHOOL ON TRENDS IN COMPUTING
SSTiC 2013
Tarragona, Spain
July 22-26, 2013
Organized by
Rovira i Virgili University
http://grammars.grlmc.com/SSTiC2013/
*********************************************************************
+++ 3rd registration deadline: April 26 +++
AIM:
SSTiC 2013 will be an open forum for the convergence of top class well
recognized computer scientists and people at the beginning of their research
career (typically PhD students) as well as consolidated researchers.
SSTiC 2013 will cover the whole spectrum of computer science by means of 74
six-hour courses dealing with hot topics at the frontiers of the field. By
actively participating, lecturers and attendees will share the idea of
scientific excellence as the main motto of their research work.
ADDRESSED TO:
Graduate students from around the world. There are no pre-requisites in
terms of the academic degree the attendee must hold. However, since there
will be several levels among the courses, in the description of some of them
reference may be made to specific knowledge background.
SSTiC 2013 is appropriate also for people more advanced in their career who
want to keep themselves updated on developments in the field.
Finally, senior researchers will find it fruitful to listen and discuss with
people who are main references of the diverse branches of computing
nowadays.
REGIME:
8 parallel sessions will be held during the whole event. Participants will
be able to freely choose the courses they will be willing to attend as well
as to move from one to another.
VENUE:
Palau Firal i de Congressos de Tarragona
Arquitecte Rovira, 2
43001 Tarragona
http://www.palaucongrestgna.com
COURSES AND PROFESSORS:
Divyakant Agrawal (Santa Barbara) [intermediate] Scalable Data Management in
Enterprise and Cloud Computing Infrastructures
Shun-ichi Amari (Riken) [introductory] Information Geometry and Its
Applications
James Anderson (Chapel Hill) [intermediate] Scheduling and Synchronization
in Real-Time Multicore Systems
Pierre Baldi (Irvine) [intermediate] Big Data Informatics Challenges and
Opportunities in the Life Sciences
Yoshua Bengio (Montréal) [introductory/intermediate] Deep Learning of
Representations
Stephen Brewster (Glasgow) [advanced] Multimodal Human-Computer Interaction
Bruno Buchberger (Linz) [introductory] Groebner Bases: An Algorithmic Method
for Multivariate Polynomial Systems. Foundations and Applications
Rajkumar Buyya (Melbourne) [intermediate] Cloud Computing
Jan Camenisch (IBM Zurich) [intermediate] Cryptography for Privacy
John M. Carroll (Penn State) [introductory] Usability Engineering and
Scenario-based Design
Jeffrey S. Chase (Duke) [intermediate] Trust Logic as an Enabler for Secure
Federated Systems
Larry S. Davis (College Park) [intermediate] Video Analysis of Human
Activities
Paul De Bra (Eindhoven) [intermediate] Adaptive Systems
Marco Dorigo (Brussels) [introductory] An Introduction to Swarm Intelligence
and Swarm Robotics
Paul Dourish (Irvine) [introductory] Ubiquitous Computing in a Social
Context
Max J. Egenhofer (Maine) [introductory/intermediate] Qualitative Spatial
Relations: Formalizations and Inferences
Richard M. Fujimoto (Georgia Tech) [introductory] Parallel and Distributed
Simulation
David Garlan (Carnegie Mellon) [advanced] Software Architecture: Past,
Present and Future
Mario Gerla (Los Angeles) [intermediate] Vehicle Cloud Computing
Georgios B. Giannakis (Minnesota) [advanced] Sparsity and Low Rank for
Robust Data Analytics and Networking
Ralph Grishman (New York) [intermediate] Information Extraction from Natural
Language
Mark Guzdial (Georgia Tech) [introductory] Computing Education Research:
What We Know about Learning and Teaching Computer Science
Francisco Herrera (Granada) [intermediate] Imbalanced Classification:
Current Approaches and Open Problems
Paul Hudak (Yale) [introductory] Euterpea: From Signals to Symphonies Using
Haskell
Syed Ali Jafar (Irvine) [intermediate] Interference Alignment
Niraj K. Jha (Princeton) [intermediate] FinFET Circuit Design
George Karypis (Minnesota) [introductory] Introduction to Parallel
Computing: Architectures, Algorithms, and Programming
Aggelos K. Katsaggelos (Northwestern) [intermediate/advanced] Sparsity-based
Advances in Image Processing
Arie E. Kaufman (Stony Brook) [advanced] Advances in Visualization
Carl Kesselman (Southern California) [intermediate] Biomedical Informatics
and Big Data
Hugo Krawczyk (IBM Research) [intermediate] An Introduction to the Design
and Analysis of Authenticated Key Exchange Protocols
Pierre L'Ecuyer (Montréal) [intermediate] Quasi-Monte Carlo Methods in
Simulation: Theory and Practice
Laks Lakshmanan (British Columbia) [intermediate/advanced] Information and
Influence Spread in Social Networks
Wenke Lee (Georgia Tech) [introductory] DNS-based Monitoring of Malware
Activities
Maurizio Lenzerini (Roma La Sapienza) [intermediate] Ontology-based Data
Integration
Ming C. Lin (Chapel Hill) [introductory/intermediate] Physically-based
Modeling and Simulation
Jane W.S. Liu (Academia Sinica) [intermediate] Critical Information and
Communication Technologies for Disaster Preparedness and Response
Nadia Magnenat-Thalmann (Nanyang Tech) [introductory] Modelling and
Animating Virtual Humans
Satoru Miyano (Tokyo) [intermediate] How to Hack Cancer Systems with
Computational Methods
Aloysius K. Mok (Austin) [intermediate] From Real-time Systems to
Cyber-physical Systems
Daniel Mossé (Pittsburgh) [intermediate] Asymmetric Multicore Management
Hermann Ney (Aachen) [intermediate/advanced] Probabilistic Modelling for
Natural Language Processing - with Applications to Speech Recognition,
Handwriting Recognition and Machine Translation
Cathleen A. Norris (North Texas) & Elliot Soloway (Ann Arbor) [introductory]
Primary & Secondary Educational Computing in the Age of Mobilism
Jeff Offutt (George Mason) [intermediate] Cutting Edge Research in
Engineering of Web Applications
David Padua (Urbana) [intermediate] Parallel Programming with Abstractions
Bijan Parsia (Manchester) [introductory] The Semantic Web: Conceptual and
Technical Foundations
Massoud Pedram (Southern California) [intermediate] Energy Efficient
Architectures and Information Processing Systems
Jian Pei (Simon Fraser) [intermediate/advanced] Mining Uncertain and
Probabilistic Data
Charles E. Perkins (FutureWei) [intermediate/advanced] Beyond 4G
Prabhakar Raghavan (Google) [introductory/intermediate] Web Search and
Advertising
Sudhakar M. Reddy (Iowa) [introductory] Design for Test and Test of Digital
VLSI Circuits
Phillip Rogaway (Davis) [introductory/intermediate] Provably Secure
Symmetric Encryption
Gustavo Rossi (La Plata) [intermediate] Topics in Model Driven Web
Engineering
Kaushik Roy (Purdue) [introductory/intermediate] Low-energy Computing
Robert Sargent (Syracuse) [introductory] Validating Models
Douglas C. Schmidt (Vanderbilt) [intermediate] Patterns and Frameworks for
Concurrent and Networked Software
Bart Selman (Cornell) [intermediate] Fast Large-scale Probabilistic and
Logical Inference Methods
Mubarak Shah (Central Florida) [intermediate/advanced] Visual Crowd
Surveillance
Ron Shamir (Tel Aviv) [introductory] Revealing Structure in Disease
Regulation and Networks
Micha Sharir (Tel Aviv) [introductory/intermediate] Geometric Arrangements
and Incidences: Algorithms, Combinatorics, and Algebra
Satinder Singh (Ann Arbor) [introductory/advanced] Reinforcement Learning:
On Machines Learning to Act from Experience
Dawn Xiaodong Song (Berkeley) [introductory] Selected Topics in Computer
Security
Daniel Thalmann (Nanyang Tech) [intermediate] Simulation of Individuals,
Groups and Crowds and Their Interaction with the User
Mike Thelwall (Wolverhampton) [introductory] Sentiment Strength Detection
for the Social Web
Julita Vassileva (Saskatchewan) [introductory/intermediate] Engaging Users
in Social Computing Systems
Philip Wadler (Edinburgh) [introductory] Topics in Lambda Calculus and Life
Yao Wang (Polytechnic New York) [introductory/advanced] Video Compression:
Fundamentals and Recent Development
Gio Wiederhold (Stanford) [introductory] Software Economics: How Do the
Results of the Intellectual Efforts Enter the Global Market Place
Ian H. Witten (Waikato) [introductory] Data Mining Using Weka
Limsoon Wong (National Singapore) [introductory/intermediate] The Use of
Context in Gene Expression and Proteomic Profile Analysis
Michael Wooldridge (Oxford) [introductory] Autonomous Agents and Multi-Agent
Systems
Ronald R. Yager (Iona) [introductory/intermediate] Fuzzy Sets and Soft
Computing
Philip S. Yu (Illinois Chicago) [advanced] Mining Big Data
Justin Zobel (Melbourne) [introductory/intermediate] Writing and Research
Skills for Computer Scientists
REGISTRATION:
It has to be done at
http://grammars.grlmc.com/SSTiC2013/Registration.php
Since a large number of attendees are expected and the capacity of the venue
is limited, registration requests will be processed on a first come first
served basis. The registration period will be closed when the capacity of
the venue will be complete.
FEES:
They are the same (a flat rate) for all people by the corresponding
deadline. They give the right to attend all courses.
ACCOMMODATION:
Information about accommodation is available on the website of the School.
CERTIFICATE:
Participants will be delivered a certificate of attendance.
IMPORTANT DATES:
Announcement of the programme: January 26, 2013
Six registration deadlines: February 26, March 26, April 26, May 26, June
26, July 26, 2013
QUESTIONS AND FURTHER INFORMATION:
Lilica Voicu:
florentinalilica.voicu@urv.cat
POSTAL ADDRESS:
SSTiC 2013
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain
Phone: +34-977-559543
Fax: +34-977-558386
ACKNOWLEDGEMENTS:
Ajuntament de Tarragona
Diputació de Tarragona
Universitat Rovira i Virgili
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Friday, April 5, 2013
[DMANET] PhD position in TCS at KTH Royal Institute of Technology
The Theory Group at KTH Royal Institute of Technology invites applications
for a PhD position in Theoretical Computer Science.
for a PhD position in Theoretical Computer Science.
KTH Royal Institute of Technology is the leading technical university in
Sweden, with education and research spanning from natural sciences to all
branches of engineering including architecture, industrial management and
urban planning. The Theory Group at KTH (http://www.csc.kth.se/tcs/)
offers a strong research environment covering a wide range of research
topics such as complexity theory and approximation algorithms, computer
and network security, cryptography, formal methods and natural language
processing. The group has a consistent track record of publishing
regularly in the leading theoretical computer science conferences and
journals worldwide, and the research conducted here has attracted numerous
international awards and grants in recent years.
We are seeking a PhD student for the research project "Understanding the
Hardness of Theorem Proving" in the area of proof complexity with
connections to SAT solving.
Proving formulas in propositional logic is a problem of immense importance
both theoretically and practically. On the one hand, this computational
task is believed to be intractable in general, and deciding whether this
is so is one of the famous million dollar Millennium Problems (the P vs.
NP problem). On the other hand, today so-called SAT solvers are routinely
used to solve large-scale real-world problem instances with millions of
variables.
Proof complexity studies formal systems for reasoning about logic
formulas. This field has deep connections to fundamental questions in
computational complexity, but another important motivation is the
connection to SAT solving. All SAT solvers use some kind of method or
system in which proofs are searched for, and proof complexity analyses the
potential and limitations of such proof systems (and thereby of the
algorithms using them).
This project aims to advance the frontiers of proof complexity, and to
leverage this research to shed light on questions related to SAT solving.
This could potentially also involve research in related areas such as, for
example, circuit complexity, communication complexity, or hardness of
approximation.
The project is led by Jakob Nordström (http://www.csc.kth.se/~jakobn) and
is financed by a Breakthrough Research Grant from the Swedish Research
Council and a Starting Independent Researcher Grant from the European
Research Council. The group currently consists of one postdoctoral
researcher and two PhD students (in addition to the project leader).
Travel funding is included, and the group also receives short-term and
long-term visitors on a regular basis.
This is a full-time employed position, normally for five years including
20% teaching, with salary according to KTH PhD student regulations
(internationally very competitive). The successful candidate is expected
to start at the latest in August 2013, although this is to some extent
negotiable.
The application deadline is May 5, 2013, but candidates are encouraged to
apply right away since applications are reviewed on a continuous basis.
See http://www.csc.kth.se/~jakobn/openings/D-2013-0301-Eng.php for the
full, formal announcement with more information and instructions for how
to apply. Informal enquiries about this position are welcome and may be
sent to Jakob Nordstrom.
**********************************************************
*
* 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] Last Mile: MESH 2013 || August 25 - 31, 2013 - Barcelona, Spain
INVITATION:
=================
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to
submit and publish original scientific results to MESH 2013.
The submission deadline is April 19, 2013.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals:
http://www.iariajournals.org
=================
============== MESH 2013 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
MESH 2013, The Sixth International Conference on Advances in Mesh Networks
August 25 - 31, 2013 - Barcelona, Spain
General page: http://www.iaria.org/conferences2013/MESH13.html
Call for Papers: http://www.iaria.org/conferences2013/CfPMESH13.html
- regular papers
- short papers (work in progress)
- posters
- ideas
Submission page: http://www.iaria.org/conferences2013/SubmitMESH13.html
Submission deadline: April 19, 2013
Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org
Print proceedings will be available via Curran Associates, Inc.: http://www.proceedings.com/9769.html
Articles will be archived in the free access ThinkMind Digital Library: http://www.thinkmind.org
Please note the Poster and Work in Progress options.
The topics suggested by the conference can be discussed in term of concepts, state of the art, research,
standards, implementations, running experiments, applications, and industrial case studies. Authors are
invited to submit complete unpublished papers, which are not under review in any other conference or journal
in the following, but not limited to, topic areas.
All tracks are open to both research and industry contributions, in terms of Regular papers, Posters, Work in
progress, Technical/marketing/business presentations, Demos, Tutorials, and Panels.
Before submission, please check and comply with the Editorial rules: http://www.iaria.org/editorialrules.html
MESH 2013 Topics (topics and submission details: see CfP on the site)
Architectures and algorithms
Frameworks; Wireless interference models; Topology models; Large-scale networks; Real-time and non-real-time
communications; Channel assignment schemes; Resource allocation; Centralized and distributed scheduling;
Performance; Static/mobile scenarios; Access control; Service differentiation; Security, Privacy, and Trust
Protocols
Protocol interference models; Access and routing protocols; Single-channel multihop / multi-channel routing;
Joint routing and scheduling; Routing metrics; Multichannel routing; Quality of Services routing;
Multimedia-centric routing; Fast-link quality metrics; Bandwidth estimation; Cross-layer multicast routing;
QoS-based access protocols for mesh networks; Multi-channel access protocols
Applications
Multimedia services; Home IPTV; WiMax; Broadband home networking communications; Emergency/disaster;
Telemedicine and e-health; Smart buildings; Broadband Internet access
-------------------------
Committee: http://www.iaria.org/conferences2013/ComMESH13.html
================================================
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
=================
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to
submit and publish original scientific results to MESH 2013.
The submission deadline is April 19, 2013.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals:
http://www.iariajournals.org
=================
============== MESH 2013 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
MESH 2013, The Sixth International Conference on Advances in Mesh Networks
August 25 - 31, 2013 - Barcelona, Spain
General page: http://www.iaria.org/conferences2013/MESH13.html
Call for Papers: http://www.iaria.org/conferences2013/CfPMESH13.html
- regular papers
- short papers (work in progress)
- posters
- ideas
Submission page: http://www.iaria.org/conferences2013/SubmitMESH13.html
Submission deadline: April 19, 2013
Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org
Print proceedings will be available via Curran Associates, Inc.: http://www.proceedings.com/9769.html
Articles will be archived in the free access ThinkMind Digital Library: http://www.thinkmind.org
Please note the Poster and Work in Progress options.
The topics suggested by the conference can be discussed in term of concepts, state of the art, research,
standards, implementations, running experiments, applications, and industrial case studies. Authors are
invited to submit complete unpublished papers, which are not under review in any other conference or journal
in the following, but not limited to, topic areas.
All tracks are open to both research and industry contributions, in terms of Regular papers, Posters, Work in
progress, Technical/marketing/business presentations, Demos, Tutorials, and Panels.
Before submission, please check and comply with the Editorial rules: http://www.iaria.org/editorialrules.html
MESH 2013 Topics (topics and submission details: see CfP on the site)
Architectures and algorithms
Frameworks; Wireless interference models; Topology models; Large-scale networks; Real-time and non-real-time
communications; Channel assignment schemes; Resource allocation; Centralized and distributed scheduling;
Performance; Static/mobile scenarios; Access control; Service differentiation; Security, Privacy, and Trust
Protocols
Protocol interference models; Access and routing protocols; Single-channel multihop / multi-channel routing;
Joint routing and scheduling; Routing metrics; Multichannel routing; Quality of Services routing;
Multimedia-centric routing; Fast-link quality metrics; Bandwidth estimation; Cross-layer multicast routing;
QoS-based access protocols for mesh networks; Multi-channel access protocols
Applications
Multimedia services; Home IPTV; WiMax; Broadband home networking communications; Emergency/disaster;
Telemedicine and e-health; Smart buildings; Broadband Internet access
-------------------------
Committee: http://www.iaria.org/conferences2013/ComMESH13.html
================================================
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Postdoc position in TCS at KTH Royal Institute of Technology
The Theory Group at KTH Royal Institute of Technology invites applications
for a postdoctoral position in Theoretical Computer Science.
KTH is the leading technical university in Sweden, with education and
research spanning from natural sciences to all branches of engineering
including architecture, industrial management and urban planning. The
Theory Group at KTH (http://www.csc.kth.se/tcs/) offers a strong research
environment covering a wide range of research topics such as complexity
theory and approximation algorithms, computer and network security,
cryptography, formal methods and natural language processing. The group
has a consistent track record of publishing regularly in the leading
theoretical computer science conferences and journals worldwide, and the
research conducted here has attracted numerous international awards and
grants in recent years.
We are seeking a postdoctoral researcher in Theoretical Computer Science.
This position is funded by the research project "Understanding the
Hardness of Theorem Proving" in the area of proof complexity with
connections to SAT solving, and much of the activities of the research
group revolve around these themes. However, proof complexity has also
turned out to have deep, and sometimes surprising, connections to other
areas such as, e.g., circuit complexity, communication complexity, and
hardness of approximation, and therefore researchers in these or other
related areas are also of interest.
The project is led by Jakob Nordström (http://www.csc.kth.se/~jakobn) and
is financed by a Breakthrough Research Grant from the Swedish Research
Council and a Starting Independent Researcher Grant from the European
Research Council. A more detailed description of the project can be found
at http://www.csc.kth.se/~jakobn/project-proofcplx. The group currently
consists of one postdoctoral researcher and two PhD students (in addition
to the project leader). Travel funding is included, and the group also
receives short-term and long-term visitors on a regular basis.
This is a full-time employed position for one year with a possible
one-year extension. The successful candidate is expected to start at the
latest in August-September 2013, although this is to some extent
negotiable.
The application deadline is May 5, 2013, but candidates are encouraged to
apply right away since applications are reviewed on a continuous basis.
More information and instructions how to apply can be found at
http://www.csc.kth.se/~jakobn/openings/D-2013-0315-Eng.php. Informal
enquiries are welcome and may be sent to Jakob Nordstrom.
for a postdoctoral position in Theoretical Computer Science.
KTH is the leading technical university in Sweden, with education and
research spanning from natural sciences to all branches of engineering
including architecture, industrial management and urban planning. The
Theory Group at KTH (http://www.csc.kth.se/tcs/) offers a strong research
environment covering a wide range of research topics such as complexity
theory and approximation algorithms, computer and network security,
cryptography, formal methods and natural language processing. The group
has a consistent track record of publishing regularly in the leading
theoretical computer science conferences and journals worldwide, and the
research conducted here has attracted numerous international awards and
grants in recent years.
We are seeking a postdoctoral researcher in Theoretical Computer Science.
This position is funded by the research project "Understanding the
Hardness of Theorem Proving" in the area of proof complexity with
connections to SAT solving, and much of the activities of the research
group revolve around these themes. However, proof complexity has also
turned out to have deep, and sometimes surprising, connections to other
areas such as, e.g., circuit complexity, communication complexity, and
hardness of approximation, and therefore researchers in these or other
related areas are also of interest.
The project is led by Jakob Nordström (http://www.csc.kth.se/~jakobn) and
is financed by a Breakthrough Research Grant from the Swedish Research
Council and a Starting Independent Researcher Grant from the European
Research Council. A more detailed description of the project can be found
at http://www.csc.kth.se/~jakobn/project-proofcplx. The group currently
consists of one postdoctoral researcher and two PhD students (in addition
to the project leader). Travel funding is included, and the group also
receives short-term and long-term visitors on a regular basis.
This is a full-time employed position for one year with a possible
one-year extension. The successful candidate is expected to start at the
latest in August-September 2013, although this is to some extent
negotiable.
The application deadline is May 5, 2013, but candidates are encouraged to
apply right away since applications are reviewed on a continuous basis.
More information and instructions how to apply can be found at
http://www.csc.kth.se/~jakobn/openings/D-2013-0315-Eng.php. Informal
enquiries are welcome and may be sent to Jakob Nordstrom.
[DMANET] Postdoc position in TCS at KTH Royal Institute of Technology
The Theory Group at KTH Royal Institute of Technology invites applications
for a postdoctoral position in Theoretical Computer Science.
for a postdoctoral position in Theoretical Computer Science.
KTH is the leading technical university in Sweden, with education and
research spanning from natural sciences to all branches of engineering
including architecture, industrial management and urban planning. The
Theory Group at KTH (http://www.csc.kth.se/tcs/) offers a strong research
environment covering a wide range of research topics such as complexity
theory and approximation algorithms, computer and network security,
cryptography, formal methods and natural language processing. The group
has a consistent track record of publishing regularly in the leading
theoretical computer science conferences and journals worldwide, and the
research conducted here has attracted numerous international awards and
grants in recent years.
We are seeking a postdoctoral researcher in Theoretical Computer Science.
This position is funded by the research project "Understanding the
Hardness of Theorem Proving" in the area of proof complexity with
connections to SAT solving, and much of the activities of the research
group revolve around these themes. However, proof complexity has also
turned out to have deep, and sometimes surprising, connections to other
areas such as, e.g., circuit complexity, communication complexity, and
hardness of approximation, and therefore researchers in these or other
related areas are also of interest.
The project is led by Jakob Nordström (http://www.csc.kth.se/~jakobn) and
is financed by a Breakthrough Research Grant from the Swedish Research
Council and a Starting Independent Researcher Grant from the European
Research Council. A more detailed description of the project can be found
at http://www.csc.kth.se/~jakobn/project-proofcplx. The group currently
consists of one postdoctoral researcher and two PhD students (in addition
to the project leader). Travel funding is included, and the group also
receives short-term and long-term visitors on a regular basis.
This is a full-time employed position for one year with a possible
one-year extension. The successful candidate is expected to start at the
latest in August-September 2013, although this is to some extent
negotiable.
The application deadline is May 5, 2013, but candidates are encouraged to
apply right away since applications are reviewed on a continuous basis.
More information and instructions how to apply can be found at
http://www.csc.kth.se/~jakobn/openings/D-2013-0315-Eng.php. Informal
enquiries are welcome and may be sent to Jakob Nordstrom.
**********************************************************
*
* 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] Open PhD position at BTU Cottbus (in German)
An der Brandenburgischen Technischen Universität Cottbus ist am
Lehrstuhl für Diskrete Mathematik und Grundlagen der Informatik ab
sofort oder nach Vereinbarung die Stelle einer/eines
wissenschaftlichen Mitarbeiterin/Mitarbeiters
vorerst befristet für 3 Jahre
(Tarif: E 13 TV-L)
zu besetzen.
Aufgabengebiet: wissenschaftliche Dienstleistungen in Lehre und
Forschung. Forschungsschwerpunkte der Arbeitsgruppe sind Probleme aus
den Bereichen strukturelle Graphentheorie, Graphenalgorithmen sowie
Kombinatorische Optimierung. Besonderes Interesse besteht hierbei an
Algorithmen für Netzwerkflüsse, Approximationsalgorithmen und
Anwendungen insbesondere im Verkehr. Es besteht die Möglichkeit zur
Promotion.
Voraussetzungen: überdurchschnittlich abgeschlossenes
wissenschaftliches Hochschulstudium der Mathematik,
Wirtschaftsmathematik oder Informatik oder einer vergleichbaren
Fachrichtung. Wünschenswert sind Programmierkenntnisse und fundierte
Kenntnisse in den Bereichen Kombinatorische Optimierung,
Graphentheorie und -algorithmen sowie damit verwandten Gebieten. Da
die Betreuung von Lehrveranstaltungen zu den Aufgaben der zukünftigen
Stelleninhaberin bzw. des künftigen Stelleninhabers gehört, sind
außerdem gute Deutschkenntnisse erforderlich.
Nähere Auskünfte erteilt Ekkehard Köhler (ekoehler@math.tu-cottbus.de,
+49 355 69 2933).
Die BTU Cottbus ist besonders um die Einstellung und Förderung von
Wissenschaftlerinnen bemüht und bittet daher entsprechend
qualifizierte Frauen nachdrücklich, sich zu bewerben.
Schwerbehinderte Bewerberinnen und Bewerber werden bei gleicher
Eignung bevorzugt berücksichtigt.
Bewerbungen unter Angabe der Kennziffer 22/13 richten Sie bitte bis
zum 30.04.2013 an den Dekan der Fakultät Mathematik,
Naturwissenschaften und Informatik, BTU Cottbus, Postfach 101344,
03013 Cottbus.
**********************************************************
*
* 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/
*
**********************************************************
Lehrstuhl für Diskrete Mathematik und Grundlagen der Informatik ab
sofort oder nach Vereinbarung die Stelle einer/eines
wissenschaftlichen Mitarbeiterin/Mitarbeiters
vorerst befristet für 3 Jahre
(Tarif: E 13 TV-L)
zu besetzen.
Aufgabengebiet: wissenschaftliche Dienstleistungen in Lehre und
Forschung. Forschungsschwerpunkte der Arbeitsgruppe sind Probleme aus
den Bereichen strukturelle Graphentheorie, Graphenalgorithmen sowie
Kombinatorische Optimierung. Besonderes Interesse besteht hierbei an
Algorithmen für Netzwerkflüsse, Approximationsalgorithmen und
Anwendungen insbesondere im Verkehr. Es besteht die Möglichkeit zur
Promotion.
Voraussetzungen: überdurchschnittlich abgeschlossenes
wissenschaftliches Hochschulstudium der Mathematik,
Wirtschaftsmathematik oder Informatik oder einer vergleichbaren
Fachrichtung. Wünschenswert sind Programmierkenntnisse und fundierte
Kenntnisse in den Bereichen Kombinatorische Optimierung,
Graphentheorie und -algorithmen sowie damit verwandten Gebieten. Da
die Betreuung von Lehrveranstaltungen zu den Aufgaben der zukünftigen
Stelleninhaberin bzw. des künftigen Stelleninhabers gehört, sind
außerdem gute Deutschkenntnisse erforderlich.
Nähere Auskünfte erteilt Ekkehard Köhler (ekoehler@math.tu-cottbus.de,
+49 355 69 2933).
Die BTU Cottbus ist besonders um die Einstellung und Förderung von
Wissenschaftlerinnen bemüht und bittet daher entsprechend
qualifizierte Frauen nachdrücklich, sich zu bewerben.
Schwerbehinderte Bewerberinnen und Bewerber werden bei gleicher
Eignung bevorzugt berücksichtigt.
Bewerbungen unter Angabe der Kennziffer 22/13 richten Sie bitte bis
zum 30.04.2013 an den Dekan der Fakultät Mathematik,
Naturwissenschaften und Informatik, BTU Cottbus, Postfach 101344,
03013 Cottbus.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Thursday, April 4, 2013
[DMANET] Final CfP: DMS2013 -- International Conference on Distributed Multimedia Systems
Dear colleague, apologies for multiple copies. The submission date for
DMS is in just over three weeks time.
-----------------------------------------
The 19th International Conference on Distributed Multimedia Systems
Holiday Inn, Brighton - Seafront, United Kingdom
August 8 - August 10, 2013
http://www.ksi.edu/seke/dms13.html
With today's proliferation of multimedia data (e.g., images, animations,
video, and sound), comes the challenge of using such information to
facilitate data analysis, modeling, presentation, interaction and
programming, particularly for end-users who are domain experts, but not
IT professionals. The main theme of the 19th International Conference on
Distributed Multimedia Systems (DMS'2013) is multimedia inspired
computing. The conference organizers seek contributions of high quality
papers, panels or tutorials, addressing any novel aspect of computing
(e.g., programming language or environment, data analysis, scientific
visualization, etc.) that significantly benefits from the
incorporation/integration of multimedia data (e.g., visual, audio, pen,
voice, image, etc.), for presentation at the conference and publication
in the proceedings. Both research and case study papers or
demonstrations describing results in research area as well as
industrial development cases and experiences are solicited. The use of
prototypes and demonstration video for presentations is encouraged.
Special issue of Journals:
The DMS conference is closely coordinated with the International Journal
of Software Engineering and Knowledge Engineering, the Journal of
Visual Languages and Computing and the International Journal of
Distance Education Technologies. Usually the best ranked papers from
the conference, after rigorous reviews, extensive revisions and further
enhancements, will appear in one or more special issues of the above
journals. Papers suggested for the special issue(s) will be reviewed by
external reviewers following the standard procedure of review
stipulated by the respective journal.
Topics:
Distributed Multimedia Technology
media coding, acquisition and standards
QoS and Quality of Experience control
digital rights management and conditional access solutions
privacy and security issues
mobile devices and wireless networks
mobile intelligent applications
sensor networks, environment control and management
Distributed Multimedia Models and Systems
human-computer interaction
languages for distributed multimedia
multimedia software engineering issues
semantic computing and processing
media grid computing, cloud and virtualization
web services and multi-agent systems
multimedia databases and information systems
multimedia indexing and retrieval systems
multimedia and cross media authoring
Applications of Distributed Multimedia Systems
collaborative and social multimedia systems and solutions
humanities and cultural heritage applications, management and fruition
multimedia preservation
cultural heritage preservation, management and fruition
distance and lifelong learning
emergency and safety management
e-commerce and e-government applications
health care management and disability assistance
intelligent multimedia computing
internet multimedia computing
virtual, mixed and augmented reality
user profiling, reasoning and recommendations
Information for Authors:
Papers must be written in English. An electronic version (Postscript,
PDF, or MS Word format) of the full paper should be submitted using the
following URL: http://conf.ksi.edu/dms2013/submit/SubmitPaper.php
(submission site will be open Jan 1, 2013). Manuscript must include a
200-word abstract and no more than 6 pages of 2-column text (include
figures and references). All submissions must not be published or under
consideration for publication in a journal or in a conference with
proceedings. Papers will be evaluated based on originality,
significance, technical soundness and clarify of exposition. Depending
upon the results of evaluation a paper may be accepted as regular paper
(6 pages), short paper (4 pages) or poster (poster presentation only).
Hotel Information:
The DMS 2013 Conference will be held at the Holiday Inn, Brighton -
Seafront, United Kingdom. See: http://hibrighton.com
A special daily rate of 99 pounds, VAT included, will be available
during the conference period. This rate includes breakfast. For two
persons, the rate will be 105 pounds. To make reservation at the
special rate, please go to:
http://www.holidayinn.com/hotels/us/en/brighton/bhtsf/hoteldetail?groupCode=EWS
Keynote Speaker:
Professor Roberto Laurini, Professor Emeritus of the University of Lyon,
France and KSI Fellow, will deliver a keynote speech at DMS2013.
Workshops and Special Sessions:
The following workshops and special sessions are being planned:
International Workshop on Distance Education Technology (DET)
International Workshop on Visual Languages and Computing (VLC)
Please contact the conference program co-chairs if you are interested in
organizing a workshop or a special session. A one-page proposal with the
following items is required:
Title of the workshop/special session
Name of the organizer(s)
A list of program committee members (reviewers)
E-mail address of the lead organizer
A brief description of the theme
Conference Contact Information:
DMS 2013 Conference Secretariat
Knowledge Systems Institute
3420 Main Street
Skokie, IL 60076 USA
Tel: 847-679-3135
Fax: 847-679-3166
E-mail: dms13@ksi.edu
Important Dates:
Paper submission due: April 29, 2013
Notification of acceptance: May 31, 2013
Camera-ready copy: June 15, 2013
Early conference registration due: June 15, 2013
Conference organized by:
Knowledge Systems Institute, USA
Conference listed by:
DBLP
INSPEC
Compendex
Library of Congress
AllConferences.com
WikiCFP
--
Dr Jim Burton
Lecturer in Computing
School of Computing, Engineering and Mathematics
University of Brighton
___________________________________________________________
This email has been scanned by MessageLabs' Email Security
System on behalf of the University of Brighton.
For more information see http://www.brighton.ac.uk/is/spam/
___________________________________________________________
**********************************************************
*
* 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/
*
**********************************************************
DMS is in just over three weeks time.
-----------------------------------------
The 19th International Conference on Distributed Multimedia Systems
Holiday Inn, Brighton - Seafront, United Kingdom
August 8 - August 10, 2013
http://www.ksi.edu/seke/dms13.html
With today's proliferation of multimedia data (e.g., images, animations,
video, and sound), comes the challenge of using such information to
facilitate data analysis, modeling, presentation, interaction and
programming, particularly for end-users who are domain experts, but not
IT professionals. The main theme of the 19th International Conference on
Distributed Multimedia Systems (DMS'2013) is multimedia inspired
computing. The conference organizers seek contributions of high quality
papers, panels or tutorials, addressing any novel aspect of computing
(e.g., programming language or environment, data analysis, scientific
visualization, etc.) that significantly benefits from the
incorporation/integration of multimedia data (e.g., visual, audio, pen,
voice, image, etc.), for presentation at the conference and publication
in the proceedings. Both research and case study papers or
demonstrations describing results in research area as well as
industrial development cases and experiences are solicited. The use of
prototypes and demonstration video for presentations is encouraged.
Special issue of Journals:
The DMS conference is closely coordinated with the International Journal
of Software Engineering and Knowledge Engineering, the Journal of
Visual Languages and Computing and the International Journal of
Distance Education Technologies. Usually the best ranked papers from
the conference, after rigorous reviews, extensive revisions and further
enhancements, will appear in one or more special issues of the above
journals. Papers suggested for the special issue(s) will be reviewed by
external reviewers following the standard procedure of review
stipulated by the respective journal.
Topics:
Distributed Multimedia Technology
media coding, acquisition and standards
QoS and Quality of Experience control
digital rights management and conditional access solutions
privacy and security issues
mobile devices and wireless networks
mobile intelligent applications
sensor networks, environment control and management
Distributed Multimedia Models and Systems
human-computer interaction
languages for distributed multimedia
multimedia software engineering issues
semantic computing and processing
media grid computing, cloud and virtualization
web services and multi-agent systems
multimedia databases and information systems
multimedia indexing and retrieval systems
multimedia and cross media authoring
Applications of Distributed Multimedia Systems
collaborative and social multimedia systems and solutions
humanities and cultural heritage applications, management and fruition
multimedia preservation
cultural heritage preservation, management and fruition
distance and lifelong learning
emergency and safety management
e-commerce and e-government applications
health care management and disability assistance
intelligent multimedia computing
internet multimedia computing
virtual, mixed and augmented reality
user profiling, reasoning and recommendations
Information for Authors:
Papers must be written in English. An electronic version (Postscript,
PDF, or MS Word format) of the full paper should be submitted using the
following URL: http://conf.ksi.edu/dms2013/submit/SubmitPaper.php
(submission site will be open Jan 1, 2013). Manuscript must include a
200-word abstract and no more than 6 pages of 2-column text (include
figures and references). All submissions must not be published or under
consideration for publication in a journal or in a conference with
proceedings. Papers will be evaluated based on originality,
significance, technical soundness and clarify of exposition. Depending
upon the results of evaluation a paper may be accepted as regular paper
(6 pages), short paper (4 pages) or poster (poster presentation only).
Hotel Information:
The DMS 2013 Conference will be held at the Holiday Inn, Brighton -
Seafront, United Kingdom. See: http://hibrighton.com
A special daily rate of 99 pounds, VAT included, will be available
during the conference period. This rate includes breakfast. For two
persons, the rate will be 105 pounds. To make reservation at the
special rate, please go to:
http://www.holidayinn.com/hotels/us/en/brighton/bhtsf/hoteldetail?groupCode=EWS
Keynote Speaker:
Professor Roberto Laurini, Professor Emeritus of the University of Lyon,
France and KSI Fellow, will deliver a keynote speech at DMS2013.
Workshops and Special Sessions:
The following workshops and special sessions are being planned:
International Workshop on Distance Education Technology (DET)
International Workshop on Visual Languages and Computing (VLC)
Please contact the conference program co-chairs if you are interested in
organizing a workshop or a special session. A one-page proposal with the
following items is required:
Title of the workshop/special session
Name of the organizer(s)
A list of program committee members (reviewers)
E-mail address of the lead organizer
A brief description of the theme
Conference Contact Information:
DMS 2013 Conference Secretariat
Knowledge Systems Institute
3420 Main Street
Skokie, IL 60076 USA
Tel: 847-679-3135
Fax: 847-679-3166
E-mail: dms13@ksi.edu
Important Dates:
Paper submission due: April 29, 2013
Notification of acceptance: May 31, 2013
Camera-ready copy: June 15, 2013
Early conference registration due: June 15, 2013
Conference organized by:
Knowledge Systems Institute, USA
Conference listed by:
DBLP
INSPEC
Compendex
Library of Congress
AllConferences.com
WikiCFP
--
Dr Jim Burton
Lecturer in Computing
School of Computing, Engineering and Mathematics
University of Brighton
___________________________________________________________
This email has been scanned by MessageLabs' Email Security
System on behalf of the University of Brighton.
For more information see http://www.brighton.ac.uk/is/spam/
___________________________________________________________
**********************************************************
*
* 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] Combinatorics, Algebra and More: A Conference in Celebration of Peter Cameron
Dear Colleagues,
Queen Mary, University of London, is hosting a conference "Combinatorics, Algebra
and More" to mark Peter Cameron's retirement and to celebrate his many mathematical
achievements (so far). The meeting runs from Monday 8th to Wednesday 10th July 2013,
with participants arriving on Sunday 9th July. Visit
http://www.maths.qmul.ac.uk/~camconf/
for more information.
Mark Jerrum, on behalf of conference organisers David Ellis and Leonard Soicher.
**********************************************************
*
* 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/
*
**********************************************************
Queen Mary, University of London, is hosting a conference "Combinatorics, Algebra
and More" to mark Peter Cameron's retirement and to celebrate his many mathematical
achievements (so far). The meeting runs from Monday 8th to Wednesday 10th July 2013,
with participants arriving on Sunday 9th July. Visit
http://www.maths.qmul.ac.uk/~camconf/
for more information.
Mark Jerrum, on behalf of conference organisers David Ellis and Leonard Soicher.
**********************************************************
*
* 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] Final CfP: VLC 2013 -- International Workshop on Visual Languages and Computing
Dear colleague, apologies for multiple copies. The submission date for
VLC is in just over three weeks time.
--------------------------------------------------
2013 International Workshop on Visual Languages and Computing
Holiday Inn, Brighton - Seafront, United Kingdom, August 8 to 10, 2013
http://www.ksi.edu/seke/vlc13cfp.html
SCOPE
Visual languages mediate human and computer interaction. For some visual
languages this mediation is straightforward; using a mouse to access a
drop-down menu is well-known to computer users. For others, this
mediation can be enriched via sketch and gesture recognition. This is
made possible by advances in commodity hardware. More formal visual
languages allow experts to accurately specify complex systems, such as
software architecture or chemical molecules. A visual language can also
encompass complex human-computer interaction such as navigating a set of
semantically linked videos. Indeed, precision of semantics underlies
visual languages and computation.
Aspects of visual computing are multi-faceted in goals that are to be
achieved during information or language design. The following represents
a short list of qualities that are of importance to the study within
visual computing: efficiency, aesthetics, pleasure, emotion, engagement,
immersion, collaboration, and culture. Aspects of art, engineering, and
science play key roles where certain practitioners focus on design and
engineering of visual interactions whereas others analyze and study
these interactions (i.e., science).
The International Workshop on Visual Languages and Computing will
explore these issues, and will be held in conjunction with the 2013
International Conference of Distributed Multimedia Systems
(http://www.ksi.edu/seke/dms13.html).
For this year's special theme we request high-quality submissions on
visual languages that increase the efficacy of various tasks, or on the
effectiveness of visual languages themselves. In addition to the special
theme, we continue to solicit papers on all aspects and approaches to
visual languages and computing, including interactive visual computing,
computer-empowered visual computing, human-empowered visual computing,
transformation algorithms for visual computing, and visual languages for
visual computing.
TOPICS
Aesthetic Computing
Ambient Information Interaction
Automated Generation and Layout of Visualisations
Biomedical Imagery
Computer-Assisted Visual Art and Design
Fusion of Vision with Audio and Other Modalities
Gestural Computing
Human-Machine Interface Design
Human Vision Systems and Models
Parallel/Distributed/Neural Computing and Representations for Visual
Information
Pictorial Databases and Information Systems
Scientific Visualization
Sketch and Gesture based design
Sketch and Gesture based interaction with data
Sketch Recognition
Software to Support the use of Visual Languages
Visual and Spatial/Temporal Reasoning
Visual Computing for Expert Communities
Visual Computing in Bioinformatics and Systems Biology
Visual Computing on Sensed Data
Visual Languages
Visual Programming
Visualization of Computational Processes
SUBMISSION OF PAPERS
Submissions that address research and development on the above and other
related topics are strongly encouraged. All the submitted papers will be
reviewed by the international Program Committee members. Accepted papers
will be published in the Proceedings of DMS 2013. A selection of the
best papers will be invited for subsequent publication in a special
issue of the Journal of Visual Languages and Computing. Papers of up to
six (6) IEEE double-column pages should be submitted electronically via
the VLC 2013 paper submission page:
http://conf.ksi.edu/vlc2013/submit/SubmitPaper.php (submission site will
be open Jan 1, 2013).
IMPORTANT DATES
Paper submission due: April 29, 2013
Notification of acceptance: May 31, 2013
Camera-ready copy: June 15, 2013
Early conference registration due: June 15, 2013
Conference listed by
DBLP
INSPEC
Compendex
AllConferences.com
WikiCFP
--
Dr Jim Burton
Lecturer in Computing
School of Computing, Engineering and Mathematics
University of Brighton
___________________________________________________________
This email has been scanned by MessageLabs' Email Security
System on behalf of the University of Brighton.
For more information see http://www.brighton.ac.uk/is/spam/
___________________________________________________________
**********************************************************
*
* 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/
*
**********************************************************
VLC is in just over three weeks time.
--------------------------------------------------
2013 International Workshop on Visual Languages and Computing
Holiday Inn, Brighton - Seafront, United Kingdom, August 8 to 10, 2013
http://www.ksi.edu/seke/vlc13cfp.html
SCOPE
Visual languages mediate human and computer interaction. For some visual
languages this mediation is straightforward; using a mouse to access a
drop-down menu is well-known to computer users. For others, this
mediation can be enriched via sketch and gesture recognition. This is
made possible by advances in commodity hardware. More formal visual
languages allow experts to accurately specify complex systems, such as
software architecture or chemical molecules. A visual language can also
encompass complex human-computer interaction such as navigating a set of
semantically linked videos. Indeed, precision of semantics underlies
visual languages and computation.
Aspects of visual computing are multi-faceted in goals that are to be
achieved during information or language design. The following represents
a short list of qualities that are of importance to the study within
visual computing: efficiency, aesthetics, pleasure, emotion, engagement,
immersion, collaboration, and culture. Aspects of art, engineering, and
science play key roles where certain practitioners focus on design and
engineering of visual interactions whereas others analyze and study
these interactions (i.e., science).
The International Workshop on Visual Languages and Computing will
explore these issues, and will be held in conjunction with the 2013
International Conference of Distributed Multimedia Systems
(http://www.ksi.edu/seke/dms13.html).
For this year's special theme we request high-quality submissions on
visual languages that increase the efficacy of various tasks, or on the
effectiveness of visual languages themselves. In addition to the special
theme, we continue to solicit papers on all aspects and approaches to
visual languages and computing, including interactive visual computing,
computer-empowered visual computing, human-empowered visual computing,
transformation algorithms for visual computing, and visual languages for
visual computing.
TOPICS
Aesthetic Computing
Ambient Information Interaction
Automated Generation and Layout of Visualisations
Biomedical Imagery
Computer-Assisted Visual Art and Design
Fusion of Vision with Audio and Other Modalities
Gestural Computing
Human-Machine Interface Design
Human Vision Systems and Models
Parallel/Distributed/Neural Computing and Representations for Visual
Information
Pictorial Databases and Information Systems
Scientific Visualization
Sketch and Gesture based design
Sketch and Gesture based interaction with data
Sketch Recognition
Software to Support the use of Visual Languages
Visual and Spatial/Temporal Reasoning
Visual Computing for Expert Communities
Visual Computing in Bioinformatics and Systems Biology
Visual Computing on Sensed Data
Visual Languages
Visual Programming
Visualization of Computational Processes
SUBMISSION OF PAPERS
Submissions that address research and development on the above and other
related topics are strongly encouraged. All the submitted papers will be
reviewed by the international Program Committee members. Accepted papers
will be published in the Proceedings of DMS 2013. A selection of the
best papers will be invited for subsequent publication in a special
issue of the Journal of Visual Languages and Computing. Papers of up to
six (6) IEEE double-column pages should be submitted electronically via
the VLC 2013 paper submission page:
http://conf.ksi.edu/vlc2013/submit/SubmitPaper.php (submission site will
be open Jan 1, 2013).
IMPORTANT DATES
Paper submission due: April 29, 2013
Notification of acceptance: May 31, 2013
Camera-ready copy: June 15, 2013
Early conference registration due: June 15, 2013
Conference listed by
DBLP
INSPEC
Compendex
AllConferences.com
WikiCFP
--
Dr Jim Burton
Lecturer in Computing
School of Computing, Engineering and Mathematics
University of Brighton
___________________________________________________________
This email has been scanned by MessageLabs' Email Security
System on behalf of the University of Brighton.
For more information see http://www.brighton.ac.uk/is/spam/
___________________________________________________________
**********************************************************
*
* 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] ESA - 2nd call for papers
ESA 2013 - call for papers
--------------------------------------------------------------------
CALL FOR PAPERS
ESA 2013
21st European Symposium on Algorithms
http://algo2013.inria.fr/esa.shtml
Sophia Antipolis, France
September 2-4, 2013
--------------------------------------------------------------------
GENERAL INFORMATION
The European Symposium on Algorithms (ESA) is one of the premier
conferences on algorithms. The symposium covers research in all
aspects of the design, analysis, and application of algorithms and
data structures. ESA 2013 has two tracks: the Design and Analysis
Track (Track A) and the Engineering and Applications Track
(Track B). The symposium seeks original algorithmic contributions
for problems with relevant theoretical and/or practical
applications: papers with a strong emphasis on the theoretical
analysis of algorithms should be submitted to Track A, while papers
reporting on the results of extensive experimental evaluations
and/or providing original contributions to the engineering of
algorithms for practical applications should be submitted to
Track B. ESA 2013 is organized in collaboration with the European
Association for Theoretical Computer Science (EATCS) and is part
of ALGO 2013.
--------------------------------------------------------------------
TOPICS
Papers presenting original research in all areas of algorithmic
research are sought, including but not limited to:
- Algorithm engineering
- Algorithmic aspects of networks
- Algorithmic game theory
- Approximation algorithms
- Computational biology
- Computational finance
- Computational geometry
- Combinatorial optimization
- Data compression
- Data structures
- Databases and information retrieval
- Distributed and parallel computing
- Graph algorithms
- Hierarchical memories
- Heuristics and meta-heuristics
- Mathematical programming
- Mobile computing
- On-line algorithms
- Parameterized complexity
- Pattern matching
- Quantum computing
- Randomized algorithms
- Scheduling and resource allocation problems
- Streaming algorithms.
--------------------------------------------------------------------
SUBMISSION GUIDELINES
Authors are invited to submit an extended abstract or full paper of
at most 12 pages and an optional appendix.
* Papers must be formatted in LaTeX, using the LNCS style file
(available through the conference website). The maximum length of
the paper (including references, but excluding the optional
appendix) is 12 pages. Do not change the margin size or the font, do
not make a separate title page, etc.: use the LNCS style file
as given, but please do add page numbers, which can be done,
for example, by adding
\pagestyle{plain}
just before
\begin{document}
* Proofs omitted due to space constraints must be placed in an
appendix to be read by the program committee members at their
discretion.
These guidelines are strict: papers failing to adhere to the
guidelines (by not providing the omitted proofs in an appendix,
being more than 12 pages, or not being in LNCS format) will be
rejected without consideration of their merits.
Papers should be submitted electronically via the EasyChair
submission system, accessible via
https://www.easychair.org/conferences/?conf=esa20130
and with the appropriate track selected. Simultaneous submission to
other conferences with published proceedings, or to both tracks
of ESA 2013, is not permitted. There will be a Best Student Paper
Award, as well as a Best Paper Award. The ESA proceedings will be
published in the Lecture Notes in Computer Science series by
Springer-Verlag. Each accepted paper will be allotted 12 pages in
the proceedings.
--------------------------------------------------------------------
IMPORTANT DATES
* Submission deadline: Monday, April 22, 2012, 20:00 GMT (22:00 CEST, 23:00 IDT)
* Notification: Monday, June 10, 2013
* Final version due: Sunday, June 23, 2013
* Symposium: September 2-4, 2013 (Sophia Antipolis, France)
--------------------------------------------------------------------
INVITED SPEAKERS
Claire Mathieu, CNRS, Ecole Normale Superieure, France and
Brown University, USA
Hannah Bast, University of Freiburg, Germany
--------------------------------------------------------------------
MORE INFORMATION
ESA 2013 will be co-located with IPEC (8th International Symposium
on Parameterized and Exact Computation, September 4-6), WABI (13th
Workshop on Algorithms in Bioinformatics, September 2-4), ATMOS
(13th Workshop on Algorithmic Approaches for Transportation
Modelling, Optimization, and Systems, September 5), WAOA (11th
Workshop on Approximation and Online Algorithms, September 5-6),
ALGOSENSORS (9th International Symposium on Algorithms for Sensor
Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities,
September 5-6), and MASSIVE (5th Workshop on Massive Data Algorithmics,
September 5).
--------------------------------------------------------------------
PROGRAM COMMITTEE: DESIGN AND ANALYSIS TRACK
* Sebastian Böcker, Friedrich-Schiller-Universität Jena, Germany
* Hans Bodlaender (chair), Utrecht University, the Netherlands
* Emanuele G. Fusco, Sapienza University of Rome, Italy
* MohammadTaghi Hajiaghayi, University of Maryland, USA
* Tobias Harks, Maastricht University, the Netherlands
* Iyad Kanj, DePaul University, USA
* Petteri Kaski, Aalto University, Finland
* Ken-ichi Kawarabayashi, National Institute of Informatics, Japan
* Guy Kortsarz, Rutgers, USA
* Jan Kratochvil, Charles University, Czech Republic
* Nicole Megow, Technische Universität Berlin, Germany
* Sang-il Oum, KAIST, South Korea
* Konstantinos Panagiotou, University of Munich, Germany
* Andrzej Pelc, Université du Québec en Outaouais, Canada
* Jeff Phillips, University of Utah, USA
* Pascal Schweitzer, JAIST, Japan and ETH Zürich, Switzerland
* Sagi Snir, University of Haifa, Israel
* Kavitha Telikepalli, Tata Institute of Fundamental Research, India
* Denis Trystram, Grenoble Institute of Technology, France
* Ronald de Wolf, CWI and University of Amsterdam, the Netherlands
* Alexander Wolff, Universität Würzburg, Germany
* Norbert Zeh, Dalhousie University, Canada
--------------------------------------------------------------------
PROGRAM COMMITTEE: ENGINEERING AND APPLICATIONS TRACK
* David Bader, Georgia Tech, USA
* Cathy McGeoch, Amherst College, USA
* Loukas Georgiadis, University of Ioannina, Greece
* Roberto Grossi, University of Pisa, Italy
* Giuseppe F. Italiano (Chair), University of Rome "Tor Vergata", Italy
* Jyrki Katajainen, University of Copenhagen, Denmark
* Marc van Kreveld, Utrecht University, The Netherlands
* Leo Liberti, LIX, Ecole Polytechnique, France
* Bernard Moret, EPFL, Switzerland
* Gabriel Moruz, University of Frankfurt, Germany
* Matthias Muller-Hannemann, Martin Luther University Halle-Wittenberg, Germany
* Kunihiko Sadakane, National Institute of Informatics, Japan
* Martin Skutella, Technische Universität Berlin, Germany
* Dorothea Wagner, Karlsruhe Institute of Technology, Germany
* Renato Werneck, Microsoft Research, USA
--------------------------------------------------------------------
ORGANIZING COMMITTEE
* Frédéric Cazals
* Agnès Cortell (event manager)
* David Coudert
* Olivier Devillers
* Joanna Moulierac
* Monique Teillaud (chair)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
--------------------------------------------------------------------
CALL FOR PAPERS
ESA 2013
21st European Symposium on Algorithms
http://algo2013.inria.fr/esa.shtml
Sophia Antipolis, France
September 2-4, 2013
--------------------------------------------------------------------
GENERAL INFORMATION
The European Symposium on Algorithms (ESA) is one of the premier
conferences on algorithms. The symposium covers research in all
aspects of the design, analysis, and application of algorithms and
data structures. ESA 2013 has two tracks: the Design and Analysis
Track (Track A) and the Engineering and Applications Track
(Track B). The symposium seeks original algorithmic contributions
for problems with relevant theoretical and/or practical
applications: papers with a strong emphasis on the theoretical
analysis of algorithms should be submitted to Track A, while papers
reporting on the results of extensive experimental evaluations
and/or providing original contributions to the engineering of
algorithms for practical applications should be submitted to
Track B. ESA 2013 is organized in collaboration with the European
Association for Theoretical Computer Science (EATCS) and is part
of ALGO 2013.
--------------------------------------------------------------------
TOPICS
Papers presenting original research in all areas of algorithmic
research are sought, including but not limited to:
- Algorithm engineering
- Algorithmic aspects of networks
- Algorithmic game theory
- Approximation algorithms
- Computational biology
- Computational finance
- Computational geometry
- Combinatorial optimization
- Data compression
- Data structures
- Databases and information retrieval
- Distributed and parallel computing
- Graph algorithms
- Hierarchical memories
- Heuristics and meta-heuristics
- Mathematical programming
- Mobile computing
- On-line algorithms
- Parameterized complexity
- Pattern matching
- Quantum computing
- Randomized algorithms
- Scheduling and resource allocation problems
- Streaming algorithms.
--------------------------------------------------------------------
SUBMISSION GUIDELINES
Authors are invited to submit an extended abstract or full paper of
at most 12 pages and an optional appendix.
* Papers must be formatted in LaTeX, using the LNCS style file
(available through the conference website). The maximum length of
the paper (including references, but excluding the optional
appendix) is 12 pages. Do not change the margin size or the font, do
not make a separate title page, etc.: use the LNCS style file
as given, but please do add page numbers, which can be done,
for example, by adding
\pagestyle{plain}
just before
\begin{document}
* Proofs omitted due to space constraints must be placed in an
appendix to be read by the program committee members at their
discretion.
These guidelines are strict: papers failing to adhere to the
guidelines (by not providing the omitted proofs in an appendix,
being more than 12 pages, or not being in LNCS format) will be
rejected without consideration of their merits.
Papers should be submitted electronically via the EasyChair
submission system, accessible via
https://www.easychair.org/conferences/?conf=esa20130
and with the appropriate track selected. Simultaneous submission to
other conferences with published proceedings, or to both tracks
of ESA 2013, is not permitted. There will be a Best Student Paper
Award, as well as a Best Paper Award. The ESA proceedings will be
published in the Lecture Notes in Computer Science series by
Springer-Verlag. Each accepted paper will be allotted 12 pages in
the proceedings.
--------------------------------------------------------------------
IMPORTANT DATES
* Submission deadline: Monday, April 22, 2012, 20:00 GMT (22:00 CEST, 23:00 IDT)
* Notification: Monday, June 10, 2013
* Final version due: Sunday, June 23, 2013
* Symposium: September 2-4, 2013 (Sophia Antipolis, France)
--------------------------------------------------------------------
INVITED SPEAKERS
Claire Mathieu, CNRS, Ecole Normale Superieure, France and
Brown University, USA
Hannah Bast, University of Freiburg, Germany
--------------------------------------------------------------------
MORE INFORMATION
ESA 2013 will be co-located with IPEC (8th International Symposium
on Parameterized and Exact Computation, September 4-6), WABI (13th
Workshop on Algorithms in Bioinformatics, September 2-4), ATMOS
(13th Workshop on Algorithmic Approaches for Transportation
Modelling, Optimization, and Systems, September 5), WAOA (11th
Workshop on Approximation and Online Algorithms, September 5-6),
ALGOSENSORS (9th International Symposium on Algorithms for Sensor
Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities,
September 5-6), and MASSIVE (5th Workshop on Massive Data Algorithmics,
September 5).
--------------------------------------------------------------------
PROGRAM COMMITTEE: DESIGN AND ANALYSIS TRACK
* Sebastian Böcker, Friedrich-Schiller-Universität Jena, Germany
* Hans Bodlaender (chair), Utrecht University, the Netherlands
* Emanuele G. Fusco, Sapienza University of Rome, Italy
* MohammadTaghi Hajiaghayi, University of Maryland, USA
* Tobias Harks, Maastricht University, the Netherlands
* Iyad Kanj, DePaul University, USA
* Petteri Kaski, Aalto University, Finland
* Ken-ichi Kawarabayashi, National Institute of Informatics, Japan
* Guy Kortsarz, Rutgers, USA
* Jan Kratochvil, Charles University, Czech Republic
* Nicole Megow, Technische Universität Berlin, Germany
* Sang-il Oum, KAIST, South Korea
* Konstantinos Panagiotou, University of Munich, Germany
* Andrzej Pelc, Université du Québec en Outaouais, Canada
* Jeff Phillips, University of Utah, USA
* Pascal Schweitzer, JAIST, Japan and ETH Zürich, Switzerland
* Sagi Snir, University of Haifa, Israel
* Kavitha Telikepalli, Tata Institute of Fundamental Research, India
* Denis Trystram, Grenoble Institute of Technology, France
* Ronald de Wolf, CWI and University of Amsterdam, the Netherlands
* Alexander Wolff, Universität Würzburg, Germany
* Norbert Zeh, Dalhousie University, Canada
--------------------------------------------------------------------
PROGRAM COMMITTEE: ENGINEERING AND APPLICATIONS TRACK
* David Bader, Georgia Tech, USA
* Cathy McGeoch, Amherst College, USA
* Loukas Georgiadis, University of Ioannina, Greece
* Roberto Grossi, University of Pisa, Italy
* Giuseppe F. Italiano (Chair), University of Rome "Tor Vergata", Italy
* Jyrki Katajainen, University of Copenhagen, Denmark
* Marc van Kreveld, Utrecht University, The Netherlands
* Leo Liberti, LIX, Ecole Polytechnique, France
* Bernard Moret, EPFL, Switzerland
* Gabriel Moruz, University of Frankfurt, Germany
* Matthias Muller-Hannemann, Martin Luther University Halle-Wittenberg, Germany
* Kunihiko Sadakane, National Institute of Informatics, Japan
* Martin Skutella, Technische Universität Berlin, Germany
* Dorothea Wagner, Karlsruhe Institute of Technology, Germany
* Renato Werneck, Microsoft Research, USA
--------------------------------------------------------------------
ORGANIZING COMMITTEE
* Frédéric Cazals
* Agnès Cortell (event manager)
* David Coudert
* Olivier Devillers
* Joanna Moulierac
* Monique Teillaud (chair)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Wednesday, April 3, 2013
[DMANET] extension submission deadline young researcher award OR2013
Dear Sir/Madam,
We would be grateful if you could help us send the information about the extended submission deadline for the young researcher awards to the members of your community.
Many thanks in advance,
the organizing committee of OR 2013
----------------------------------------------------------
Deadline extension for submission impact awards (OR 2013)
----------------------------------------------------------
International Conference on Operations Research Rotterdam, September 3-6,2013 http://www.or2013.org/
------------------------------------------------------------------------------------------
Dear colleagues,
The submission deadline for the awards "Young participant with most academic impact" and "Young participant with most practical impact" has been extended to April 15. We encourage promising young researchers from all over the world to submit their work.
The awards will be presented during OR 2013, the International Conference on Operations Research organized by the German and Dutch OR societies.
For any further information please visit the conference web page: www.or2013.org.
or contact or2013@ese.eur.nl.
Moreover, everyone is invited to submit regular abstracts before April 30, 2013.
Other important dates:
-----------------------------
Notification of acceptance: May 31, 2013
Deadline early registration: June 30, 2013
Conference date: September 3-6, 2013
Best regards,
the organizing committee of OR2013
Disclaimer
________________________________
De informatie verzonden in dit e-mail bericht inclusief de bijlage(n) is vertrouwelijk en is uitsluitend bestemd voor de geadresseerde van dit bericht. Lees verder: www.eur.nl/email-disclaimer <http://www.eur.nl/email-disclaimer>
The information in this e-mail message is confidential and may be legally privileged. Read more: www.eur.nl/english/email-disclaimer<http://www.eur.nl/english/email-disclaimer>
________________________________
**********************************************************
*
* 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/
*
**********************************************************
We would be grateful if you could help us send the information about the extended submission deadline for the young researcher awards to the members of your community.
Many thanks in advance,
the organizing committee of OR 2013
----------------------------------------------------------
Deadline extension for submission impact awards (OR 2013)
----------------------------------------------------------
International Conference on Operations Research Rotterdam, September 3-6,2013 http://www.or2013.org/
------------------------------------------------------------------------------------------
Dear colleagues,
The submission deadline for the awards "Young participant with most academic impact" and "Young participant with most practical impact" has been extended to April 15. We encourage promising young researchers from all over the world to submit their work.
The awards will be presented during OR 2013, the International Conference on Operations Research organized by the German and Dutch OR societies.
For any further information please visit the conference web page: www.or2013.org.
or contact or2013@ese.eur.nl.
Moreover, everyone is invited to submit regular abstracts before April 30, 2013.
Other important dates:
-----------------------------
Notification of acceptance: May 31, 2013
Deadline early registration: June 30, 2013
Conference date: September 3-6, 2013
Best regards,
the organizing committee of OR2013
Disclaimer
________________________________
De informatie verzonden in dit e-mail bericht inclusief de bijlage(n) is vertrouwelijk en is uitsluitend bestemd voor de geadresseerde van dit bericht. Lees verder: www.eur.nl/email-disclaimer <http://www.eur.nl/email-disclaimer>
The information in this e-mail message is confidential and may be legally privileged. Read more: www.eur.nl/english/email-disclaimer<http://www.eur.nl/english/email-disclaimer>
________________________________
**********************************************************
*
* 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 DEBS 2013 Doctoral Workshop Submissions
DEBS 2013: 7th ACM International Conference on Distributed Event-Based
Systems
http://www.orgs.ttu.edu/debs2013/
Arlington, Texas, USA, June 29 - July 3, 2013
The scope of the ACM International Conference on Distributed Event-Based
Systems covers all topics relevant to event-based computing ranging from
those discussed in related disciplines (e.g. software systems,
distributed systems, data management, dependability, knowledge
management, networking, programming languages, security and software
engineering), to domain-specific topics of event-based computing (e.g.
real-time analytics, mobile computing, social networking, pervasive and
ubiquitous computing, sensors networks, user interfaces, big data
processing, spatio-temporal processing, Cloud computing, the internet of
things, peer-to-peer computing and embedded systems), to
enterprise-related topics (e.g. complex event detection, enterprise
application integration, real-time enterprises and web services). Topics
addressed by the conference papers may include (but are not limited to)
models, architectures and paradigms of event-based systems, middleware
systems and frameworks, and applications, experiences and requirements.
The DEBS 2013 Doctoral Workshop welcomes submissions from students who
are enrolled in a PhD program and are working on topics relevant to
those covered by the DEBS 2013 conference. We encourage submissions from
students who are at the late stages of their doctoral work, and who can
therefore present a relatively "complete" story about their research. We
also encourage submissions from students in the beginning stages of
their program, and thus have a significant "future work" component. The
former category will have the opportunity to present their research to a
wider audience in preparation for a job search, whereas the latter can
obtain valuable feedback about their upcoming research plans. Students
in both stages of their careers will benefit from interacting with each
other, as well as with members of the event processing research
community represented at the conference.
Structure
The Program Committee for this workshop consists mainly of distinguished
researchers who are prominent in the field of event-based systems or who
have obtained their own PhDs not too long ago. Members of the Program
Committee will attend the doctoral workshop to encourage and help,
answer questions and give feedback. The doctoral workshop will provide a
friendly and supportive atmosphere for PhD students. There will be time
to get to know other students and researchers from a range of countries
and backgrounds and to have fun as well as to work.
Submission Information
All paper submissions must be original and unpublished. Submissions must
be in the ACM format for conference proceedings.
Only PDF documents will be accepted.
Authors are encouraged to make use of the ACM SIGS Proceedings templates
available at http://www.acm.org/sigs/publications/proceedings-templates.
Submissions to all tracks of DEBS 2013 are made through the DEBS 2013
submission site on EasyChair
https://www.easychair.org/account/signin.cgi?conf=debs2013 by 11:59 PM
(GMT) on the due date. Questions about submissions can be sent to the
DEBS 2013 program chairs at debs13-pc-chairs@imperial.ac.uk.
Doctoral Workshop papers should describe the problem addressed as part
of the PhD work, explain its importance, discuss shortcomings of
existing solutions and give some indication of steps towards a solution.
There should be enough substance to encourage discussion at the
workshop, but the work does not need to be complete. Please also include
a thesis outline and a summary of further planned work.
Submitted papers for the doctoral workshop are limited to 4 pages.
Submissions must be single-author with the name of the supervisor
mentioned. No copyrighted proceedings will be published so that future
publication of the work in conferences/journals is not precluded.
Accepted submissions will be made available electronically to all
participants at http://debs.org.
Important: We will not accept submissions that are typical conference
paper submissions without explicit focus on the PhD work.
Important Dates
Doctoral Workshop submission May 10, 2013
Author notification for Doctoral Workshop May 20, 2013
Conference June 29-July 3, 2013
Tentative date for the workshop is June 29, 2013
Doctoral Workshop Co-Chairs
Gero Muehl, University of Rostock, Germany
Tore Risch, Uppsala University, Sweden
**********************************************************
*
* 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/
*
**********************************************************
Systems
http://www.orgs.ttu.edu/debs2013/
Arlington, Texas, USA, June 29 - July 3, 2013
The scope of the ACM International Conference on Distributed Event-Based
Systems covers all topics relevant to event-based computing ranging from
those discussed in related disciplines (e.g. software systems,
distributed systems, data management, dependability, knowledge
management, networking, programming languages, security and software
engineering), to domain-specific topics of event-based computing (e.g.
real-time analytics, mobile computing, social networking, pervasive and
ubiquitous computing, sensors networks, user interfaces, big data
processing, spatio-temporal processing, Cloud computing, the internet of
things, peer-to-peer computing and embedded systems), to
enterprise-related topics (e.g. complex event detection, enterprise
application integration, real-time enterprises and web services). Topics
addressed by the conference papers may include (but are not limited to)
models, architectures and paradigms of event-based systems, middleware
systems and frameworks, and applications, experiences and requirements.
The DEBS 2013 Doctoral Workshop welcomes submissions from students who
are enrolled in a PhD program and are working on topics relevant to
those covered by the DEBS 2013 conference. We encourage submissions from
students who are at the late stages of their doctoral work, and who can
therefore present a relatively "complete" story about their research. We
also encourage submissions from students in the beginning stages of
their program, and thus have a significant "future work" component. The
former category will have the opportunity to present their research to a
wider audience in preparation for a job search, whereas the latter can
obtain valuable feedback about their upcoming research plans. Students
in both stages of their careers will benefit from interacting with each
other, as well as with members of the event processing research
community represented at the conference.
Structure
The Program Committee for this workshop consists mainly of distinguished
researchers who are prominent in the field of event-based systems or who
have obtained their own PhDs not too long ago. Members of the Program
Committee will attend the doctoral workshop to encourage and help,
answer questions and give feedback. The doctoral workshop will provide a
friendly and supportive atmosphere for PhD students. There will be time
to get to know other students and researchers from a range of countries
and backgrounds and to have fun as well as to work.
Submission Information
All paper submissions must be original and unpublished. Submissions must
be in the ACM format for conference proceedings.
Only PDF documents will be accepted.
Authors are encouraged to make use of the ACM SIGS Proceedings templates
available at http://www.acm.org/sigs/publications/proceedings-templates.
Submissions to all tracks of DEBS 2013 are made through the DEBS 2013
submission site on EasyChair
https://www.easychair.org/account/signin.cgi?conf=debs2013 by 11:59 PM
(GMT) on the due date. Questions about submissions can be sent to the
DEBS 2013 program chairs at debs13-pc-chairs@imperial.ac.uk.
Doctoral Workshop papers should describe the problem addressed as part
of the PhD work, explain its importance, discuss shortcomings of
existing solutions and give some indication of steps towards a solution.
There should be enough substance to encourage discussion at the
workshop, but the work does not need to be complete. Please also include
a thesis outline and a summary of further planned work.
Submitted papers for the doctoral workshop are limited to 4 pages.
Submissions must be single-author with the name of the supervisor
mentioned. No copyrighted proceedings will be published so that future
publication of the work in conferences/journals is not precluded.
Accepted submissions will be made available electronically to all
participants at http://debs.org.
Important: We will not accept submissions that are typical conference
paper submissions without explicit focus on the PhD work.
Important Dates
Doctoral Workshop submission May 10, 2013
Author notification for Doctoral Workshop May 20, 2013
Conference June 29-July 3, 2013
Tentative date for the workshop is June 29, 2013
Doctoral Workshop Co-Chairs
Gero Muehl, University of Rostock, Germany
Tore Risch, Uppsala University, Sweden
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Phd Position: Graph Algorithms for Cancer System Biology @ IOR-IDSIA Switzerland
IOR/IOSI and IDSIA USI/SUPSI - Switzerland
Phd Student Position in
Graph Algorithms for Cancer System Biology
(supported by Swiss National Science Foundation)
The Lymphoma and Genomics Research Program at the
Institute of Oncology Research (IOR) and Dalle Molle
Institute for Artificial Intelligence (IDSIA) are seeking
a PhD Student to work on Graph Algorithms for Cancer
System Biology.
The Institute of Oncology Research (IOR, ior.iosi.ch) is
part of the Research Division of the Oncology Institute of
Southern Switzerland (IOSI), the comprehensive cancer
center of the Ente Ospedaliero Cantonale (EOC). IOSI is
one of the world referral centers for lymphomas. The
Lymphoma and Genomics Research Program has a very strong
expertise on performing and analyzing genomic profiling in
lymphoid neoplasms.
Dalle Molle Institute for Artificial Intelligence (IDSIA,
www.idsia.ch), affiliated with the University of Applied
Sciences and Arts of Southern Switzerland (SUPSI,
www.supsi.ch) and the University of Lugano (USI,
www.usi.ch), is a research institute active on artificial
intelligence, evolutionary computation, combinatorial
optimization and imprecise probability. IDSIA is small but
visible, competitive, and influential. The "X-Lab Survey"
by Business Week Magazine ranked IDSIA among the world's
top ten labs in Artificial Intelligence.
We are looking for an outstanding Ph.D. student with
excellent background in algorithms and optimization on
graphs as well as computer programming skills. Experience
in bioinformatics is not strictly required but highly
desirable. The applicant must have completed Master
studies in computer science, bioinformatics, or a closely
related field prior to starting the program.
The position is funded by the Swiss National Science
Foundation (SNSF, www.snf.ch). The initial appointment
will be for 3 years. The gross salary is roughly 42,000
CHF (Swiss Francs) for the first year, 45,000 CHF for the
second year and 48,000 CHF for the third year (taxes
20-25%). IOR and IDSIA offer a stimulating international
environment (English is the official language). The
position is suitable for students no older than 35 years.
The candidate will work in close collaboration with:
* Ivo Kwee (IOR/IDSIA), expert in bioinformatics
* Francesco Bertoni (IOR/IOSI), expert in lymphomas and
cancer genomics
* Roberto Montemanni (IDSIA), expert in algorithms and
optimization
Applicants should submit as soon as possible:
(i) Detailed curriculum vitae et studiorum.
(ii) Letter of presentation and motivation.
(iii) List of at most three references and their email
addresses.
Please send all documents via email to roberto@idsia.ch
(with subject "PhD Bioinformatics 2013").
Contact persons:
Dr. Ivo Kwee Prof. Roberto Montemanni
IOR/IDSIA IDSIA/SUPSI
ivo@idsia.ch roberto@idsia.ch
APPLICATION DEADLINE: May 1st 2013.
We guarantee that the selection process, based solely on
the research records, will give equal opportunities to
female and male researchers.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Phd Student Position in
Graph Algorithms for Cancer System Biology
(supported by Swiss National Science Foundation)
The Lymphoma and Genomics Research Program at the
Institute of Oncology Research (IOR) and Dalle Molle
Institute for Artificial Intelligence (IDSIA) are seeking
a PhD Student to work on Graph Algorithms for Cancer
System Biology.
The Institute of Oncology Research (IOR, ior.iosi.ch) is
part of the Research Division of the Oncology Institute of
Southern Switzerland (IOSI), the comprehensive cancer
center of the Ente Ospedaliero Cantonale (EOC). IOSI is
one of the world referral centers for lymphomas. The
Lymphoma and Genomics Research Program has a very strong
expertise on performing and analyzing genomic profiling in
lymphoid neoplasms.
Dalle Molle Institute for Artificial Intelligence (IDSIA,
www.idsia.ch), affiliated with the University of Applied
Sciences and Arts of Southern Switzerland (SUPSI,
www.supsi.ch) and the University of Lugano (USI,
www.usi.ch), is a research institute active on artificial
intelligence, evolutionary computation, combinatorial
optimization and imprecise probability. IDSIA is small but
visible, competitive, and influential. The "X-Lab Survey"
by Business Week Magazine ranked IDSIA among the world's
top ten labs in Artificial Intelligence.
We are looking for an outstanding Ph.D. student with
excellent background in algorithms and optimization on
graphs as well as computer programming skills. Experience
in bioinformatics is not strictly required but highly
desirable. The applicant must have completed Master
studies in computer science, bioinformatics, or a closely
related field prior to starting the program.
The position is funded by the Swiss National Science
Foundation (SNSF, www.snf.ch). The initial appointment
will be for 3 years. The gross salary is roughly 42,000
CHF (Swiss Francs) for the first year, 45,000 CHF for the
second year and 48,000 CHF for the third year (taxes
20-25%). IOR and IDSIA offer a stimulating international
environment (English is the official language). The
position is suitable for students no older than 35 years.
The candidate will work in close collaboration with:
* Ivo Kwee (IOR/IDSIA), expert in bioinformatics
* Francesco Bertoni (IOR/IOSI), expert in lymphomas and
cancer genomics
* Roberto Montemanni (IDSIA), expert in algorithms and
optimization
Applicants should submit as soon as possible:
(i) Detailed curriculum vitae et studiorum.
(ii) Letter of presentation and motivation.
(iii) List of at most three references and their email
addresses.
Please send all documents via email to roberto@idsia.ch
(with subject "PhD Bioinformatics 2013").
Contact persons:
Dr. Ivo Kwee Prof. Roberto Montemanni
IOR/IDSIA IDSIA/SUPSI
ivo@idsia.ch roberto@idsia.ch
APPLICATION DEADLINE: May 1st 2013.
We guarantee that the selection process, based solely on
the research records, will give equal opportunities to
female and male researchers.
**********************************************************
*
* 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] LOGOPT 2013 - Deadline extended
Optimization Methods in Logistics - LOGOPT
29-31 July 2013
Lisbon, Portugal
http://www.tadbir.ca/icaor/logopt.htm
The LOGOPT workshop will take place in conjunction with
the International Conference on Applied Operational
Research (ICAOR). We invite you to join your colleagues
for this international forum. Sharing of ideas, knowledge
and experience is the primary goal of the workshop. The
meeting would be ideal for young researchers to present
their work, even at a preliminary stage, for constructive
discussion and feedback. The workshop covers the general
area of optimization methods in logistics with particular
emphasis on real-world applications, including, but not
limited to:
- Distribution
- Inventory
- Loading and handling
- Materials management
- Returns management
- Reverse logistics
- Supply chain management
- Warehousing
Paper Submission
Researchers wishing to contribute to the conference are
invited to submit manuscripts of not more than 6 pages
either as full papers or extended abstracts. All
submissions will be reviewed by at least two referees, and
successful papers will be included in the Conference
Proceedings published by LNMS. Please use ICAOR-template
when preparing your manuscript for submission but we will
then correctly format all accepted papers for publication.
Papers should be submitted in MS Word format online
through the following link:
https://www.easychair.org/account/signin.cgi?conf=icaor2013
Submission Deadline: 15-Apr-2013 (was 30-Mar-2013)
Special Issues
The authors of accepted papers will have the opportunity
to submit extended versions of their papers for
consideration to post-conference special issues of the
Journal of Applied Operational Research (JAOR). Authors
should submit their manuscripts in MS Word via email to
jaor@tadbir.ca. By submitting a manuscript you certify
that the contribution is original work and no part of the
material breaches any right of others. Authors are advised
to ensure that they have conformed to the JAOR script
requirements. All articles will be peer reviewed by at
least two anonymous referees.
Post-conference special issues submission deadline:
15-Sep-2013
Important Dates
15-Apr-2013 - Paper submission deadline (was 30-Mar-2013)
30-Apr-2013 - Notification of decisions
15-May-2013 - Registration deadline
30-May-2013 - Camera-ready deadline
29-Jul-2013 - Conference starts
Chair
Roberto Montemanni, Dalle Molle Institute for AI,
Switzerland (roberto@idsia.ch)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
29-31 July 2013
Lisbon, Portugal
http://www.tadbir.ca/icaor/logopt.htm
The LOGOPT workshop will take place in conjunction with
the International Conference on Applied Operational
Research (ICAOR). We invite you to join your colleagues
for this international forum. Sharing of ideas, knowledge
and experience is the primary goal of the workshop. The
meeting would be ideal for young researchers to present
their work, even at a preliminary stage, for constructive
discussion and feedback. The workshop covers the general
area of optimization methods in logistics with particular
emphasis on real-world applications, including, but not
limited to:
- Distribution
- Inventory
- Loading and handling
- Materials management
- Returns management
- Reverse logistics
- Supply chain management
- Warehousing
Paper Submission
Researchers wishing to contribute to the conference are
invited to submit manuscripts of not more than 6 pages
either as full papers or extended abstracts. All
submissions will be reviewed by at least two referees, and
successful papers will be included in the Conference
Proceedings published by LNMS. Please use ICAOR-template
when preparing your manuscript for submission but we will
then correctly format all accepted papers for publication.
Papers should be submitted in MS Word format online
through the following link:
https://www.easychair.org/account/signin.cgi?conf=icaor2013
Submission Deadline: 15-Apr-2013 (was 30-Mar-2013)
Special Issues
The authors of accepted papers will have the opportunity
to submit extended versions of their papers for
consideration to post-conference special issues of the
Journal of Applied Operational Research (JAOR). Authors
should submit their manuscripts in MS Word via email to
jaor@tadbir.ca. By submitting a manuscript you certify
that the contribution is original work and no part of the
material breaches any right of others. Authors are advised
to ensure that they have conformed to the JAOR script
requirements. All articles will be peer reviewed by at
least two anonymous referees.
Post-conference special issues submission deadline:
15-Sep-2013
Important Dates
15-Apr-2013 - Paper submission deadline (was 30-Mar-2013)
30-Apr-2013 - Notification of decisions
15-May-2013 - Registration deadline
30-May-2013 - Camera-ready deadline
29-Jul-2013 - Conference starts
Chair
Roberto Montemanni, Dalle Molle Institute for AI,
Switzerland (roberto@idsia.ch)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Tuesday, April 2, 2013
[DMANET] Job announcement: The Hakubi Project at Kyoto University, Japan
Kyoto University's "Hakubi Project" is recruiting up to twenty assistant
professors and associate professors in all kinds of academic fields.
The deadline for applications is May 1 / May 8, 2013, and the starting
date for successful applicants is April 1, 2014.
The contracts are for five years, and the monthly salary (before tax) is
normally in the range 400,000 -- 600,000 yen for assistant professors
and 550,000 -- 700,000 yen for associate professors.
Japanese language skills are not required to apply for the positions.
For information about the Hakubi Project and its goals, see:
http://www.hakubi.kyoto-u.ac.jp/eng/
For more details about the application process, see the official call
for applications at:
http://www.hakubi.kyoto-u.ac.jp/eng/04_rec/h25/bos.html
and the FAQ at:
http://www.hakubi.kyoto-u.ac.jp/eng/04_rec/h25/doc/faq.pdf
**********************************************************
*
* 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/
*
**********************************************************
professors and associate professors in all kinds of academic fields.
The deadline for applications is May 1 / May 8, 2013, and the starting
date for successful applicants is April 1, 2014.
The contracts are for five years, and the monthly salary (before tax) is
normally in the range 400,000 -- 600,000 yen for assistant professors
and 550,000 -- 700,000 yen for associate professors.
Japanese language skills are not required to apply for the positions.
For information about the Hakubi Project and its goals, see:
http://www.hakubi.kyoto-u.ac.jp/eng/
For more details about the application process, see the official call
for applications at:
http://www.hakubi.kyoto-u.ac.jp/eng/04_rec/h25/bos.html
and the FAQ at:
http://www.hakubi.kyoto-u.ac.jp/eng/04_rec/h25/doc/faq.pdf
**********************************************************
*
* 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] System Administrator/Rechnerbeauftragter in Mathematics, TU Darmstadt
The Department of Mathematics at TU Darmstadt invites applications for a
permanent position of a system administrator at the postdoc level. The
position involves system administration (of desktop computers and
servers), administration of mathematical software, teaching connected to
matheamtical software, and research in applied mathematics (mathematical
optimization if possible).
For more details, please consult the german job offer below.
----------------------------------------------------------------------
Im Fachbereich Mathematik der TU Darmstadt ist zum nächstmöglichen
Zeitpunkt die Stelle für eine/einen
Wiss. Mitarbeiterin/Mitarbeiter als Rechner- und Informationsbeauftragte/n
zu besetzen.
Aufgabengebiete:
- Arbeitsplatzrechner- und Serverbetreuung
- wissenschaftliche Betreuung von System- und Benutzersoftware,
insbesondere mathematische Software und Benutzerberatung
- Betreuung des WWW-Auftritts des Fachbereichs
- Betreuung und Softwareunterstützung in der Prüfungsverwaltung
- Betreuung des Campus-Management-Systems (TUCaN)
- Lehraufgaben, insbesondere zu mathematischer Software
- Beteiligung an Forschungsaktivitäten im Fachbereich
Voraussetzungen:
- abgeschlossenes Hochschulstudium und Promotion in Mathematik oder
gleichwertige Qualifikation,
- fundierte Kenntnisse und Erfahrungen, insbesondere in folgenden
Bereichen: mathematische Software, Softwareentwicklung, Rechnersysteme
und -vernetzungen, WWW-Auftritte
- Kreativität und Engagement, sowie Fähigkeit zur Teamarbeit,
- Bereitschaft zur fachlichen Weiterbildung,
- Lehrerfahrung in mathematischen Veranstaltungen,
- Forschungstätigkeit im Bereich der anwendungsorientierten Mathematik,
vorzugsweise der mathematischen Optimierung.
Die Technische Universität Darmstadt strebt eine Erhöhung des Anteils
der Frauen am Personal an und fordert deshalb besonders Frauen auf, sich
zu bewerben. Bewerberinnen oder Bewerber mit einem Grad der Behinderung
von mindestens 50 oder diesen Gleichgestellte werden bei gleicher
Eignung bevorzugt. Die Vergütung erfolgt nach dem Tarifvertrag für die
Technische Universität Darmstadt (TV - TU Darmstadt).
Teilzeitbeschäftigung ist grundsätzlich möglich.
Bewerbungen sind mit den üblichen Unterlagen unter Angabe der
Kenn-Nummer postalisch an den Dekan des Fachbereichs Mathematik,
Schloßgartenstr. 7, 64289 Darmstadt, oder elektronisch an
bewerbung@mathematik.tu-darmstadt.de senden. Für Rückfragen steht Ihnen
der Fachbereichskoordinator, Herr Dr. Andreas Mars, Tel.: 06151 - 163589
oder 0160-97245802, mars@mathematik.tu-darmstadt.de, gerne zur Verfügung.
Kenn.-Nr. 104
Bewerbungsfrist: 01.05.2013
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
permanent position of a system administrator at the postdoc level. The
position involves system administration (of desktop computers and
servers), administration of mathematical software, teaching connected to
matheamtical software, and research in applied mathematics (mathematical
optimization if possible).
For more details, please consult the german job offer below.
----------------------------------------------------------------------
Im Fachbereich Mathematik der TU Darmstadt ist zum nächstmöglichen
Zeitpunkt die Stelle für eine/einen
Wiss. Mitarbeiterin/Mitarbeiter als Rechner- und Informationsbeauftragte/n
zu besetzen.
Aufgabengebiete:
- Arbeitsplatzrechner- und Serverbetreuung
- wissenschaftliche Betreuung von System- und Benutzersoftware,
insbesondere mathematische Software und Benutzerberatung
- Betreuung des WWW-Auftritts des Fachbereichs
- Betreuung und Softwareunterstützung in der Prüfungsverwaltung
- Betreuung des Campus-Management-Systems (TUCaN)
- Lehraufgaben, insbesondere zu mathematischer Software
- Beteiligung an Forschungsaktivitäten im Fachbereich
Voraussetzungen:
- abgeschlossenes Hochschulstudium und Promotion in Mathematik oder
gleichwertige Qualifikation,
- fundierte Kenntnisse und Erfahrungen, insbesondere in folgenden
Bereichen: mathematische Software, Softwareentwicklung, Rechnersysteme
und -vernetzungen, WWW-Auftritte
- Kreativität und Engagement, sowie Fähigkeit zur Teamarbeit,
- Bereitschaft zur fachlichen Weiterbildung,
- Lehrerfahrung in mathematischen Veranstaltungen,
- Forschungstätigkeit im Bereich der anwendungsorientierten Mathematik,
vorzugsweise der mathematischen Optimierung.
Die Technische Universität Darmstadt strebt eine Erhöhung des Anteils
der Frauen am Personal an und fordert deshalb besonders Frauen auf, sich
zu bewerben. Bewerberinnen oder Bewerber mit einem Grad der Behinderung
von mindestens 50 oder diesen Gleichgestellte werden bei gleicher
Eignung bevorzugt. Die Vergütung erfolgt nach dem Tarifvertrag für die
Technische Universität Darmstadt (TV - TU Darmstadt).
Teilzeitbeschäftigung ist grundsätzlich möglich.
Bewerbungen sind mit den üblichen Unterlagen unter Angabe der
Kenn-Nummer postalisch an den Dekan des Fachbereichs Mathematik,
Schloßgartenstr. 7, 64289 Darmstadt, oder elektronisch an
bewerbung@mathematik.tu-darmstadt.de senden. Für Rückfragen steht Ihnen
der Fachbereichskoordinator, Herr Dr. Andreas Mars, Tel.: 06151 - 163589
oder 0160-97245802, mars@mathematik.tu-darmstadt.de, gerne zur Verfügung.
Kenn.-Nr. 104
Bewerbungsfrist: 01.05.2013
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] New, post conference publication of Computational Optimization
[Please post - apologies for multiple copies.]
------------
Call for Papers
6th Workshop on Computational Optimization (WCO 2013)
Krakow, Poland, September 8 - 11, 2013
organized in the framework of FEDERATED CONFERENCE ON COMPUTER SCIENCE
AND INFORMATION SYSTEMS
FedCSIS - 2013
http://www.fedcsis.org/
====================
We invite original contributions related with both theoretical and
practical aspects of optimization methods.
The list of topics includes, but is not limited to:
* unconstrained and constrained optimization
* combinatorial optimization
* global optimization
* multiobjective optimization
* optimization in dynamic and/or noisy environments
* large scale optimization
* parallel and distributed approaches in optimization
* random search algorithms, simulated annealing, tabu search and other
derivative free optimization methods
* nature inspired optimization methods (evolutionary algorithms, ant
colony optimization, particle swarm optimization, immune artificial
systems etc)
* hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
* computational biology and optimization
* distance geometry and applications
* optimization methods for learning processes and data mining
* application of optimization methods on real life and industrial problems
* computational optimization methods in statistics, econometrics,
finance, physics, medicine, engineering etc
====================
Important dates:
12.05.2013 (May 12, 2013): Full paper submission
17.06.2013 (June 17, 2013): Notification of acceptance
8.07.2013 (July 8, 2013): Camera-ready version of the accepted paper
and registration
====================
Submission and Publication
* Authors should submit draft papers as PDF.
* The total length of a paper should not exceed 8 pages (IEEE style).
IEEE style templates are available at http://www.fedcsis.org/.
* Papers will be refereed and accepted on the basis of their
scientific merit and relevance to the workshop.
* Accepted and Presented papers will be published in the Conference
Proceedings and included in the IEEE Xplore database (pending) and
indexed in the DBLP.
* Extended versions of selected papers presented during the conference
will be published as Special Issue(s) in Studies of Computational
Intelligence of Springer.
====================
If you have any question do not hesitate to send a mail to wco2013@fedcsis.org .
Workshop co-chairs:
Stefka Fidanova, Bulgaria
Antonio Mucherino, France
Daniela Zaharie, Romania
--
Assoc. Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
------------
Call for Papers
6th Workshop on Computational Optimization (WCO 2013)
Krakow, Poland, September 8 - 11, 2013
organized in the framework of FEDERATED CONFERENCE ON COMPUTER SCIENCE
AND INFORMATION SYSTEMS
FedCSIS - 2013
http://www.fedcsis.org/
====================
We invite original contributions related with both theoretical and
practical aspects of optimization methods.
The list of topics includes, but is not limited to:
* unconstrained and constrained optimization
* combinatorial optimization
* global optimization
* multiobjective optimization
* optimization in dynamic and/or noisy environments
* large scale optimization
* parallel and distributed approaches in optimization
* random search algorithms, simulated annealing, tabu search and other
derivative free optimization methods
* nature inspired optimization methods (evolutionary algorithms, ant
colony optimization, particle swarm optimization, immune artificial
systems etc)
* hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
* computational biology and optimization
* distance geometry and applications
* optimization methods for learning processes and data mining
* application of optimization methods on real life and industrial problems
* computational optimization methods in statistics, econometrics,
finance, physics, medicine, engineering etc
====================
Important dates:
12.05.2013 (May 12, 2013): Full paper submission
17.06.2013 (June 17, 2013): Notification of acceptance
8.07.2013 (July 8, 2013): Camera-ready version of the accepted paper
and registration
====================
Submission and Publication
* Authors should submit draft papers as PDF.
* The total length of a paper should not exceed 8 pages (IEEE style).
IEEE style templates are available at http://www.fedcsis.org/.
* Papers will be refereed and accepted on the basis of their
scientific merit and relevance to the workshop.
* Accepted and Presented papers will be published in the Conference
Proceedings and included in the IEEE Xplore database (pending) and
indexed in the DBLP.
* Extended versions of selected papers presented during the conference
will be published as Special Issue(s) in Studies of Computational
Intelligence of Springer.
====================
If you have any question do not hesitate to send a mail to wco2013@fedcsis.org .
Workshop co-chairs:
Stefka Fidanova, Bulgaria
Antonio Mucherino, France
Daniela Zaharie, Romania
--
Assoc. Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Monday, April 1, 2013
[DMANET] PhD positions in Discrete Math at University of Tartu, Estonia
The University of Tartu is looking for candidates for several
PhD-positions in Discrete Mathematics.
The work environment is multi-national. The language of
instruction and communication is English.
You should be interested in at least one of the following:
- Probabilistic combinatorics
- Matrix theory, or
- Hypergraph theory, graph coloring, probabilistic methods.
The discrete mathematics research group is smal and vibrant. We
value working closely with research students: There will be
twice-weekly (at least) meetings between the supervisor and each
PhD student.
The successful candidate will
- have an excellent background in mathematics;
- be fluent in English;
- be able to express concisely his mathematical ideas and
questions;
- hold a Masters degree (or equivalent), or be in the process of
acquiring one, in Mathematics or Computer Science (or a
closely related discipline).
If you are interested, please contact
Dr Dirk Oliver Theis
Senior Lecturer
University of Tartu
dirk.oliver.theis@ut.ee
Informal inquiries are welcome: Just send a couple of lines about
your education and your interests.
See below for more information regarding Estonia, Tartu, the
University of Tartu, and the institute.
The PhD program
===============
The 4-year PhD program (affiliated in Computer Science) comprises
one year of course work and three years of research. You can
choose between a position without teaching obligations, or a 5h
weekly teaching load. The salary is competitive (i.e., depends
on the candidate's qualifications).
About half of the PhD students in the program are non-Estonian.
Estonia
=======
Estonia is a Euro-zone country located directly south of Finland.
Estonia is an ``E-Society'': Broadband Internet (e.g. LTE) is
fast and inexpensive or free (public WiFi is ubiquitous). The
country scores 1st in the world in Internet Freedom and 5th in
Privacy. It is ranked directly behind Germany in the ``State of
the World's Children's Index'' (10th). In the Human-Development
index, it scores between the UK and Portugal. See Wikipedia for
these and other statistical facts.
Pretty much everybody under 40 speaks English. It is not
necessary (though polite) to learn Estonian. The language is
similar to Finnish.
Tartu
=====
Tartu is a picturesque city in southern Estonia. Home to 17,000
students (in a population of 105,000), there are lots of
inexpensive restaurants, bars, and cafés.
Universitas Tartuensis
======================
Founded in 1632, the University of Tartu is one of the most
venerable centers of education and research in this part of the
world. In rankings (e.g., Times Higher Education World
University Ranking), it is ranked in the top 400 universities
world wide, with a rapid ascent over the recent years.
The CS institute
================
A significant number of the Computer Science institute faculty
are expatriates. Cryptology is a traditional stronghold. The
discrete mathematics group, of which you will be part, is
currently in expansion/construction.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
PhD-positions in Discrete Mathematics.
The work environment is multi-national. The language of
instruction and communication is English.
You should be interested in at least one of the following:
- Probabilistic combinatorics
- Matrix theory, or
- Hypergraph theory, graph coloring, probabilistic methods.
The discrete mathematics research group is smal and vibrant. We
value working closely with research students: There will be
twice-weekly (at least) meetings between the supervisor and each
PhD student.
The successful candidate will
- have an excellent background in mathematics;
- be fluent in English;
- be able to express concisely his mathematical ideas and
questions;
- hold a Masters degree (or equivalent), or be in the process of
acquiring one, in Mathematics or Computer Science (or a
closely related discipline).
If you are interested, please contact
Dr Dirk Oliver Theis
Senior Lecturer
University of Tartu
dirk.oliver.theis@ut.ee
Informal inquiries are welcome: Just send a couple of lines about
your education and your interests.
See below for more information regarding Estonia, Tartu, the
University of Tartu, and the institute.
The PhD program
===============
The 4-year PhD program (affiliated in Computer Science) comprises
one year of course work and three years of research. You can
choose between a position without teaching obligations, or a 5h
weekly teaching load. The salary is competitive (i.e., depends
on the candidate's qualifications).
About half of the PhD students in the program are non-Estonian.
Estonia
=======
Estonia is a Euro-zone country located directly south of Finland.
Estonia is an ``E-Society'': Broadband Internet (e.g. LTE) is
fast and inexpensive or free (public WiFi is ubiquitous). The
country scores 1st in the world in Internet Freedom and 5th in
Privacy. It is ranked directly behind Germany in the ``State of
the World's Children's Index'' (10th). In the Human-Development
index, it scores between the UK and Portugal. See Wikipedia for
these and other statistical facts.
Pretty much everybody under 40 speaks English. It is not
necessary (though polite) to learn Estonian. The language is
similar to Finnish.
Tartu
=====
Tartu is a picturesque city in southern Estonia. Home to 17,000
students (in a population of 105,000), there are lots of
inexpensive restaurants, bars, and cafés.
Universitas Tartuensis
======================
Founded in 1632, the University of Tartu is one of the most
venerable centers of education and research in this part of the
world. In rankings (e.g., Times Higher Education World
University Ranking), it is ranked in the top 400 universities
world wide, with a rapid ascent over the recent years.
The CS institute
================
A significant number of the Computer Science institute faculty
are expatriates. Cryptology is a traditional stronghold. The
discrete mathematics group, of which you will be part, is
currently in expansion/construction.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Subscribe to:
Posts (Atom)
Posts
