********************************************************************
We apologize in advance if you receive multiple copies of this CFP.
Please disseminate CFP to your colleagues that might be interested.
********************************************************************
---------------------------------------------------------
Call for Papers
ICDCS 2014
34th Int. Conf. on Distributed Computing Systems
30th June-3rd July 2014
Madrid, Spain
http://lsd.ls.fi.upm.es/icdcs2014
---------------------------------------------------------
SCOPE
The conference provides a forum for engineers and scientists in academia,
industry and government to present their latest research findings
in any aspects of distributed computing.
Topics of particular interest include, but are not limited to:
- Big Data, Data Management and Analytics
- Cloud Computing and Data Center Systems
- Distributed OS and Middleware
- Algorithms and Theory
- Fault Tolerance and Dependability
- Security and Privacy
- Social Networks, Crowdsourcing, and P2P systems
- Energy Management and Green Computing
- Sensor Networks and Systems
- Mobile and Wireless Computing
- File and Storage Systems
NOTE: To build a broad program and to encourage a diverse set of submissions,
a limited number of papers will be accepted within each topic area,
and every topic area will accept a minimum quota of papers.
WORKSHOPS
Workshops will be held in conjunction with the conference.
Workshop proposals should be submitted to Workshops Co-Chairs Prof.
Roberto Baldoni (baldoni@dis.uniroma1.it)
and Prof. Jason Gu (jasongu@sutd.edu.sg) by September 30th, 2013.
Notification of acceptance will be made by October 10th, 2013. Please see
the conference web page for details.
PAPER SUBMISSION
Form of Manuscript: All paper submissions should follow the IEEE 8.5" x
11" Two-Column Format.
Each submission can have 10 pages. If the paper is accepted for
publication, up to 2 overlength pages
may be purchased for the final camera-ready version. Submitted papers
should NOT be blinded for review.
Electronic Submission: Submissions will be handled via the conference web
page.
IMPORTANT DEADLINES
Abstract registration 22nd November 2013
Paper Submission 29th November 2013
Author Notification 17th March 2014
Final Manuscript Due 7th April 2014
For further information, please contact General Chair, Prof. Marta
Patiño-Martínez (mpatino@fi.upm.es) or
Program Co-Chair, Prof. Ricardo Jimenez-Peris (rjimenez@fi.upm.es).
ORGANIZING & PROGRAM COMMITTEES
General Chair
Marta Patiño-Martínez (Univ. Politécnica de Madrid, Spain)
Program Co-Chairs
Ricardo Jimenez-Peris (Univ. Politécnica de Madrid, Spain)
Hui Lei (IBM Watson, US)
Program Vice Chairs
Big Data, Data Management and Analytics
Phillip Gibbons (Intel Labs, US)
Cloud Computing and Data Center Systems
Flavio Junqueira (MSR-Cambridge, UK)
Distributed OS and Middleware
Gustavo Alonso (ETH Zurich, Switzerland)
Algorithms and Theory
Antonio Fernandez-Anta (IMDEA, Spain)
Fault Tolerance and Dependability
Bettina Kemme (McGill Univ., Canada)
Security and Privacy
Elisa Bertino (Purdue, US)
Social Networks, Crowdsourcing, and P2P systems
Alberto Montresor (Trento Univ., Italy)
Energy Management and Green Computing
Tarek F. Abdelzaher (UIUC, US)
Sensor Networks and Systems
Tian He (University of Minnesota, US)
Mobile and Wireless Computing
Guohong Cao ( Pennsylvania State Univ, US)
File and Storage Systems
André Brinkmann (Meinz Univ., Germany)
Program Committee Members
http://lsd.ls.fi.upm.es/icdcs2014/pc-members
Workshops Co-Chairs
Roberto Baldoni (Univ. Sapienza, Italy)
Jason Gu (Singapore Univ., Singapore)
Publicity Chair
Ernesto Jimenez (Univ. Politecnica Madrid, Spain)
Publication Chair
Mikel Larra (Univ. Pais Vasco, Spain)
TCDP Chair
Jiannong Cao,(Hong Kong Polyt. Univ., HK)
Steering Committee Chair
Xiaodong Zhang (Ohio State Univ., USA)
Sponsors
Microsoft Research Cambridge
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Tuesday, October 8, 2013
[DMANET] [CPAIOR 2014] 2nd Call for Papers
2nd Call for Papers
CPAIOR 2014
Eleventh International Conference on Integration of Artificial
Intelligence and Operations Research Techniques in Constraint
Programming
web: http://4c.ucc.ie/cpaior2014/
cpaior series: http://www.andrew.cmu.edu/user/vanhoeve/cpaior/
Cork, Ireland
MAY 19 - 23, 2014
=============================================================================
DEADLINES (note ***CHANGED*** DEADLINE)
=============================================================================
PAPER SUBMISSION (identical for long and short papers):
Abstract due: NOV 20, 2013 11.59 P.M. PST
Paper due: NOV 24, 2013 11.59 P.M. PST
Rebuttal Phase: DEC 20-23, 2013
Final Notification: JAN 10, 2014
Final version due: FEB 10, 2014
=============================================================================
The Eleventh International Conference on Integration of Artificial
Intelligence and Operations Research Techniques in Constraint
Programming will be held in Cork, Ireland, May 19-23, 2014 with
Workshops on May 19th, a Master Class on Data Mining, Machine Learning
and Constraint Programming on May 20, and the Main Conference on May
21-23, 2014.
The aim of the conference is to bring together interested researchers
from Constraint Programming (CP), Artificial Intelligence (AI), and
Operations Research (OR) to present new techniques or new applications
in combinatorial optimization and to provide an opportunity for
researchers in one area to learn about techniques in the others. A
main objective of this conference series is also to give these
researchers the opportunity to show how the integration of techniques
from different fields can lead to interesting results on large and
complex problems. Therefore papers that actively combine, integrate,
or contrast approaches from more than one of the areas are especially
solicited. High quality papers from a single area are also welcome,
provided that they are of interest to other communities involved.
Finally, application papers showcasing CP/AI/OR techniques on
innovative and challenging applications or experience reports on such
applications are strongly encouraged.
The program committee invites submissions that include but are not
limited to the following topics:
* Inference and relaxation methods: constraint propagation, cutting
planes, global constraints, graph algorithms, dynamic programming,
Lagrangean and convex relaxations, heuristic functions based on
constraint relaxation.
* Search methods: branch and bound, intelligent backtracking,
incomplete search, randomized search, column generation and other
decomposition methods, local search, meta-heuristics.
* Integration methods: static/dynamic problem decomposition, solver
communication, transformations between models and solvers,
collaboration between concurrent methods, models, and solvers.
* Modeling methods: comparison of models, symmetry breaking,
uncertainty, dominance relationships.
* Innovative Applications of CP/AI/OR techniques.
* Implementation of CP/AI/OR techniques and optimization systems.
PAPER SUBMISSION
Paper submissions are of two types: Long papers and short papers.
INSTRUCTION FOR LONG PAPERS:
Long papers should present original unpublished work and be at most 15
pages plus references in length, and should be prepared in the format
used for the Springer Lecture Notes in Computer Science series
(http://www.springer.de/comp/lncs/authors.html). These papers will
undergo rigorous review. The proceedings will be published in the
Springer Lecture Notes in Computer Science series.
NOTE: Unlike previous CPAIOR conferences the page limit for long
papers is 15 LNCS pages *plus references*.
INSTRUCTION FOR SHORT PAPERS: Short papers are also encouraged,
limited to 8 LNCS pages plus references and should be prepared with
the same format as long papers
(http://www.springer.de/comp/lncs/authors.html). Although containing
less material, short papers should describe original unpublished work
and will be reviewed to the same criteria of quality as long papers.
It is also encouraged to submit short papers about work in progress on
ideas that are interesting but for which the practical or theoretical
relevance is not yet fully identified. Short papers will be presented
at the conference and published in the conference proceedings.
SUBMISSION NOTES:
All papers are to be submitted electronically in PDF format by
following the instructions at the URL
http://www.easychair.org/conferences/?conf=cpaior2014
For any queries on the submission process, please contact the Program
Chairs using the email cpaior2014@gmail.com .
PROGRAM CHAIR:
Helmut Simonis
**********************************************************
*
* 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/
*
**********************************************************
CPAIOR 2014
Eleventh International Conference on Integration of Artificial
Intelligence and Operations Research Techniques in Constraint
Programming
web: http://4c.ucc.ie/cpaior2014/
cpaior series: http://www.andrew.cmu.edu/user/vanhoeve/cpaior/
Cork, Ireland
MAY 19 - 23, 2014
=============================================================================
DEADLINES (note ***CHANGED*** DEADLINE)
=============================================================================
PAPER SUBMISSION (identical for long and short papers):
Abstract due: NOV 20, 2013 11.59 P.M. PST
Paper due: NOV 24, 2013 11.59 P.M. PST
Rebuttal Phase: DEC 20-23, 2013
Final Notification: JAN 10, 2014
Final version due: FEB 10, 2014
=============================================================================
The Eleventh International Conference on Integration of Artificial
Intelligence and Operations Research Techniques in Constraint
Programming will be held in Cork, Ireland, May 19-23, 2014 with
Workshops on May 19th, a Master Class on Data Mining, Machine Learning
and Constraint Programming on May 20, and the Main Conference on May
21-23, 2014.
The aim of the conference is to bring together interested researchers
from Constraint Programming (CP), Artificial Intelligence (AI), and
Operations Research (OR) to present new techniques or new applications
in combinatorial optimization and to provide an opportunity for
researchers in one area to learn about techniques in the others. A
main objective of this conference series is also to give these
researchers the opportunity to show how the integration of techniques
from different fields can lead to interesting results on large and
complex problems. Therefore papers that actively combine, integrate,
or contrast approaches from more than one of the areas are especially
solicited. High quality papers from a single area are also welcome,
provided that they are of interest to other communities involved.
Finally, application papers showcasing CP/AI/OR techniques on
innovative and challenging applications or experience reports on such
applications are strongly encouraged.
The program committee invites submissions that include but are not
limited to the following topics:
* Inference and relaxation methods: constraint propagation, cutting
planes, global constraints, graph algorithms, dynamic programming,
Lagrangean and convex relaxations, heuristic functions based on
constraint relaxation.
* Search methods: branch and bound, intelligent backtracking,
incomplete search, randomized search, column generation and other
decomposition methods, local search, meta-heuristics.
* Integration methods: static/dynamic problem decomposition, solver
communication, transformations between models and solvers,
collaboration between concurrent methods, models, and solvers.
* Modeling methods: comparison of models, symmetry breaking,
uncertainty, dominance relationships.
* Innovative Applications of CP/AI/OR techniques.
* Implementation of CP/AI/OR techniques and optimization systems.
PAPER SUBMISSION
Paper submissions are of two types: Long papers and short papers.
INSTRUCTION FOR LONG PAPERS:
Long papers should present original unpublished work and be at most 15
pages plus references in length, and should be prepared in the format
used for the Springer Lecture Notes in Computer Science series
(http://www.springer.de/comp/lncs/authors.html). These papers will
undergo rigorous review. The proceedings will be published in the
Springer Lecture Notes in Computer Science series.
NOTE: Unlike previous CPAIOR conferences the page limit for long
papers is 15 LNCS pages *plus references*.
INSTRUCTION FOR SHORT PAPERS: Short papers are also encouraged,
limited to 8 LNCS pages plus references and should be prepared with
the same format as long papers
(http://www.springer.de/comp/lncs/authors.html). Although containing
less material, short papers should describe original unpublished work
and will be reviewed to the same criteria of quality as long papers.
It is also encouraged to submit short papers about work in progress on
ideas that are interesting but for which the practical or theoretical
relevance is not yet fully identified. Short papers will be presented
at the conference and published in the conference proceedings.
SUBMISSION NOTES:
All papers are to be submitted electronically in PDF format by
following the instructions at the URL
http://www.easychair.org/conferences/?conf=cpaior2014
For any queries on the submission process, please contact the Program
Chairs using the email cpaior2014@gmail.com .
PROGRAM CHAIR:
Helmut Simonis
**********************************************************
*
* 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-Nominations: The 2014 Dan David Prize in Artificial Intelligence
Call for Nominations and Scholarships
The 2014 Dan David Prize
Artificial Intelligence, the Digital Mind
Three prizes are awarded annually in fields chosen within the three time
dimensions -- Past, Present, and Future. The selected field for 2014 in the
Future dimension is Artificial Intelligence, the Digital Mind.
The Dan David Prize is awarded to individuals and institutions with
proven, exceptional excellence and contribution to humanity in the sciences,
arts, humanities, public service and business.
*Nominations deadline: *November 30, 2013
For information regarding the Dan David Prize and nomination submission
please consult the website: http://www.dandavidprize.org/prize-nominations
Contact information:
Ms. Smadar Fisher, Director
Prof. Isaac P. Witz, Scientific Adviser
Dan David Prize, Eitan Berglas Bldg./ l 19, Tel Aviv University,
Tel Aviv 69978, Israel
Email: ddprize@post.tau.ac.il Tel: +972-3-6406614/5, Fax: +972-3-6406613
Each year the Dan David Prize awards 20 scholarships of US$ 15,000 each to
outstanding doctoral students and postdoctoral researchers; 10 scholarships are
awarded to students from universities all over the world and 10 scholarships to
students from Tel Aviv University. Advanced doctoral and postdoctoral students
of excellent achievement and promise studying topics related to the fields
chosen for this year are invited to apply for the Dan David Prize Scholarships
2014. Applications deadline: February 28, 2014 For details regarding
scholarships, please consult the
website: http://www.dandavidprize.org
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
The 2014 Dan David Prize
Artificial Intelligence, the Digital Mind
Three prizes are awarded annually in fields chosen within the three time
dimensions -- Past, Present, and Future. The selected field for 2014 in the
Future dimension is Artificial Intelligence, the Digital Mind.
The Dan David Prize is awarded to individuals and institutions with
proven, exceptional excellence and contribution to humanity in the sciences,
arts, humanities, public service and business.
*Nominations deadline: *November 30, 2013
For information regarding the Dan David Prize and nomination submission
please consult the website: http://www.dandavidprize.org/prize-nominations
Contact information:
Ms. Smadar Fisher, Director
Prof. Isaac P. Witz, Scientific Adviser
Dan David Prize, Eitan Berglas Bldg./ l 19, Tel Aviv University,
Tel Aviv 69978, Israel
Email: ddprize@post.tau.ac.il Tel: +972-3-6406614/5, Fax: +972-3-6406613
Each year the Dan David Prize awards 20 scholarships of US$ 15,000 each to
outstanding doctoral students and postdoctoral researchers; 10 scholarships are
awarded to students from universities all over the world and 10 scholarships to
students from Tel Aviv University. Advanced doctoral and postdoctoral students
of excellent achievement and promise studying topics related to the fields
chosen for this year are invited to apply for the Dan David Prize Scholarships
2014. Applications deadline: February 28, 2014 For details regarding
scholarships, please consult the
website: http://www.dandavidprize.org
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Last Mile, October 17 || ICONS 2014 || February 23 - 27, 2014 - Nice, France
INVITATION:
=================
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results to ICONS 2014.
The submission deadline is October 17, 2013.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org
=================
============== ICONS 2014 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
ICONS 2014, The Ninth International Conference on Systems
February 23 - 27, 2014 - Nice, France
General page: http://www.iaria.org/conferences2014/ICONS14.html
Call for Papers: http://www.iaria.org/conferences2014/CfPICONS14.html
- regular papers
- short papers (work in progress)
- posters
Submission page: http://www.iaria.org/conferences2014/SubmitICONS14.html
Submission deadline: October 17, 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
ICONS 2014 Topics (topics and submission details: see CfP on the site)
Systems' Theory and Practice
Systems design methodologies and techniques; Formal methods to specify systems? behavior; Online and offline systems; Open and closed systems; Centralized and distributed systems; Proactive and reactive systems; System robustness; Systems scalability; Fault-tolerant systems; Feedback systems; High-speed systems; Delay tolerant systems; Real-time systems
Systems engineering
Systems requirements; Systems modeling; Systems development lifecycle; System-of-systems; Systems ergonomics; Subsystem interactions; Systems decomposition; Systems integration
System Instrumentation
Metering embedded sensors; Composing multi-scale measurements; Monitoring instrumentation; Smart sensor-based systems; Calibration and self-calibration systems; Instrumentation for prediction systems
Embedded systems and systems-on-the-chip
Real-time embedded systems Programming embedded systems; Controlling embedded systems; High speed embedded systems; Designing methodologies for embedded systems; Performance on embedded systems; Updating embedded systems; Wireless/wired design of systems-on-the-chip; Testing embedded systems; Technologies for systems processors; Migration to single-chip systems; Micro/nano structures and systems
Target-oriented systems [emulation, simulation, prediction, etc.]
Information systems; Real-time systems; Software systems; Hardware systems; Emulation systems; Simulation systems Prediction systems
Specialized systems [sensor-based, mobile, multimedia, biometrics, etc.]
Sensor-based systems; Biometrics systems; Mobile and fixed systems; Ubiquitous systems; Nano-technology-based systems; Multimedia systems
Validation systems
Diagnosis assistance systems; Test systems; Validation systems; Performance measurement systems; Maintenance systems
Security and protection systems
Security systems; Vulnerability detecting systems; Intrusion detection systems Intrusion avoidance systems; Presence detection systems; Monitoring systems; Management systems; Alert systems; Defense systems; Emergency systems
Advanced systems [expert, tutoring, self-adapting, interactive, etc.]
Expert systems; Tutoring systems; Highly interactive systems; Anticipative systems; On-demand systems; GRID systems; Autonomic systems; Autonomous systems; Self-adapting systems; Adjustable autonomic systems; High performance computing systems; Mission critical systems
Application-oriented systems [content, eHealth, radar, financial, vehicular, etc.]
Web-cashing systems; Content-distributed systems; Accounting and billing systems; E-Health systems; E-Commerce systems; Radar systems; Navigation systems; Systems for measuring physical quantities; Earthquake detection and ranking systems; Financial systems; Robotics systems; Vehicular systems; Entertainment systems; Gaming systems; Speech recognition system
IT Systems
IT service management; IT Infrastructure management; IT service desk; Service support and delivery; Service strategy; Service design; Service transition; Service operation; Continual service improvement
Safety in industrial systems
Fundamentals on system safety; Safety of software systems and software engineering; Safety requirements; Safety for critical systems; Engineering for system robustness and reliability; Control of mission critical systems; Safety-oriented system design; Human tasks and error models; Hazard analysis; Cost and effectiveness of system safety; Verification and validation of safety; Safety tools; Evaluation of safety data, and mitigation and prevention strategies; Safety control and management; System Safety Implementation Guidelines and Standards; Transferring safety knowledge; Metrics for Risk Assessment; Contingency Planning and Occurrence Reporting; Preparedness Activities; Industry specific safety systems (Medical devices, Aerospace, Chemical industry, Nuclear power plants, Public health, Biological Safety)
Complex systems
Theory of complex systems; Ontologies for complex systems; Chaos and complexity; Design and integrate complex systems; Complexity and simulation; Simulation and datamining; Artificial intelligence and soft computing in complex systems; Multi-agent based simulation; Systems of systems; Intelligent agent architectures; Evolutionary programming; Uncertainty reduction and classification; Monitoring and managing complex systems; Case studies of complex systems [vehicular, avionic, health, emergency, sensing, etc.]; Industrial systems [robotics, production, accounting and billing, e-commerce, etc.]
-----------------------
Committee: http://www.iaria.org/conferences2014/ComICONS14.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 ICONS 2014.
The submission deadline is October 17, 2013.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org
=================
============== ICONS 2014 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
ICONS 2014, The Ninth International Conference on Systems
February 23 - 27, 2014 - Nice, France
General page: http://www.iaria.org/conferences2014/ICONS14.html
Call for Papers: http://www.iaria.org/conferences2014/CfPICONS14.html
- regular papers
- short papers (work in progress)
- posters
Submission page: http://www.iaria.org/conferences2014/SubmitICONS14.html
Submission deadline: October 17, 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
ICONS 2014 Topics (topics and submission details: see CfP on the site)
Systems' Theory and Practice
Systems design methodologies and techniques; Formal methods to specify systems? behavior; Online and offline systems; Open and closed systems; Centralized and distributed systems; Proactive and reactive systems; System robustness; Systems scalability; Fault-tolerant systems; Feedback systems; High-speed systems; Delay tolerant systems; Real-time systems
Systems engineering
Systems requirements; Systems modeling; Systems development lifecycle; System-of-systems; Systems ergonomics; Subsystem interactions; Systems decomposition; Systems integration
System Instrumentation
Metering embedded sensors; Composing multi-scale measurements; Monitoring instrumentation; Smart sensor-based systems; Calibration and self-calibration systems; Instrumentation for prediction systems
Embedded systems and systems-on-the-chip
Real-time embedded systems Programming embedded systems; Controlling embedded systems; High speed embedded systems; Designing methodologies for embedded systems; Performance on embedded systems; Updating embedded systems; Wireless/wired design of systems-on-the-chip; Testing embedded systems; Technologies for systems processors; Migration to single-chip systems; Micro/nano structures and systems
Target-oriented systems [emulation, simulation, prediction, etc.]
Information systems; Real-time systems; Software systems; Hardware systems; Emulation systems; Simulation systems Prediction systems
Specialized systems [sensor-based, mobile, multimedia, biometrics, etc.]
Sensor-based systems; Biometrics systems; Mobile and fixed systems; Ubiquitous systems; Nano-technology-based systems; Multimedia systems
Validation systems
Diagnosis assistance systems; Test systems; Validation systems; Performance measurement systems; Maintenance systems
Security and protection systems
Security systems; Vulnerability detecting systems; Intrusion detection systems Intrusion avoidance systems; Presence detection systems; Monitoring systems; Management systems; Alert systems; Defense systems; Emergency systems
Advanced systems [expert, tutoring, self-adapting, interactive, etc.]
Expert systems; Tutoring systems; Highly interactive systems; Anticipative systems; On-demand systems; GRID systems; Autonomic systems; Autonomous systems; Self-adapting systems; Adjustable autonomic systems; High performance computing systems; Mission critical systems
Application-oriented systems [content, eHealth, radar, financial, vehicular, etc.]
Web-cashing systems; Content-distributed systems; Accounting and billing systems; E-Health systems; E-Commerce systems; Radar systems; Navigation systems; Systems for measuring physical quantities; Earthquake detection and ranking systems; Financial systems; Robotics systems; Vehicular systems; Entertainment systems; Gaming systems; Speech recognition system
IT Systems
IT service management; IT Infrastructure management; IT service desk; Service support and delivery; Service strategy; Service design; Service transition; Service operation; Continual service improvement
Safety in industrial systems
Fundamentals on system safety; Safety of software systems and software engineering; Safety requirements; Safety for critical systems; Engineering for system robustness and reliability; Control of mission critical systems; Safety-oriented system design; Human tasks and error models; Hazard analysis; Cost and effectiveness of system safety; Verification and validation of safety; Safety tools; Evaluation of safety data, and mitigation and prevention strategies; Safety control and management; System Safety Implementation Guidelines and Standards; Transferring safety knowledge; Metrics for Risk Assessment; Contingency Planning and Occurrence Reporting; Preparedness Activities; Industry specific safety systems (Medical devices, Aerospace, Chemical industry, Nuclear power plants, Public health, Biological Safety)
Complex systems
Theory of complex systems; Ontologies for complex systems; Chaos and complexity; Design and integrate complex systems; Complexity and simulation; Simulation and datamining; Artificial intelligence and soft computing in complex systems; Multi-agent based simulation; Systems of systems; Intelligent agent architectures; Evolutionary programming; Uncertainty reduction and classification; Monitoring and managing complex systems; Case studies of complex systems [vehicular, avionic, health, emergency, sensing, etc.]; Industrial systems [robotics, production, accounting and billing, e-commerce, etc.]
-----------------------
Committee: http://www.iaria.org/conferences2014/ComICONS14.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/
*
**********************************************************
Monday, October 7, 2013
[DMANET] ISCO 2014 and Spring School in Stochastic Programming (2nd announcement)
ISCO 2014 and Spring School in Stochastic Programming (2nd announcement)
The 3rd International Symposium in Combinatorial Optimization (ISCO 2014) will take place in Lisbon, March 5-7 2014, in Campo Grande, Lisboa, Portugal.
ISCO is a biannual symposium whose aim is to gather researchers from combinatorial optimization and other related fields of operations research.
Conference Chairs: Luis Gouveia (Univ of Lisbon-CIO) and Ridha Mahjoub (University Paris-Dauphine)
Plenary Speakers: Matteo Fischetti (Univ. of Padova), Martin Grotschel (ZIB-Berlin) and Adam Letchford (University of Lancaster)
Abstract submission deadline: December 15, 2013
Accepted regular papers (with up to 12 pages) will be published by Springer-Verlag in the Lecture Notes in Computer Science (LNCS) series in a post-conference proceedings volume. The authors will have to prepare their camera-ready version two weeks after the end of ISCO 2014.
A special issue of Discrete Optimization on "Combinatorial Optimization" will be associated to ISCO2014
This symposium is preceded by a spring school titled "Stochastic Programs with Integer Variables: Theory, Algorithms, and Applications"
School lecturers - Rüdiger Schultz (University of Duisburg) and Jonas Schweiger (ZIB-Berlin)
For more information on the Symposium and School, see ISCO2014.fc.ul.pt.
The 12th INFORMS Telecommunications Conference (2014) will also be held from the 2nd to the 4th of March, just before ISCO 2014, also at Campo Grande, Lisbon.
See the registration (to be updated) for reduced fees for people attending the two conferences.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
The 3rd International Symposium in Combinatorial Optimization (ISCO 2014) will take place in Lisbon, March 5-7 2014, in Campo Grande, Lisboa, Portugal.
ISCO is a biannual symposium whose aim is to gather researchers from combinatorial optimization and other related fields of operations research.
Conference Chairs: Luis Gouveia (Univ of Lisbon-CIO) and Ridha Mahjoub (University Paris-Dauphine)
Plenary Speakers: Matteo Fischetti (Univ. of Padova), Martin Grotschel (ZIB-Berlin) and Adam Letchford (University of Lancaster)
Abstract submission deadline: December 15, 2013
Accepted regular papers (with up to 12 pages) will be published by Springer-Verlag in the Lecture Notes in Computer Science (LNCS) series in a post-conference proceedings volume. The authors will have to prepare their camera-ready version two weeks after the end of ISCO 2014.
A special issue of Discrete Optimization on "Combinatorial Optimization" will be associated to ISCO2014
This symposium is preceded by a spring school titled "Stochastic Programs with Integer Variables: Theory, Algorithms, and Applications"
School lecturers - Rüdiger Schultz (University of Duisburg) and Jonas Schweiger (ZIB-Berlin)
For more information on the Symposium and School, see ISCO2014.fc.ul.pt.
The 12th INFORMS Telecommunications Conference (2014) will also be held from the 2nd to the 4th of March, just before ISCO 2014, also at Campo Grande, Lisbon.
See the registration (to be updated) for reduced fees for people attending the two conferences.
**********************************************************
*
* 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] INFORMS Telecommunications 2014 - 2nd announcement
INFORMS Telecommunications 2014 (www.informstelecom2014.fc.ul.pt) - 2nd announcement
The 12th INFORMS Telecommunications Conference will be held March 2 - 4, 2014 in Campo Grande, Lisboa, Portugal.
In the tradition of the previous conferences, the 12th Conference will focus on the theory and application of operations research and management science to problems in telecommunications, with particular emphasis on new and emerging technologies. The conference is organized by the INFORMS Technical Section on Telecommunications.
Conference chair: Luís Gouveia
Conference co-chairs: Maurício Resende and Youngho Lee
Plenary speakers: Thomas Bonald (Telecom Paris Tech), Martin Grötschel (Zuse Institut Berlin) and Guy Leduc (Université de Liège)
2014 Doctoral Dissertation Award for Operations Research in Telecommunications
Abstract submission: January 3rd, 2014
The 3rd International Symposium in Combinatorial Optimization (ISCO 2014) will also be held from the 5th to the 7th of March, just after the INFORMS Telecommunications Conference, also at Campo Grande, Lisbon.
See the registration (to be updated) for reduced fees for people attending the two conferences.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
The 12th INFORMS Telecommunications Conference will be held March 2 - 4, 2014 in Campo Grande, Lisboa, Portugal.
In the tradition of the previous conferences, the 12th Conference will focus on the theory and application of operations research and management science to problems in telecommunications, with particular emphasis on new and emerging technologies. The conference is organized by the INFORMS Technical Section on Telecommunications.
Conference chair: Luís Gouveia
Conference co-chairs: Maurício Resende and Youngho Lee
Plenary speakers: Thomas Bonald (Telecom Paris Tech), Martin Grötschel (Zuse Institut Berlin) and Guy Leduc (Université de Liège)
2014 Doctoral Dissertation Award for Operations Research in Telecommunications
Abstract submission: January 3rd, 2014
The 3rd International Symposium in Combinatorial Optimization (ISCO 2014) will also be held from the 5th to the 7th of March, just after the INFORMS Telecommunications Conference, also at Campo Grande, Lisbon.
See the registration (to be updated) for reduced fees for people attending the two conferences.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] CFP - Workshop on Active Security through Multi-Agent Systems 2014
[.Apologizes if multiple copies received.]
==========================================================
==========================================================
CALL FOR CONTRIBUTIONS
Workshop on Active Security through Multi-Agent Systems
(WASMAS 2014)
in Conjunction with
The 12th International Conference on Practical Applications of
Agents and Multi-Agent Systems (PAAMS 2014)
4 - 6 June 2014
Salamanca, Spain
http://www.paams.net/wasmas14
***** IMPORTANT DATES *****
20th January 2014: Works submission
24th February 2014: Acceptance notification
10th March 2014: Camera-ready papers
4-6 June 2014: Conference dates
***** PUBLICATION *****
ALL accepted papers will be included in PAAMS 2014 Proceedings,
published in CCIS Series of Springer.
Format, extension and submission of contributions are the same
specified for PAAMS main track (http://www.paams.net/).
***** SCOPE *****
Security is an essential issue to be covered by current information and
communication technologies, as services provided both to systems and
users must be reliable. However, most available security related
solutions mainly rely on the deployment of prevention and/or detection
schemes. This in some sense passivity of the defense system limits in
several aspects its capabilities and thus those of the overall
environment.
Given the increasing complexity of networking and communication systems
at present, proactive security solutions offer a number of benefits with
respect to passive security solutions. As such, novel and effective
proactive security related approaches are highly encouraged. Adoption of
these new technologies and methodologies will contribute to increase the
robustness of the environment by leveraging concepts such as response,
collaboration, tolerance, auto-configuration and adaptability, etc.
In this context, the goal of the WASMAS workshop is to contribute new
advances and trends in the use and deployment of agent-like security
related systems, that is schemes composed of pro-active elements with
acting capacities. It is expected that this kind of systems will be of
indubitable help for developing next generation networks, services and
systems.
***** TOPICS *****
Several main topics in the field of security and protection of
services, users, systems and infrastructures, but not limited to them,
are:
- Anti-spoofing robust solutions
- Self-protection and adaptive systems
- Collaborative authentication
- Localization and position-based security
- Non-legitimate events active detection
- Tolerance and survivability
- Auto-configurable environments
- Mobility and pro-active security
- Robust access control
- Active defenses and hacking back strategies
- Resilience against maliciousness
- Collaborative and distributed systems for security
- Defenses against collusion attacks
- Agent-based systems and RoQ
- Cybercrime prosecution schemes
- Response/Reaction mechanisms
- New proposals against DDoS events
- Low-cost security related procedures
- Active security in the cloud
- Privacy-enhanced technologies
- Strategic applications
**** TECHNICAL COMMITTEE *****
Aleksandar Kuzmanovic - University of Northwestern, IL (USA)
Barbara Kordy - University of Luxembourg (Luxembourg)
Danilo Mauro Bruschi - University of Milan (Italy)
David W. Chadwick - University of Kent (UK)
Davide Balzarotti - Eurecom (France)
Federica Paci - University of Trento (Italy)
Flavio Lombardi - Roma Tre University of Roma (Italy)
Gabriel Maciá Fernández - University of Granada (Spain)
Jesús E. Díaz Verdejo - University of Granada (Spain)
José Camacho Páez - University of Granada (Spain)
Juan Manuel Estévez Tapiador - Universidad Carlos III de Madrid (Spain)
Krzysztof Szczypiorski - Warsaw University of Technology (Poland)
Lorenzo Cavallaro - Royal Holloway, University of London (UK)
Matt Bishop - University of California, Davis, CA (USA)
Miguel Soriano Ibáñez - Polytechnic University of Catalunya (Spain)
Nicola Dragoni- Technical University of Denmark (Denmark)
Nils Aschenbruck - University of Osnabrück (Germany)
Simone Fischer-Hübner - Karlstad University (Sweden)
Tarek M. Sobh - University of Bridgeport, CT (USA)
*** CONTACT *****
Pedro García Teodoro (pgteodor@ugr.es)
Network Engineering & Security Group (NESG; http://nesg.ugr.es)
Dpt. Signal Theory, Telematics and Communications
Faculty of Computer Science and Telecommunications
University of Granada
C/ Periodista Daniel Saucedo Aranda, s/n
18071 - Granada, Spain
**********************************************************
*
* 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 CONTRIBUTIONS
Workshop on Active Security through Multi-Agent Systems
(WASMAS 2014)
in Conjunction with
The 12th International Conference on Practical Applications of
Agents and Multi-Agent Systems (PAAMS 2014)
4 - 6 June 2014
Salamanca, Spain
http://www.paams.net/wasmas14
***** IMPORTANT DATES *****
20th January 2014: Works submission
24th February 2014: Acceptance notification
10th March 2014: Camera-ready papers
4-6 June 2014: Conference dates
***** PUBLICATION *****
ALL accepted papers will be included in PAAMS 2014 Proceedings,
published in CCIS Series of Springer.
Format, extension and submission of contributions are the same
specified for PAAMS main track (http://www.paams.net/).
***** SCOPE *****
Security is an essential issue to be covered by current information and
communication technologies, as services provided both to systems and
users must be reliable. However, most available security related
solutions mainly rely on the deployment of prevention and/or detection
schemes. This in some sense passivity of the defense system limits in
several aspects its capabilities and thus those of the overall
environment.
Given the increasing complexity of networking and communication systems
at present, proactive security solutions offer a number of benefits with
respect to passive security solutions. As such, novel and effective
proactive security related approaches are highly encouraged. Adoption of
these new technologies and methodologies will contribute to increase the
robustness of the environment by leveraging concepts such as response,
collaboration, tolerance, auto-configuration and adaptability, etc.
In this context, the goal of the WASMAS workshop is to contribute new
advances and trends in the use and deployment of agent-like security
related systems, that is schemes composed of pro-active elements with
acting capacities. It is expected that this kind of systems will be of
indubitable help for developing next generation networks, services and
systems.
***** TOPICS *****
Several main topics in the field of security and protection of
services, users, systems and infrastructures, but not limited to them,
are:
- Anti-spoofing robust solutions
- Self-protection and adaptive systems
- Collaborative authentication
- Localization and position-based security
- Non-legitimate events active detection
- Tolerance and survivability
- Auto-configurable environments
- Mobility and pro-active security
- Robust access control
- Active defenses and hacking back strategies
- Resilience against maliciousness
- Collaborative and distributed systems for security
- Defenses against collusion attacks
- Agent-based systems and RoQ
- Cybercrime prosecution schemes
- Response/Reaction mechanisms
- New proposals against DDoS events
- Low-cost security related procedures
- Active security in the cloud
- Privacy-enhanced technologies
- Strategic applications
**** TECHNICAL COMMITTEE *****
Aleksandar Kuzmanovic - University of Northwestern, IL (USA)
Barbara Kordy - University of Luxembourg (Luxembourg)
Danilo Mauro Bruschi - University of Milan (Italy)
David W. Chadwick - University of Kent (UK)
Davide Balzarotti - Eurecom (France)
Federica Paci - University of Trento (Italy)
Flavio Lombardi - Roma Tre University of Roma (Italy)
Gabriel Maciá Fernández - University of Granada (Spain)
Jesús E. Díaz Verdejo - University of Granada (Spain)
José Camacho Páez - University of Granada (Spain)
Juan Manuel Estévez Tapiador - Universidad Carlos III de Madrid (Spain)
Krzysztof Szczypiorski - Warsaw University of Technology (Poland)
Lorenzo Cavallaro - Royal Holloway, University of London (UK)
Matt Bishop - University of California, Davis, CA (USA)
Miguel Soriano Ibáñez - Polytechnic University of Catalunya (Spain)
Nicola Dragoni- Technical University of Denmark (Denmark)
Nils Aschenbruck - University of Osnabrück (Germany)
Simone Fischer-Hübner - Karlstad University (Sweden)
Tarek M. Sobh - University of Bridgeport, CT (USA)
*** CONTACT *****
Pedro García Teodoro (pgteodor@ugr.es)
Network Engineering & Security Group (NESG; http://nesg.ugr.es)
Dpt. Signal Theory, Telematics and Communications
Faculty of Computer Science and Telecommunications
University of Granada
C/ Periodista Daniel Saucedo Aranda, s/n
18071 - Granada, Spain
**********************************************************
*
* 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, October 17 || ICDT 2014 || February 23 - 27, 2014 - Nice, France
INVITATION:
=================
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results to ICDT 2014.
The submission deadline is October 17, 2013.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org
=================
============== ICDT 2014 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
ICDT 2014, The Ninth International Conference on Digital Telecommunications
February 23 - 27, 2014 - Nice, France
General page: http://www.iaria.org/conferences2014/ICDT14.html
Call for Papers: http://www.iaria.org/conferences2014/CfPICDT14.html
- regular papers
- short papers (work in progress)
- posters
Submission page: http://www.iaria.org/conferences2014/SubmitICDT14.html
Submission deadline: October 17, 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
ICDT 2014 Topics (topics and submission details: see CfP on the site)
SIGNAL: Signal processing in telecommunications
Signal processing theory and practice; Image and multidimensional signal processing; Signal filter design and structures; Multirate filtering, filter banks, and adaptive filters; Fast signal processing algorithms; Nonlinear signals and systems; Nonuniform transformation; 2D nonuniform DFT; Fast algorithm of NDFT; Advanced image/video coding; Advanced prediction techniques; Signal detection and reconstruction; Spectral estimation and time-frequency analysis; Higher order spectrum analysis; Parameter estimation; Array signal processing; Statistical signal analysis; Signal and system modeling; Cyclostationary signal analysis; Active noise control, active noise reduction and echo cancellation; Psychoacoustics and room acoustics; Signal processing for music; Binaural systems and multidimensional signal systems; Geophysical and seismic signal processing; Nonlinear interpolation/resampling; Extensions to wavelet based coding (x-lets); Low complexity image/video compression; Mult!
iple resolution signal processing;
New approach to digital signal processing; Compression of random data; Recompression of compressed data; 2D projection of 3D data; Stereo data matching; Emerging applications requiring new compression tools; Unified compression and recognition; H.264 and latest video coding standards; Latest audio coding standards
DATA: Data processing
Data transmission and reception mechanisms and techniques; Enhanced tools for video data integrity; Data mining, filtering, and reporting; Secure data transmission; Transmission media and data encoding; Text reading devices (super-pen, pen-elite, reading-pen); Scanned and generated lossy (progressive) multi-page text; (Visually) lossless mechanisms; Pricing data transmission; Differential data transmission systems; Data transmission equipments and transmission rates; Delay-constrained data transmission; Undersea and satellite data transmission techniques; Performance evaluation of data transmission; Multicast data transmission; High speed data transmission; Data transmission control; Integrity and privacy in data transmission; Data transmission standards
AUDIO: Audio transmission and reception systems
Audio transmission and reception systems and devices; Digital audio transmission signal processing; Audio transmission over Internet; Audio Multiplexing Transmission Systems; Stereo audio transmission signal; Digital infrared audio transmission; Multi-stream and multi-path audio transmission; Wireless-compressed digital audio transmission; Perceptual coding for audio transmission and storage; Laser audio transmission; Synchronizing video and audio transmission; Wide-band audio transmission; Index-frame audio transmission; Digital audio transmission rights; Noise in wireless audio transmission; Audio tools and products; Standards
VOICE: Voice over packet networks
Planning and implementing voice networks and systems; Voice transmission systems; Voice transmission performance; Quality real-time voice transmission; Metrics for quality of voice transmission; Stereophonic voice transmission systems; Header Compression for VoIP over WLAN; Voice over IP solution for mobile radio interoperability; VoIP over cable TV networks; VoIP over Wi-Max
VIDEO: Video, conferencing, telephony
Digital video; Video coding formats (ITU-T, SMPTE 421M, AVS-China); Video coders and decoders; Profiles, latency, intermediate formats; Video surveillance and privacy; Video feature requirements; Network video recorders; Graceful degradation of archive video; Video data integrity (error detection, tamper resistance); Alarm events for voice content (motion detection, object tracking, face recognitions); Coding efficiency and distributed video coding; Compression and scrambling; Enhanced tools for video data integrity; Multiple reference pictures; Intra-layer and inter-layer prediction; Fading prediction and loop filter; Video with compression errors; Viewing distance and perceptual quality; Video quality models; Omnidirectional video; 3D video; Video standardization encoding; Texture synthesizer
IMAGE: Image producing, sending, and mining
Model-based progressive image transmission; Wireless image transmission; Computer generated images; Image security, scrambling, and regions of interest; Timing requirements for image transmission; Transmission of still and moving images; Protocols for low bit rate; Error-prone image transmission; Energy efficient image transmission; Multi-technology image formation; Devices for image capturing and processing (cams, web-cams, etc.); Scanning and sampling, quantization and halftoning, color reproduction; Image representation and rendering, display and printing systems; Image quality assessment; Image search and sorting, video indexing and editing; Integration of images and video with other media; Image authentication and watermarking; Image storage, retrieval and multimedia; Image and video databases; Generic coding of moving pictures; Media stream packetization; Modes for archival playback; Image-based applications; Standard for image processing; Image analysis and segment!
ation; Image filtering, restoration
and enhancement; Image representation and modeling; Pattern recognition
SPEECH: Speech producing and processing
Tooling, Architectures, Components and Standards; Voice modulation, frequencies; Linguistics, Phonology and Phonetics; Discourse and Dialogue; Speech analysis, synthesis, coding, and recognition; Speech enhancement and noise reduction; Speech features, production, and perception; Speech Coding and Transmission; Speech Signal Processing; Spoken Language Generation and Synthesis; Speech QoS Enhancement; Speaker Characterization and Recognition; Spoken Language; Resources and Annotation; Spoken/Multi-modal Dialogue Technology and Systems; Spoken Language Information Extraction/Retrieval; Speech Transmission Technology for the Aged and Disabled; Audio-Visual Speech Processing; Biomedical Applications of Speech Analysis; Spoken document retrieval; Speech Processing in a Packet; Network Environment; Automatic Speech Recognition in the Context of Mobile Communications; Human Factors in Speech and Communication Systems; Automatic speech recognition and understanding technology; S!
peech to text systems; Spoken dialo
g systems; Multilingual language processing; New Applications of Spoken Language Technology and Systems
IPTV: IP/Mobile TV
IPTV applications and middleware; On-demand television; Interactive TV; Broadcast TV data; Broadcast content formats; Stereo and 3D TV; TVoDSL; Television archiving; IPTV broadcasting; IPTV-aware devices; IPTV regulatory issues and copyrights; IPTV network infrastructure; IPTV monitoring and management; I[P]TV usage fees; IPTV Personalization and QoS Implications
MULTI: Multicast/Broadcast Triple-Quadruple-play
Scalable video/audio coding; Multiplexing video/audio/data; Multimedia terminals; Multimedia systems and protocols; PSTN modems and interfaces; Facsimile terminals; Direct broadcast satellite; Terrestrial broadcast television; Cable modems; Universal media access; Format compatibility; Media support platforms; VoIP Quality for Triple Play; Testing triple-play services; Triple-play data encryption; Triple-play services
CONTENT: Production, distribution
Content injection, cashing, storage, and distribution; Producing and transmitting streaming content; Content localization services; Content and customers profiles; Documenting and content authoring; Authorizing topic-based content; Content customization and metadata; On-demand content; Content retrieval from archives (alarm-based, time stamp-based); Content management solutions and systems; Unstructured content environment; Multi-channel content delivery/publishing strategies; Content reuse
HXSIP: H-series towards SIP
SIP and H-xxx architectures and logical components; Instant messages and presence; Management of QoS in SIP and H-xxx environments; Basic SIP building blocks; Security and firewalls with SIP and H-xxx series; Service creation and telephony services with SIP and H-xxx; Multimedia conferencing with SIP and H-xxx; SIP application scenarios; SIP (auto)configuration; SIP and H-xxx beyond VoIP; Leveraging SIP for Global Enterprise Roaming; SIP, H-xxx and 3GPP; Emergency Calling in SIP and H-xxx; Advanced SIP and H-xxx applications and services; SIP and H-xxx on Cable Networks; SIP and H-xxx devices; SIP and h-xxx deployment experience; End-to-end SIP and H-xxx communications; SIP/H.323 Interworking Function for real time communications
MULTE: Multimedia Telecommunications
Frameworks, architectures, systems for delivering voices, audio, and data; Methodologies, technologies, procedures and mechanisms; IMT-2000 concepts; IMS concepts (IP Multimedia Systems); Bluetooth and WLAN coexistence on handsets; Packet-based multimedia communication systems; Converging technology for voice and data networks; Accessibility features for unpaired users; Confidentiality for audiovisual services; Multimedia transmission performance; Multiplexing and synchronization; Directory services for multimedia; Computation complexity and costs (multiple simultaneous decoders); Coding efficiency (embedded, bit-plane, arithmetic); Compatibility between Analog/DVD and networks; IP4/IP6 transition and NAT; QoS/SLA, perceptual QoS, and formal visual tests; Temporal and spatial scalability; Pre-processing and predictive coding; Coding with regions-of-interest; Secure transcoding; Computation power and resolution; Transform and quantization; Entropy coding; Lossless and loss!
y compression; Transmission in nois
y environments; Voice/video/data in 4G; Specialized medical applications; Medical imaging and communications networks; MPEG for endoscopy, microscopy, radiology, surgery; Medical archiving systems; Digital devices for image capturing (microscope, stethoscope); Digital equipments and digital cinema; Digital signature protection
MOBILE: Mobile technologies
3G+: UMTS, HSPA, HSUPA, HSDPA, HSOPA, WiMAX, UWB. LTE, All-IP LTE 4G and beyond; Seamless handover engineering; Cognitive radio; Mobile video surveillance; Pervasive/ubiquitous/mobile systems; Security and privacy issues for mobile and wireless systems; Mobile ad hoc networks
MEDMAN: Control and management of multimedia telecommunication
Video codec-aware of packets; Monitoring via guard on patrol, central station, forensic analysis; Managing single domestic licensing and granted patent pool for compressions; End-to-end quality monitoring/management; Perceived/offered quality: video-only, audio-only, audio-video; In-service monitoring of voice/video/data services; Real-time distributed imagery management systems; Performance in voice/video/data systems; Distributed multimedia service management; Mobile multimedia network management; Multi-point, multicast services management; Deployment of multimedia services; Network management models and architectures; Billing and security for multimedia services; Network measurement/monitoring for multimedia services
SARP: Software architecture research and practice
Distributed software architecture; Architectural styles and patterns; Architecture refinement and transformation; Software architecture and pervasive systems; Software architecture analysis & testing; Architectural description languages (ADLs); Component-based software architecture; Dynamic software architecture; Self-repairing software architecture; Adaptive software architecture; Aspect-oriented software architecture; Service-oriented architecture [SOA]; Domain specific software architecture [DSSA]; Tools/Environments for software architects; Product-line software architecture; Industrial case studies and reports
STREAM: Data stream processing
Fundamentals on data stream processing; Data stream processing and event stream processing; Continuous query languages; Time management in data stream systems; Aggregated queries support; Query processing with multiple, continuous, rapid, time-varying data streams; Processing frequent itemset discovery queries; Real-time stream data processing; Network-aware operator placement for stream-processing systems; Integrating database queries and Web searches; Scalable Distributed Stream Processing; Optimization of data stream processing; Performance and overhead in data stream processing; QoS adaptation in data stream systems; Adaptive query processing in data stream; Interactive distributed data stream processing and mining; Data stream management systems; Control theory on stream processing; Processing high-speed data streams; Stream processing in production-to-business software; Multi-site cooperative data stream analysis; Grid-based data stream processing; Hyperdatabases fo!
r P2P data stream processing; Senso
r data stream processing in health monitoring; Processing and sharing data streams in Grid-based P2P infrastructures
TRACK: Tracking computing technologies
Airport security communications technologies; Hazards detection- automatic real-time material/object recognition; Intelligent IP-based sensor networking for homeland security; Real-time intelligence data validation and verification mechanisms; Efficient data integration and mining techniques for NATO countries; Secure distributed storage and data pinning; SATCOM for HLS; Critical aerospace communications systems; HLS for air, land and sea operational environments; Airborne real-time spatial tracking techniques; Bio-authentication sensors and tools; Cyber and physical security of key infrastructure and operations; Protection of Real-time resilient communications network infrastructures; International standards for data schema and data sharing between USA and other countries; Emergency response tools; Prediction of Intent; Standards for Passenger Data Integration; Sharing Addressing and Service Discovery in Auto-configuring MANETs; Exploiting localization and network inform!
ation (GPS, INS, GIS, terrain featu
res, ToA, AoA, SNR, QoS) for improved ad-hoc networking in complex terrain; Advanced indoor and outdoor location-based applications: real-time tracking, multimedia, bidirectional, proactive applications; Location based services based on integrated cellular, ad hoc, RFID, and sensor networks; New positioning techniques in support of location based servcies (indoor, cellular, satellite, hybrid); Geographic Information Systems for supporting location based services; Quality of location data; Integration of Hierarchical Location-Based Routing (HLBR) with Delay- and Disruption-Tolerant Neworks (DTNs); Narrow-band control channels for HLBR; Location-aware (GPS-aware) Internet Browsers for Location-based services
---------------------
Committee: http://www.iaria.org/conferences2014/ComICDT14.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 ICDT 2014.
The submission deadline is October 17, 2013.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org
=================
============== ICDT 2014 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
ICDT 2014, The Ninth International Conference on Digital Telecommunications
February 23 - 27, 2014 - Nice, France
General page: http://www.iaria.org/conferences2014/ICDT14.html
Call for Papers: http://www.iaria.org/conferences2014/CfPICDT14.html
- regular papers
- short papers (work in progress)
- posters
Submission page: http://www.iaria.org/conferences2014/SubmitICDT14.html
Submission deadline: October 17, 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
ICDT 2014 Topics (topics and submission details: see CfP on the site)
SIGNAL: Signal processing in telecommunications
Signal processing theory and practice; Image and multidimensional signal processing; Signal filter design and structures; Multirate filtering, filter banks, and adaptive filters; Fast signal processing algorithms; Nonlinear signals and systems; Nonuniform transformation; 2D nonuniform DFT; Fast algorithm of NDFT; Advanced image/video coding; Advanced prediction techniques; Signal detection and reconstruction; Spectral estimation and time-frequency analysis; Higher order spectrum analysis; Parameter estimation; Array signal processing; Statistical signal analysis; Signal and system modeling; Cyclostationary signal analysis; Active noise control, active noise reduction and echo cancellation; Psychoacoustics and room acoustics; Signal processing for music; Binaural systems and multidimensional signal systems; Geophysical and seismic signal processing; Nonlinear interpolation/resampling; Extensions to wavelet based coding (x-lets); Low complexity image/video compression; Mult!
iple resolution signal processing;
New approach to digital signal processing; Compression of random data; Recompression of compressed data; 2D projection of 3D data; Stereo data matching; Emerging applications requiring new compression tools; Unified compression and recognition; H.264 and latest video coding standards; Latest audio coding standards
DATA: Data processing
Data transmission and reception mechanisms and techniques; Enhanced tools for video data integrity; Data mining, filtering, and reporting; Secure data transmission; Transmission media and data encoding; Text reading devices (super-pen, pen-elite, reading-pen); Scanned and generated lossy (progressive) multi-page text; (Visually) lossless mechanisms; Pricing data transmission; Differential data transmission systems; Data transmission equipments and transmission rates; Delay-constrained data transmission; Undersea and satellite data transmission techniques; Performance evaluation of data transmission; Multicast data transmission; High speed data transmission; Data transmission control; Integrity and privacy in data transmission; Data transmission standards
AUDIO: Audio transmission and reception systems
Audio transmission and reception systems and devices; Digital audio transmission signal processing; Audio transmission over Internet; Audio Multiplexing Transmission Systems; Stereo audio transmission signal; Digital infrared audio transmission; Multi-stream and multi-path audio transmission; Wireless-compressed digital audio transmission; Perceptual coding for audio transmission and storage; Laser audio transmission; Synchronizing video and audio transmission; Wide-band audio transmission; Index-frame audio transmission; Digital audio transmission rights; Noise in wireless audio transmission; Audio tools and products; Standards
VOICE: Voice over packet networks
Planning and implementing voice networks and systems; Voice transmission systems; Voice transmission performance; Quality real-time voice transmission; Metrics for quality of voice transmission; Stereophonic voice transmission systems; Header Compression for VoIP over WLAN; Voice over IP solution for mobile radio interoperability; VoIP over cable TV networks; VoIP over Wi-Max
VIDEO: Video, conferencing, telephony
Digital video; Video coding formats (ITU-T, SMPTE 421M, AVS-China); Video coders and decoders; Profiles, latency, intermediate formats; Video surveillance and privacy; Video feature requirements; Network video recorders; Graceful degradation of archive video; Video data integrity (error detection, tamper resistance); Alarm events for voice content (motion detection, object tracking, face recognitions); Coding efficiency and distributed video coding; Compression and scrambling; Enhanced tools for video data integrity; Multiple reference pictures; Intra-layer and inter-layer prediction; Fading prediction and loop filter; Video with compression errors; Viewing distance and perceptual quality; Video quality models; Omnidirectional video; 3D video; Video standardization encoding; Texture synthesizer
IMAGE: Image producing, sending, and mining
Model-based progressive image transmission; Wireless image transmission; Computer generated images; Image security, scrambling, and regions of interest; Timing requirements for image transmission; Transmission of still and moving images; Protocols for low bit rate; Error-prone image transmission; Energy efficient image transmission; Multi-technology image formation; Devices for image capturing and processing (cams, web-cams, etc.); Scanning and sampling, quantization and halftoning, color reproduction; Image representation and rendering, display and printing systems; Image quality assessment; Image search and sorting, video indexing and editing; Integration of images and video with other media; Image authentication and watermarking; Image storage, retrieval and multimedia; Image and video databases; Generic coding of moving pictures; Media stream packetization; Modes for archival playback; Image-based applications; Standard for image processing; Image analysis and segment!
ation; Image filtering, restoration
and enhancement; Image representation and modeling; Pattern recognition
SPEECH: Speech producing and processing
Tooling, Architectures, Components and Standards; Voice modulation, frequencies; Linguistics, Phonology and Phonetics; Discourse and Dialogue; Speech analysis, synthesis, coding, and recognition; Speech enhancement and noise reduction; Speech features, production, and perception; Speech Coding and Transmission; Speech Signal Processing; Spoken Language Generation and Synthesis; Speech QoS Enhancement; Speaker Characterization and Recognition; Spoken Language; Resources and Annotation; Spoken/Multi-modal Dialogue Technology and Systems; Spoken Language Information Extraction/Retrieval; Speech Transmission Technology for the Aged and Disabled; Audio-Visual Speech Processing; Biomedical Applications of Speech Analysis; Spoken document retrieval; Speech Processing in a Packet; Network Environment; Automatic Speech Recognition in the Context of Mobile Communications; Human Factors in Speech and Communication Systems; Automatic speech recognition and understanding technology; S!
peech to text systems; Spoken dialo
g systems; Multilingual language processing; New Applications of Spoken Language Technology and Systems
IPTV: IP/Mobile TV
IPTV applications and middleware; On-demand television; Interactive TV; Broadcast TV data; Broadcast content formats; Stereo and 3D TV; TVoDSL; Television archiving; IPTV broadcasting; IPTV-aware devices; IPTV regulatory issues and copyrights; IPTV network infrastructure; IPTV monitoring and management; I[P]TV usage fees; IPTV Personalization and QoS Implications
MULTI: Multicast/Broadcast Triple-Quadruple-play
Scalable video/audio coding; Multiplexing video/audio/data; Multimedia terminals; Multimedia systems and protocols; PSTN modems and interfaces; Facsimile terminals; Direct broadcast satellite; Terrestrial broadcast television; Cable modems; Universal media access; Format compatibility; Media support platforms; VoIP Quality for Triple Play; Testing triple-play services; Triple-play data encryption; Triple-play services
CONTENT: Production, distribution
Content injection, cashing, storage, and distribution; Producing and transmitting streaming content; Content localization services; Content and customers profiles; Documenting and content authoring; Authorizing topic-based content; Content customization and metadata; On-demand content; Content retrieval from archives (alarm-based, time stamp-based); Content management solutions and systems; Unstructured content environment; Multi-channel content delivery/publishing strategies; Content reuse
HXSIP: H-series towards SIP
SIP and H-xxx architectures and logical components; Instant messages and presence; Management of QoS in SIP and H-xxx environments; Basic SIP building blocks; Security and firewalls with SIP and H-xxx series; Service creation and telephony services with SIP and H-xxx; Multimedia conferencing with SIP and H-xxx; SIP application scenarios; SIP (auto)configuration; SIP and H-xxx beyond VoIP; Leveraging SIP for Global Enterprise Roaming; SIP, H-xxx and 3GPP; Emergency Calling in SIP and H-xxx; Advanced SIP and H-xxx applications and services; SIP and H-xxx on Cable Networks; SIP and H-xxx devices; SIP and h-xxx deployment experience; End-to-end SIP and H-xxx communications; SIP/H.323 Interworking Function for real time communications
MULTE: Multimedia Telecommunications
Frameworks, architectures, systems for delivering voices, audio, and data; Methodologies, technologies, procedures and mechanisms; IMT-2000 concepts; IMS concepts (IP Multimedia Systems); Bluetooth and WLAN coexistence on handsets; Packet-based multimedia communication systems; Converging technology for voice and data networks; Accessibility features for unpaired users; Confidentiality for audiovisual services; Multimedia transmission performance; Multiplexing and synchronization; Directory services for multimedia; Computation complexity and costs (multiple simultaneous decoders); Coding efficiency (embedded, bit-plane, arithmetic); Compatibility between Analog/DVD and networks; IP4/IP6 transition and NAT; QoS/SLA, perceptual QoS, and formal visual tests; Temporal and spatial scalability; Pre-processing and predictive coding; Coding with regions-of-interest; Secure transcoding; Computation power and resolution; Transform and quantization; Entropy coding; Lossless and loss!
y compression; Transmission in nois
y environments; Voice/video/data in 4G; Specialized medical applications; Medical imaging and communications networks; MPEG for endoscopy, microscopy, radiology, surgery; Medical archiving systems; Digital devices for image capturing (microscope, stethoscope); Digital equipments and digital cinema; Digital signature protection
MOBILE: Mobile technologies
3G+: UMTS, HSPA, HSUPA, HSDPA, HSOPA, WiMAX, UWB. LTE, All-IP LTE 4G and beyond; Seamless handover engineering; Cognitive radio; Mobile video surveillance; Pervasive/ubiquitous/mobile systems; Security and privacy issues for mobile and wireless systems; Mobile ad hoc networks
MEDMAN: Control and management of multimedia telecommunication
Video codec-aware of packets; Monitoring via guard on patrol, central station, forensic analysis; Managing single domestic licensing and granted patent pool for compressions; End-to-end quality monitoring/management; Perceived/offered quality: video-only, audio-only, audio-video; In-service monitoring of voice/video/data services; Real-time distributed imagery management systems; Performance in voice/video/data systems; Distributed multimedia service management; Mobile multimedia network management; Multi-point, multicast services management; Deployment of multimedia services; Network management models and architectures; Billing and security for multimedia services; Network measurement/monitoring for multimedia services
SARP: Software architecture research and practice
Distributed software architecture; Architectural styles and patterns; Architecture refinement and transformation; Software architecture and pervasive systems; Software architecture analysis & testing; Architectural description languages (ADLs); Component-based software architecture; Dynamic software architecture; Self-repairing software architecture; Adaptive software architecture; Aspect-oriented software architecture; Service-oriented architecture [SOA]; Domain specific software architecture [DSSA]; Tools/Environments for software architects; Product-line software architecture; Industrial case studies and reports
STREAM: Data stream processing
Fundamentals on data stream processing; Data stream processing and event stream processing; Continuous query languages; Time management in data stream systems; Aggregated queries support; Query processing with multiple, continuous, rapid, time-varying data streams; Processing frequent itemset discovery queries; Real-time stream data processing; Network-aware operator placement for stream-processing systems; Integrating database queries and Web searches; Scalable Distributed Stream Processing; Optimization of data stream processing; Performance and overhead in data stream processing; QoS adaptation in data stream systems; Adaptive query processing in data stream; Interactive distributed data stream processing and mining; Data stream management systems; Control theory on stream processing; Processing high-speed data streams; Stream processing in production-to-business software; Multi-site cooperative data stream analysis; Grid-based data stream processing; Hyperdatabases fo!
r P2P data stream processing; Senso
r data stream processing in health monitoring; Processing and sharing data streams in Grid-based P2P infrastructures
TRACK: Tracking computing technologies
Airport security communications technologies; Hazards detection- automatic real-time material/object recognition; Intelligent IP-based sensor networking for homeland security; Real-time intelligence data validation and verification mechanisms; Efficient data integration and mining techniques for NATO countries; Secure distributed storage and data pinning; SATCOM for HLS; Critical aerospace communications systems; HLS for air, land and sea operational environments; Airborne real-time spatial tracking techniques; Bio-authentication sensors and tools; Cyber and physical security of key infrastructure and operations; Protection of Real-time resilient communications network infrastructures; International standards for data schema and data sharing between USA and other countries; Emergency response tools; Prediction of Intent; Standards for Passenger Data Integration; Sharing Addressing and Service Discovery in Auto-configuring MANETs; Exploiting localization and network inform!
ation (GPS, INS, GIS, terrain featu
res, ToA, AoA, SNR, QoS) for improved ad-hoc networking in complex terrain; Advanced indoor and outdoor location-based applications: real-time tracking, multimedia, bidirectional, proactive applications; Location based services based on integrated cellular, ad hoc, RFID, and sensor networks; New positioning techniques in support of location based servcies (indoor, cellular, satellite, hybrid); Geographic Information Systems for supporting location based services; Quality of location data; Integration of Hierarchical Location-Based Routing (HLBR) with Delay- and Disruption-Tolerant Neworks (DTNs); Narrow-band control channels for HLBR; Location-aware (GPS-aware) Internet Browsers for Location-based services
---------------------
Committee: http://www.iaria.org/conferences2014/ComICDT14.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] Abstract-Talk: Short interviews on a selection of COSN 2013 papers
************************************************************
Abstract Talk
Collaborative Interviews on Science and Technology
www.abstract-talk.org
************************************************************
We are happy to present a collection of short interviews on papers
from COSN 2013 (Conference on Online Social Networks), Boston, USA.
They briefly introduce their research questions and results and
hopefully make you want to read the corresponding papers...
Enjoy!
On the Precision of Social and Information Networks
http://www.abstract-talk.org/wp/?p=750
Social Resilience in Online Communities: The Autopsy of Friendster
http://www.abstract-talk.org/wp/?p=747
Call Me MayBe: Understanding Nature and Risks of Sharing Mobile
Numbers on Online Social Networks
http://www.abstract-talk.org/wp/?p=719
Inferring User Interests from Tweet Times
http://www.abstract-talk.org/wp/?p=683
Scalable Similarity Estimation in Social Networks: Closeness, Node
Labels, and Random Edge Lengths
http://www.abstract-talk.org/wp/?p=678
On the Performance of Percolation Graph Matching
http://www.abstract-talk.org/wp/?p=674
We are happy to receive feedback!
Zvi Lotker, Ben Gurion University of the Negev, Beer-Sheva, Israel
Yvonne-Anne Pignolet, ABB Corporate Research, Dättwil, Switzerland
Chen Avin, Ben Gurion University of the Negev, Beer-Sheva, Israel
************************************************************
Abstract-Talk promotes the work of the scientific community and to
facilitate the easy exchange of new ideas and new research. We believe
that using podcasts and short, informal discussions and talks we can
increases the visibility of research to people inside and outside the
respective research community. A podcast episode can be a chat about
a new paper, a new book or a discussion or interviewabout a research
topic. These episodes also provide an opportunity to learn about new
work for researchers that cannot attend conferences and for students
new to the field.
Subscribe to abstract-talk.org:
Podcast: http://www.abstract-talk.org/wp/?feed=podcast
iTunes: http://itunes.apple.com/en/podcast/abstract-talk/id491951721?l=en
Email Newsletter: http://eepurl.com/h8aOw
**********************************************************
*
* 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/
*
**********************************************************
Abstract Talk
Collaborative Interviews on Science and Technology
www.abstract-talk.org
************************************************************
We are happy to present a collection of short interviews on papers
from COSN 2013 (Conference on Online Social Networks), Boston, USA.
They briefly introduce their research questions and results and
hopefully make you want to read the corresponding papers...
Enjoy!
On the Precision of Social and Information Networks
http://www.abstract-talk.org/wp/?p=750
Social Resilience in Online Communities: The Autopsy of Friendster
http://www.abstract-talk.org/wp/?p=747
Call Me MayBe: Understanding Nature and Risks of Sharing Mobile
Numbers on Online Social Networks
http://www.abstract-talk.org/wp/?p=719
Inferring User Interests from Tweet Times
http://www.abstract-talk.org/wp/?p=683
Scalable Similarity Estimation in Social Networks: Closeness, Node
Labels, and Random Edge Lengths
http://www.abstract-talk.org/wp/?p=678
On the Performance of Percolation Graph Matching
http://www.abstract-talk.org/wp/?p=674
We are happy to receive feedback!
Zvi Lotker, Ben Gurion University of the Negev, Beer-Sheva, Israel
Yvonne-Anne Pignolet, ABB Corporate Research, Dättwil, Switzerland
Chen Avin, Ben Gurion University of the Negev, Beer-Sheva, Israel
************************************************************
Abstract-Talk promotes the work of the scientific community and to
facilitate the easy exchange of new ideas and new research. We believe
that using podcasts and short, informal discussions and talks we can
increases the visibility of research to people inside and outside the
respective research community. A podcast episode can be a chat about
a new paper, a new book or a discussion or interviewabout a research
topic. These episodes also provide an opportunity to learn about new
work for researchers that cannot attend conferences and for students
new to the field.
Subscribe to abstract-talk.org:
Podcast: http://www.abstract-talk.org/wp/?feed=podcast
iTunes: http://itunes.apple.com/en/podcast/abstract-talk/id491951721?l=en
Email Newsletter: http://eepurl.com/h8aOw
**********************************************************
*
* 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, October 5, 2013
[DMANET] Last Mile, October 17 || COCORA 2014 || February 23 - 27, 2014 - Nice, France
INVITATION:
=================
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results to COCORA 2014.
The submission deadline is October 17, 2013.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org
=================
============== COCORA 2014 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
COCORA 2014, The Fourth International Conference on Advances in Cognitive Radio
February 23 - 27, 2014 - Nice, France
General page: http://www.iaria.org/conferences2014/COCORA14.html
Call for Papers: http://www.iaria.org/conferences2014/CfPCOCORA14.html
- regular papers
- short papers (work in progress)
- posters
Submission page: http://www.iaria.org/conferences2014/SubmitCOCORA14.html
Submission deadline: October 17, 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
COCORA 2014 Topics (topics and submission details: see CfP on the site)
Fundamentals
Cognitive radio and network architectures; Collaborative radio networks; Information theory and performance limits of dynamic spectrum access; Agile spectrum and dynamic spectrum sharing techniques; Cognitive spectrum sharing, coexistence, and interoperability; Cross-layer algorithms based on spectrum sensing techniques; Cognitive radio sensing in the large and feature detection; Collaboration optimization and refinement; Collaborative spectrum sensing schemes with weighted user contributions; Connectivity, capacity, and scalability of heterogeneous systems via cognitive networking; Auction and pricing models for dynamic spectrum sharing
Mechanisms and protocols
Interoperability, interference and co-existence of dissimilar wireless networks; Distributed algorithms for spectrum detection and cooperative spectrum sensing; Models and fundamental limits of cognitive networking; Transient behavior and stability analysis in cognitive networking; Cognitive MAC, multicast, and routing protocols for heterogeneous networks with highly dynamic topology; Software radio and radio resource allocation; Spectrum policy reform issues and standardization
Processing and devices
Propagation channel modeling and utilization; Cognitive and collaborative radio architecture for equipments; Transceivers and front-end technologies, SOC and SiP; MIMO, advanced signal processing, and smart antennas; Primary transmitter shadowing and fading; High-speed and broadband wireless technologies; Software defined radios and cognitive radios; Hardware reconfigurability; Smart antennas; Passive antennas
Measurement and management
Software radio and cognitive radio management; Interference measurements and metrics; Spectrum and performance management in cognitive radio networks; Security and robustness issues in cognitive networking; Cooperative resource management and optimization; QoS provisioning in adaptive, spectrum agile, and cognitive networks; Context management, sensing, reasoning and context acquisition; Traffic patterns, topology, mobility, and interference tolerance in cognitive networking; Statistical inference and cognition with from measurements that are inaccurate, incomplete, inconsistent, and delayed measurements; Sensing and feedback mechanism in cognitive networking and the associated cost; Cognitive radio with reinforcement learning
Applications
Cognitive radio applications; Wideband sensing and multiband agile wireless networks; Future Internet with cognitive technologies; Flexible and opportunistic wireless access; Multimedia communications through cognitive networks; Simulation of cognitive wireless networks; Cognitive radio test-beds and hardware prototypes
----------------------
Committee: http://www.iaria.org/conferences2014/ComCOCORA14.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 COCORA 2014.
The submission deadline is October 17, 2013.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org
=================
============== COCORA 2014 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
COCORA 2014, The Fourth International Conference on Advances in Cognitive Radio
February 23 - 27, 2014 - Nice, France
General page: http://www.iaria.org/conferences2014/COCORA14.html
Call for Papers: http://www.iaria.org/conferences2014/CfPCOCORA14.html
- regular papers
- short papers (work in progress)
- posters
Submission page: http://www.iaria.org/conferences2014/SubmitCOCORA14.html
Submission deadline: October 17, 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
COCORA 2014 Topics (topics and submission details: see CfP on the site)
Fundamentals
Cognitive radio and network architectures; Collaborative radio networks; Information theory and performance limits of dynamic spectrum access; Agile spectrum and dynamic spectrum sharing techniques; Cognitive spectrum sharing, coexistence, and interoperability; Cross-layer algorithms based on spectrum sensing techniques; Cognitive radio sensing in the large and feature detection; Collaboration optimization and refinement; Collaborative spectrum sensing schemes with weighted user contributions; Connectivity, capacity, and scalability of heterogeneous systems via cognitive networking; Auction and pricing models for dynamic spectrum sharing
Mechanisms and protocols
Interoperability, interference and co-existence of dissimilar wireless networks; Distributed algorithms for spectrum detection and cooperative spectrum sensing; Models and fundamental limits of cognitive networking; Transient behavior and stability analysis in cognitive networking; Cognitive MAC, multicast, and routing protocols for heterogeneous networks with highly dynamic topology; Software radio and radio resource allocation; Spectrum policy reform issues and standardization
Processing and devices
Propagation channel modeling and utilization; Cognitive and collaborative radio architecture for equipments; Transceivers and front-end technologies, SOC and SiP; MIMO, advanced signal processing, and smart antennas; Primary transmitter shadowing and fading; High-speed and broadband wireless technologies; Software defined radios and cognitive radios; Hardware reconfigurability; Smart antennas; Passive antennas
Measurement and management
Software radio and cognitive radio management; Interference measurements and metrics; Spectrum and performance management in cognitive radio networks; Security and robustness issues in cognitive networking; Cooperative resource management and optimization; QoS provisioning in adaptive, spectrum agile, and cognitive networks; Context management, sensing, reasoning and context acquisition; Traffic patterns, topology, mobility, and interference tolerance in cognitive networking; Statistical inference and cognition with from measurements that are inaccurate, incomplete, inconsistent, and delayed measurements; Sensing and feedback mechanism in cognitive networking and the associated cost; Cognitive radio with reinforcement learning
Applications
Cognitive radio applications; Wideband sensing and multiband agile wireless networks; Future Internet with cognitive technologies; Flexible and opportunistic wireless access; Multimedia communications through cognitive networks; Simulation of cognitive wireless networks; Cognitive radio test-beds and hardware prototypes
----------------------
Committee: http://www.iaria.org/conferences2014/ComCOCORA14.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/
*
**********************************************************
Wednesday, October 2, 2013
[DMANET] Faculty Position in Algorithms at Virginia Tech
Tenure-track Faculty Position in Algorithms
Department of Computer Science, Virginia Tech
http://www.cs.vt.edu/Algorithms-Search
The Department of Computer Science at Virginia Tech (www.cs.vt.edu)
invites applications for a full-time tenure-track position, at the rank of
Assistant Professor, from exceptional candidates with expertise in
theoretical computer science, specifically with emphasis on discrete
algorithms. Candidates should have a PhD in Computer Science or related
discipline at the time of appointment; a strong record of scholarship in
discrete algorithms; demonstrated ability to contribute to teaching at the
undergraduate and graduate levels in theoretical computer science;
sensitivity to issues of diversity in the campus community; and the skills
to establish and grow an algorithmic research group. Selected candidates
are expected to travel occasionally to attend professional
conferences/meetings. It is desirable that the candidate have the ability
to develop synergistic collaborations with established research areas in
the department, such as computational biology and bioinformatics, cyber
security, data mining, HCI, high performance & scientific computing, and
systems.
The Department of Computer Science has 36 research oriented tenure-track
faculty and 11 research faculty. There are a total 12 NSF/DOE CAREER
award winners in the department. Research expenditures during FY2013 were
$11.7 million; total research funding at the beginning of FY2014 was $34
million. BS, MS, and PhD degrees are offered, with an enrollment of over
550 undergraduate majors (12% women) and over 200 PhD/MS students. In
2010, CS@VT was ranked 5th in the country in recruiting quality of CS
undergrads by the Wall Street Journal. The department is in the College of
Engineering, whose undergraduate program was ranked 6th and graduate
program was ranked 12th among public engineering schools in 2013 by US
News and World Report.
There are three research centers associated with the department. The new
interdisciplinary Discovery Analytics Center (dac.cs.vt.edu) focuses on
'big data' problems in areas of national interest including intelligence
analysis, sustainability and health informatics. The Center for
Human-Computer Interaction (www.hci.vt.edu) supports research in
visualization, 3D interfaces, virtual reality, usability and personal
information systems. The Center for High End Computing Systems
(www.checs.eng.vt.edu) is known for its expertise in high performance
computing, including energy efficient and/or heterogeneous
supercomputers. Recently, we designed and acquired HokieSpeed, a CPU/GPU
200+ node machine for use by computational scientists and engineers across
campus through a $2M NSF MRI grant. HokieSpeed ranked 11th in the world on
the Green 500 List in November 2011. CS faculty also participate in the
Ted and Karyn Hume Center for National Security and Technology
(www.hume.ictas.vt.edu) a cyber security center.
Virginia Tech is a comprehensive research university with over 31,000
students. This hire is for the main campus in Blacksburg, consistently
ranked among the country's best places to live
www.hr.vt.edu/great-place-to-work/culture-community.
Salary for suitably qualified applicants is competitive and commensurate
with experience. Selected candidates must pass a criminal background check
prior to employment.
Applications must be submitted online to https://jobs.vt.edu for posting
#117037. We welcome applications from women and minorities. Applicant
screening will begin December 15, 2013 and continue until the position is
filled. Early applications are encouraged. Inquiries should be directed to
Dr. Lenwood S. Heath, Algorithms Search Committee Chair, heath@vt.edu.
Virginia Tech is an equal opportunity/affirmative action institution.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Department of Computer Science, Virginia Tech
http://www.cs.vt.edu/Algorithms-Search
The Department of Computer Science at Virginia Tech (www.cs.vt.edu)
invites applications for a full-time tenure-track position, at the rank of
Assistant Professor, from exceptional candidates with expertise in
theoretical computer science, specifically with emphasis on discrete
algorithms. Candidates should have a PhD in Computer Science or related
discipline at the time of appointment; a strong record of scholarship in
discrete algorithms; demonstrated ability to contribute to teaching at the
undergraduate and graduate levels in theoretical computer science;
sensitivity to issues of diversity in the campus community; and the skills
to establish and grow an algorithmic research group. Selected candidates
are expected to travel occasionally to attend professional
conferences/meetings. It is desirable that the candidate have the ability
to develop synergistic collaborations with established research areas in
the department, such as computational biology and bioinformatics, cyber
security, data mining, HCI, high performance & scientific computing, and
systems.
The Department of Computer Science has 36 research oriented tenure-track
faculty and 11 research faculty. There are a total 12 NSF/DOE CAREER
award winners in the department. Research expenditures during FY2013 were
$11.7 million; total research funding at the beginning of FY2014 was $34
million. BS, MS, and PhD degrees are offered, with an enrollment of over
550 undergraduate majors (12% women) and over 200 PhD/MS students. In
2010, CS@VT was ranked 5th in the country in recruiting quality of CS
undergrads by the Wall Street Journal. The department is in the College of
Engineering, whose undergraduate program was ranked 6th and graduate
program was ranked 12th among public engineering schools in 2013 by US
News and World Report.
There are three research centers associated with the department. The new
interdisciplinary Discovery Analytics Center (dac.cs.vt.edu) focuses on
'big data' problems in areas of national interest including intelligence
analysis, sustainability and health informatics. The Center for
Human-Computer Interaction (www.hci.vt.edu) supports research in
visualization, 3D interfaces, virtual reality, usability and personal
information systems. The Center for High End Computing Systems
(www.checs.eng.vt.edu) is known for its expertise in high performance
computing, including energy efficient and/or heterogeneous
supercomputers. Recently, we designed and acquired HokieSpeed, a CPU/GPU
200+ node machine for use by computational scientists and engineers across
campus through a $2M NSF MRI grant. HokieSpeed ranked 11th in the world on
the Green 500 List in November 2011. CS faculty also participate in the
Ted and Karyn Hume Center for National Security and Technology
(www.hume.ictas.vt.edu) a cyber security center.
Virginia Tech is a comprehensive research university with over 31,000
students. This hire is for the main campus in Blacksburg, consistently
ranked among the country's best places to live
www.hr.vt.edu/great-place-to-work/culture-community.
Salary for suitably qualified applicants is competitive and commensurate
with experience. Selected candidates must pass a criminal background check
prior to employment.
Applications must be submitted online to https://jobs.vt.edu for posting
#117037. We welcome applications from women and minorities. Applicant
screening will begin December 15, 2013 and continue until the position is
filled. Early applications are encouraged. Inquiries should be directed to
Dr. Lenwood S. Heath, Algorithms Search Committee Chair, heath@vt.edu.
Virginia Tech is an equal opportunity/affirmative action institution.
**********************************************************
*
* 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] Two Research Positions in Algorithms and Complexity at the University of Oxford
Professor Leslie Ann Goldberg is looking for two postdoctoral researchers to join the ERC project "Mapping the Complexity of Counting" at the University of Oxford.
This is a five-year project from 1 Mar 2014 to 28 Feb 2019.
The positions are available for the duration of the project (subject to satisfactory performance).
The salary range is £29,541 - £36,298, depending on experience.
Deadline for applications: 15 November 2013
Details and application form at
https://www.recruit.ox.ac.uk/pls/hrisliverecruit/erq_jobspec_version_4.jobspec?p_id=110002
The overall objectives of the project are:
* To map out the landscape of computational counting problems (both exact and approximate), determining which problems are tractable, and which are intractable (quantifying the extent of tractability).
* To discover complexity characterisations which elucidate the features that make counting problems tractable or intractable (telling us why each problem is tractable or intractable).
Within the context of these overall objectives, the goal is to study classes of counting problems which are as wide as possible (obviously including the problems that arise in practice), and within these classes, to develop complexity dichotomies/characterisations which are as precise as possible. The key problem domains that will be considered are graph homomorphism problems (including generalised weighted homomorphism problems), counting constraint satisfaction problems and holant problems. Key challenges include determining the effect of restrictions such as planarity, bipartiteness and bounded-degree constraints on the complexity of graph-theoretic counting problems.
Candidates should have a PhD in algorithms and complexity or in a closely related area of discrete mathematics. Expertise in one or more of the following would be helpful: combinatorics or discrete probability, graph polynomials or partition functions, mixing rates of Markov chains, constraint satisfaction problems including algebraic methods for classifying their difficulty, holographic algorithms or holant problems.
**********************************************************
*
* 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/
*
**********************************************************
This is a five-year project from 1 Mar 2014 to 28 Feb 2019.
The positions are available for the duration of the project (subject to satisfactory performance).
The salary range is £29,541 - £36,298, depending on experience.
Deadline for applications: 15 November 2013
Details and application form at
https://www.recruit.ox.ac.uk/pls/hrisliverecruit/erq_jobspec_version_4.jobspec?p_id=110002
The overall objectives of the project are:
* To map out the landscape of computational counting problems (both exact and approximate), determining which problems are tractable, and which are intractable (quantifying the extent of tractability).
* To discover complexity characterisations which elucidate the features that make counting problems tractable or intractable (telling us why each problem is tractable or intractable).
Within the context of these overall objectives, the goal is to study classes of counting problems which are as wide as possible (obviously including the problems that arise in practice), and within these classes, to develop complexity dichotomies/characterisations which are as precise as possible. The key problem domains that will be considered are graph homomorphism problems (including generalised weighted homomorphism problems), counting constraint satisfaction problems and holant problems. Key challenges include determining the effect of restrictions such as planarity, bipartiteness and bounded-degree constraints on the complexity of graph-theoretic counting problems.
Candidates should have a PhD in algorithms and complexity or in a closely related area of discrete mathematics. Expertise in one or more of the following would be helpful: combinatorics or discrete probability, graph polynomials or partition functions, mixing rates of Markov chains, constraint satisfaction problems including algebraic methods for classifying their difficulty, holographic algorithms or holant problems.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Postdoc Positions in Theoretical Computer Science at the University of Vienna
DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF VIENNA
POST-DOCTORAL RESEARCH ASSISTANT POSITIONS
Post-doctorial research assistant positions are available in the research
group of Professor Monika Henzinger, who is leading the research group
Theory and Applications of Algorithms at the University of Vienna and who
was recently awarded an ERC Advance grant. Her research areas are
combinatorial algorithms and algorithmic game theory.
See
http://informatik.univie.ac.at/forschung/forschungsgruppen/theory-and-applications-of-algorithms/
for more information on the research group.
The positions are available immediately and will be of 12 months with
possible extension. Applicants should have have, or expect shortly to
obtain, a PhD in computer science or some other relevant discipline, with
a strong background in theoretical computer science. Experience in the
analysis of algorithms or in algorithmic game theory is very useful.
Successful applicants are expected to perform independent research as well
as collaborative research with the research group of Prof. Henzinger.
To apply, please send your CV, a short letter of motivation, and names of
at least two references to monika.henzinger@univie.ac.at.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
POST-DOCTORAL RESEARCH ASSISTANT POSITIONS
Post-doctorial research assistant positions are available in the research
group of Professor Monika Henzinger, who is leading the research group
Theory and Applications of Algorithms at the University of Vienna and who
was recently awarded an ERC Advance grant. Her research areas are
combinatorial algorithms and algorithmic game theory.
See
http://informatik.univie.ac.at/forschung/forschungsgruppen/theory-and-applications-of-algorithms/
for more information on the research group.
The positions are available immediately and will be of 12 months with
possible extension. Applicants should have have, or expect shortly to
obtain, a PhD in computer science or some other relevant discipline, with
a strong background in theoretical computer science. Experience in the
analysis of algorithms or in algorithmic game theory is very useful.
Successful applicants are expected to perform independent research as well
as collaborative research with the research group of Prof. Henzinger.
To apply, please send your CV, a short letter of motivation, and names of
at least two references to monika.henzinger@univie.ac.at.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] 1st Competition on Applied Text Searching CATS'2014 - CALL FORTASKS
FIRST COMPETITION ON APPLIED TEXT SEARCHING, CATS'2014 - CALL FOR TASKS
http://www.cats-series.org
The CATS committee cordially invites proposals for tasks to be run as part of the "Competition on Applied Text Searching 2014 (CATS'14)", which is intended to be an ongoing series of evaluations of text searching algorithms. The main goal of the CATS series is to explore the potentialities of the most recent advances in text searching on real world problems. We particularly aim to provide a fruitful platform, where the practical demands would be better sensed by the academia, and the advances in algorithm design and engineering would be more apparent to the industry.
SUBMISSION DEADLINE: DECEMBER 1 2013
CALL FOR TASKS IN A PDF FILE: http://www.cats-series.org/CATS14-CallForTasks.pdf
COMPETITION TASKS
Tasks are typically focused on the design and implementation of efficient, correct algorithms, in the field of text searching, including exact, approximate, single and multiple strings. Any problem definitions extending these fundamental topics as well as introducing new concepts or dimensions are surely very welcome. We especiallyencourage tasks on diverse data sets that are relevant in (but not restricted to) searching biological/DNA sequences, musical sequences, binary data, encrypted texts, natural language texts, compressed data, numerical sequences, dictionaries, images, specialized texts, etc. Tasks based on purely theoretical or open-ended problems, i.e., tasks that do not necessarily have a known efficient or optimal solution may also be considered. In typical setting, the tasks are expected to evaluate solutions in terms of correctness and speed (CPU running times). However, tasks with alternative measures of solution effectiveness other than CPU time consumption w!
ill be also taken into account. It will help us a lot if tasks are designed in such a way that they can be run and scored automatically from a central website or from a freely available tool. We will be happy to help with task design, data formatting, and so on. Task proposals must be submitted in English and must include an email address and information on the task author(s) including name, affiliation, and country.
To ensure a fair and interesting competition for all participants, proposed tasks should ideally contain:
1. Abstract
The abstract will contain a short description of the task and of the data which will be used for the evaluation.
2. Introduction and Motivation
This section will present an introduction to the problem containing some historical informations and the most significant references. It will include also applications and motivations of the problem proposed in the task.
3. Task Description
This section will present a detailed description and a formal definition of the problem involved in the proposed task. It will include technical details about input and output data.
4. Evaluation Procedure and Environment
This section will describe very clearly the procedure to evaluate the submitted solutions. It is expected that all submissions for the task will be checked for correctness and then compared in terms of speed via an automatic system. The proposers may consider to use the smart research tool (http://www.dmi.unict.it/~faro/smart), which is a platform to automatically score and compare string matching algorithms. It might be also possible, and we will be happy, to extent and tune the smart tool according to the needs of the tasks. However, the proposers are surely free to offer their own evaluation procedure with their own tools according to their specific needs. It is also vital to announce the details of the computing device that will be used throughout the evaluation, such as the CPU information, memory, operating system, or any other task specific properties.
5. Data Format
This section will explain the data format which will beused for the evaluation, and the description of the textand of the set of patterns.
6. Basic Solution
While not strictly required, it is strongly preferred that the submission also includes at least one implementation of the desired solution, attached as a separate file. It will be considered as the basic solution to be outperformed in the final evaluations process.
7. Reward Proposal
Although not mandatory, we strongly suggest the task authors to offer a reward for the winner, which will help to receive more attention to the specific task. In this case description of the reward and the constraint to complywith the reward must be given. The rewards may be considered in the form of cash money, grant for attending the conference or even a job contract. However, the reward proposal is at author's complete discretion.
Submitted tasks must be kept strictly confidential until the end of CATS 2014. After this time, authors are free to do whatever they wish with the tasks. A set of task proposals will be selected by the CATS Committee on the basis of their interest to the community, peculiarity and novelty.
The set of final selected tasks will be announced by December10, 2013.
All authors will be acknowledged at the close of CATS 2014.
SUBMISSION
Please submit proposals as soon as possible, preferably in a pdf file. Task materials must be placed together in a single file (use .zip or .tgz for multiple les) and submitted via email to the address: tasksubmission@cats-series.org.
Task proposals must be submitted by December 1, 2013
WHAT HAPPENS NEXT
Receipt of submissions will be confirmed via email.The CATS Scientific Committee will carefully review allsubmissions and will select a list of tasks to be run at the CATS 2014 competition. The authors of the tasks selected for competition will be invited to attend the CATS 2014 as Invited Guests. Following the announcement of the selected tasks, the CATS Committee will publish corresponding Call for Participationto invite solutions for the selected tasks.The authors of the selected tasks will be asked to provide training data to competitors in order to test and evaluatetheir own solutions. Training data will be released tocompetitors by December 25 2013.At the end of the Call for Participation a set of evaluationdata will be provided to the CATS committee by the task authors. This data will be similar (but not equal) totraining data provided in the first phase of the process.Task authors could eventually ask to keep confidential theevaluation data and/or to participate duri!
ng the testingprocess of the submitted solutions. In this case authorsshould explicitly state their interest in keeping confidentialthe evaluation data. In any case training data mustbe released to the participants.Solutions will be checked first for correctness, and will beevaluated in terms of running times or in terms of someother measures of effectiveness. The authors of tasks included in the actual competitionwill also be recognized by listing their name, affiliationand country in the official CATS 2014 proceedings (unless they specifically decline this).
IMPORTANT DATES
1 December 2013 : Task submission deadline
1 January 2014 : Call for solutions
May 2014 : Registration deadline
June 2014 : Winners announcement
September 2014 : CATS Workshop
COMMITTEE
Simone Faro
Dipartimento di Matematica e Informatica, University of Catania, Italy
email: faro@dmi.unict.it
M. Oguzhan Kulekci
TUBITAK, National Research Institute of Electronics and Cryptology, Turkey
email: oguzhan.kulekci@tubitak.gov.tr
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
http://www.cats-series.org
The CATS committee cordially invites proposals for tasks to be run as part of the "Competition on Applied Text Searching 2014 (CATS'14)", which is intended to be an ongoing series of evaluations of text searching algorithms. The main goal of the CATS series is to explore the potentialities of the most recent advances in text searching on real world problems. We particularly aim to provide a fruitful platform, where the practical demands would be better sensed by the academia, and the advances in algorithm design and engineering would be more apparent to the industry.
SUBMISSION DEADLINE: DECEMBER 1 2013
CALL FOR TASKS IN A PDF FILE: http://www.cats-series.org/CATS14-CallForTasks.pdf
COMPETITION TASKS
Tasks are typically focused on the design and implementation of efficient, correct algorithms, in the field of text searching, including exact, approximate, single and multiple strings. Any problem definitions extending these fundamental topics as well as introducing new concepts or dimensions are surely very welcome. We especiallyencourage tasks on diverse data sets that are relevant in (but not restricted to) searching biological/DNA sequences, musical sequences, binary data, encrypted texts, natural language texts, compressed data, numerical sequences, dictionaries, images, specialized texts, etc. Tasks based on purely theoretical or open-ended problems, i.e., tasks that do not necessarily have a known efficient or optimal solution may also be considered. In typical setting, the tasks are expected to evaluate solutions in terms of correctness and speed (CPU running times). However, tasks with alternative measures of solution effectiveness other than CPU time consumption w!
ill be also taken into account. It will help us a lot if tasks are designed in such a way that they can be run and scored automatically from a central website or from a freely available tool. We will be happy to help with task design, data formatting, and so on. Task proposals must be submitted in English and must include an email address and information on the task author(s) including name, affiliation, and country.
To ensure a fair and interesting competition for all participants, proposed tasks should ideally contain:
1. Abstract
The abstract will contain a short description of the task and of the data which will be used for the evaluation.
2. Introduction and Motivation
This section will present an introduction to the problem containing some historical informations and the most significant references. It will include also applications and motivations of the problem proposed in the task.
3. Task Description
This section will present a detailed description and a formal definition of the problem involved in the proposed task. It will include technical details about input and output data.
4. Evaluation Procedure and Environment
This section will describe very clearly the procedure to evaluate the submitted solutions. It is expected that all submissions for the task will be checked for correctness and then compared in terms of speed via an automatic system. The proposers may consider to use the smart research tool (http://www.dmi.unict.it/~faro/smart), which is a platform to automatically score and compare string matching algorithms. It might be also possible, and we will be happy, to extent and tune the smart tool according to the needs of the tasks. However, the proposers are surely free to offer their own evaluation procedure with their own tools according to their specific needs. It is also vital to announce the details of the computing device that will be used throughout the evaluation, such as the CPU information, memory, operating system, or any other task specific properties.
5. Data Format
This section will explain the data format which will beused for the evaluation, and the description of the textand of the set of patterns.
6. Basic Solution
While not strictly required, it is strongly preferred that the submission also includes at least one implementation of the desired solution, attached as a separate file. It will be considered as the basic solution to be outperformed in the final evaluations process.
7. Reward Proposal
Although not mandatory, we strongly suggest the task authors to offer a reward for the winner, which will help to receive more attention to the specific task. In this case description of the reward and the constraint to complywith the reward must be given. The rewards may be considered in the form of cash money, grant for attending the conference or even a job contract. However, the reward proposal is at author's complete discretion.
Submitted tasks must be kept strictly confidential until the end of CATS 2014. After this time, authors are free to do whatever they wish with the tasks. A set of task proposals will be selected by the CATS Committee on the basis of their interest to the community, peculiarity and novelty.
The set of final selected tasks will be announced by December10, 2013.
All authors will be acknowledged at the close of CATS 2014.
SUBMISSION
Please submit proposals as soon as possible, preferably in a pdf file. Task materials must be placed together in a single file (use .zip or .tgz for multiple les) and submitted via email to the address: tasksubmission@cats-series.org.
Task proposals must be submitted by December 1, 2013
WHAT HAPPENS NEXT
Receipt of submissions will be confirmed via email.The CATS Scientific Committee will carefully review allsubmissions and will select a list of tasks to be run at the CATS 2014 competition. The authors of the tasks selected for competition will be invited to attend the CATS 2014 as Invited Guests. Following the announcement of the selected tasks, the CATS Committee will publish corresponding Call for Participationto invite solutions for the selected tasks.The authors of the selected tasks will be asked to provide training data to competitors in order to test and evaluatetheir own solutions. Training data will be released tocompetitors by December 25 2013.At the end of the Call for Participation a set of evaluationdata will be provided to the CATS committee by the task authors. This data will be similar (but not equal) totraining data provided in the first phase of the process.Task authors could eventually ask to keep confidential theevaluation data and/or to participate duri!
ng the testingprocess of the submitted solutions. In this case authorsshould explicitly state their interest in keeping confidentialthe evaluation data. In any case training data mustbe released to the participants.Solutions will be checked first for correctness, and will beevaluated in terms of running times or in terms of someother measures of effectiveness. The authors of tasks included in the actual competitionwill also be recognized by listing their name, affiliationand country in the official CATS 2014 proceedings (unless they specifically decline this).
IMPORTANT DATES
1 December 2013 : Task submission deadline
1 January 2014 : Call for solutions
May 2014 : Registration deadline
June 2014 : Winners announcement
September 2014 : CATS Workshop
COMMITTEE
Simone Faro
Dipartimento di Matematica e Informatica, University of Catania, Italy
email: faro@dmi.unict.it
M. Oguzhan Kulekci
TUBITAK, National Research Institute of Electronics and Cryptology, Turkey
email: oguzhan.kulekci@tubitak.gov.tr
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Tuesday, October 1, 2013
[DMANET] Graduate Studies in Combinatorics & Optimization (Waterloo)
=======================================================================
GRADUATE STUDIES IN COMBINATORICS & OPTIMIZATION
University of Waterloo
C&O DEPARTMENT
The Department of Combinatorics and Optimization (C&O) is the
only department of its kind in the world. It has 30 professors
and approximately 60 graduate students. Among the faculty are one
Fellow of the Royal Society of Canada, one member of the National
Academy of Engineering, two Canada Research Chairs, three University
Research Chairs, two Fulkerson Prize winners, one Sloan Fellow,
and one recipient of a Friedrich Wilhelm Bessel Research Award.
Recent faculty appointments include Bill Cook and Luke Postle.
We are intensely research oriented and hold a strong international
reputation in each of our six major research areas:
* Algebraic combinatorics
* Continuous optimization
* Cryptography
* Discrete Optimization
* Graph Theory
* Quantum Computing
C&O faculty members also do research in algorithmic game theory,
approximation algorithms, combinatorial algebraic geometry, matroid
theory, network optimization, numerical analysis, and operations
research. The C&O department is affiliated with the Centre for
Applied Cryptographic Research (CACR), the Institute for Quantum
Computing (IQC), Perimeter Institute (PI), and the Waterloo Research
Institute in Insurance, Securities & Quantitative Finance (WatRISQ).
Our PhD graduates include Vasek Chvatal, Bill Cook, Bill Cunningham,
Jim Geelen, Bill Pulleyblank, Neil Robertson, Bruce Shepherd,
Doug Stinson, and Carsten Thomassen.
GRADUATE STUDIES IN C&O
We have a PhD program and several Master's programs (thesis-based,
course-based, co-op, quantum information). Our graduate students
come from all around the world. All students are given full
financial aid comprising research assistantships, teaching
assistantships, and scholarships. Teaching assistants have light
teaching and grading responsibilities of at most five hours per week.
We accept applications for graduate studies throughout the year.
The deadline for admission for the Fall term (starting in September)
is February 1. Application procedures are available on our web site:
http://math.uwaterloo.ca/co
MATH AT WATERLOO
The C&O department is one of five departments in the Faculty of
Mathematics, the other four being Applied Mathematics, Pure
Mathematics, Statistics & Actuarial Science, and the David R.
Cheriton School of Computer Science. Altogether, there are more
than 7,000 graduate and undergraduate students and 200 professors
in the Faculty of Mathematics, offering a stimulating environment
for research in all branches of the mathematical sciences.
THE CITY OF WATERLOO
Waterloo, and its twin city Kitchener, are located in Southern
Ontario, Canada. This thriving area, notable for its technology
industry, has the advantages of city living and yet is conveniently
close to natural attractions such as camping and hiking along the
Grand River. The City of Waterloo has a city-wide network of
trails and bike paths along with a comprehensive public
transportation system. Waterloo is an easy 90-minute drive or
bus ride to downtown Toronto, Canada's largest city.
CONTACT INFORMATION:
Melissa Cambridge
Administrative Coordinator, Graduate Studies
Phone: 1-519-888-4567 x34027
Email: cograd@math.uwaterloo.ca
URL: math.uwaterloo.ca/co
=======================================================================
**********************************************************
*
* 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/
*
**********************************************************
GRADUATE STUDIES IN COMBINATORICS & OPTIMIZATION
University of Waterloo
C&O DEPARTMENT
The Department of Combinatorics and Optimization (C&O) is the
only department of its kind in the world. It has 30 professors
and approximately 60 graduate students. Among the faculty are one
Fellow of the Royal Society of Canada, one member of the National
Academy of Engineering, two Canada Research Chairs, three University
Research Chairs, two Fulkerson Prize winners, one Sloan Fellow,
and one recipient of a Friedrich Wilhelm Bessel Research Award.
Recent faculty appointments include Bill Cook and Luke Postle.
We are intensely research oriented and hold a strong international
reputation in each of our six major research areas:
* Algebraic combinatorics
* Continuous optimization
* Cryptography
* Discrete Optimization
* Graph Theory
* Quantum Computing
C&O faculty members also do research in algorithmic game theory,
approximation algorithms, combinatorial algebraic geometry, matroid
theory, network optimization, numerical analysis, and operations
research. The C&O department is affiliated with the Centre for
Applied Cryptographic Research (CACR), the Institute for Quantum
Computing (IQC), Perimeter Institute (PI), and the Waterloo Research
Institute in Insurance, Securities & Quantitative Finance (WatRISQ).
Our PhD graduates include Vasek Chvatal, Bill Cook, Bill Cunningham,
Jim Geelen, Bill Pulleyblank, Neil Robertson, Bruce Shepherd,
Doug Stinson, and Carsten Thomassen.
GRADUATE STUDIES IN C&O
We have a PhD program and several Master's programs (thesis-based,
course-based, co-op, quantum information). Our graduate students
come from all around the world. All students are given full
financial aid comprising research assistantships, teaching
assistantships, and scholarships. Teaching assistants have light
teaching and grading responsibilities of at most five hours per week.
We accept applications for graduate studies throughout the year.
The deadline for admission for the Fall term (starting in September)
is February 1. Application procedures are available on our web site:
http://math.uwaterloo.ca/co
MATH AT WATERLOO
The C&O department is one of five departments in the Faculty of
Mathematics, the other four being Applied Mathematics, Pure
Mathematics, Statistics & Actuarial Science, and the David R.
Cheriton School of Computer Science. Altogether, there are more
than 7,000 graduate and undergraduate students and 200 professors
in the Faculty of Mathematics, offering a stimulating environment
for research in all branches of the mathematical sciences.
THE CITY OF WATERLOO
Waterloo, and its twin city Kitchener, are located in Southern
Ontario, Canada. This thriving area, notable for its technology
industry, has the advantages of city living and yet is conveniently
close to natural attractions such as camping and hiking along the
Grand River. The City of Waterloo has a city-wide network of
trails and bike paths along with a comprehensive public
transportation system. Waterloo is an easy 90-minute drive or
bus ride to downtown Toronto, Canada's largest city.
CONTACT INFORMATION:
Melissa Cambridge
Administrative Coordinator, Graduate Studies
Phone: 1-519-888-4567 x34027
Email: cograd@math.uwaterloo.ca
URL: math.uwaterloo.ca/co
=======================================================================
**********************************************************
*
* 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] Announcement and CfP --- IFORS 2014. Barcelona, Spain, July 13-18, 2014
Announcement and Call for Papers
IFORS 2014. Barcelona, Spain, July 13-18 2014 (www.ifors2014.org)
We invite you to participate in the IFORS 2014 Conference and to
submit an abstract.
Important dates
Abstract submissions opens: 1 November 2013
Abstract submissions closes: 31 January 2014
Early Registration: 1 November 2013- 28 February 2014
Regular Registration: 1 March - 30 April 2014
Late and on-site registration: 1 May - 13 July 2014
The IFORS 2014 Triennial Conference will be held in Barcelona, Spain,
July 13-18 2014. It will bring operational researchers from around the
globe together.
Barcelona is a dynamic, open, and inviting city, in the Mediterranean
coast of Spain, which displays the characteristics of major
Mediterranean cities and inherits a millenarian tradition in science,
art and commerce. The venue is Barcelona International Convention
Center, which was built for Barcelona's International Cultural Forum
in 2002 and counts with all the facilities to host major conferences.
The Conference Organizing and Program Committees together represent
many countries from all five continents, bringing the research,
applications and perspectives of their areas to this international
forum. We are working to prepare an attractive scientific program
covering the full spectrum of topics in our field, with a diverse and
high quality number of participants sharing their knowledge and
experience of operational research.
All attendees, including speakers and session chairs, must register
and pay the registration fee. If you need an early confirmation for
visa or budgetary reasons, please contact info@ifors2014.org. For all
other aspects, please contact the conference secretariat
ifors2014@pacifico-meetings.com.
Learn, enjoy, and be part of the great IFORS community by
participating in IFORS 2014. Organize a session, give a talk and
experience this great city!
Elena Fernández. Organizing Committee Chair
Stefan Nickel. Program Committee Chair
See more at www.ifors2014.org
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
IFORS 2014. Barcelona, Spain, July 13-18 2014 (www.ifors2014.org)
We invite you to participate in the IFORS 2014 Conference and to
submit an abstract.
Important dates
Abstract submissions opens: 1 November 2013
Abstract submissions closes: 31 January 2014
Early Registration: 1 November 2013- 28 February 2014
Regular Registration: 1 March - 30 April 2014
Late and on-site registration: 1 May - 13 July 2014
The IFORS 2014 Triennial Conference will be held in Barcelona, Spain,
July 13-18 2014. It will bring operational researchers from around the
globe together.
Barcelona is a dynamic, open, and inviting city, in the Mediterranean
coast of Spain, which displays the characteristics of major
Mediterranean cities and inherits a millenarian tradition in science,
art and commerce. The venue is Barcelona International Convention
Center, which was built for Barcelona's International Cultural Forum
in 2002 and counts with all the facilities to host major conferences.
The Conference Organizing and Program Committees together represent
many countries from all five continents, bringing the research,
applications and perspectives of their areas to this international
forum. We are working to prepare an attractive scientific program
covering the full spectrum of topics in our field, with a diverse and
high quality number of participants sharing their knowledge and
experience of operational research.
All attendees, including speakers and session chairs, must register
and pay the registration fee. If you need an early confirmation for
visa or budgetary reasons, please contact info@ifors2014.org. For all
other aspects, please contact the conference secretariat
ifors2014@pacifico-meetings.com.
Learn, enjoy, and be part of the great IFORS community by
participating in IFORS 2014. Organize a session, give a talk and
experience this great city!
Elena Fernández. Organizing Committee Chair
Stefan Nickel. Program Committee Chair
See more at www.ifors2014.org
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Call for Papers - PATAT 2014: The 10th International Conference on the Practice and Theory of Automated
[Please circulate to all those who might be interested, and accept our
apologies if you received multiple copies of this announcement]
--------------------------------------------------------------------------
CALL FOR PAPERS
The 10th International Conference on the
Practice and Theory of Automated Timetabling -
PATAT 2014
http://www.patatconference.org/patat2014/
York, United Kingdom
26-29 August, 2014
--------------------------------------------------------------------------
AIM AND SCOPE
--------------
The International Series of Conferences on the Practice and Theory of
Automated Timetabling (PATAT) is held biennially as a forum for both
researchers and practitioners of timetabling to exchange ideas. PATAT 2014
which is the tenth in the conference series will be held in York, UK.
Whether it is sporting events, educational institutions, transportation or
employee management the construction of efficient timetables which provide
the maximum in way of flexibility for all constituent parts is as important
as it is challenging. An increasingly important aspect within organisations
is an automated approach which maximises all aspects of resource usage. In
doing so a number of quantitative and qualitative challenges must be dealt
with from both a technical and practical perspective.
An important aim of the conference is to align the needs of practitioners
and the objectives of researchers. This is achieved through the presentation
and application of leading edge research techniques. Practitioners and
Researchers alike are encouraged to present their work and experiences with
the overall goal of developing efficient and practical solutions. With this
goal in mind, at PATAT 2014, researchers and practitioners will be brought
together through a number of key presentations and workshops.
Topics of interest and themes of the conference include, but not limited to:
- Educational Timetabling - Artificial Intelligence
- Timetabling in Transport - Graph Colouring
- Employee Rostering - Resource Capacity Planning
- Sports Timetabling - Parallel/Distributed Computing
- Timetabling in Healthcare - Hybrid Methods (e.g., Memetic
- Mathematical Programming Computing, Matheuristics)
- Constraint-Based Methods - Machine Learning (e.g., Data
Mining,
- Expert Systems Classifier Systems, Neural
Networks)
- Knowledge Based Systems - Multi-objective Approaches
- Fuzzy Systems - Multi-criteria Decision Making
- Heuristic Search - Foundational Studies (e.g.,
- Metaheuristics (e.g., Evolutionary Complexity Issues)
Computation, Simulated Annealing, - Timetabling Tools and Applications
Tabu Search, Ant Colony Methods) (e.g., Interactive
- Systems to Build Systems (e.g., and Batch Systems,
Hyper-heuristics, Standard Data Formats,
Algorithm Portfolios) Ontologies, Experiences)
PUBLICATION
------------
Authors are invited to submit their work in one of three categories:
1) Full papers: Authors should submit papers describing significant,
original and unpublished work.
2) Abstracts: People who wish to give a talk (e.g. practitioners,
researchers with preliminary or incomplete papers) but do not want to submit
a full paper can submit abstracts of up to 1000 words.
3) System demonstrations: Authors can also submit an abstract, describing
the major properties and contribution of implemented and/or commercial
timetabling systems.
All submissions will be peer reviewed by at least three members of the
programme committee. Accepted papers will be invited for an oral
presentation at the event and included in the PATAT 2014 proceedings after
they are presented.
JOURNAL SPECIAL ISSUE
----------------------
Authors will be invited to submit extended versions of their original work
as full papers for consideration to be published in a Special Issue of the
Annals of Operations Research.
IMPORTANT DATES
----------------
Paper Submission Deadline: 10 February, 2014
Notification of Acceptance: 29 April, 2014
Early Registration Closes: 30 June, 2014
PROGRAMME CO-CHAIRS
-------------------
Ender Özcan
University of Nottingham
ender.ozcan(ATT)nottingham.ac.uk
Edmund Burke
University of Stirling
e.k.burke(ATT)stir.ac.uk
Barry McCollum
Queen's University Belfast
b.mccollum(ATT)qub.ac.uk
*[Replace (ATT) with @]
ORGANISING COMMITTEE
--------------------
Tim Curtois, University of Nottingham
Mike Earl, Loughborough University
Bob John, University of Nottingham
Julie Lane, Sheffield Hallam University
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
apologies if you received multiple copies of this announcement]
--------------------------------------------------------------------------
CALL FOR PAPERS
The 10th International Conference on the
Practice and Theory of Automated Timetabling -
PATAT 2014
http://www.patatconference.org/patat2014/
York, United Kingdom
26-29 August, 2014
--------------------------------------------------------------------------
AIM AND SCOPE
--------------
The International Series of Conferences on the Practice and Theory of
Automated Timetabling (PATAT) is held biennially as a forum for both
researchers and practitioners of timetabling to exchange ideas. PATAT 2014
which is the tenth in the conference series will be held in York, UK.
Whether it is sporting events, educational institutions, transportation or
employee management the construction of efficient timetables which provide
the maximum in way of flexibility for all constituent parts is as important
as it is challenging. An increasingly important aspect within organisations
is an automated approach which maximises all aspects of resource usage. In
doing so a number of quantitative and qualitative challenges must be dealt
with from both a technical and practical perspective.
An important aim of the conference is to align the needs of practitioners
and the objectives of researchers. This is achieved through the presentation
and application of leading edge research techniques. Practitioners and
Researchers alike are encouraged to present their work and experiences with
the overall goal of developing efficient and practical solutions. With this
goal in mind, at PATAT 2014, researchers and practitioners will be brought
together through a number of key presentations and workshops.
Topics of interest and themes of the conference include, but not limited to:
- Educational Timetabling - Artificial Intelligence
- Timetabling in Transport - Graph Colouring
- Employee Rostering - Resource Capacity Planning
- Sports Timetabling - Parallel/Distributed Computing
- Timetabling in Healthcare - Hybrid Methods (e.g., Memetic
- Mathematical Programming Computing, Matheuristics)
- Constraint-Based Methods - Machine Learning (e.g., Data
Mining,
- Expert Systems Classifier Systems, Neural
Networks)
- Knowledge Based Systems - Multi-objective Approaches
- Fuzzy Systems - Multi-criteria Decision Making
- Heuristic Search - Foundational Studies (e.g.,
- Metaheuristics (e.g., Evolutionary Complexity Issues)
Computation, Simulated Annealing, - Timetabling Tools and Applications
Tabu Search, Ant Colony Methods) (e.g., Interactive
- Systems to Build Systems (e.g., and Batch Systems,
Hyper-heuristics, Standard Data Formats,
Algorithm Portfolios) Ontologies, Experiences)
PUBLICATION
------------
Authors are invited to submit their work in one of three categories:
1) Full papers: Authors should submit papers describing significant,
original and unpublished work.
2) Abstracts: People who wish to give a talk (e.g. practitioners,
researchers with preliminary or incomplete papers) but do not want to submit
a full paper can submit abstracts of up to 1000 words.
3) System demonstrations: Authors can also submit an abstract, describing
the major properties and contribution of implemented and/or commercial
timetabling systems.
All submissions will be peer reviewed by at least three members of the
programme committee. Accepted papers will be invited for an oral
presentation at the event and included in the PATAT 2014 proceedings after
they are presented.
JOURNAL SPECIAL ISSUE
----------------------
Authors will be invited to submit extended versions of their original work
as full papers for consideration to be published in a Special Issue of the
Annals of Operations Research.
IMPORTANT DATES
----------------
Paper Submission Deadline: 10 February, 2014
Notification of Acceptance: 29 April, 2014
Early Registration Closes: 30 June, 2014
PROGRAMME CO-CHAIRS
-------------------
Ender Özcan
University of Nottingham
ender.ozcan(ATT)nottingham.ac.uk
Edmund Burke
University of Stirling
e.k.burke(ATT)stir.ac.uk
Barry McCollum
Queen's University Belfast
b.mccollum(ATT)qub.ac.uk
*[Replace (ATT) with @]
ORGANISING COMMITTEE
--------------------
Tim Curtois, University of Nottingham
Mike Earl, Loughborough University
Bob John, University of Nottingham
Julie Lane, Sheffield Hallam University
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Junior Scientist (m/w) im Forschungsgebiet Transportlogistik
AIT Austrian Institute of Technology, the Austrian research institute with European format which focuses on the key infrastructure issues of the future, is looking to strengthen its team in the Mobility Department, Business Unit "Dynamic Transportation Systems" with the immediate appointment of a Junior Scientist in Transport Optimization and Logistics in Vienna.
A detailed description of the position and the required qualifications can be found at:
http://bewerber.ait.ac.at/bewerber/show_ausschreibung.php?&IDStelle=2032&lang=de
Best Regards,
Jakob Puchinger
Senior Scientist
Mobility Department
Dynamic Transportation Systems
AIT Austrian Institute of Technology GmbH
Giefinggasse 2 | 1210 Vienna | Austria
T +43 50550-6461 | M +43 664 210 65 09 | F +43 50550-6439
jakob.puchinger@ait.ac.at | http://www.ait.ac.at
FN: 115980 i HG Wien | UID: ATU14703506
www.ait.ac.at/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/
*
**********************************************************
A detailed description of the position and the required qualifications can be found at:
http://bewerber.ait.ac.at/bewerber/show_ausschreibung.php?&IDStelle=2032&lang=de
Best Regards,
Jakob Puchinger
Senior Scientist
Mobility Department
Dynamic Transportation Systems
AIT Austrian Institute of Technology GmbH
Giefinggasse 2 | 1210 Vienna | Austria
T +43 50550-6461 | M +43 664 210 65 09 | F +43 50550-6439
jakob.puchinger@ait.ac.at | http://www.ait.ac.at
FN: 115980 i HG Wien | UID: ATU14703506
www.ait.ac.at/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] permanent faculty position in Discrete Mathematics at the University of Birmingham
The University of Birmingham (UK) is seeking to recruit a researcher who has demonstrated excellent research achievement in any area of Discrete Mathematics.
This position is within the Birmingham fellowship scheme. Birmingham fellowships are prestigious permanent faculty positions, with a probationary period of three years. The positions are made especially attractive by the fact that the first 5 years come with (additional) protected time for high-quality research: there will be a significantly reduced teaching load for the first five years with almost no teaching in the first year, gradually going up to the full load. At the end of the five years the fellowship is transferred to a position at the appropriate level (Lecturer/Reader), which would be equivalent to an Associate Professorship within the US system.
Discrete Mathematics is one of the priority areas for the current call.
Applicants would be expected to have at least a year's postdoc or so, but they could also be (much) more senior.
The deadline for applications is 23 November 2013. The starting date is flexible - sometime in 2014.
Information about the fellowship call can be found here:
http://www.birmingham.ac.uk/staff/excellence/fellows/index.aspx
Information about the Birmingham Combinatorics group can be found here:
http://www.birmingham.ac.uk/research/activity/mathematics/pure-maths/combinatorics.aspx
Informal enquiries about applications are very welcome and can be made to:
Daniela Kuhn (d.kuhn@bham.ac.uk) and Deryk Osthus (d.osthus@bham.ac.uk).
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
This position is within the Birmingham fellowship scheme. Birmingham fellowships are prestigious permanent faculty positions, with a probationary period of three years. The positions are made especially attractive by the fact that the first 5 years come with (additional) protected time for high-quality research: there will be a significantly reduced teaching load for the first five years with almost no teaching in the first year, gradually going up to the full load. At the end of the five years the fellowship is transferred to a position at the appropriate level (Lecturer/Reader), which would be equivalent to an Associate Professorship within the US system.
Discrete Mathematics is one of the priority areas for the current call.
Applicants would be expected to have at least a year's postdoc or so, but they could also be (much) more senior.
The deadline for applications is 23 November 2013. The starting date is flexible - sometime in 2014.
Information about the fellowship call can be found here:
http://www.birmingham.ac.uk/staff/excellence/fellows/index.aspx
Information about the Birmingham Combinatorics group can be found here:
http://www.birmingham.ac.uk/research/activity/mathematics/pure-maths/combinatorics.aspx
Informal enquiries about applications are very welcome and can be made to:
Daniela Kuhn (d.kuhn@bham.ac.uk) and Deryk Osthus (d.osthus@bham.ac.uk).
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Max Planck Institute for Informatics: Group Leader Position in Algorithms
The Max Planck Institute for Informatics seeks a Group Leader for the Algorithms
and Complexity Department (directed by Kurt Mehlhorn). The department currently
conducts research in the areas foundations and discrete mathematics,
combinatorial optimization, bio-inspired computation, computational geometry,
computer algebra, algorithmic game theory, and software libraries. More
information can be found at http://www.mpi-inf.mpg.de/departments/d1.
This is a five-year appointment at the W2 level, which is roughly equivalent to
the assistant or associate professor level in the US system. All of our previous
Group Leaders have secured tenured professorships during their time at the
Institute. The primary criterion for selection is the ability to conduct
high-quality internationally recognized research in algorithms or complexity.
Please include your curriculum vitae, three selected publications, referee
contact details, and a 2500 word research statement. Applications should be sent
as a single pdf-file to d1-office@mpi-inf.mpg.de. The deadline for applications
is October 30th, 2013.
For further information regarding the position, please contact Kurt Mehlhorn
(mehlhorn@mpi-inf.mpg.de).
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
and Complexity Department (directed by Kurt Mehlhorn). The department currently
conducts research in the areas foundations and discrete mathematics,
combinatorial optimization, bio-inspired computation, computational geometry,
computer algebra, algorithmic game theory, and software libraries. More
information can be found at http://www.mpi-inf.mpg.de/departments/d1.
This is a five-year appointment at the W2 level, which is roughly equivalent to
the assistant or associate professor level in the US system. All of our previous
Group Leaders have secured tenured professorships during their time at the
Institute. The primary criterion for selection is the ability to conduct
high-quality internationally recognized research in algorithms or complexity.
Please include your curriculum vitae, three selected publications, referee
contact details, and a 2500 word research statement. Applications should be sent
as a single pdf-file to d1-office@mpi-inf.mpg.de. The deadline for applications
is October 30th, 2013.
For further information regarding the position, please contact Kurt Mehlhorn
(mehlhorn@mpi-inf.mpg.de).
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Subscribe to:
Posts (Atom)
Posts
