Send dmanet mailing list submissions to
dmanet@zpr.uni-koeln.de
To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de
You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de
When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."
Today's Topics:
1. SSTiC 2014: May 10, 6th registration deadline (GRLMC)
2. Associate professorship in algorithms at ITU Copenhagen
(Rasmus Pagh)
3. School on Parameterized Algorithms and Complexity
(application deadline approaching) (Marcin Pilipczuk)
4. YR-ICALP 2014: Deadline extended to May 4th
(Troels Bjerre S?rensen)
5. Ph.D. Position in Information Security at the University of
Luxembourg (Barbara KORDY)
6. SPAA 2014 - Call for Participation (Jeremy Fineman)
7. ECAI-14 Workshop and Tutorial on Metalearning & Algorithm
Selection (Pavel Brazdil)
----------------------------------------------------------------------
Message: 1
Date: Mon, 28 Apr 2014 11:55:02 +0200
From: "GRLMC" <grlmc@urv.cat>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] SSTiC 2014: May 10, 6th registration deadline
Message-ID: <EB0FC10A0F65414C963686F8FCD7AAD6@Carlos1>
Content-Type: text/plain; charset="iso-8859-1"
*********************************************************************
2014 TARRAGONA INTERNATIONAL SUMMER SCHOOL ON TRENDS IN COMPUTING
SSTiC 2014
Tarragona, Spain
July 7-11, 2014
Organized by
Rovira i Virgili University
http://grammars.grlmc.com/sstic2014/
*********************************************************************
--- May 10, 6th registration deadline ---
*********************************************************************
AIM:
SSTiC 2014 is the second edition in a series started in 2013. For the
previous event, see http://grammars.grlmc.com/SSTiC2013/
SSTiC 2014 will be a research training event mainly addressed to PhD
students and PhD holders in the first steps of their academic career. It
intends to update them about the most recent developments in the diverse
branches of computer science and its neighbouring areas. To that purpose,
renowned scholars will lecture and will be available for interaction with
the audience.
SSTiC 2014 will cover the whole spectrum of computer science through 6
keynote lectures and 23 six-hour courses dealing with some of the most
lively topics in the field. The organizers share the idea that outstanding
speakers will really attract the brightest students.
ADDRESSED TO:
Graduate students from around the world. There are no formal pre-requisites
in terms of the academic degree the attendee must hold. However, since there
will be several levels among the courses, reference may be made to specific
knowledge background in the description of some of them.
SSTiC 2014 is also appropriate for more senior people who want to keep
themselves updated on developments in their own field or in other branches
of computer science. They will surely find it fruitful to listen and discuss
with scholars who are main references in computing nowadays.
REGIME:
In addition to keynotes, 3 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:
SSTiC 2014 will take place in Tarragona, located 90 kms. to the south of
Barcelona. The venue will be:
Campus Catalunya
Universitat Rovira i Virgili
Av. Catalunya, 35
43002 Tarragona
KEYNOTE SPEAKERS:
Larry S. Davis (U Maryland, College Park), A Historical Perspective of
Computer Vision Models for Object Recognition and Scene Analysis
David S. Johnson (Columbia U, New York), Open and Closed Problems in
NP-Completeness
George Karypis (U Minnesota, Twin Cities), Top-N Recommender Systems:
Revisiting Item Neighborhood Methods
Steffen Staab (U Koblenz), Explicit and Implicit Semantics: Two Sides of One
Coin
Philip Wadler (U Edinburgh), You and Your Research and The Elements of Style
Ronald R. Yager (Iona C, New Rochelle), Social Modeling
COURSES AND PROFESSORS:
Divyakant Agrawal (U California, Santa Barbara), [intermediate] Scalable
Data Management in Enterprise and Cloud Computing Infrastructures
Pierre Baldi (U California, Irvine), [intermediate] Big Data Informatics
Challenges and Opportunities in the Life Sciences
Rajkumar Buyya (U Melbourne), [intermediate] Cloud Computing
John M. Carroll (Pennsylvania State U, University Park), [introductory]
Usability Engineering and Scenario-based Design
Kwang-Ting (Tim) Cheng (U California, Santa Barbara),
[introductory/intermediate] Smartphones: Hardware Platform, Software
Development, and Emerging Apps
Amr El Abbadi (U California, Santa Barbara), [introductory] The Distributed
Foundations of Data Management in the Cloud
Richard M. Fujimoto (Georgia Tech, Atlanta), [introductory] Parallel and
Distributed Simulation
Mark Guzdial (Georgia Tech, Atlanta), [introductory] Computing Education
Research: What We Know about Learning and Teaching Computer Science
David S. Johnson (Columbia U, New York), [introductory] The Traveling
Salesman Problem in Theory and Practice
George Karypis (U Minnesota, Twin Cities), [intermediate] Programming
Models/Frameworks for Parallel & Distributed Computing
Aggelos K. Katsaggelos (Northwestern U, Evanston), [intermediate]
Optimization Techniques for Sparse/Low-rank Recovery Problems in Image
Processing and Machine Learning
Arie E. Kaufman (U Stony Brook), [intermediate/advanced] Visualization
Carl Lagoze (U Michigan, Ann Arbor), [introductory] Curation of Big Data
Dinesh Manocha (U North Carolina, Chapel Hill), [introductory/intermediate]
Robot Motion Planning
Bijan Parsia (U Manchester), [introductory] The Empirical Mindset in
Computer Science
Charles E. Perkins (FutureWei Technologies, Santa Clara), [intermediate]
Beyond LTE: the Evolution of 4G Networks and the Need for Higher Performance
Handover System Designs
Robert Sargent (Syracuse U), [introductory] Validation of Models
Mubarak Shah (U Central Florida, Orlando), [intermediate] Visual Crowd
Analysis
Steffen Staab (U Koblenz), [intermediate] Programming the Semantic Web
Mike Thelwall (U Wolverhampton), [introductory] Sentiment Strength Detection
for Twitter and the Social Web
Jeffrey D. Ullman (Stanford U), [introductory] MapReduce Algorithms
Nitin Vaidya (U Illinois, Urbana-Champaign), [introductory/intermediate]
Distributed Consensus: Theory and Applications
Philip Wadler (U Edinburgh), [intermediate] Topics in Lambda Calculus and
Life
ORGANIZING COMMITTEE:
Adrian Horia Dediu (Tarragona)
Carlos Mart?n-Vide (Tarragona, chair)
Florentina Lilica Voicu (Tarragona)
REGISTRATION:
It has to be done at
http://grammars.grlmc.com/sstic2014/registration.php
The selection of up to 8 courses requested in the registration template is
only tentative and non-binding. For the sake of organization, it will be
helpful to have an approximation of the respective demand for each course.
Since the capacity of the venue is limited, registration requests will be
processed on a first come first served basis. The registration period will
be closed when the capacity of the venue will be complete. It is very
convenient to register prior to the event.
FEES:
As far as possible, participants are expected to attend for the whole (or
most of the) week (full-time). Fees are a flat rate allowing one to
participate to all courses. They vary depending on the registration
deadline.
ACCOMMODATION:
Information about accommodation is available on the website of the School.
CERTIFICATE:
Participants will be delivered a certificate of attendance.
QUESTIONS AND FURTHER INFORMATION:
florentinalilica.voicu@urv.cat
POSTAL ADDRESS:
SSTiC 2014
Lilica Voicu
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain
Phone: +34 977 559 543
Fax: +34 977 558 386
ACKNOWLEDGEMENTS:
Departament d?Economia i Coneixement, Generalitat de Catalunya
Universitat Rovira i Virgili
------------------------------
Message: 2
Date: Mon, 28 Apr 2014 10:28:16 +0000
From: Rasmus Pagh <pagh@itu.dk>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Associate professorship in algorithms at ITU
Copenhagen
Message-ID: <EF352957-895E-4F90-9B03-F6437496FD4D@itu.dk>
Content-Type: text/plain; charset="us-ascii"
The IT University of Copenhagen invites applicants for an associate professorship in algorithms (tenured) with special emphasis on algorithm engineering.
The proposed starting date is January 1, 2015.
Candidates are expected to have expertise in design and analysis of algorithms, with focus on bridging the gap between theory and practice. A history of industry collaboration, dissemination activities, and of making developed algorithms available to software developers is an advantage.
Candidates should complement ITU's existing expertise within algorithms theory and big data algorithms, and be motivated by an interplay of theory and practice (motivated by problems of practical interest, while seeking to make use of theoretical insight). Possible areas of expertise include, but are not limited to: Algorithms for modern computer architectures, algorithms for data management, space-efficiency, scalable algorithms for analyzing string and graph data, experimental algorithms, and engineering of randomized algorithms.
More info: https://delta.hr-manager.net/ApplicationInit.aspx?cid=119&ProjectId=173037&departmentId=3439&MediaId=5
------------------------------
Message: 3
Date: Mon, 28 Apr 2014 12:52:43 +0200 (CEST)
From: Marcin Pilipczuk <malcin@mimuw.edu.pl>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] School on Parameterized Algorithms and Complexity
(application deadline approaching)
Message-ID: <alpine.LNX.2.00.1404281249260.29008@duch.mimuw.edu.pl>
Content-Type: TEXT/PLAIN; format=flowed; charset=US-ASCII
School on Parameterized Algorithms and Complexity
We would like to remind about the approaching deadline for application
(30 April 2014).
Application form: http://fptschool.mimuw.edu.pl/index.php/application
More info: http://fptschool.mimuw.edu.pl
------------------------------
Message: 4
Date: Mon, 28 Apr 2014 12:21:29 +0000
From: Troels Bjerre S?rensen <trbj@itu.dk>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] YR-ICALP 2014: Deadline extended to May 4th
Message-ID: <1398687680763.96046@itu.dk>
Content-Type: text/plain; charset="utf-8"
YR-ICALP 2014: 1st Young Researcher Workshop on Automata, Languages and Programming
(http://www.itu.dk/people/maca/YR-ICALP2014/)
Scope:
YR-ICALP 2014 is a satellite workshop of ICALP 2014 and will be held on Monday July 7, 2014, at the ICALP venue at the IT-University of Copenhagen. This workshop aims at providing a forum for PhD students to exchange their preliminary or established results within the scope of the ICALP conference, in order to receive feedback. Excellent master students are also encouraged to contribute.
Format:?
YR-ICALP 2014 will offer a blend of presentations and posters:
* Presentations are selected on the basis of an abstract of up to 3 pages (incl. references).
* Posters are selected on the basis of an abstract of 500 words.
No particular format is required for either kind of abstract. Submissions must state whether they are presentations or posters. The accepted abstracts for presentations will be made available at the workshop, but no formal proceedings are planned. It is thus also allowed (and encouraged) to send results that have already been published. Rejected submissions for presentations may be invited for the poster session.
Submission must be done through the following link:
https://www.easychair.org/conferences/?conf=yricalp2014
Important Dates:
Submission:?4 May?2014 (extended)
Notification: 13 May 2014
Workshop Day: 7 July 2014
Program Committee:
Troels S?rensen
Marco Carbone
Pierluigi Crescenzi??
------------------------------
Message: 5
Date: Mon, 28 Apr 2014 14:38:29 +0000
From: Barbara KORDY <barbara.kordy@uni.lu>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Ph.D. Position in Information Security at the
University of Luxembourg
Message-ID: <51604CA7384E4C4A97AD9EE83BC440C11DB4C590@hoshi.uni.lux>
Content-Type: text/plain; charset="us-ascii"
The University of Luxembourg seeks to hire an outstanding doctoral
researcher at its Interdisciplinary Centre for Security, Reliability
and Trust (http://wwwen.uni.lu/snt) (SnT).
The successful candidate will participate in the activities of the
SaToSS (http://satoss.uni.lu) research group led by Prof. Dr. Sjouke
Mauw. The SaToSS group is working on formalizing and applying formal
reasoning to real-world security problems and trust issues. The research
topics of the group include: security protocols, security modeling,
formal methods for security, socio-technical aspects of security, risk
management, privacy, verification, etc.
Your role
--------------
The position is within the national project Attack-Defense Trees:
Theory Meets Practice (ADT2P). ADT2P is a follow-up project of a
recently finalized project Attack
Trees (http://satoss.uni.lu/projects/atrees/). The main tasks of the
Ph.D. student will be to
- Develop techniques for efficient representation of large-scale
security models,
- Introduce algorithms for quantitative analysis of such models,
- Integrate the developed techniques with existing risk assessment
methods and tools,
- Implement the obtained results in a computer tool,
- Conduct case studies together with the project partners from
industry,
- Co-supervise master students.
Your Profile
----------------
The candidate is expected to have:
- A Master degree in computer science or mathematics,
- A proven interest in security,
- Background in formal methods,
- Excellent written and oral English skills.
We offer
-----------
The University offers a three year appointment (extension up to 4 years
in total is possible). The University offers highly competitive salaries
and is an equal opportunity employer. You will work in an exciting
international environment and will have the opportunity to participate
in the development of a newly created research center.
Application
---------------
Applications should be written in English and include the following
documents:
- Cover letter indicating the research area of interest and your
motivation,
- Curriculum Vitae (including your contact address, work experience,
list of publications),
- A research statement addressing the topic of the position (max 1
page),
- A short description of your Master work (max 1 page),
- Transcript of grades from all university-level courses taken,
- Contact information for 3 referees.
Applications should be submitted electronically via the on-line
recruitment portal of the University of Luxembourg at
http://emea3.mrted.ly/dehl
Deadline for applications: June 22, 2014.
Contact information
-----------------------
For further inquiries please contact:
Prof. Dr. Sjouke Mauw (sjouke.mauw@uni.lu) or
Dr. Rolando Trujillo Rasua (rolando.trujillo@uni.lu)
For more information about this vacancy please check
http://satoss.uni.lu/vacancies/phd2014.php
------------------------------
Message: 6
Date: Mon, 28 Apr 2014 10:50:15 -0400
From: Jeremy Fineman <jfineman@cs.georgetown.edu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] SPAA 2014 - Call for Participation
Message-ID: <3EADBFBA-E876-4CEB-ACA9-E30A2F6C3C90@cs.georgetown.edu>
Content-Type: text/plain; charset=us-ascii
======================================================
SPAA 2014 Call for Participation
======================================================
26th ACM Symposium on
Parallelism in Algorithms and Architectures (SPAA 2014)
June 23-25, 2014 Charles University, Prague, Czech Republic
http://www.spaa-conference.org
Highlight: The two keynote speakers will be Bruce Maggs and Fabian Kuhn.
======================================================
Registration is now open. The early registration deadline is May 23.
We are accepting applications for travel grants for students. These applications are due May 2.
Please visit the conference webpage for:
- list of accepted papers
- registration
- information on student travel grants
- information on local arrangements
------------------------------
Message: 7
Date: Mon, 28 Apr 2014 16:20:25 +0100
From: Pavel Brazdil <pbrazdil@inescporto.pt>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] ECAI-14 Workshop and Tutorial on Metalearning &
Algorithm Selection
Message-ID:
<CAKvmzC2ooQTh3R2JG6-DcAAa-_bbBs2Zv6H+dPX42PgMgOuRyw@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
MetaSel - Meta-learning & Algorithm Selection
*********************************************
ECAI-2014 Workshop, Prague,
19 August 2014
http://metasel2014.inescporto.pt/
2nd Announcement & Call for Papers
Objectives
This ECAI-2014 workshop will provide a platform for discussing the
nature of algorithm selection which arises in many diverse domains,
such as machine learning, data mining, optimization and satisfiability
solving, among many others.
Algorithm Selection and configuration are increasingly relevant today.
Researchers and practitioners from all branches of science and
technology face a large choice of parameterized machine learning
algorithms, with little guidance as to which techniques to use.
Moreover, data mining challenges frequently remind us that algorithm
selection and configuration are crucial in order to achieve the best
performance, and drive industrial applications.
Meta-learning leverages knowledge of past algorithm applications to
select the best techniques for future applications, and offers
effective techniques that are superior to humans both in terms of the
end result and especially in the time required to achieve it. In this
workshop we will discuss different ways of exploiting meta-learning
techniques to identify the potentially best algorithm(s) for a new
task, based on meta-level information and prior experiments. We also
discuss the prerequisites for effective meta-learning systems such as
recent infrastructure such as OpenML.org.
Many problems of today require that solutions be elaborated in the
form of complex systems or workflows which include many different
processes or operations. Constructing such complex systems or
workflows requires extensive expertise, and could be greatly
facilitated by leveraging planning, meta-learning and intelligent
system design. This task is inherently interdisciplinary, as it builds
on expertise in various areas of AI.
The workshop will include invited talks, presentations of
peer-reviewed papers and panels. The invited talks will be by Lars
Kotthoff and Frank Hutter (to be confirmed).
The target audience of this workshop includes researchers (Ph.D.'s)
and research students interested to exchange their knowledge about:
- problems and solutions of algorithm selection and algorithm configuration
- how to use software and platforms to select algorithms in practice
- how to provide advice to end users about which algorithms to
select in diverse domains, including optimization, SAT etc. and
incorporate this knowledge in new platforms.
We specifically aim to attract researchers in diverse areas that have
encountered the problem of algorithm selection and thus promote
exchange of ideas and possible collaborations.
Topics
Algorithm Selection & Configuration
Planning to learn and construct workflows
Applications of workflow planning
Meta-learning and exploitation of meta-knowledge
Exploitation of ontologies of tasks and methods
Exploitation of benchmarks and experimentation
Representation of learning goals and states in learning
Control and coordination of learning processes
Meta-reasoning
Experimentation and evaluation of learning processes
Layered learning
Multi-task and transfer learning
Learning to learn
Intelligent design
Performance modeling
Process mining
Submissions and Review Process
Important dates:
Submission deadline: 25 May 2014
Notification: 23 June 2014
Full papers can consist of a maximum of 8 pages, extended abstracts up
to 2 pages, in the ECAI format. Each submission must be submitted
online via the Easychair submission interface.
Submissions can be updated at will before the submission deadline.
Electronic versions of accepted submissions will also be made publicly
available on the conference web site. The only accepted format for
submitted papers is PDF.
Submissions are possible either as a full paper or as an extended
abstract. Full papers should present more advanced work, covering
research or a case application. Extended abstracts may present
current, recently published or future research, and can cover a wider
scope. For instance, they may be position statements, offer a specific
scientific or business problem to be solved by machine learning (ML) /
data mining (DM) or describe ML / DM demo or
installation.
Each paper submission will be evaluated on the basis of relevance,
significance of contribution, technical quality, scholarship, and
quality of presentation, by at least two members of the program
committee. All accepted submissions will be included in the conference
proceedings. At least one author of each accepted full paper or
extended abstract is required to attend the workshop to present the
contribution.
A selection will be made of the best paper and runner ups, and these
will be presented in the plenary session. The remainder of accepted
submissions will be presented in the form of short talks and a poster
session. All accepted papers, including those presented as a poster,
will be published in the workshop proceedings (possibly as CEUR
Workshop Proceedings). The papers selected for plenary presentation
will be identified in the proceedings.
Organizers:
Pavel Brazdil, FEP, Univ. of Porto / Inesc Tec, Portugal, pbrazdil
at inescporto.pt
Carlos Soares, FEUP, Univ. of Porto / Inesc Tec, Portugal, csoares
at fe.up.pt
Joaquin Vanschoren, Eindhoven University of Technology (TU/e), Eindhoven,
The Netherlands, j.vanschoren at tue.nl
Lars Kotthoff, University College Cork, Cork, Ireland, larsko at 4c.ucc.ie
Program Committee:
Pavel Brazdil, LIAAD-INESC Porto L.A. / FEP, University of Porto, Portugal
Andr? C. P. Carvalho, USP, Brasil
Claudia Diamantini, Universit? Politecnica delle Marche, Italy
Johannes Fuernkranz, TU Darmstadt, Germany
Christophe Giraud-Carrier, Brigham Young Univ., USA
Krzysztof Grabczewski, Nicolaus Copernicus University, Poland
Melanie Hilario, Switzerland
Frank Hutter, University of Freiburg, Germany
Christopher Jefferson, University of St Andrews, UK
Alexandros Kalousis, U Geneva, Switzerland
J?rg-Uwe Kietz, U.Zurich, Switzerland
Lars Kotthoff, University College Cork, Ireland
Yuri Malitsky, University College Cork, Ireland
Bernhard Pfahringer, U Waikato, New Zealand
Vid Podpecan, Jozef Stefan Institute, Slovenia
Ricardo Prud?ncio, Univ. Federal de Pernambuco Recife (PE), Brasil
Carlos Soares, FEP, University of Porto, Portugal
Guido Tack, Monash University, Australia
Joaquin Vanschoren, U. Leiden / KU Leuven
Ricardo Vilalta, University of Houston, USA
Filip Zelezn?, CVUT, Prague, R.Checa
Previous events
This workshop is closely related to the PlanLearn-2012, which took
place at ECAI-2012 and other predecessor workshops in this series.
Tutorial on Metalearning and Algorithm Selection at ECAI-2014
*************************************************************
18 August 2014
http://metasel.inescporto.pt/
Algorithm Selection and configuration are increasingly relevant today.
Researchers and practitioners from all branches of science and
technology face a large choice of parameterized algorithms, with
little
guidance as to which techniques to use. Moreover, data mining
challenges frequently remind us that algorithm selection and
configuration are crucial in order to achieve the best performance and
drive industrial applications.
Meta-learning leverages knowledge of past algorithm applications to
select the best techniques for future applications, and offers
effective techniques that are superior to humans both in terms of the
end result and especially in a limited time.
In this tutorial, we elucidate the nature of algorithm selection and
how it arises in many diverse domains, such as machine learning, data
mining, optimization and SAT solving. We show that it is possible to
use meta-learning techniques to identify the potentially best
algorithm(s) for a new task, based on meta-level information and prior
experiments. We also discuss the prerequisites for effective
meta-learning systems, and how recent infrastructures, such as
OpenML.org, allow us to build systems that effectively advice users on
which algorithms to apply.
The intended audience includes researchers (Ph.D.'s), research
students and practitioners interested to learn about, or consolidate
their knowledge about the state-of-the-art in algorithm selection and
algorithm configuration, how to use Data Mining software and platforms
to select algorithms in practice, how to provide advice to end users
about which algorithms to select in diverse domains, including
optimization, SAT etc. and incorporate this knowledge in new
platforms. The participants should bring their own laptops
------------------------------
Subject: Digest Footer
_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
------------------------------
End of dmanet Digest, Vol 74, Issue 27
**************************************
No comments:
Post a Comment