<Apologies if you receive multiple posts>
This special issue of Springer Complex Adaptive Systems Modeling (CASM)
intends to publish high quality original research as well as review articles
on case studies, models and methods for the modeling and simulation of
large-scale computer communication networks using either of the following
two approaches:
- Complex networks (Such as modeled, simulated or analyzed using tools
such as Gephi, Network Workbench, Visone, Cytoscape, Pajek and others).
- Agent-based models (such as based on NetLogo, Repast, Mason, Swarm
and others)
Modern computer communication networks often involve a large number of
interacting and adapting entities or nodes. These nodes can be modeled as
agents interacting with each other as well as adapting over time as well as
space. While a large body of literature exists on the modeling and
simulation of computer networks, most current models do not cater for this
emergent complex nature of networks even though such networks can be better
represented as Complex Adaptive Systems (CAS), a special class of complex
systems. Meanwhile, a large and multidisciplinary CAS community has evolved
well-developed methods and techniques for the modeling and simulation of CAS
including the use of techniques such as complex networks and Agent-based
Modeling; both of which have been demonstrated to be effective approaches
for the modeling of different aspects of CAS.
Recent work has demonstrated the utility of using either of these approaches
for the modeling of computer communication networks. This special issue of
CASM aims to consolidate such research on the use of these CAS modeling
techniques in the modeling of modern large-scale Complex communication
networks or Complex Adaptive COmmunicatiOn Networks and EnvironmentS
(CACOONS).
Papers submitted to the special issue conform to the scope of the journal
CASM and include a detailed cover letter as outlined here:
http://www.casmodeling.com/about
Topics of interest include areas such as but not limited to the
agent-based/complex network-based modeling and Simulation of:
- Multiagent systems
- Cognitive Sensor Networks
- Wireless Sensor Networks
- Sensor Actuator Networks
- Cloud computing infra-structures
- Internet of Things
- Service-oriented architectures
- Pervasive/Mobile Computing
- Peer-to-peer networks
Deadline: March, 15, 2012
First Decision: Typically within 5 weeks of submission
About Springer Complex Adaptive Systems Modeling Journal
Complex Adaptive Systems Modeling (CASM) is a highly multidisciplinary
modeling and simulation journal that serves as a unique forum for original,
high-quality peer-reviewed papers with a specific interest and scope limited
to agent-based and complex network-based modeling paradigms for Complex
Adaptive Systems (CAS). CASM is part of the SpringerOpen/BioMed Central
journals suite, which is the world's largest open access publisher. CASM
offers a fast peer-review and publication policy.
Other features of SpringerOpen include:
- Portability of peer-review across journals
- Open access - publications are freely available online
- High-level peer review, production and publishing processes
- Authors retain copyright to their work
- High visibility through different platforms
- Easy compliance with open access mandates
- Citation tracking and inclusion in bibliographic databases
Kind regards,
Muaz
-
Muaz A. Niazi, PhD SMIEEE
Professor,
Computer & Software Engineering Dept.,
Bahria University, Pakistan
Editor-in-Chief Springer Complex Adaptive Systems Modeling
http://www.casmodeling.com
Editor-in-Chief IGI Global IJPHIM www.igi-global.com/ijphim
Email: muaz.niazi@gmail.com
Web: https://sites.google.com/site/muazniazi/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Thursday, January 31, 2013
[DMANET] LAGOS 2013- Registration is now open
LAGOS2013 - VII Latin-American Algorithms, Graphs and Optimization Symposium
Apologies for cross posting and duplicates.
Dear Colleagues,
We are happy to announce that the registration page of LAGOS2013 is now open.
Please be sure to:
1. Fill in the registration form and pay the registration fee:
http://xamanek.izt.uam.mx/LAGOS2013/registration.html
2. Make accommodation arrangements.
http://xamanek.izt.uam.mx/LAGOS2013/accommodation.html
Notes:
-- Staying at a hotel other than Bluebay Grand Esmeralda would be
impractical and expensive since the conference hotel is All-Inclusive,
it is far from most other hotels and taxi cabs are expensive at Playa
del Carmen.
-- Deadlines for these registration processes and accommodation
arrangements are clearly indicated in the corresponding pages. But you
would certainly help us a lot by doing so at your earliest
convenience.
-- ***Accommodation Grants for Students*** There are a limited number
of accommodation grants for students. You may apply for it in the
registration page. Read instructions carefully and fill in all the
fields in the registration form. Time is a factor, so register soon.
-- ***Optional Trip Recommended*** As you make your accommodation
arrangements, please consider to stay an additional day to take an
optional trip (on Saturday 27) to the coral reefs of Cozumel island
which is part of the 2nd largest coral reef system in the world. The
regular price for this trip is 116.55USDplustax(plus7USD for
port usage). LAGOS participants will receive a $12USD discount. The
trip starts at the hotel at 9am and ends again at the hotel at 6:30pm.
The price includes bus transportation, ferry to Cozumel, meal and
snorkeling equipment -OR- one hour ride on the Paradise Sub See
Explorer, a semisubmersible ship where you can see the marine life
without getting wet:
http://www.aquaworld.com.mx/Cozumel-subsee-explorer.html
We are looking forward to see you in beautiful Playa del Carmen.
The Organizing Committee.
**********************************************************
*
* 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 for cross posting and duplicates.
Dear Colleagues,
We are happy to announce that the registration page of LAGOS2013 is now open.
Please be sure to:
1. Fill in the registration form and pay the registration fee:
http://xamanek.izt.uam.mx/LAGOS2013/registration.html
2. Make accommodation arrangements.
http://xamanek.izt.uam.mx/LAGOS2013/accommodation.html
Notes:
-- Staying at a hotel other than Bluebay Grand Esmeralda would be
impractical and expensive since the conference hotel is All-Inclusive,
it is far from most other hotels and taxi cabs are expensive at Playa
del Carmen.
-- Deadlines for these registration processes and accommodation
arrangements are clearly indicated in the corresponding pages. But you
would certainly help us a lot by doing so at your earliest
convenience.
-- ***Accommodation Grants for Students*** There are a limited number
of accommodation grants for students. You may apply for it in the
registration page. Read instructions carefully and fill in all the
fields in the registration form. Time is a factor, so register soon.
-- ***Optional Trip Recommended*** As you make your accommodation
arrangements, please consider to stay an additional day to take an
optional trip (on Saturday 27) to the coral reefs of Cozumel island
which is part of the 2nd largest coral reef system in the world. The
regular price for this trip is 116.55USDplustax(plus7USD for
port usage). LAGOS participants will receive a $12USD discount. The
trip starts at the hotel at 9am and ends again at the hotel at 6:30pm.
The price includes bus transportation, ferry to Cozumel, meal and
snorkeling equipment -OR- one hour ride on the Paradise Sub See
Explorer, a semisubmersible ship where you can see the marine life
without getting wet:
http://www.aquaworld.com.mx/Cozumel-subsee-explorer.html
We are looking forward to see you in beautiful Playa del Carmen.
The Organizing Committee.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] PhD studentships
The Department of Management Science at Lancaster University (UK) is looking to recruit doctoral students with a strong quantitative background, for example in mathematics, statistics, computing or engineering. Several studentships, each worth up to £13,500 sterling (+fees) per annum, are available in Management Science, Operational Research, Operations Management and Information Systems.
We suggest that potential applicants examine the list of supervisors and their areas of research and then contact the department informally, enclosing a cv and a brief description of the proposed research area, linking it to a faculty member's interests.
Find out more at: www.lums.lancs.ac.uk/phd
Main Contact: Gay Bentinck +44 (0)1524 592408: email g.bentinck@lancaster.ac.uk
Deadline for applications: 27th March 2013.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
We suggest that potential applicants examine the list of supervisors and their areas of research and then contact the department informally, enclosing a cv and a brief description of the proposed research area, linking it to a faculty member's interests.
Find out more at: www.lums.lancs.ac.uk/phd
Main Contact: Gay Bentinck +44 (0)1524 592408: email g.bentinck@lancaster.ac.uk
Deadline for applications: 27th March 2013.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
from: Andrzej Pelc: Postdoctoral Fellowship, Universite du Quebec en Outaouais
POSTDOCTORAL FELLOWSHIP UNIVERSITE DU QUEBEC EN OUTAOUAIS, CANADA
A postdoctoral position in computer science is available at the
Research Chair in Distributed Computing of the
Universite du Quebec en Outaouais, Canada,
under the supervision of Prof. Andrzej Pelc.
Requirements: * Ph.D. in Computer Science or Mathematics obtained between
September 1, 2010 and August 31, 2013
* Strong academic background in algorithms and graph theory.
* Strong research record and potential in one or more of the
following domains:
- design and analysis of combinatorial algorithms
- algorithmic aspects of distributed and parallel computing
- algorithms for interconnection networks
- algorithmic aspects of fault tolerance
Further information about the
Research Chair in Distributed Computing, and
about topics related to prospective postdoctoral research
of the successful candidate can be obtained at:
http://w3.uqo.ca/pelc/main.html
and
http://w3.uqo.ca/pelc/caldi/index.htm
Duties: Research in the above areas. NO teaching duties.
Knowledge of French is NOT necessary.
Duration: 12 months
Beginning: September 2013 (flexible)
Stipend: $40 000 per year (Canadian dollars).
Location: The Universite du Quebec en Outaouais is situated in Gatineau,
across the river from Ottawa. The National
Capital region of Ottawa offers a variety of possibilities
for cultural and sports activities (swimming, sailing, hiking,
skating, cross-country and downhill skiing). The campus of the
University of Quebec is a 10 min. drive from downtown Ottawa.
Applications including a detailed CV (with e-mail address),
a statement of research interests, a complete list of publications,
an abstract of Ph.D. Thesis and reprints (preprints) of 2 best papers
should be sent to the following address (by physical mail, not by e-mail):
Prof. Andrzej Pelc
Research Chair in Distributed Computing
Departement d'informatique
Universite du Quebec en Outaouais
C.P. 1250, succ. Hull
Gatineau, Quebec J8X 3X7
Canada
Please arrange to have three letters of reference sent directly to the same
address. Deadline for applications is March 15, 2013.
Informal enquiries at
e-mail: pelc@uqo.ca
A postdoctoral position in computer science is available at the
Research Chair in Distributed Computing of the
Universite du Quebec en Outaouais, Canada,
under the supervision of Prof. Andrzej Pelc.
Requirements: * Ph.D. in Computer Science or Mathematics obtained between
September 1, 2010 and August 31, 2013
* Strong academic background in algorithms and graph theory.
* Strong research record and potential in one or more of the
following domains:
- design and analysis of combinatorial algorithms
- algorithmic aspects of distributed and parallel computing
- algorithms for interconnection networks
- algorithmic aspects of fault tolerance
Further information about the
Research Chair in Distributed Computing, and
about topics related to prospective postdoctoral research
of the successful candidate can be obtained at:
http://w3.uqo.ca/pelc/main.html
and
http://w3.uqo.ca/pelc/caldi/index.htm
Duties: Research in the above areas. NO teaching duties.
Knowledge of French is NOT necessary.
Duration: 12 months
Beginning: September 2013 (flexible)
Stipend: $40 000 per year (Canadian dollars).
Location: The Universite du Quebec en Outaouais is situated in Gatineau,
across the river from Ottawa. The National
Capital region of Ottawa offers a variety of possibilities
for cultural and sports activities (swimming, sailing, hiking,
skating, cross-country and downhill skiing). The campus of the
University of Quebec is a 10 min. drive from downtown Ottawa.
Applications including a detailed CV (with e-mail address),
a statement of research interests, a complete list of publications,
an abstract of Ph.D. Thesis and reprints (preprints) of 2 best papers
should be sent to the following address (by physical mail, not by e-mail):
Prof. Andrzej Pelc
Research Chair in Distributed Computing
Departement d'informatique
Universite du Quebec en Outaouais
C.P. 1250, succ. Hull
Gatineau, Quebec J8X 3X7
Canada
Please arrange to have three letters of reference sent directly to the same
address. Deadline for applications is March 15, 2013.
Informal enquiries at
e-mail: pelc@uqo.ca
[DMANET] ELC Tokyo Complexity Workshop
ELC Tokyo Complexity Workshop
March 14-17, 2013, Shinagawa Prince Hotel, Tokyo, Japan
ELC (Exploring the Limits of Computation) is a five-year project
started in 2012 in Japan, focusing on various aspects of
computational complexity theory. As a kickoff event of this project,
we are planning to have a workshop during March 14-17 in Tokyo,
inviting the following distinguished speakers. We welcome any of you
interested in computational complexity theory to participate in this
workshop. We are planning also some satellite seminars before and
after the workshop. Please see the following web page for further
information.
http://www.al.ics.saitama-u.ac.jp/elc/ws/
Invited Speakers:
* Eric Allender (Rutgers University)
* Irit Dinur (Weizmann Institute of Science)
* Zeev Dvir (Princeton University)
* Joshua A. Grochow (University of Toronto)
* Rahul Jain (National University of Singapore)
* Valentine Kabanets (Simon Fraser University)
* Shachar Lovett (Institute for Advanced Study)
* Pinyan Lu (Microsoft Research Asia and Shanghai Jiao Tong University)
* Raghu Meka (Institute for Advanced Study and DIMACS)
* Ketan Mulmuley (University of Chicago)
* Noam Nisan (Hebrew University of Jerusalem)
* Ryan O'Donnell (Carnegie Mellon University)
* Pavel Pudlak (Academy of Sciences of the Czech Republic)
* Ran Raz (Weizmann Institute of Science)
* Rocco Servedio (Columbia University)
* Luca Trevisan (Stanford University)
* Umesh Vazirani (UC Berkeley)
* Yuichi Yoshida (National Institute of Informatics)
* David Zuckerman (University of Texas at Austin)
Exploring the Limits of Computation (ELC)
Project webpage: http://www.al.ics.saitama-u.ac.jp/elc/
**********************************************************
*
* 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/
*
**********************************************************
March 14-17, 2013, Shinagawa Prince Hotel, Tokyo, Japan
ELC (Exploring the Limits of Computation) is a five-year project
started in 2012 in Japan, focusing on various aspects of
computational complexity theory. As a kickoff event of this project,
we are planning to have a workshop during March 14-17 in Tokyo,
inviting the following distinguished speakers. We welcome any of you
interested in computational complexity theory to participate in this
workshop. We are planning also some satellite seminars before and
after the workshop. Please see the following web page for further
information.
http://www.al.ics.saitama-u.ac.jp/elc/ws/
Invited Speakers:
* Eric Allender (Rutgers University)
* Irit Dinur (Weizmann Institute of Science)
* Zeev Dvir (Princeton University)
* Joshua A. Grochow (University of Toronto)
* Rahul Jain (National University of Singapore)
* Valentine Kabanets (Simon Fraser University)
* Shachar Lovett (Institute for Advanced Study)
* Pinyan Lu (Microsoft Research Asia and Shanghai Jiao Tong University)
* Raghu Meka (Institute for Advanced Study and DIMACS)
* Ketan Mulmuley (University of Chicago)
* Noam Nisan (Hebrew University of Jerusalem)
* Ryan O'Donnell (Carnegie Mellon University)
* Pavel Pudlak (Academy of Sciences of the Czech Republic)
* Ran Raz (Weizmann Institute of Science)
* Rocco Servedio (Columbia University)
* Luca Trevisan (Stanford University)
* Umesh Vazirani (UC Berkeley)
* Yuichi Yoshida (National Institute of Informatics)
* David Zuckerman (University of Texas at Austin)
Exploring the Limits of Computation (ELC)
Project webpage: http://www.al.ics.saitama-u.ac.jp/elc/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] PhD position in TCS at KTH Royal Institute of Technology, Stockholm
The Theoretical Computer Science group at KTH Royal Institute of
Technology invites applications for a PhD position in Theoretical
Computer Science (Algorithms & Complexity).
We are seeking a PhD student in Theoretical Computer Science for the
research project "Trading Time for Approximation in Optimization" in
the areas of approximation algorithms and exact algorithms.
The application deadline is March 15, 2013. See
http://www.csc.kth.se/~austrin/jobs/phd-2013.php for the full, formal
announcement with more information and instructions for how to
apply. Informal enquiries about this position are welcome and may be
sent to Per Austrin (austrin@kth.se).
Best regards,
Per Austrin
**********************************************************
*
* 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/
*
**********************************************************
Technology invites applications for a PhD position in Theoretical
Computer Science (Algorithms & Complexity).
We are seeking a PhD student in Theoretical Computer Science for the
research project "Trading Time for Approximation in Optimization" in
the areas of approximation algorithms and exact algorithms.
The application deadline is March 15, 2013. See
http://www.csc.kth.se/~austrin/jobs/phd-2013.php for the full, formal
announcement with more information and instructions for how to
apply. Informal enquiries about this position are welcome and may be
sent to Per Austrin (austrin@kth.se).
Best regards,
Per Austrin
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Final CfP Euro-Par 2013, Topic 12
=======================================================================
Euro-Par 2013,
19th International European Conference on
Parallel and Distributed Computing
http://www.europar2013.org/
August 26 - 30, Aachen, Germany
Deadline for abstracts: February 8, 2013
Deadline for full papers: February 15, 2013
=======================================================================
Scope of Topic 12: Theory and Algorithms for Parallel Computation
=================================================================
The detailed description of Topic 12 can be found here:
http://www.europar2013.org/conference/topics/topic12
High-quality, original papers are solicited which contribute new results
on foundational issues regarding parallelism in computing and/or
proposing improved approaches to the solution of specific algorithmic
problems. Topics of interest include, but are not limited to, the
following:
- Foundations, computational models, and emerging paradigms for
parallel, distributed, multiprocessor and network computation
- Deterministic and randomized parallel algorithms and data structures
- Lower bounds for key computational problems
- Models and algorithms for parallelism in memory hierarchies
- Models and algorithms for real networks (scale-free, small world,
wireless networks)
- Energy-efficient algorithms
Topic Committee
===============
- Giuseppe F. Italiano, Università di Roma "Tor Vergata", Italy (Global
topic chair)
- Henning Meyerhenke, Karlsruhe Institute of Technology (KIT), Germany
(Local topic chair)
- Guy E. Blelloch, Carnegie Mellon University, USA
- Philippas Tsigas, Chalmers University, Sweden
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Euro-Par 2013,
19th International European Conference on
Parallel and Distributed Computing
http://www.europar2013.org/
August 26 - 30, Aachen, Germany
Deadline for abstracts: February 8, 2013
Deadline for full papers: February 15, 2013
=======================================================================
Scope of Topic 12: Theory and Algorithms for Parallel Computation
=================================================================
The detailed description of Topic 12 can be found here:
http://www.europar2013.org/conference/topics/topic12
High-quality, original papers are solicited which contribute new results
on foundational issues regarding parallelism in computing and/or
proposing improved approaches to the solution of specific algorithmic
problems. Topics of interest include, but are not limited to, the
following:
- Foundations, computational models, and emerging paradigms for
parallel, distributed, multiprocessor and network computation
- Deterministic and randomized parallel algorithms and data structures
- Lower bounds for key computational problems
- Models and algorithms for parallelism in memory hierarchies
- Models and algorithms for real networks (scale-free, small world,
wireless networks)
- Energy-efficient algorithms
Topic Committee
===============
- Giuseppe F. Italiano, Università di Roma "Tor Vergata", Italy (Global
topic chair)
- Henning Meyerhenke, Karlsruhe Institute of Technology (KIT), Germany
(Local topic chair)
- Guy E. Blelloch, Carnegie Mellon University, USA
- Philippas Tsigas, Chalmers University, Sweden
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Wednesday, January 30, 2013
[DMANET] UCNC 2013: Submission deadline extended to 17 February 2013
Due to many requests, we have extended the UCNC 2013 submission deadline
to 17 February 2013.
---------------------------------------------------------------
to 17 February 2013.
---------------------------------------------------------------
12th International Conference on
UNCONVENTIONAL COMPUTATION AND NATURAL COMPUTATION
UCNC 2013
previously Unconventional Computation
1-5 July 2013
Milano, Italy
http://ucnc2013.disco.unimib.it
ucnc2013@disco.unimib.it
Important dates
* Submission deadline: 17 February 2013 (extended)
* Notification to authors: 25 March 2013
* Final version: 1 May 2013
* Conference: 1-5 July 2013
UCNC 2013 is organised by Dipartimento di Informatica,
Sistemistica e Comunicazione (Department of Computer Science,
Systems and Communication) of Università degli Studi di
Milano-Bicocca.
Topics
The topics of the conference include all areas of unconventional
computation and natural computation, including (but not limited
to) quantum, cellular, molecular, neural, DNA, membrane, and
evolutionary computing; cellular automata; computation based on
chaos and dynamical systems; massive parallel computation;
collective intelligence; computation based on physical principles
such as relativistic, optical, spatial, collision-based
computing; amorphous computing; physarum computing;
hypercomputation. Both theoretical and experimental papers are
welcome.
Submissions
Authors are invited to submit original papers (at most 12 pages
in LNCS format) using EasyChair.org, at
https://www.easychair.org/conferences/?conf=ucnc2013
Papers must be submitted in Portable Document Format (PDF). The
revised version of the manuscripts, to appear in a LNCS volume by
Springer, must be prepared in LaTeX according to the LNCS format
(see http://www.springer.com/computer/lncs/ lncs+authors).
The papers must not have been submitted simultaneously to other
conferences with published proceedings. All accepted papers must
be presented at the conference.
The proceedings will be available at the conference venue.
Authors of accepted papers will be invited to submit an extended
and improved version of their contribution to a special issue of
an international journal.
Invited speakers
* Enrico Formenti (Université Nice Sophia Antipolis, France)
* John V. Tucker (Swansea University, UK)
* Xin Yao (University of Birmingham, UK)
Joint UCNC/CiE 2013 invited speakers
* Gilles Brassard (Université de Montréal, Canada)
* Grzegorz Rozenberg (Universiteit Leiden, Netherlands and
University of Colorado Boulder, USA)
* Endre Szemerédi (Hungarian Academy of Sciences, Hungary and
Rutgers University, USA)
Program committee
* Andrew Adamatzky (University of the West of England, UK)
* Selim G. Akl (Queen's University, Canada)
* Olivier Bournez (École Politechnique, France)
* Cristian S. Calude (University of Auckland, New Zealand)
* José Félix Costa (Techinical University of Lisbon, Portugal)
* Erzsébet Csuhaj-Varjú (Eötvös Loránd University, Hungary)
* Alberto Dennunzio (Università degli Studi di Milano-Bicocca,
Italy)
* Michael J. Dinneen (University of Auckland, New Zealand)
* Marco Dorigo (Université Libre de Bruxelles, Belgium)
* Jérôme Durand-Lose (Université d'Orléans, France)
* Oscar H. Ibarra (University of California, Santa Barbara, USA)
* Masami Hagiya (University of Tokyo, Japan)
* Jarkko Kari (University of Turku, Finland)
* Lila Kari (University of Western Ontario, Canada)
* Viv Kendon (University of Leeds, UK)
* Giancarlo Mauri (chair, Università degli Studi di
Milano-Bicocca, Italy)
* Mario J. Pérez-Jiménez (Universidad de Sevilla, Spain)
* Kai Salomaa (Queen's University, Canada)
* Hava Siegelmann (University of Massachusetts Amherst, USA)
* Susan Stepney (University of York, UK)
* Hiroshi Umeo (Osaka Electro-Communication University, Japan)
* Leonardo Vanneschi (Universidade Nova de Lisboa, Portugal)
* Damien Woods (California Institute of Technology, USA)
Organising committee
* Alberto Dennunzio (Università degli Studi di Milano-Bicocca,
Italy)
* Luca Manzoni (Università degli Studi di Milano-Bicocca, Italy)
* Giancarlo Mauri (chair, Università degli Studi di
Milano-Bicocca, Italy)
* Antonio E. Porreca (Università degli Studi di Milano-Bicocca,
Italy)
Satellite workshops:
* BioChemIT2013 (Third COBRA Workshop on Biological and Chemical
Information Technologies)
http://www.cobra-project.eu/biochemit2013_call.html
* CoSMoS 2013 (6th Complex Systems Modelling and
Simulation Workshop)
http://www-users.cs.york.ac.uk/psa/cosmos2013/cosmos2013.html
* Wivace 2013 (Workshop Italiano di Vita Artificiale e
Computazione Evolutiva 2013 - Italian Workshop on Artificial
Life and Evolutionary Computation 2013)
http://wivace2013.disco.unimib.it
The UCNC 2013 conference will be co-located with Computability in
Europe 2013 (CiE 2013, http://cie2013.disco.unimib.it).
The conference and the satellite workshops will take place at
the U6 building of Università degli Studi di Milano-Bicocca,
Piazza dell'Ateneo Nuovo 1, Milano.
The previous editions of the conference took place at Auckland,
New Zealand (UMC 1998); Brussels, Belgium (UMC 2000); Kobe, Japan
(UMC 2002); Seville, Spain (UC 2005); York, UK (UC 2006);
Kingston, Canada (UC 2007); Vienna, Austria (UC 2008); Ponta
Delgada, Portugal (UC 2009); Tokyo, Japan (UC 2010); Turku,
Finland (UC 2011); Orleans, France (UCNC 2012).
**********************************************************
*
* 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] MathSport International 2013 – Extended deadline (Feb 8)
We like to inform you that the MathSport deadline has been extended by one week to Feb 8, 2013.
Furthermore, registration is now opened.
Please find the final call for papers below.
======================================================
MathSport International 2013 – Final Call for Papers
======================================================
The 4th International Conference on Mathematics and Sport
June 5 – 7 , 2013
Leuven, Belgium
http://www.mathsportinternational.com
======================================================
Deadlines:
Abstract submission: February 8, 2013 (extended)
Notification of acceptance: February 15, 2013
Proceedings paper: March 29, 2013
Early registration: April 12, 2013
All times refer to 23:59 in Brussels, Belgium (Central European Time).
======================================================
We invite you to submit an abstract for the 4th International Conference on Mathematics in Sport. Submissions in all areas where sports and mathematics meet are welcome. The term sport is interpreted liberally and includes games, gambling, and lotteries.
Topics of interest include, but are not limited to:
- econometrics in sport
- optimal tournament design
- sport scheduling
- competitive strategy
- match outcome models
- decision support systems
- analysis of sporting technologies
- statistics and statistical modeling in sport
- analysis of rules and adjudication
- performance measures and models
- optimisation of sport performance
- mathematics education and sport
- financial valuation in sport
Submission:
Contributions will be accepted for the conference based on a 100-300 word abstract. Abstracts should be submitted electronically by January 31st, 2013, through the following EasyChair website: https://www.easychair.org/conferences/?conf=mathsport2013
Although submitting an abstract may be sufficient for presenting your work at the conference, we encourage you to submit a proceedings paper, even if it describes work in progress. Proceedings papers should be prepared using Word, complying with the format that can be found on the MathSport website (www.mathsportinternational.com/callforpapers.html). Please submit your paper electronically as a ".doc" or ".docx" file. Proceedings papers can be submitted (or changed) until March 29th, 2013. It is perfectly possible to submit the proceedings paper after receiving notification of acceptance.
At least one author of each accepted paper must register and present the work at the conference.
Publication:
Accepted papers presented at the conference will appear in the conference proceedings, which will be distributed on USB stick. The proceedings will be submitted for indexation by Thomson Reuters Conference Proceedings Citation Index (ISI). Each participant will also receive a booklet of abstracts.
A special issue of Journal of Quantitative Analysis in Sports (http://www.degruyter.com/view/j/jqas) will be devoted papers from the MathSport conference. Interested authors can submit their work for publication in this special issue.
For further information, we refer to the conference website, or info@mathsportinternational.com
======================================================
Keynote speakers:
Prof. Dominique de Werra (Ecole Polytechnique Fédérale de Lausanne)
Prof. David Forrest (University of Salford)
Prof. Mark Glickman (Boston University)
======================================================
Venue:
Leuven is a university town located some 30 km to the east of Brussels. Leuven dates back to the 9th century and has a rich heritage with various historical buildings to be admired. Leuven also provides an excellent environment for relaxation in its numerous bars and restaurants. The Old Market, locally known as 'the largest pub of Europe', is known for its lively nightlife, and a large collection of the famous Belgian beers are served.
======================================================
Social events:
Discovering Leuven: a guided walk through the city center.
Bar Quiz: a fine MathSport tradition
Conference dinner: at the Great Beguinage (UNESCO world heritage)
======================================================
Registration fee:
Early registration: 350 € (student: 230€)
All social events are included in the registration fee
======================================================
Scientific Committee:
Anthony Bedford (RMIT University), Ruud Koning (University of Groningen), David Percy (University of Salford), Ray Stefani (CSULB), Celso Ribeiro (Universidade Federal Fluminense), Liam Lenten (LaTrobe University), Dimitris Karlis (Athens University), Guillermo Duran (Universidad de Buenos Aires and Universidad de Chile), Joao Carlos Soares de Mello (Universidade Federal Fluminense), Michael Trick (Carnegie Mellon University), James Cochran (Louisiana Tech University), Ryuhei Miyashiro (Tokyo University of Agriculture and Technology), Ian McHale (University of Salford)
======================================================
Organizing Committee:
Dries Goossens (KU Leuven), Phil Scarf (University of Salford), Frits Spieksma (KU Leuven)
======================================================
**********************************************************
*
* 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/
*
**********************************************************
Furthermore, registration is now opened.
Please find the final call for papers below.
======================================================
MathSport International 2013 – Final Call for Papers
======================================================
The 4th International Conference on Mathematics and Sport
June 5 – 7 , 2013
Leuven, Belgium
http://www.mathsportinternational.com
======================================================
Deadlines:
Abstract submission: February 8, 2013 (extended)
Notification of acceptance: February 15, 2013
Proceedings paper: March 29, 2013
Early registration: April 12, 2013
All times refer to 23:59 in Brussels, Belgium (Central European Time).
======================================================
We invite you to submit an abstract for the 4th International Conference on Mathematics in Sport. Submissions in all areas where sports and mathematics meet are welcome. The term sport is interpreted liberally and includes games, gambling, and lotteries.
Topics of interest include, but are not limited to:
- econometrics in sport
- optimal tournament design
- sport scheduling
- competitive strategy
- match outcome models
- decision support systems
- analysis of sporting technologies
- statistics and statistical modeling in sport
- analysis of rules and adjudication
- performance measures and models
- optimisation of sport performance
- mathematics education and sport
- financial valuation in sport
Submission:
Contributions will be accepted for the conference based on a 100-300 word abstract. Abstracts should be submitted electronically by January 31st, 2013, through the following EasyChair website: https://www.easychair.org/conferences/?conf=mathsport2013
Although submitting an abstract may be sufficient for presenting your work at the conference, we encourage you to submit a proceedings paper, even if it describes work in progress. Proceedings papers should be prepared using Word, complying with the format that can be found on the MathSport website (www.mathsportinternational.com/callforpapers.html). Please submit your paper electronically as a ".doc" or ".docx" file. Proceedings papers can be submitted (or changed) until March 29th, 2013. It is perfectly possible to submit the proceedings paper after receiving notification of acceptance.
At least one author of each accepted paper must register and present the work at the conference.
Publication:
Accepted papers presented at the conference will appear in the conference proceedings, which will be distributed on USB stick. The proceedings will be submitted for indexation by Thomson Reuters Conference Proceedings Citation Index (ISI). Each participant will also receive a booklet of abstracts.
A special issue of Journal of Quantitative Analysis in Sports (http://www.degruyter.com/view/j/jqas) will be devoted papers from the MathSport conference. Interested authors can submit their work for publication in this special issue.
For further information, we refer to the conference website, or info@mathsportinternational.com
======================================================
Keynote speakers:
Prof. Dominique de Werra (Ecole Polytechnique Fédérale de Lausanne)
Prof. David Forrest (University of Salford)
Prof. Mark Glickman (Boston University)
======================================================
Venue:
Leuven is a university town located some 30 km to the east of Brussels. Leuven dates back to the 9th century and has a rich heritage with various historical buildings to be admired. Leuven also provides an excellent environment for relaxation in its numerous bars and restaurants. The Old Market, locally known as 'the largest pub of Europe', is known for its lively nightlife, and a large collection of the famous Belgian beers are served.
======================================================
Social events:
Discovering Leuven: a guided walk through the city center.
Bar Quiz: a fine MathSport tradition
Conference dinner: at the Great Beguinage (UNESCO world heritage)
======================================================
Registration fee:
Early registration: 350 € (student: 230€)
All social events are included in the registration fee
======================================================
Scientific Committee:
Anthony Bedford (RMIT University), Ruud Koning (University of Groningen), David Percy (University of Salford), Ray Stefani (CSULB), Celso Ribeiro (Universidade Federal Fluminense), Liam Lenten (LaTrobe University), Dimitris Karlis (Athens University), Guillermo Duran (Universidad de Buenos Aires and Universidad de Chile), Joao Carlos Soares de Mello (Universidade Federal Fluminense), Michael Trick (Carnegie Mellon University), James Cochran (Louisiana Tech University), Ryuhei Miyashiro (Tokyo University of Agriculture and Technology), Ian McHale (University of Salford)
======================================================
Organizing Committee:
Dries Goossens (KU Leuven), Phil Scarf (University of Salford), Frits Spieksma (KU Leuven)
======================================================
**********************************************************
*
* 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] FW: VeRoLog 2013 - Call for Papers
(Apologies for multiple copies)
CALL FOR PAPERS: VeRoLog 2013
7-10 July 2013, University of Southampton, Southampton, UK
The second meeting of the EURO Working Group on Vehicle Routing and Logistics Optimization (VeRoLog) will take place at the University of Southampton, UK, from 7-10 July 2013. Researchers, practitioners and students are welcome to participate and present their research. Abstracts can be submitted through the website https://www.ocs.soton.ac.uk/index.php/verolog/verolog2013 either using the LaTeX or the Microsoft Word template (maximum length one page).
Important dates:
- Paper submission deadline: 25 February 2013
- Notification of paper acceptance: 1 April 2013
- Early registration deadline: 29 April 2013
- Conference: 7-10 July 2013
Anyone wanting to organize a stream or a session should contact Tolga Bektaş (t.bektas@soton.ac.uk).
Special issues:
Conference participants will be offered the opportunity to submit their papers for publication in special issues of the following journals:
- Computers & Operations Research
- Networks
Key-note speakers:
- Jean-Francois Cordeau (HEC, Montreal)
- Bruce Golden (University of Maryland)
- Maria Grazia Speranza (University of Brescia)
Organizers
VeRoLog 2013 is organized by CORMSIS (http://www.soton.ac.uk/cormsis), the University of Southampton's Centre for Operational Research, Management Science and Information Systems, with support provided by the LANCS Initiative (http://www.lancs-initiative.ac.uk). An international Program Committee is jointly chaired by Tolga Bektaş (University of Southampton, UK) and Daniele Vigo (University of Bologna, Italy).
Contacts
Website: https://www.ocs.soton.ac.uk/index.php/verolog/verolog2013
Email: verolog2013@soton.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/
*
**********************************************************
CALL FOR PAPERS: VeRoLog 2013
7-10 July 2013, University of Southampton, Southampton, UK
The second meeting of the EURO Working Group on Vehicle Routing and Logistics Optimization (VeRoLog) will take place at the University of Southampton, UK, from 7-10 July 2013. Researchers, practitioners and students are welcome to participate and present their research. Abstracts can be submitted through the website https://www.ocs.soton.ac.uk/index.php/verolog/verolog2013 either using the LaTeX or the Microsoft Word template (maximum length one page).
Important dates:
- Paper submission deadline: 25 February 2013
- Notification of paper acceptance: 1 April 2013
- Early registration deadline: 29 April 2013
- Conference: 7-10 July 2013
Anyone wanting to organize a stream or a session should contact Tolga Bektaş (t.bektas@soton.ac.uk).
Special issues:
Conference participants will be offered the opportunity to submit their papers for publication in special issues of the following journals:
- Computers & Operations Research
- Networks
Key-note speakers:
- Jean-Francois Cordeau (HEC, Montreal)
- Bruce Golden (University of Maryland)
- Maria Grazia Speranza (University of Brescia)
Organizers
VeRoLog 2013 is organized by CORMSIS (http://www.soton.ac.uk/cormsis), the University of Southampton's Centre for Operational Research, Management Science and Information Systems, with support provided by the LANCS Initiative (http://www.lancs-initiative.ac.uk). An international Program Committee is jointly chaired by Tolga Bektaş (University of Southampton, UK) and Daniele Vigo (University of Bologna, Italy).
Contacts
Website: https://www.ocs.soton.ac.uk/index.php/verolog/verolog2013
Email: verolog2013@soton.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/
*
**********************************************************
Tuesday, January 29, 2013
[DMANET] Two postdoc positions at Warwick
Dear colleagues,
we have two postdoc openings in the area of discrete mathematics
at the University of Warwick. The details follow. In order to be
considered for both positions one needs to apply for each of them
separately.
Best regards,
Dan Kral and Oleg Pikhurko
Research Fellow
Department of Mathematics
GBP 27,854 - 36,298 pa
Fixed term contract for 36 months
For a project funded by the Engineering and Physical Sciences Research Council (EPSRC), we are looking for a highly motivated post-doctoral researcher to work in extremal combinatorics under supervision of Oleg Pikhurko. While the main directions of the project will be asymptotic extremal problems for graphs and k-uniform hypergraphs (such as the Turan function and Ramsey numbers), previous experience in these areas is not required.
More importantly, we will be looking for the depth of your research and your proficiency in applying probabilistic, analytic, or algebraic methods to problems of discrete mathematics. In particular, a familiarity with regularity lemmas, graph limits, or flag algebras will be a strong asset.
The starting date for this position is between 1 October 2013 and 1 January 2014.
Candidates should send a CV and a list of publications (that includes a short annotation of at most three of their best papers) to Georgina Copeland (Georgina.Copeland@warwick.ac.uk). Candidates are also encouraged to send a research statement.
https://secure.admin.warwick.ac.uk/webjobs/jobs/research/job25125.html
Research Fellow
Department of Computer Science
GBP 27,854 - 36,298 pa
Fixed Term Contract until 30 November 2015
You will be expected to perform high quality research in algorithm design and extremal combinatorics under the supervision of Professor Daniel Kral within the framework of an ERC funded project "Classes of Combinatorial Objects: from Structure to Algorithms" (CCOSA).
You will possess a PhD or an equivalent qualification in Mathematics or Computer Science and have a strong background in one or more of the following areas: graph theory, extremal combinatorics, model theory and fixed parameter tractability. The post is based in Department of Computer Science but a close interaction with members of Warwick Mathematics Institute and members of the DIMAP centre is expected.
Please note that this post is available from 1 September 2013 until 30 November 2015, although the start date can be negotiated for the right candidate.
Candidates should provide with their application form a CV, a list of publications and a research statement.
https://secure.admin.warwick.ac.uk/webjobs/jobs/research/job28491.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/
*
**********************************************************
we have two postdoc openings in the area of discrete mathematics
at the University of Warwick. The details follow. In order to be
considered for both positions one needs to apply for each of them
separately.
Best regards,
Dan Kral and Oleg Pikhurko
Research Fellow
Department of Mathematics
GBP 27,854 - 36,298 pa
Fixed term contract for 36 months
For a project funded by the Engineering and Physical Sciences Research Council (EPSRC), we are looking for a highly motivated post-doctoral researcher to work in extremal combinatorics under supervision of Oleg Pikhurko. While the main directions of the project will be asymptotic extremal problems for graphs and k-uniform hypergraphs (such as the Turan function and Ramsey numbers), previous experience in these areas is not required.
More importantly, we will be looking for the depth of your research and your proficiency in applying probabilistic, analytic, or algebraic methods to problems of discrete mathematics. In particular, a familiarity with regularity lemmas, graph limits, or flag algebras will be a strong asset.
The starting date for this position is between 1 October 2013 and 1 January 2014.
Candidates should send a CV and a list of publications (that includes a short annotation of at most three of their best papers) to Georgina Copeland (Georgina.Copeland@warwick.ac.uk). Candidates are also encouraged to send a research statement.
https://secure.admin.warwick.ac.uk/webjobs/jobs/research/job25125.html
Research Fellow
Department of Computer Science
GBP 27,854 - 36,298 pa
Fixed Term Contract until 30 November 2015
You will be expected to perform high quality research in algorithm design and extremal combinatorics under the supervision of Professor Daniel Kral within the framework of an ERC funded project "Classes of Combinatorial Objects: from Structure to Algorithms" (CCOSA).
You will possess a PhD or an equivalent qualification in Mathematics or Computer Science and have a strong background in one or more of the following areas: graph theory, extremal combinatorics, model theory and fixed parameter tractability. The post is based in Department of Computer Science but a close interaction with members of Warwick Mathematics Institute and members of the DIMAP centre is expected.
Please note that this post is available from 1 September 2013 until 30 November 2015, although the start date can be negotiated for the right candidate.
Candidates should provide with their application form a CV, a list of publications and a research statement.
https://secure.admin.warwick.ac.uk/webjobs/jobs/research/job28491.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] NetSys 2013 - Early Registration Deadline Approaching
*** Please Apologies multiple copies ***
======================================================================
======================= CALL FOR PARTICIPATION =======================
======================================================================
International Conference on Networked Systems 2013 (NetSys 2013)
March 11-15, 2013. Stuttgart, Germany
http://www.netsys2013.de/
======================================================================
Registration is open now: www.netsys2013.de/registration.html
Early registration deadline: January 31st, 2013
======================================================================
ABOUT THE CONFERENCE
The Conference on Networked Systems (NetSys 2013) provides an
international forum for engineers and scientists in academia,
industry, and government to discuss innovations in the realm of
networked systems – including aspects of networking, distributed
systems, communications, middleware, and applications.
This biennial international conference is the successor of the
conference series Kommunikation in Verteilten Systemen (KiVS), which
was started more than 30 years ago and developed to the major
scientific event in German-speaking countries in the field of
communications and distributed systems.
Please note this event is sponsored by IEEE, GI, and ITG.
======================================================================
CONFERENCE HIGHLIGHTS
This year's conference highlights include an outstanding technical
program on recent advances in computer communications and networking
comprising:
* Keynote addresses by R. Fechner (Member of Board of Alcatel-Lucent
Deutschland AG, President Bell Labs Germany), A. Feldmann
(Professor, Deutsche Telekom Laboratories, TU Berlin), and
A. Rowstron (Principle Researcher, Microsoft Research Cambridge)
* 16 technical papers reporting original research on networking,
distributed systems middleware, security, and networked applications
* Industry track with 6 invited talks from well-known experts in the
field of cloud computing, network virtualization, and
virtualization of embedded systems
* Two half-day workshops and six half-day tutorials
* Communication software demonstrations
* Doctoral forum with poster sessions
======================================================================
CONFERENCE CHAIRS
* K. Rothermel, University of Stuttgart, Germany
* A. Kirstädter, University of Stuttgart, Germany
* J. Charzinski, HdM Stuttgart, Germany
* M. Matthiesen, University of Stuttgart, Germany
* C. Becker, University of Mannheim, Germany
* K. Wehrle, RWTH Aachen, Germany
======================================================================
Looking forward to seeing you in Stuttgart!
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
======================================================================
======================= CALL FOR PARTICIPATION =======================
======================================================================
International Conference on Networked Systems 2013 (NetSys 2013)
March 11-15, 2013. Stuttgart, Germany
http://www.netsys2013.de/
======================================================================
Registration is open now: www.netsys2013.de/registration.html
Early registration deadline: January 31st, 2013
======================================================================
ABOUT THE CONFERENCE
The Conference on Networked Systems (NetSys 2013) provides an
international forum for engineers and scientists in academia,
industry, and government to discuss innovations in the realm of
networked systems – including aspects of networking, distributed
systems, communications, middleware, and applications.
This biennial international conference is the successor of the
conference series Kommunikation in Verteilten Systemen (KiVS), which
was started more than 30 years ago and developed to the major
scientific event in German-speaking countries in the field of
communications and distributed systems.
Please note this event is sponsored by IEEE, GI, and ITG.
======================================================================
CONFERENCE HIGHLIGHTS
This year's conference highlights include an outstanding technical
program on recent advances in computer communications and networking
comprising:
* Keynote addresses by R. Fechner (Member of Board of Alcatel-Lucent
Deutschland AG, President Bell Labs Germany), A. Feldmann
(Professor, Deutsche Telekom Laboratories, TU Berlin), and
A. Rowstron (Principle Researcher, Microsoft Research Cambridge)
* 16 technical papers reporting original research on networking,
distributed systems middleware, security, and networked applications
* Industry track with 6 invited talks from well-known experts in the
field of cloud computing, network virtualization, and
virtualization of embedded systems
* Two half-day workshops and six half-day tutorials
* Communication software demonstrations
* Doctoral forum with poster sessions
======================================================================
CONFERENCE CHAIRS
* K. Rothermel, University of Stuttgart, Germany
* A. Kirstädter, University of Stuttgart, Germany
* J. Charzinski, HdM Stuttgart, Germany
* M. Matthiesen, University of Stuttgart, Germany
* C. Becker, University of Mannheim, Germany
* K. Wehrle, RWTH Aachen, Germany
======================================================================
Looking forward to seeing you in Stuttgart!
**********************************************************
*
* 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] GRAPHITE 2013: Call for Participation
GRAPHITE 2013
Second Workshop on GRAPH Inspection and Traversal Engineering
March 24, 2013, Rome, Italy
(affiliated with ETAPS 2013)
http://www.win.tue.nl/~awijs/graphite
Call for Participation
----------------------------
Objectives
---------------
The topic of the GRAPHITE workshop is graph analysis in all its forms in computer science.
Graphs are used to represent data in many application areas, and they are subjected to
various computational algorithms in order to acquire the desired information. These graph
algorithms tend to have common characteristics, such as duplicate detection to guarantee
their termination, independent of their application domain. Over the past few years, it has
been shown that the scalability of such algorithms can be dramatically improved by using,
e.g., external memory, by exploiting parallel architectures, such as clusters, multi-core
CPUs, and graphics processing units, and by using heuristics to guide the search. Novel
techniques to further scale graph search algorithms, and new applications of graph search
are within the scope of this workshop. Another topic of interest of the event is more
related to the structural properties of graphs: which kind of graph characteristics are
relevant for a particular application area, and how can these be measured? Finally, any
novel way of using graphs for a particular application area is on topic. The goal of this
event is to gather scientists from different communities, such as model checking, artificial
intelligence planning, game playing, and algorithm engineering, who do research on graph
search algorithms, such that awareness of each others' work is increased.
The workshop will be held as a satellite event of ETAPS 2013, the
16-th edition of The European Joint Conferences on Theory and Practice
of Software (ETAPS). ETAPS is a primary European forum for academic
and industrial researchers working on topics relating to Software Science.
Workshop Specific Topics
------------------------
* Algorithms for the verification of hardware and software based on graph exploration
(e.g. the computation of an explicit state space based on an implicit description)
* Application of graph based techniques originating in one application domain, applied on
a problem in another domain (e.g. verification algorithms on artificial intelligence problems)
* Techniques to deal with potentially infinite graphs and infinite families of graphs
* Innovative or otherwise particularly significant case studies of applications of graph based
methods
* Theoretical results on the limits and possibilities of graph based methods
* Parallel algorithms for graph exploration for distributed and shared memory systems (e.g.
clusters, multi-core CPUs, GPGPUs)
* Graph algorithms in artificial intelligence; planning; game playing; social network analysis;
biological network analysis, and similar
* Graph minimisation and abstraction techniques as a preprocessing step for analysis (e.g.
bisimulation reduction, transitive reduction)
* Computation on graphs through graph transformation techniques
* I/O Efficient graph algorithms using external memory
Invited speakers
-----------------------
Alberto Lluch-Lafuente (IMT Lucca, Italy)
Arend Rensink (University of Twente, The Netherlands)
Organization
------------------
Anton Wijs (Eindhoven University of Technology, Netherlands)
Dragan Bosnacki (Eindhoven University of Technology, Netherlands)
Stefan Edelkamp (University of Bremen, Germany)
Programme Committee
--------------------------------
Henri Bal (VU University Amsterdam, The Netherlands)
Dragan Bosnacki (Eindhoven University of Technology, The Netherlands) (co-chair)
Alastair Donaldson (Imperial College London, England)
Stefan Edelkamp (University of Bremen, Germany) (co-chair)
Ansgar Fehnker (The University of the South Pacific, Fiji)
Wan Fokkink (VU University Amsterdam, The Netherlands)
Keijo Heljanko (Aalto University, Finland)
Gerard Holzmann (NASA / Jet Propulsion Laboratory, USA)
Gunnar Klau (Centrum Wiskunde & Informatica, The Netherlands)
Juan de Lara (Universidad Autónoma de Madrid, Spain)
Stefan Leue (University of Konstanz, Germany)
Ulrich Meyer (Goethe University Frankfurt am Main, Germany)
Jun Pang (Université du Luxembourg, Luxembourg)
David Parker (University of Birmingham, England)
Arend Rensink (University of Twente, The Netherlands)
Anton Wijs (Eindhoven University of Technology, The Netherlands) (co-chair)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Second Workshop on GRAPH Inspection and Traversal Engineering
March 24, 2013, Rome, Italy
(affiliated with ETAPS 2013)
http://www.win.tue.nl/~awijs/graphite
Call for Participation
----------------------------
Objectives
---------------
The topic of the GRAPHITE workshop is graph analysis in all its forms in computer science.
Graphs are used to represent data in many application areas, and they are subjected to
various computational algorithms in order to acquire the desired information. These graph
algorithms tend to have common characteristics, such as duplicate detection to guarantee
their termination, independent of their application domain. Over the past few years, it has
been shown that the scalability of such algorithms can be dramatically improved by using,
e.g., external memory, by exploiting parallel architectures, such as clusters, multi-core
CPUs, and graphics processing units, and by using heuristics to guide the search. Novel
techniques to further scale graph search algorithms, and new applications of graph search
are within the scope of this workshop. Another topic of interest of the event is more
related to the structural properties of graphs: which kind of graph characteristics are
relevant for a particular application area, and how can these be measured? Finally, any
novel way of using graphs for a particular application area is on topic. The goal of this
event is to gather scientists from different communities, such as model checking, artificial
intelligence planning, game playing, and algorithm engineering, who do research on graph
search algorithms, such that awareness of each others' work is increased.
The workshop will be held as a satellite event of ETAPS 2013, the
16-th edition of The European Joint Conferences on Theory and Practice
of Software (ETAPS). ETAPS is a primary European forum for academic
and industrial researchers working on topics relating to Software Science.
Workshop Specific Topics
------------------------
* Algorithms for the verification of hardware and software based on graph exploration
(e.g. the computation of an explicit state space based on an implicit description)
* Application of graph based techniques originating in one application domain, applied on
a problem in another domain (e.g. verification algorithms on artificial intelligence problems)
* Techniques to deal with potentially infinite graphs and infinite families of graphs
* Innovative or otherwise particularly significant case studies of applications of graph based
methods
* Theoretical results on the limits and possibilities of graph based methods
* Parallel algorithms for graph exploration for distributed and shared memory systems (e.g.
clusters, multi-core CPUs, GPGPUs)
* Graph algorithms in artificial intelligence; planning; game playing; social network analysis;
biological network analysis, and similar
* Graph minimisation and abstraction techniques as a preprocessing step for analysis (e.g.
bisimulation reduction, transitive reduction)
* Computation on graphs through graph transformation techniques
* I/O Efficient graph algorithms using external memory
Invited speakers
-----------------------
Alberto Lluch-Lafuente (IMT Lucca, Italy)
Arend Rensink (University of Twente, The Netherlands)
Organization
------------------
Anton Wijs (Eindhoven University of Technology, Netherlands)
Dragan Bosnacki (Eindhoven University of Technology, Netherlands)
Stefan Edelkamp (University of Bremen, Germany)
Programme Committee
--------------------------------
Henri Bal (VU University Amsterdam, The Netherlands)
Dragan Bosnacki (Eindhoven University of Technology, The Netherlands) (co-chair)
Alastair Donaldson (Imperial College London, England)
Stefan Edelkamp (University of Bremen, Germany) (co-chair)
Ansgar Fehnker (The University of the South Pacific, Fiji)
Wan Fokkink (VU University Amsterdam, The Netherlands)
Keijo Heljanko (Aalto University, Finland)
Gerard Holzmann (NASA / Jet Propulsion Laboratory, USA)
Gunnar Klau (Centrum Wiskunde & Informatica, The Netherlands)
Juan de Lara (Universidad Autónoma de Madrid, Spain)
Stefan Leue (University of Konstanz, Germany)
Ulrich Meyer (Goethe University Frankfurt am Main, Germany)
Jun Pang (Université du Luxembourg, Luxembourg)
David Parker (University of Birmingham, England)
Arend Rensink (University of Twente, The Netherlands)
Anton Wijs (Eindhoven University of Technology, The Netherlands) (co-chair)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Monday, January 28, 2013
[DMANET] SEA 2013 - Final Call for Papers
--------------------------------------------------------------------
12th International Symposium on Experimental Algorithms
http://sea2013.dis.uniroma1.it
June 5-7, 2013
Rome, Italy
Final Call for Papers
Submission deadline: February 1st, 2013
--------------------------------------------------------------------
AIMS & SCOPE
SEA, previously known as WEA (Workshop on Experimental Algorithms),
is an international forum for researchers in the area of design,
analysis, and experimental evaluation and engineering of algorithms,
as well as in various aspects of computational optimization and
its applications. The preceding symposia were held in Riga, Monte
Verita, Rio de Janeiro, Santorini, Menorca Island, Rome, Cape Cod,
Dortmund, Ischia Island, Crete, and Bordeaux.
The main theme of the symposium is the role of experimentation and
of algorithm engineering techniques in the design and evaluation of
algorithms and data structures. Submissions should present
significant contributions supported by experimental evaluation,
methodological issues in the design and interpretation of
experiments, the use of (meta-)heuristics, or application-driven
case studies that deepen the understanding of a problem's
complexity.
Topics of interest include, but are not limited to:
- Algorithm Engineering
- Algorithmic Libraries
- Algorithmic Mechanism Design
- Analysis of Algorithms
- Algorithms for Memory Hierarchies
- Approximation Techniques
- Bioinformatics
- Branch and Bound Algorithms
- Combinatorial and Irregular Problems
- Combinatorial Structures and Graphs
- Communication Networks
- Complex Networks
- Computational Geometry
- Computational Learning Theory
- Computational Optimization
- Computer Systems
- Cryptography and Security
- Data Streams
- Data Structures
- Distributed and Parallel Algorithms
- Evaluation of Algorithms for Realistic Environments
- Experimental Techniques and Statistics
- Graph Drawing
- Heuristics for Combinatorial Optimization
- Implementation, Testing, Evaluation and Fine-tuning
- Information Retrieval
- Integer Programming
- Logistics and Operations Management
- Machine Learning and Data Mining
- Mathematical Programming
- Metaheuristic Methodologies
- Multiple Criteria Decision Making
- Network Analysis
- Novel Applications of Algorithms in Other Disciplines
- On-line Problems
- Parallel Algorithms and Computing
- Railway Optimization using Algorithmic Methods
- Randomized Techniques
- Robotics
- Semidefinite Programming
- Simulation
- Software Repositories and Platforms for using Algorithms
- Telecommunications and Networking
- World Wide Web Algorithms
PROGRAM COMMITTEE
Vincenzo Bonifaci (co-chair) (IASI-CNR, Rome, Italy)
Ulrik Brandes (U. Konstanz, Germany)
Daniel Delling (Microsoft Research, USA)
Giuseppe Di Battista (Roma Tre U., Italy)
Tobias Friedrich (U. Jena, Germany)
Ralf Klasing (CNRS & U. Bordeaux, France)
Arie Koster (RWTH Aachen U., Germany)
Pierre Leone (U. Geneva, Switzerland)
Leo Liberti (LIX, Ecole Polytechnique, France)
Andrea Lodi (U. Bologna, Italy)
Alberto Marchetti-Spaccamela (co-chair) (Sapienza U. Rome, Italy)
Nicole Megow (TU Berlin, Germany)
Frank Neumann (U. Adelaide, Australia)
Simon Puglisi (King's College London, UK)
Rajeev Raman (U. Leicester, UK)
Anita Schöbel (U. Goettingen, Germany)
Maria Serna (U. Politecnica de Catalunya, Spain)
Renato Werneck (Microsoft Research, USA)
Christos Zaroliagis (U. Patras & CTI, Greece)
Norbert Zeh (Dalhousie U., Canada)
PLENARY SPEAKERS
Andrew Goldberg (Microsoft Research, USA)
Roberto Grossi (U. Pisa, Italy)
Martin Skutella (TU Berlin, Germany)
SUBMISSIONS
Authors are invited to submit high-quality manuscripts reporting
original unpublished research and recent developments in the topics
related to the symposium. Simultaneous submission to other
conferences or workshops with published proceedings is not allowed.
Submissions must not exceed 12 pages formatted according to LNCS
style plus an optional, clearly marked appendix of reasonable
length (to be read at the program committee's discretion). All papers
will be peer reviewed and comments will be provided to the authors.
The submission system can be accessed via
http://sea2013.dis.uniroma1.it/.
PROCEEDINGS
Accepted papers will appear in the SEA 2013 proceedings published
by Springer in the LNCS series.
ORGANIZING COMMITTEE
Vincenzo Bonifaci (IASI-CNR, Rome, Italy)
Saverio Caminiti (Sapienza U. Rome, Italy)
Camil Demetrescu (chair) (Sapienza U. Rome, Italy)
Alberto Marchetti-Spaccamela (Sapienza U. Rome, Italy)
CONTACT
For further information, please send an e-mail to
sea2013@dis.uniroma1.it.
**********************************************************
*
* 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/
*
**********************************************************
12th International Symposium on Experimental Algorithms
http://sea2013.dis.uniroma1.it
June 5-7, 2013
Rome, Italy
Final Call for Papers
Submission deadline: February 1st, 2013
--------------------------------------------------------------------
AIMS & SCOPE
SEA, previously known as WEA (Workshop on Experimental Algorithms),
is an international forum for researchers in the area of design,
analysis, and experimental evaluation and engineering of algorithms,
as well as in various aspects of computational optimization and
its applications. The preceding symposia were held in Riga, Monte
Verita, Rio de Janeiro, Santorini, Menorca Island, Rome, Cape Cod,
Dortmund, Ischia Island, Crete, and Bordeaux.
The main theme of the symposium is the role of experimentation and
of algorithm engineering techniques in the design and evaluation of
algorithms and data structures. Submissions should present
significant contributions supported by experimental evaluation,
methodological issues in the design and interpretation of
experiments, the use of (meta-)heuristics, or application-driven
case studies that deepen the understanding of a problem's
complexity.
Topics of interest include, but are not limited to:
- Algorithm Engineering
- Algorithmic Libraries
- Algorithmic Mechanism Design
- Analysis of Algorithms
- Algorithms for Memory Hierarchies
- Approximation Techniques
- Bioinformatics
- Branch and Bound Algorithms
- Combinatorial and Irregular Problems
- Combinatorial Structures and Graphs
- Communication Networks
- Complex Networks
- Computational Geometry
- Computational Learning Theory
- Computational Optimization
- Computer Systems
- Cryptography and Security
- Data Streams
- Data Structures
- Distributed and Parallel Algorithms
- Evaluation of Algorithms for Realistic Environments
- Experimental Techniques and Statistics
- Graph Drawing
- Heuristics for Combinatorial Optimization
- Implementation, Testing, Evaluation and Fine-tuning
- Information Retrieval
- Integer Programming
- Logistics and Operations Management
- Machine Learning and Data Mining
- Mathematical Programming
- Metaheuristic Methodologies
- Multiple Criteria Decision Making
- Network Analysis
- Novel Applications of Algorithms in Other Disciplines
- On-line Problems
- Parallel Algorithms and Computing
- Railway Optimization using Algorithmic Methods
- Randomized Techniques
- Robotics
- Semidefinite Programming
- Simulation
- Software Repositories and Platforms for using Algorithms
- Telecommunications and Networking
- World Wide Web Algorithms
PROGRAM COMMITTEE
Vincenzo Bonifaci (co-chair) (IASI-CNR, Rome, Italy)
Ulrik Brandes (U. Konstanz, Germany)
Daniel Delling (Microsoft Research, USA)
Giuseppe Di Battista (Roma Tre U., Italy)
Tobias Friedrich (U. Jena, Germany)
Ralf Klasing (CNRS & U. Bordeaux, France)
Arie Koster (RWTH Aachen U., Germany)
Pierre Leone (U. Geneva, Switzerland)
Leo Liberti (LIX, Ecole Polytechnique, France)
Andrea Lodi (U. Bologna, Italy)
Alberto Marchetti-Spaccamela (co-chair) (Sapienza U. Rome, Italy)
Nicole Megow (TU Berlin, Germany)
Frank Neumann (U. Adelaide, Australia)
Simon Puglisi (King's College London, UK)
Rajeev Raman (U. Leicester, UK)
Anita Schöbel (U. Goettingen, Germany)
Maria Serna (U. Politecnica de Catalunya, Spain)
Renato Werneck (Microsoft Research, USA)
Christos Zaroliagis (U. Patras & CTI, Greece)
Norbert Zeh (Dalhousie U., Canada)
PLENARY SPEAKERS
Andrew Goldberg (Microsoft Research, USA)
Roberto Grossi (U. Pisa, Italy)
Martin Skutella (TU Berlin, Germany)
SUBMISSIONS
Authors are invited to submit high-quality manuscripts reporting
original unpublished research and recent developments in the topics
related to the symposium. Simultaneous submission to other
conferences or workshops with published proceedings is not allowed.
Submissions must not exceed 12 pages formatted according to LNCS
style plus an optional, clearly marked appendix of reasonable
length (to be read at the program committee's discretion). All papers
will be peer reviewed and comments will be provided to the authors.
The submission system can be accessed via
http://sea2013.dis.uniroma1.it/.
PROCEEDINGS
Accepted papers will appear in the SEA 2013 proceedings published
by Springer in the LNCS series.
ORGANIZING COMMITTEE
Vincenzo Bonifaci (IASI-CNR, Rome, Italy)
Saverio Caminiti (Sapienza U. Rome, Italy)
Camil Demetrescu (chair) (Sapienza U. Rome, Italy)
Alberto Marchetti-Spaccamela (Sapienza U. Rome, Italy)
CONTACT
For further information, please send an e-mail to
sea2013@dis.uniroma1.it.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] SSTiC 2013: 1st announcement
*********************************************************************
2013 INTERNATIONAL SUMMER SCHOOL ON TRENDS IN COMPUTING
SSTiC 2013
Tarragona, Spain
July 22-26, 2013
Organized by:
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
http://grammars.grlmc.com/SSTiC2013/
*********************************************************************
AIM:
SSTiC 2013 will be an open forum for the convergence of top class well recognized computer scientists and people at the beginning of their research career (typically PhD students) as well as consolidated researchers.
SSTiC 2013 will cover the whole spectrum of computer science by means of more than 70 six-hour courses dealing with hot topics at the frontiers of the field. By actively participating, lecturers and attendees will share the idea of scientific excellence as the main motto of their research work.
ADDRESSED TO:
Graduate students from around the world. There are no pre-requisites in terms of the academic degree the attendee must hold. However, since there will be several levels among the courses, in the description of some of them reference may be made to specific knowledge background.
SSTiC 2013 is appropriate also for people more advanced in their career who want to keep themselves updated on developments in the field.
Finally, senior researchers will find it fruitful to listen and discuss with people who are main references of the diverse branches of computing nowadays.
REGIME:
At least 8 parallel sessions will be held during the whole event. Participants will be able to freely choose the courses they will be willing to attend as well as to move from one to another.
VENUE:
Palau Firal i de Congressos de Tarragona
Arquitecte Rovira, 2
43001 Tarragona
http://www.palaucongrestgna.com
COURSES AND PROFESSORS:
Divyakant Agrawal (Santa Barbara) [intermediate] Scalable Data Management in Enterprise and Cloud Computing Infrastructures
Shun-ichi Amari (Riken) [introductory] Information Geometry and Its Applications
James Anderson (Chapel Hill) [intermediate] Scheduling and Synchronization in Real-Time Multicore Systems
Pierre Baldi (Irvine) [intermediate] Big Data Informatics Challenges and Opportunities in the Life Sciences
Yoshua Bengio (Montréal) [introductory/intermediate] Deep Learning of Representations
Stephen Brewster (Glasgow) [advanced] Multimodal Human-Computer Interaction
Bruno Buchberger (Linz) [introductory] Groebner Bases: An Algorithmic Method for Multivariate Polynomial Systems. Foundations and Applications
Rajkumar Buyya (Melbourne) [intermediate] Cloud Computing
Jan Camenisch (IBM Zurich) [intermediate] Cryptography for Privacy
John M. Carroll (Penn State) [introductory] Usability Engineering and Scenario-based Design
Jeffrey S. Chase (Duke) [intermediate] Trust Logic as an Enabler for Secure Federated Systems
Larry S. Davis (College Park) [intermediate] Video Analysis of Human Activities
Paul De Bra (Eindhoven) [intermediate] Adaptive Systems
Marco Dorigo (Brussels) [introductory] An Introduction to Swarm Intelligence and Swarm Robotics
Max J. Egenhofer (Maine) [introductory/intermediate] Qualitative Spatial Relations: Formalizations and Inferences
Matthias Felleisen (Northeastern) [introductory] Programming with Contracts
Richard M. Fujimoto (Georgia Tech) [introductory] Parallel and Distributed Simulation
David Garlan (Carnegie Mellon) [advanced] Software Architecture: Past, Present and Future
Mario Gerla (Los Angeles) [intermediate] Vehicle Cloud Computing
Georgios B. Giannakis (Minnesota) [advanced] Sparsity and Low Rank for Robust Data Analytics and Networking
Ralph Grishman (New York) [intermediate] Information Extraction from Natural Language
Mark Guzdial (Georgia Tech) [introductory] Computing Education Research: What We Know about Learning and Teaching Computer Science
Francisco Herrera (Granada) [intermediate] Imbalanced Classification: Current Approaches and Open Problems
Paul Hudak (Yale) [introductory] Euterpea: From Signals to Symphonies Using Haskell
Syed Ali Jafar (Irvine) [intermediate] Interference Alignment
Niraj K. Jha (Princeton) [intermediate] FinFET Circuit Design
George Karypis (Minnesota) [introductory] Introduction to Parallel Computing: Architectures, Algorithms, and Programming
Aggelos K. Katsaggelos (Northwestern) [intermediate/advanced] Sparsity-based Advances in Image Processing
Arie E. Kaufman (Stony Brook) [advanced] Advances in Visualization
Carl Kesselman (Southern California) [intermediate] Biomedical Informatics and Big Data
Hugo Krawczyk (IBM Research) [intermediate] An Introduction to the Design and Analysis of Authenticated Key Exchange Protocols
Pierre L'Ecuyer (Montréal) [intermediate] Quasi-Monte Carlo Methods in Simulation: Theory and Practice
Laks Lakshmanan (British Columbia) [intermediate/advanced] Information and Influence Spread in Social Networks
Wenke Lee (Georgia Tech) [introductory] DNS-based Monitoring of Malware Activities
Maurizio Lenzerini (Roma La Sapienza) [intermediate] Ontology-based Data Integration
Ming C. Lin (Chapel Hill) [introductory/intermediate] Physically-based Modeling and Simulation
Jane W.S. Liu (Academia Sinica) [intermediate] Critical Information and Communication Technologies for Disaster Preparedness and Response
Nadia Magnenat-Thalmann (Nanyang Tech) [introductory] Modelling and Animating Virtual Humans
Satoru Miyano (Tokyo) [intermediate] How to Hack Cancer Systems with Computational Methods
Aloysius K. Mok (Austin) [introductory/advanced] From Real-time Systems to Cyber-physical Systems
Daniel Mossé (Pittsburgh) [intermediate] Asymmetric Multicore Management
Hermann Ney (Aachen) [intermediate/advanced] Probabilistic Modelling for Natural Language Processing - with Applications to Speech Recognition, Handwriting Recognition and Machine Translation
David M. Nicol (Urbana) [intermediate] Cyber-security and Privacy in the Power Grid
Jeff Offutt (George Mason) [intermediate] Cutting Edge Research in Engineering of Web Applications
David Padua (Urbana) [intermediate] Data Parallel Programming
Bijan Parsia (Manchester) [introductory] The Semantic Web: Conceptual and Technical Foundations
Massoud Pedram (Southern California) [intermediate] Energy Efficient Architectures and Information Processing Systems
Jian Pei (Simon Fraser) [intermediate/advanced] Mining Uncertain and Probabilistic Data
Charles E. Perkins (FutureWei) [intermediate/advanced] Beyond 4G
Prabhakar Raghavan (Google) [introductory/intermediate] Web Search and Advertising
Sudhakar M. Reddy (Iowa) [introductory] Design for Test and Test of Digital VLSI Circuits
Gustavo Rossi (La Plata) [intermediate] Topics in Model Driven Web Engineering
Kaushik Roy (Purdue) [introductory/intermediate] Low-energy Computing
Yousef Saad (Minnesota) [intermediate] Projection Methods and Their Applications
Robert Sargent (Syracuse) [introductory] Validating Models
Douglas C. Schmidt (Vanderbilt) [intermediate] Patterns and Frameworks for Concurrent and Networked Software
Bart Selman (Cornell) [intermediate] Fast Large-scale Probabilistic and Logical Inference Methods
Mubarak Shah (Central Florida) [advanced] Visual Crowd Surveillance
Ron Shamir (Tel Aviv) [introductory] Revealing Structure in Disease Regulation and Networks
Micha Sharir (Tel Aviv) [introductory/intermediate] Geometric Arrangements and Incidences: Algorithms, Combinatorics, and Algebra
Satinder Singh (Ann Arbor) [introductory/advanced] Reinforcement Learning: On Machines Learning to Act from Experience
Elliot Soloway (Ann Arbor) [introductory] Primary & Secondary Educational Computing in the Age of Mobilism
Dawn Xiaodong Song (Berkeley) [advanced] Selected Topics in Computer Security
Daniel Thalmann (Nanyang Tech) [intermediate] Simulation of Individuals, Groups and Crowds and Their Interaction with the User
Mike Thelwall (Wolverhampton) [introductory] Sentiment Strength Detection for the Social Web
Julita Vassileva (Saskatchewan) [intermediate] Engaging Users in Social Computing Systems
Yao Wang (Polytechnic New York) [introductory/advanced] Video Compression: Fundamentals and Recent Development
Gio Wiederhold (Stanford) [introductory] Software Economics: How Do the Results of the Intellectual Efforts Enter the Global Market Place
Ian H. Witten (Waikato) [introductory] Data Mining Using Weka
Limsoon Wong (National Singapore) [introductory/intermediate] The Use of Context in Gene Expression and Proteomic Profile Analysis
Michael Wooldridge (Oxford) [introductory] Autonomous Agents and Multi-Agent Systems
Philip S. Yu (Illinois Chicago) [advanced] Mining Big Data
Yuanyuan Zhou (San Diego) [intermediate] Building Robust Software
Justin Zobel (Melbourne) [introductory/intermediate] Writing and Research Skills for Computer Scientists
REGISTRATION:
It has to be done on line at
http://grammars.grlmc.com/SSTiC2013/Registration.php
Since a large number of attendees are expected and the capacity of the venue is limited, registration requests will be processed on a first come first served basis. The registration period will be closed when the capacity of the venue will be complete.
FEES:
They are the same (a flat rate) for all people by the corresponding deadline. They give the right to attend all courses.
ACCOMMODATION:
Information about accommodation will be available on the website of the School.
CERTIFICATE:
Participants will be delivered a certificate of attendance.
IMPORTANT DATES:
Announcement of the programme: January 26, 2013
Six registration deadlines: February 26, March 26, April 26, May 26, June 26, July 26, 2013
QUESTIONS AND FURTHER INFORMATION:
Lilica Voicu:
florentinalilica.voicu@urv.cat
POSTAL ADDRESS:
SSTiC 2013
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain
Phone: +34-977-559543
Fax: +34-977-558386
ACKNOWLEDGEMENTS:
Ajuntament de Tarragona
Diputació de Tarragona
Universitat Rovira i Virgili
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
2013 INTERNATIONAL SUMMER SCHOOL ON TRENDS IN COMPUTING
SSTiC 2013
Tarragona, Spain
July 22-26, 2013
Organized by:
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
http://grammars.grlmc.com/SSTiC2013/
*********************************************************************
AIM:
SSTiC 2013 will be an open forum for the convergence of top class well recognized computer scientists and people at the beginning of their research career (typically PhD students) as well as consolidated researchers.
SSTiC 2013 will cover the whole spectrum of computer science by means of more than 70 six-hour courses dealing with hot topics at the frontiers of the field. By actively participating, lecturers and attendees will share the idea of scientific excellence as the main motto of their research work.
ADDRESSED TO:
Graduate students from around the world. There are no pre-requisites in terms of the academic degree the attendee must hold. However, since there will be several levels among the courses, in the description of some of them reference may be made to specific knowledge background.
SSTiC 2013 is appropriate also for people more advanced in their career who want to keep themselves updated on developments in the field.
Finally, senior researchers will find it fruitful to listen and discuss with people who are main references of the diverse branches of computing nowadays.
REGIME:
At least 8 parallel sessions will be held during the whole event. Participants will be able to freely choose the courses they will be willing to attend as well as to move from one to another.
VENUE:
Palau Firal i de Congressos de Tarragona
Arquitecte Rovira, 2
43001 Tarragona
http://www.palaucongrestgna.com
COURSES AND PROFESSORS:
Divyakant Agrawal (Santa Barbara) [intermediate] Scalable Data Management in Enterprise and Cloud Computing Infrastructures
Shun-ichi Amari (Riken) [introductory] Information Geometry and Its Applications
James Anderson (Chapel Hill) [intermediate] Scheduling and Synchronization in Real-Time Multicore Systems
Pierre Baldi (Irvine) [intermediate] Big Data Informatics Challenges and Opportunities in the Life Sciences
Yoshua Bengio (Montréal) [introductory/intermediate] Deep Learning of Representations
Stephen Brewster (Glasgow) [advanced] Multimodal Human-Computer Interaction
Bruno Buchberger (Linz) [introductory] Groebner Bases: An Algorithmic Method for Multivariate Polynomial Systems. Foundations and Applications
Rajkumar Buyya (Melbourne) [intermediate] Cloud Computing
Jan Camenisch (IBM Zurich) [intermediate] Cryptography for Privacy
John M. Carroll (Penn State) [introductory] Usability Engineering and Scenario-based Design
Jeffrey S. Chase (Duke) [intermediate] Trust Logic as an Enabler for Secure Federated Systems
Larry S. Davis (College Park) [intermediate] Video Analysis of Human Activities
Paul De Bra (Eindhoven) [intermediate] Adaptive Systems
Marco Dorigo (Brussels) [introductory] An Introduction to Swarm Intelligence and Swarm Robotics
Max J. Egenhofer (Maine) [introductory/intermediate] Qualitative Spatial Relations: Formalizations and Inferences
Matthias Felleisen (Northeastern) [introductory] Programming with Contracts
Richard M. Fujimoto (Georgia Tech) [introductory] Parallel and Distributed Simulation
David Garlan (Carnegie Mellon) [advanced] Software Architecture: Past, Present and Future
Mario Gerla (Los Angeles) [intermediate] Vehicle Cloud Computing
Georgios B. Giannakis (Minnesota) [advanced] Sparsity and Low Rank for Robust Data Analytics and Networking
Ralph Grishman (New York) [intermediate] Information Extraction from Natural Language
Mark Guzdial (Georgia Tech) [introductory] Computing Education Research: What We Know about Learning and Teaching Computer Science
Francisco Herrera (Granada) [intermediate] Imbalanced Classification: Current Approaches and Open Problems
Paul Hudak (Yale) [introductory] Euterpea: From Signals to Symphonies Using Haskell
Syed Ali Jafar (Irvine) [intermediate] Interference Alignment
Niraj K. Jha (Princeton) [intermediate] FinFET Circuit Design
George Karypis (Minnesota) [introductory] Introduction to Parallel Computing: Architectures, Algorithms, and Programming
Aggelos K. Katsaggelos (Northwestern) [intermediate/advanced] Sparsity-based Advances in Image Processing
Arie E. Kaufman (Stony Brook) [advanced] Advances in Visualization
Carl Kesselman (Southern California) [intermediate] Biomedical Informatics and Big Data
Hugo Krawczyk (IBM Research) [intermediate] An Introduction to the Design and Analysis of Authenticated Key Exchange Protocols
Pierre L'Ecuyer (Montréal) [intermediate] Quasi-Monte Carlo Methods in Simulation: Theory and Practice
Laks Lakshmanan (British Columbia) [intermediate/advanced] Information and Influence Spread in Social Networks
Wenke Lee (Georgia Tech) [introductory] DNS-based Monitoring of Malware Activities
Maurizio Lenzerini (Roma La Sapienza) [intermediate] Ontology-based Data Integration
Ming C. Lin (Chapel Hill) [introductory/intermediate] Physically-based Modeling and Simulation
Jane W.S. Liu (Academia Sinica) [intermediate] Critical Information and Communication Technologies for Disaster Preparedness and Response
Nadia Magnenat-Thalmann (Nanyang Tech) [introductory] Modelling and Animating Virtual Humans
Satoru Miyano (Tokyo) [intermediate] How to Hack Cancer Systems with Computational Methods
Aloysius K. Mok (Austin) [introductory/advanced] From Real-time Systems to Cyber-physical Systems
Daniel Mossé (Pittsburgh) [intermediate] Asymmetric Multicore Management
Hermann Ney (Aachen) [intermediate/advanced] Probabilistic Modelling for Natural Language Processing - with Applications to Speech Recognition, Handwriting Recognition and Machine Translation
David M. Nicol (Urbana) [intermediate] Cyber-security and Privacy in the Power Grid
Jeff Offutt (George Mason) [intermediate] Cutting Edge Research in Engineering of Web Applications
David Padua (Urbana) [intermediate] Data Parallel Programming
Bijan Parsia (Manchester) [introductory] The Semantic Web: Conceptual and Technical Foundations
Massoud Pedram (Southern California) [intermediate] Energy Efficient Architectures and Information Processing Systems
Jian Pei (Simon Fraser) [intermediate/advanced] Mining Uncertain and Probabilistic Data
Charles E. Perkins (FutureWei) [intermediate/advanced] Beyond 4G
Prabhakar Raghavan (Google) [introductory/intermediate] Web Search and Advertising
Sudhakar M. Reddy (Iowa) [introductory] Design for Test and Test of Digital VLSI Circuits
Gustavo Rossi (La Plata) [intermediate] Topics in Model Driven Web Engineering
Kaushik Roy (Purdue) [introductory/intermediate] Low-energy Computing
Yousef Saad (Minnesota) [intermediate] Projection Methods and Their Applications
Robert Sargent (Syracuse) [introductory] Validating Models
Douglas C. Schmidt (Vanderbilt) [intermediate] Patterns and Frameworks for Concurrent and Networked Software
Bart Selman (Cornell) [intermediate] Fast Large-scale Probabilistic and Logical Inference Methods
Mubarak Shah (Central Florida) [advanced] Visual Crowd Surveillance
Ron Shamir (Tel Aviv) [introductory] Revealing Structure in Disease Regulation and Networks
Micha Sharir (Tel Aviv) [introductory/intermediate] Geometric Arrangements and Incidences: Algorithms, Combinatorics, and Algebra
Satinder Singh (Ann Arbor) [introductory/advanced] Reinforcement Learning: On Machines Learning to Act from Experience
Elliot Soloway (Ann Arbor) [introductory] Primary & Secondary Educational Computing in the Age of Mobilism
Dawn Xiaodong Song (Berkeley) [advanced] Selected Topics in Computer Security
Daniel Thalmann (Nanyang Tech) [intermediate] Simulation of Individuals, Groups and Crowds and Their Interaction with the User
Mike Thelwall (Wolverhampton) [introductory] Sentiment Strength Detection for the Social Web
Julita Vassileva (Saskatchewan) [intermediate] Engaging Users in Social Computing Systems
Yao Wang (Polytechnic New York) [introductory/advanced] Video Compression: Fundamentals and Recent Development
Gio Wiederhold (Stanford) [introductory] Software Economics: How Do the Results of the Intellectual Efforts Enter the Global Market Place
Ian H. Witten (Waikato) [introductory] Data Mining Using Weka
Limsoon Wong (National Singapore) [introductory/intermediate] The Use of Context in Gene Expression and Proteomic Profile Analysis
Michael Wooldridge (Oxford) [introductory] Autonomous Agents and Multi-Agent Systems
Philip S. Yu (Illinois Chicago) [advanced] Mining Big Data
Yuanyuan Zhou (San Diego) [intermediate] Building Robust Software
Justin Zobel (Melbourne) [introductory/intermediate] Writing and Research Skills for Computer Scientists
REGISTRATION:
It has to be done on line at
http://grammars.grlmc.com/SSTiC2013/Registration.php
Since a large number of attendees are expected and the capacity of the venue is limited, registration requests will be processed on a first come first served basis. The registration period will be closed when the capacity of the venue will be complete.
FEES:
They are the same (a flat rate) for all people by the corresponding deadline. They give the right to attend all courses.
ACCOMMODATION:
Information about accommodation will be available on the website of the School.
CERTIFICATE:
Participants will be delivered a certificate of attendance.
IMPORTANT DATES:
Announcement of the programme: January 26, 2013
Six registration deadlines: February 26, March 26, April 26, May 26, June 26, July 26, 2013
QUESTIONS AND FURTHER INFORMATION:
Lilica Voicu:
florentinalilica.voicu@urv.cat
POSTAL ADDRESS:
SSTiC 2013
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain
Phone: +34-977-559543
Fax: +34-977-558386
ACKNOWLEDGEMENTS:
Ajuntament de Tarragona
Diputació de Tarragona
Universitat Rovira i Virgili
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Last Days: PATTERNS 2013 || May 27 - June 1, 2013 - Valencia, Spain
INVITATION:
=================
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results to PATTERNS 2013.
The submission deadline is extended to January 29, 2013.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org
=================
============== PATTERNS 2013 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
PATTERNS 2013, The Fifth International Conferences on Pervasive Patterns and Applications
May 27 - June 1, 2013 - Valencia, Spain
General page: http://www.iaria.org/conferences2013/PATTERNS13.html
Call for Papers: http://www.iaria.org/conferences2013/CfPPATTERNS13.html
- regular papers
- short papers (work in progress)
- posters
Submission page: http://www.iaria.org/conferences2013/SubmitPATTERNS13.html
Submission deadline: January 29, 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 conform with the Editorial rules: http://www.iaria.org/editorialrules.html
PATTERNS 2013 Topics (topics and submission details: see CfP on the site)
Basics on patterns
Design patterns; Pattern identification and extraction; Validate patterns; Patterns? accuracy; Incomplete patterns; Patterns and noise
Patterns at work
Pattern logics and algebras; Pattern recognition; Pattern matching; Pattern languages; Patterns languages/models pitfalls; Pattern specification/modeling; Pattern validation; Pattern composition; Pattern reuse; Testing in pattern-based designed systems; Manageability and maintenance of pattern-based designed systems
Ubiquity patterns
User mobility patterns; Social networking patterns; Content dependency patterns; Content accessing patterns; Behavioral autonomy patterns; Prediction patterns /behavioral, structure, environment/; Patterns of discovery
Software patterns
Software design patterns; Software reuse patterns; Software quality patterns; Software testing patterns; Software performance, security, and safety patterns; Software management patterns; Patterns for evolving software elements
Security patterns
Security patterns; Patterns of trust; Attack patterns; Authorization patterns; Failed access patterns; Intrusion attempt patterns; Local malware patterns; Distributed malware patterns; Predictive patterns; Mobility patterns; Tracking patterns
System management patterns
Management and control patterns; Monitoring patterns; Correlation patterns; Event patterns; Visualization patterns
Discovery and decision patterns
Search patterns; Data mining for patterns; Query patterns; Knowledge patterns; Behavioral patterns; Reasoning patterns; Decision patterns; Patterns in WWW; Predictive patterns; Mobility patterns; Tracking patterns
Communications patterns
Communication patterns; Propagation patterns; Traffic/routing patterns; P2P and P4P patterns; Configuration change patterns; System abnormal behavior patterns
Domain-oriented patterns
Forensic patterns; Genomic patterns; Image patterns; Voice patterns; Speech patterns; Hand writing patterns; Text-embedded sentiment patterns; Emotion recognition patterns; Site access patterns; Service orchestration; Keyboard typing patterns; Financial/stock patterns; Shopping patterns; Dietary patterns; Global warming patterns; Job market patterns; Stock movement patterns; Investing patterns
Antipatterns and lessons learned
Architectural; Design; Development; People and project management; Social
--------------------------------
Committee: http://www.iaria.org/conferences2013/ComPATTERNS13.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 PATTERNS 2013.
The submission deadline is extended to January 29, 2013.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org
=================
============== PATTERNS 2013 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
PATTERNS 2013, The Fifth International Conferences on Pervasive Patterns and Applications
May 27 - June 1, 2013 - Valencia, Spain
General page: http://www.iaria.org/conferences2013/PATTERNS13.html
Call for Papers: http://www.iaria.org/conferences2013/CfPPATTERNS13.html
- regular papers
- short papers (work in progress)
- posters
Submission page: http://www.iaria.org/conferences2013/SubmitPATTERNS13.html
Submission deadline: January 29, 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 conform with the Editorial rules: http://www.iaria.org/editorialrules.html
PATTERNS 2013 Topics (topics and submission details: see CfP on the site)
Basics on patterns
Design patterns; Pattern identification and extraction; Validate patterns; Patterns? accuracy; Incomplete patterns; Patterns and noise
Patterns at work
Pattern logics and algebras; Pattern recognition; Pattern matching; Pattern languages; Patterns languages/models pitfalls; Pattern specification/modeling; Pattern validation; Pattern composition; Pattern reuse; Testing in pattern-based designed systems; Manageability and maintenance of pattern-based designed systems
Ubiquity patterns
User mobility patterns; Social networking patterns; Content dependency patterns; Content accessing patterns; Behavioral autonomy patterns; Prediction patterns /behavioral, structure, environment/; Patterns of discovery
Software patterns
Software design patterns; Software reuse patterns; Software quality patterns; Software testing patterns; Software performance, security, and safety patterns; Software management patterns; Patterns for evolving software elements
Security patterns
Security patterns; Patterns of trust; Attack patterns; Authorization patterns; Failed access patterns; Intrusion attempt patterns; Local malware patterns; Distributed malware patterns; Predictive patterns; Mobility patterns; Tracking patterns
System management patterns
Management and control patterns; Monitoring patterns; Correlation patterns; Event patterns; Visualization patterns
Discovery and decision patterns
Search patterns; Data mining for patterns; Query patterns; Knowledge patterns; Behavioral patterns; Reasoning patterns; Decision patterns; Patterns in WWW; Predictive patterns; Mobility patterns; Tracking patterns
Communications patterns
Communication patterns; Propagation patterns; Traffic/routing patterns; P2P and P4P patterns; Configuration change patterns; System abnormal behavior patterns
Domain-oriented patterns
Forensic patterns; Genomic patterns; Image patterns; Voice patterns; Speech patterns; Hand writing patterns; Text-embedded sentiment patterns; Emotion recognition patterns; Site access patterns; Service orchestration; Keyboard typing patterns; Financial/stock patterns; Shopping patterns; Dietary patterns; Global warming patterns; Job market patterns; Stock movement patterns; Investing patterns
Antipatterns and lessons learned
Architectural; Design; Development; People and project management; Social
--------------------------------
Committee: http://www.iaria.org/conferences2013/ComPATTERNS13.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] PostDoc in Approximation Algorithms at IDSIA, University of Lugano, Switzerland
The Algorithms and Complexity Group of IDSIA, University of Lugano
(Switzerland), opens one PostDoc position in approximation algorithms,
with a special focus on network design and pricing problems. The
position is supported by the European Research Council Starting Grant
"New Approaches to Network Design".
The appointment is for 2 years, with the possibility of an extension
by 2 years. The starting date will be agreed with the successful
candidate. The salary is roughly 75.000 CHF per year (taxes ~20-25%).
There are no teaching duties and there is a (very) generous travel
support.
An ideal candidate should have (or be close to obtaining) a PhD in
Computer Science or in a related area, and should have a strong
publication record in top Theoretical Computer Science conferences
such as STOC, FOCS, SODA, ICALP, ESA etc.
Further details about the position can be found at:
www.idsia.ch/~grandoni/ERC2010.html
Applicants should email a detailed CV, including a list of
publications and the email addresses of 3 references, to:
Prof. Fabrizio Grandoni
fabrizio@idsia.ch
The deadline for the application (with moderate flexibility) is
February 28th, 2013. For any question, do not hesitate to contact
Prof. Grandoni.
**********************************************************
*
* 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/
*
**********************************************************
(Switzerland), opens one PostDoc position in approximation algorithms,
with a special focus on network design and pricing problems. The
position is supported by the European Research Council Starting Grant
"New Approaches to Network Design".
The appointment is for 2 years, with the possibility of an extension
by 2 years. The starting date will be agreed with the successful
candidate. The salary is roughly 75.000 CHF per year (taxes ~20-25%).
There are no teaching duties and there is a (very) generous travel
support.
An ideal candidate should have (or be close to obtaining) a PhD in
Computer Science or in a related area, and should have a strong
publication record in top Theoretical Computer Science conferences
such as STOC, FOCS, SODA, ICALP, ESA etc.
Further details about the position can be found at:
www.idsia.ch/~grandoni/ERC2010.html
Applicants should email a detailed CV, including a list of
publications and the email addresses of 3 references, to:
Prof. Fabrizio Grandoni
fabrizio@idsia.ch
The deadline for the application (with moderate flexibility) is
February 28th, 2013. For any question, do not hesitate to contact
Prof. Grandoni.
**********************************************************
*
* 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] ACM MobiCom 2013_ Call for Workshop Proposals, Papers, Demos, Posters, & Panels
Apologies for multiple posting.
=============================================================================
MobiCom 2013 -- The 19th Annual International Conference on Mobile Computing and Networking
September 30-October 4, 2013
Hyatt Regency Miami
Miami, Florida
http://www.sigmobile.org/mobicom/2013/
=============================================================================
Earliest Deadline: March 1, 2013
|| Call FOR WORKSHOP PROPOSALS || Call for Papers || Call for Demos || Call for Posters & SRC ||
=============================================================================
MobiCom 2013, the premier International Conference on Mobile Computing and Networking, is the nineteenth in a series of annual conferences sponsored by ACM SIGMOBILE dedicated to addressing the challenges in the areas of mobile computing and wireless and mobile networking. The MobiCom conference series serves as a highly selective, premier international forum addressing networks, systems, algorithms, and applications that support mobile computers and wireless networks.
In addition to the regular conference program, MobiCom 2013 will include a set of pre- and post-conference workshops, keynotes and panels. Also, two parallel programs will be included for research/technology demos and posters (including the ACM Student Research Competition). Students travel grants will be provided on competitive bases.
New in MobiCom 2013 will be:
- Mobile App Competition (details of the competition will be published shortly)
- Invited industry presentations in the regular conference program
- On site conference interaction smart space
The venue for MobiCom 2013 will be the Hyatt Regency Miami. A special hotel rate of $129 plus taxes has been negotiated (single or double including in-room wireless internet). The hotel is centrally located which will allow for easy access to a multitude of upscale restaurants, stores, leisure activities, and Miami attractions. Additionally, the hotel overlooks Biscayne Bay providing effortless access to everything from Brickell and Coral Gables to Coconut Grove and world-famous white sand beaches.
Important Dates:
Workshop proposals due:
March 1, 2013
Abstracts submission due:
March 8, 2013
Paper submissions due:
March 15, 2013
Poster/SRC submissions due:
July 1, 2013
Demo/exhibit submissions due:
July 3, 2013
Organizing Committee
For sponsorship requests or other inquiries, contact the conference chair at mobicom_info@acm.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/
*
**********************************************************
=============================================================================
MobiCom 2013 -- The 19th Annual International Conference on Mobile Computing and Networking
September 30-October 4, 2013
Hyatt Regency Miami
Miami, Florida
http://www.sigmobile.org/mobicom/2013/
=============================================================================
Earliest Deadline: March 1, 2013
|| Call FOR WORKSHOP PROPOSALS || Call for Papers || Call for Demos || Call for Posters & SRC ||
=============================================================================
MobiCom 2013, the premier International Conference on Mobile Computing and Networking, is the nineteenth in a series of annual conferences sponsored by ACM SIGMOBILE dedicated to addressing the challenges in the areas of mobile computing and wireless and mobile networking. The MobiCom conference series serves as a highly selective, premier international forum addressing networks, systems, algorithms, and applications that support mobile computers and wireless networks.
In addition to the regular conference program, MobiCom 2013 will include a set of pre- and post-conference workshops, keynotes and panels. Also, two parallel programs will be included for research/technology demos and posters (including the ACM Student Research Competition). Students travel grants will be provided on competitive bases.
New in MobiCom 2013 will be:
- Mobile App Competition (details of the competition will be published shortly)
- Invited industry presentations in the regular conference program
- On site conference interaction smart space
The venue for MobiCom 2013 will be the Hyatt Regency Miami. A special hotel rate of $129 plus taxes has been negotiated (single or double including in-room wireless internet). The hotel is centrally located which will allow for easy access to a multitude of upscale restaurants, stores, leisure activities, and Miami attractions. Additionally, the hotel overlooks Biscayne Bay providing effortless access to everything from Brickell and Coral Gables to Coconut Grove and world-famous white sand beaches.
Important Dates:
Workshop proposals due:
March 1, 2013
Abstracts submission due:
March 8, 2013
Paper submissions due:
March 15, 2013
Poster/SRC submissions due:
July 1, 2013
Demo/exhibit submissions due:
July 3, 2013
Organizing Committee
For sponsorship requests or other inquiries, contact the conference chair at mobicom_info@acm.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/
*
**********************************************************
Sunday, January 27, 2013
[DMANET] MAPSP 2013: Extended Deadline (Feb 8) and Final Call for Papers
Due to several requests, the MAPSP deadline has been extended by one
week to Feb 8, 2013.
We apologise for the multiples postings.
The final call appears below.
Best Regards,
Nikhil Bansal
Liliana Cucu-Grosjean
-----------------------------------------------------------------
===================
Call for Papers
===================
MAPSP 2013
Eleventh Workshop on Models and Algorithms for Planning
and Scheduling Problems
June 23-28, 2013
Pont a Mousson, France
http://mapsp2013.loria.fr
liliana.cucu@inria.fr
------------------------------------------------------------------------
MAPSP is a biennial workshop dedicated to all theoretical and practical
aspects of scheduling, planning, and timetabling. Previous MAPSP meetings
have been held in Menaggio, Italy (1993), Wernigerode, Germany (1995),
Cambridge, UK (1997), Renesse, Netherlands (1999), Aussois, France (2001),
Aussois, France (2003), Siena, Italy (2005), Istanbul, Turkey (2007),
Kerkrade, Netherlands (2009), Nymbruk, Czech Repulic (2011).
----------------------------------------------------
Submissions:
MAPSP submissions undergo a selection process based on a light refereeing
by the PC. MAPSP does not publish proceedings other than a conference booklet.
Hence, presenting your paper at MAPSP will not prevent you from submitting
it to journals or to other conferences. Similarly, it is acceptable to submit
a paper that was presented at an earlier conference.
Abstracts of 2-3 pages must be submitted according to the guidelines
at http://mapsp2013.loria.fr . Most talks will have 20 minutes.
Some submissions will be selected for 30 minute plenary talks.
Submission Link: https://www.easychair.org/conferences/?conf=mapsp2013
---------------------------------------------------
Important dates:
Extended Deadline February 8, 2013
Notification March 8, 2013
Early registration April 5, 2013
Conference June 23-28, 2013
---------------------------------------------------
Invited speakers:
Anupam Gupta (Carnegie Mellon University, Pittsburgh)
Magnus M. Halldorsson (Reykjavik Univeristy, Reykjavik)
Ola Svensson (EPFL, Lausanne)
------------------------------------------
The program committee:
Nikhil Bansal (TU Eindhoven, Eindhoven, chair)
Vincenzo Bonifaci (IASI-CNR, Rome)
Niv Buchbinder (Tel-Aviv University, Tel-Aviv)
Jose Correa (Universidad de Chile, Santiago)
Liliana Cucu-Grosjean (INRIA, co-chair)
Amit Kumar (IIT Delhi, New Delhi)
Asaf Levin (Technion, Haifa)
Viswanath Nagarajan (IBM Research, Yorktown Heights)
Britta Peis (TU Berlin, Berlin)
Thomas Rothvoss (MIT, Cambridge)
Rene Sitters (Vrije Universiteit, Amsterdam)
Rob van Stee (MPI, Saarbruecken)
Andreas Wiese (MPI, Saarbruecken)
-------------------------------------------------------
The organizing committee:
Anne-Lise Charbonnier
Adriana Gogonel
Dorin Maxim
Cristian Maxim
Liliana Cucu-Grosjean (chair)
------------------------------------------
Detailed workshop information is available at http://mapsp2013.loria.fr
------------------------------------------
**********************************************************
*
* 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/
*
**********************************************************
week to Feb 8, 2013.
We apologise for the multiples postings.
The final call appears below.
Best Regards,
Nikhil Bansal
Liliana Cucu-Grosjean
-----------------------------------------------------------------
===================
Call for Papers
===================
MAPSP 2013
Eleventh Workshop on Models and Algorithms for Planning
and Scheduling Problems
June 23-28, 2013
Pont a Mousson, France
http://mapsp2013.loria.fr
liliana.cucu@inria.fr
------------------------------------------------------------------------
MAPSP is a biennial workshop dedicated to all theoretical and practical
aspects of scheduling, planning, and timetabling. Previous MAPSP meetings
have been held in Menaggio, Italy (1993), Wernigerode, Germany (1995),
Cambridge, UK (1997), Renesse, Netherlands (1999), Aussois, France (2001),
Aussois, France (2003), Siena, Italy (2005), Istanbul, Turkey (2007),
Kerkrade, Netherlands (2009), Nymbruk, Czech Repulic (2011).
----------------------------------------------------
Submissions:
MAPSP submissions undergo a selection process based on a light refereeing
by the PC. MAPSP does not publish proceedings other than a conference booklet.
Hence, presenting your paper at MAPSP will not prevent you from submitting
it to journals or to other conferences. Similarly, it is acceptable to submit
a paper that was presented at an earlier conference.
Abstracts of 2-3 pages must be submitted according to the guidelines
at http://mapsp2013.loria.fr . Most talks will have 20 minutes.
Some submissions will be selected for 30 minute plenary talks.
Submission Link: https://www.easychair.org/conferences/?conf=mapsp2013
---------------------------------------------------
Important dates:
Extended Deadline February 8, 2013
Notification March 8, 2013
Early registration April 5, 2013
Conference June 23-28, 2013
---------------------------------------------------
Invited speakers:
Anupam Gupta (Carnegie Mellon University, Pittsburgh)
Magnus M. Halldorsson (Reykjavik Univeristy, Reykjavik)
Ola Svensson (EPFL, Lausanne)
------------------------------------------
The program committee:
Nikhil Bansal (TU Eindhoven, Eindhoven, chair)
Vincenzo Bonifaci (IASI-CNR, Rome)
Niv Buchbinder (Tel-Aviv University, Tel-Aviv)
Jose Correa (Universidad de Chile, Santiago)
Liliana Cucu-Grosjean (INRIA, co-chair)
Amit Kumar (IIT Delhi, New Delhi)
Asaf Levin (Technion, Haifa)
Viswanath Nagarajan (IBM Research, Yorktown Heights)
Britta Peis (TU Berlin, Berlin)
Thomas Rothvoss (MIT, Cambridge)
Rene Sitters (Vrije Universiteit, Amsterdam)
Rob van Stee (MPI, Saarbruecken)
Andreas Wiese (MPI, Saarbruecken)
-------------------------------------------------------
The organizing committee:
Anne-Lise Charbonnier
Adriana Gogonel
Dorin Maxim
Cristian Maxim
Liliana Cucu-Grosjean (chair)
------------------------------------------
Detailed workshop information is available at http://mapsp2013.loria.fr
------------------------------------------
**********************************************************
*
* 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/
*
**********************************************************
SSTiC 2013: 1st announcement
*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject*
*********************************************************************
2013 INTERNATIONAL SUMMER SCHOOL ON
TRENDS IN COMPUTING
SSTiC 2013
July 22-26, 2013
Organized by:
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
http://grammars.grlmc.com/SSTiC2013/
*********************************************************************
AIM:
SSTiC 2013 will be an open forum for the convergence of top class well recognized computer scientists and people at the beginning of their research career (typically PhD students) as well as consolidated researchers.
SSTiC 2013 will cover the whole spectrum of computer science by means of more than 70 six-hour courses dealing with hot topics at the frontiers of the field. By actively participating, lecturers and attendees will share the idea of scientific excellence as the main motto of their research work.
ADDRESSED TO:
Graduate students from around the world. There are no pre-requisites in terms of the academic degree the attendee must hold. However, since there will be several levels among the courses, in the description of some of them reference may be made to specific knowledge background.
SSTiC 2013 is appropriate also for people more advanced in their career who want to keep themselves updated on developments in the field.
Finally, senior researchers will find it fruitful to listen and discuss with people who are main references of the diverse branches of computing nowadays.
REGIME:
At least 8 parallel sessions will be held during the whole event. Participants will be able to freely choose the courses they will be willing to attend as well as to move from one to another.
VENUE:
Palau Firal i de Congressos de Tarragona
Arquitecte Rovira, 2
43001
http://www.palaucongrestgna.com
COURSES AND PROFESSORS:
Divyakant Agrawal (
Shun-ichi Amari (Riken) [introductory] Information Geometry and Its Applications
James Anderson (
Pierre Baldi (
Yoshua Bengio (Montréal) [introductory/intermediate] Deep Learning of Representations
Stephen Brewster (
Bruno Buchberger (
Rajkumar Buyya (
Jan Camenisch (IBM Zurich) [intermediate] Cryptography for Privacy
John M. Carroll (Penn State) [introductory] Usability Engineering and Scenario-based Design
Jeffrey S. Chase (Duke) [intermediate] Trust Logic as an Enabler for Secure Federated Systems
Larry S. Davis (
Paul De Bra (
Marco Dorigo (
Max J. Egenhofer (
Matthias Felleisen (Northeastern) [introductory] Programming with Contracts
Richard M. Fujimoto (Georgia Tech) [introductory] Parallel and Distributed Simulation
David Garlan (Carnegie Mellon) [advanced] Software Architecture: Past, Present and Future
Mario Gerla (
Georgios B. Giannakis (
Ralph Grishman (
Mark Guzdial (Georgia Tech) [introductory] Computing Education Research: What We Know about Learning and Teaching Computer Science
Francisco Herrera (
Paul Hudak (Yale) [introductory] Euterpea: From Signals to Symphonies Using Haskell
Syed Ali Jafar (
Niraj K. Jha (
George Karypis (
Aggelos K. Katsaggelos (Northwestern) [intermediate/advanced] Sparsity-based Advances in Image Processing
Arie E. Kaufman (Stony Brook) [advanced] Advances in Visualization
Carl Kesselman (
Hugo Krawczyk (IBM Research) [intermediate] An Introduction to the Design and Analysis of Authenticated Key Exchange Protocols
Pierre L'Ecuyer (Montréal) [intermediate] Quasi-Monte Carlo Methods in Simulation: Theory and Practice
Laks Lakshmanan (
Wenke Lee (Georgia Tech) [introductory] DNS-based Monitoring of Malware Activities
Maurizio Lenzerini (Roma La Sapienza) [intermediate] Ontology-based Data Integration
Ming C. Lin (
Jane W.S. Liu (Academia Sinica) [intermediate] Critical Information and Communication Technologies for Disaster Preparedness and Response
Nadia Magnenat-Thalmann (Nanyang Tech) [introductory] Modelling and Animating Virtual Humans
Satoru Miyano (
Aloysius K. Mok (
Daniel Mossé (
Hermann Ney (Aachen) [intermediate/advanced] Probabilistic Modelling for Natural Language Processing - with Applications to Speech Recognition, Handwriting Recognition and Machine Translation
David M. Nicol (
Jeff Offutt (George Mason) [intermediate] Cutting Edge Research in Engineering of Web Applications
David Padua (
Bijan Parsia (
Massoud Pedram (
Charles E. Perkins (FutureWei) [intermediate/advanced] Beyond 4G
Prabhakar Raghavan (Google) [introductory/intermediate] Web Search and Advertising
Sudhakar M. Reddy (
Gustavo Rossi (
Kaushik Roy (Purdue) [introductory/intermediate] Low-energy Computing
Yousef Saad (
Robert Sargent (
Douglas C. Schmidt (Vanderbilt) [intermediate] Patterns and Frameworks for Concurrent and Networked Software
Bart Selman (Cornell) [intermediate] Fast Large-scale Probabilistic and Logical Inference Methods
Mubarak Shah (Central Florida) [advanced] Visual Crowd Surveillance
Ron Shamir (Tel Aviv) [introductory] Revealing Structure in Disease Regulation and Networks
Micha Sharir (Tel Aviv) [introductory/intermediate] Geometric Arrangements and Incidences: Algorithms, Combinatorics, and Algebra
Satinder Singh (
Elliot Soloway (
Dawn Xiaodong Song (
Daniel Thalmann (Nanyang Tech) [intermediate] Simulation of Individuals, Groups and Crowds and Their Interaction with the User
Mike Thelwall (
Julita Vassileva (
Gio Wiederhold (Stanford) [introductory] Software Economics: How Do the Results of the Intellectual Efforts Enter the
Ian H. Witten (
Limsoon Wong (National Singapore) [introductory/intermediate] The Use of Context in Gene Expression and Proteomic Profile Analysis
Michael Wooldridge (
Philip S. Yu (Illinois Chicago) [advanced] Mining Big Data
Yuanyuan Zhou (
Justin Zobel (Melbourne) [introductory/intermediate] Writing and Research Skills for Computer Scientists
REGISTRATION:
It has to be done on line at
http://grammars.grlmc.com/SSTiC2013/Registration.php
Since a large number of attendees are expected and the capacity of the venue is limited, registration requests will be processed on a first come first served basis. The registration period will be closed when the capacity of the venue will be complete.
FEES:
They are the same (a flat rate) for all people by the corresponding deadline. They give the right to attend all courses.
ACCOMMODATION:
Information about accommodation will be available on the website of the School.
CERTIFICATE:
Participants will be delivered a certificate of attendance.
IMPORTANT DATES:
Announcement of the programme: January 26, 2013
Six registration deadlines: February 26, March 26, April 26, May 26, June 26, July 26, 2013
QUESTIONS AND FURTHER INFORMATION:
Lilica Voicu:
florentinalilica.voicu@urv.cat
POSTAL ADDRESS:
SSTiC 2013
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
Av. Catalunya, 35
43002
Phone: +34-977-559543
Fax: +34-977-558386
ACKNOWLEDGEMENTS:
Ajuntament de Tarragona
Diputació de Tarragona
Universitat Rovira i Virgili
Subscribe to:
Posts (Atom)
Posts
